On mind \& Turing's machines

DOI10.1007/S11047-006-9021-9zbMath1120.03006OpenAlexW2108878936MaRDI QIDQ885688

Wilfried Sieg

Publication date: 14 June 2007

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-006-9021-9

zbMATH Keywords

Church's thesisaxiom of infinityTuring machineDiophantine problemabsolutely unsolvable (undecidable)finite machinegeneral recursive functionmechanical computabilityobjective mathematicssubjective mathematics

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Decidability of theories and sets of sentences (03B25) Turing machines and related notions (03D10)

Related Items (1)

Parikh and Wittgenstein

Cites Work

• Automated search for Gödel's proofs
• Godel on computability
• Paper Machines
• Finite combinatory processes—formulation
• Systems of Logic Based on Ordinals^†
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On mind \& Turing's machines