The never-ending recursion

DOI10.1016/j.jal.2017.03.003zbMath1439.03076OpenAlexW2599382074MaRDI QIDQ1688713

Sérgio Mota

Publication date: 11 January 2018

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2017.03.003

zbMATH Keywords

iterationrecursioncognitive scienceself-involvement

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25)

Cites Work

• Syntactic structures and recursive devices: a legacy of imprecision
• Turing oracle machines, online computing, and three displacements in computability theory
• Wittgenstein versus Turing on the nature of Church's thesis
• Fifty years of self-reference in arithmetic
• Recursive Functions: An Archeological Look
• Formalism and intuition in computability
• On certain formal properties of grammars
• Computability and Logic
• Using Structural Recursion for Corecursion
• Computability and Recursion
• Sequential abstract-state machines capture sequential algorithms
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On notation for ordinal numbers
• Recursive Predicates and Quantifiers
• Formal Reductions of the General Combinatorial Decision Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item