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

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)

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

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

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

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

Computability Theory

Autori: Rebecca Weber

Typ zdroja: eBook.

Predmet: Recursion theory, Computable functions

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

HYPERCOMPUTATION: FANTASY OR REALITY? A POSITION PAPER.

Autori: SYROPOULOS, APOSTOLOS

Zdroj: Parallel Processing Letters; Mar2013, Vol. 23 Issue 1, p-1, 12p

Predmety: COMPUTATIONAL mechanics, TURING machines, PROBLEM solving, RECURSION theory

Osoby: EUCLID

SOBRE EL CONCEPTO DE RECURSION Y SUS USOS. (Spanish)

Alternate Title: On the concept of recursion and its uses. (English)

Autori: Mota, Sergio

Zdroj: Praxis Filosófica; ene-jun2015, Issue 40, p153-181, 29p

Predmety: RECURSION theory, HOMONYMS, GRAMMAR, STRUCTURALISM, COMPUTABLE functions

Some algorithmic problems and free products in R-varieties of linear \(\Omega\)-algebras

Autori: Glukhov, M. M.

Predmety: word problem, \(R\)-variety, Other \(n\)-ary compositions \((n \ge 3)\), free algebras, free products, linear \(\Omega\)-algebra, Applications of computability and recursion theory, Free algebras, Varieties, Word problems, etc. in computability and recursion theory

Popis súboru: application/xml

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

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

Computability of String Functions Over Algebraic Structures Armin Hemmerling.

Autori: Hemmerling, Armin

Zdroj: Mathematical Logic Quarterly; 1998, Vol. 44 Issue 1, p1-44, 44p

Predmety: COMPUTABLE functions, RECURSION theory, SUBROUTINES (Computer programs), HIGH-level programming languages, DOMAIN-specific programming languages

Rethinking Revision.

Autori: Welch, P. D.

Zdroj: Journal of Philosophical Logic; Feb2019, Vol. 48 Issue 1, p137-154, 18p

Predmety: RECURSION theory, FUNCTIONALS, ORACLES, ARITHMETIC, PREDICATE (Logic)

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

On some algorithmic problems related to varieties of nonassociative rings

Autori: Popov, V. Yu.

Predmety: decidable theory, Nonassociative algebras satisfying other identities, Decidability of theories and sets of sentences, undecidable theory, finitely based nonassociative rings, Lattices of varieties, decidability, finite basis property, variety of rings, finitely based variety, Word problems, etc. in computability and recursion theory, equational theory

Popis súboru: application/xml

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

A solution of the conjugacy problem in a class of groups

Autori: Fridman, A. A.

Predmety: Generators, relations, and presentations of groups, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Word problems, etc. in computability and recursion theory

Popis súboru: application/xml

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

Recursion in Partial Type-1 Objects With Well-Behaved Oracles.

Autori: Tourlakis, George

Zdroj: Mathematical Logic Quarterly; 1996, Vol. 42 Issue 1, p449-460, 12p

Predmety: RECURSION theory, KLEENE algebra, FUNCTIONALS, SEQUENTIAL analysis

Reviews & Products: ORACLE & Public Advertiser (Periodical)

Multi-Tape and Infinite-State Automata--A Survey.

Autori: Oettinger, A. G. Fischer, Patrick C.

Zdroj: Communications of the ACM; Dec1965, Vol. 8 Issue 12, p799-805, 7p

Predmety: TURING machines, SEQUENTIAL machine theory, COMPUTATIONAL linguistics, RECURSION theory, MACHINE theory, ALGORITHMS