Výsledky vyhľadávania - (work OR york) problems, etc. in computability and recursion theory

On Strong and Weak Logics for Paraconsistent Computability.

Autori: Weber, Zach Cano-Jorge, Fernando

Zdroj: Journal of Applied Logics- IfCoLog Journal of Logics & their Applications (FLAP); Jun2025, Vol. 12 Issue 5, p1349-1381, 33p

Predmety: RECURSION theory, ARITHMETIC, LOGIC, MATHEMATICS, VIRTUES

Language Learnability in the Limit: A Generalization of Gold’s Theorem: Language learnability in the limit: a generalization of Gold's theorem

Autori: Fernando C. Alves

Zdroj: Journal of Logic, Language and Information. 32:363-372

Predmety: recursion theory, inductive inference, Computational learning theory, learning in the limit, Formal languages and automata, 06 humanities and the arts, 0101 mathematics, 0603 philosophy, ethics and religion, Word problems, etc. in computability and recursion theory, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Gold's theorem

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/7726393
https://doi.org/10.1007/s10849-022-09391-w

ON DIOPHANTINE SINGLEFOLD SPECIFICATIONS.

Autori: CANTONE, D. CUZZIOL, L. OMODEO, E. G.

Zdroj: Le Matematiche; 2024, Vol. 79 Issue 2, p585-620, 36p

Predmety: HILBERT'S tenth problem, CHINESE remainder theorem, MATHEMATICAL logic, RECURSION theory, RECURSIVE functions, DIOPHANTINE equations, QUADRATIC forms, BINOMIAL coefficients

Further N -Frame networking dynamics of conscious observer-self agents via a functional contextual interface: predictive coding, double-slit quantum mechanical experiment, and decision-making fallacy modeling as applied to the measurement problem in humans and AI

Autori: Edwards, Darren J.

Zdroj: Frontiers in Computational Neuroscience; 2025, p1-53, 53p

Predmety: LANGUAGE models, ARTIFICIAL intelligence, COGNITIVE bias, QUANTUM operators, COGNITIVE maps (Psychology)

A finitely axiomatizable undecidable equational theory with recursively solvable word problems

Autori: Dejan Delić

Zdroj: Transactions of the American Mathematical Society. 352:3065-3101

Predmety: undecidable equational theory, Decidability of theories and sets of sentences, Word problems (aspects of algebraic structures), Equational logic, Mal'tsev conditions, Equational classes, universal algebra in model theory, many-sorted logics, 0102 computer and information sciences, 0101 mathematics, Automata and formal grammars in connection with logical questions, Word problems, etc. in computability and recursion theory, recursively solvable word problems, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://www.ams.org/tran/2000-352-07/S0002-9947-99-02339-9/S0002-9947-99-02339-9.pdf
https://zbmath.org/1449843
https://doi.org/10.1090/s0002-9947-99-02339-9
https://www.ams.org/journals/tran/2000-352-07/S0002-9947-99-02339-9/home.html
https://www.ams.org/tran/2000-352-07/S0002-9947-99-02339-9/S0002-9947-99-02339-9.pdf
https://www.jstor.org/stable/118198

Can Church's thesis be viewed as a Carnapian explication?

Autori: Quinon, Paula

Zdroj: Synthese; Mar2021 Supplement 5, Vol. 198, p1047-1074, 28p

Predmety: RECURSION theory, MATHEMATICAL logic, MATHEMATICAL forms

Osoby: CARNAP, Rudolf, 1891-1970

recursion theoretic foundation of computation over real numbers.

Autori: Ng, Keng Meng Tavana, Nazanin R Yang, Yue

Zdroj: Journal of Logic & Computation; Oct2021, Vol. 31 Issue 7, p1660-1689, 30p

Predmety: REAL numbers, COMPUTABLE functions, RECURSIVE functions, RECURSION theory

Geografický termín: NOVA Scotia

A Survey of Nature-Inspired Computing: Membrane Computing.

Autori: BOSHENG SONG KENLI LI ORELLANA-MARTÍN, DAVID a ďalší

Zdroj: ACM Computing Surveys; Jan2022, Vol. 54 Issue 1, p1-31, 31p

Predmety: COMPUTATIONAL complexity, NP-complete problems, RECURSION theory, CELL anatomy, COMPUTER systems, BIOLOGICALLY inspired computing

Reclaiming AI as a Theoretical Tool for Cognitive Science.

Autori: van Rooij, Iris Guest, Olivia Adolfi, Federico a ďalší

Zdroj: Computational Brain & Behavior; Dec2024, Vol. 7 Issue 4, p616-636, 21p

An inside/outside Ramsey theorem and recursion theory.

Autori: Fiori-Carones, Marta Shafer, Paul Soldà, Giovanni

Zdroj: Transactions of the American Mathematical Society; Mar2022, Vol. 375 Issue 3, p1977-2024, 48p

Predmety: RECURSION theory, REVERSE mathematics, RAMSEY numbers, COMPUTABLE functions, RAMSEY theory, SAND

Coding in the existential theory of concatenation

Autori: Büchi, J. R. Senger, St.

Zdroj: The Collected Works of J. Richard Büchi ISBN: 9781461389309

Predmety: Prefix, length-variable, comma-free codes, 510.mathematics, Free semigroups, generators and relations, word problems, 4. Education, 0102 computer and information sciences, 0101 mathematics, Word problems, etc. in computability and recursion theory, existential theory, 01 natural sciences, Article, existentially definable relation over concatenation, diophantine

Popis súboru: application/xml; image/jpeg; application/pdf

Prístupová URL adresa: https://zbmath.org/4053596
https://doi.org/10.1007/bf02017493
https://link.springer.com/content/pdf/10.1007/BF02017493.pdf
https://eudml.org/doc/138054
https://rd.springer.com/chapter/10.1007/978-1-4613-8928-6_36
https://dblp.uni-trier.de/db/journals/aml/aml26.html#BuchiS87
https://link.springer.com/article/10.1007/BF02017493

On the work of P. S. Novikov and his graduate students in algorithmic questions of algebra

Autori: Adyan, S. I.

Predmety: History of mathematical logic and foundations, Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations, Applications of computability and recursion theory, History of group theory, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Word problems, etc. in computability and recursion theory, Research exposition (monographs, survey articles) pertaining to group theory

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/3545646

The word problem for division rings

Autori: Angus Macintyre

Zdroj: Journal of Symbolic Logic. 38:428-436

Predmety: Division rings and semisimple Artin rings, 0101 mathematics, Word problems, etc. in computability and recursion theory, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/jsyml/jsyml38.html#MacIntyre73a
https://doi.org/10.2307/2273039
https://www.jstor.org/stable/2273039
https://projecteuclid.org/euclid.jsl/1183738755

The word problem for free fields

Autori: Paul M. Cohn

Zdroj: Journal of Symbolic Logic. 38:309-314

Predmety: Division rings and semisimple Artin rings, Connections between field theory and logic, 0101 mathematics, 16. Peace & justice, Word problems, etc. in computability and recursion theory, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://www.jstor.org/stable/2272067
https://dblp.uni-trier.de/db/journals/jsyml/jsyml38.html#Cohn73
https://www.maths.ed.ac.uk/~aar/papers/cohnword.pdf
https://projecteuclid.org/euclid.jsl/1183738636

DOS CONCEPCIONES DEL LENGUAJE: WITTGENSTEIN Y CHOMSKY EN TORNO A LA RECURSIÓN COMO "BUENA" EXPLICACIÓN DE LA NATURALEZA HUMANA. (Spanish)

Alternate Title: Two conceptions of language: Wittgenstein and Chomsky on recursion as a "good" explanation of human nature. (English)

Autori: Mota, Sergio

Zdroj: Praxis Filosófica; ene-jun2018, Issue 46, p125-149, 25p

Predmety: RECURSION theory, PHILOSOPHY of language, LINGUISTICS, HUMAN behavior, COMPUTATIONAL linguistics, HUMAN beings

Osoby: CHOMSKY, Noam, 1928-, WITTGENSTEIN, Ludwig, 1889-1951

Recursion in programs, thought, and language.

Autori: Johnson-Laird, P. N. Bucciarelli, Monica Mackiewicz, Robert a ďalší

Zdroj: Psychonomic Bulletin & Review; Apr2022, Vol. 29 Issue 2, p430-454, 25p

Predmety: RECURSIVE functions, RECURSION theory, KOLMOGOROV complexity, NATURAL languages, SHORT-term memory

Die Theorie algorithmischer Sozialität (TaS). (German)

Alternate Title: A theory of algorithmic sociality (TaS). (English)

Autori: Seyfert, Robert

Zdroj: Österreichische Zeitschrift für Soziologie; Mar2024, Vol. 49 Issue 1, p23-46, 24p

Complexity of equational theory of relational algebras with standard projection elements.

Autori: Mikulás, Szabolcs Sain, Ildikó Simon, András

Zdroj: Synthese; Jul2015, Vol. 192 Issue 7, p2159-2182, 24p

Predmety: ALGEBRAIC logic, RECURSION theory, RELATION algebras, COMPUTER science, MATHEMATICS

From Fieldwork to Linguistic Theory

Autori: Gibson, Edward Poliak, Moshe

Typ zdroja: eBook.

Kategórie: LANGUAGE ARTS & DISCIPLINES / Linguistics / General

FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS.

Autori: MILLER, RUSSELL NG, KENG MENG

Zdroj: Journal of Symbolic Logic; Dec2016, Vol. 81 Issue 4, p1225-1254, 30p

Predmety: COMPUTABLE functions, COMPUTABILITY logic, EQUIVALENCE relations (Set theory), RECURSION theory, MATHEMATICAL readiness