scientific article; zbMATH DE number 5064404

MaRDI QIDQ5493757zbMATH OpenFDO

Authors Oron Shagrir

Publication date 16 October 2006

zbMATH Keywords

Turing computability

Mathematics Subject Classification ID

History of mathematical logic and foundations (03-03) Philosophical and critical aspects of logic and foundations (03A05) Turing machines and related notions (03D10) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• Godel on computability
• Logical Approaches to Computational Barriers
• Computability. Turing, Gödel, Church, and beyond
• Gödel and Turing's thesis
• Computation and intractability: echoes of Kurt Gödel
• scientific article; zbMATH DE number 1869992
• Gödel on Tarski
• scientific article; zbMATH DE number 205734
• On Gödel's incompleteness theorems

Cited in

(17)

• Gödel's reception of Turing's model of computability: the shift of perception in 1934
• A new Gödelian argument for hypercomputing minds based on the busy beaver problem
• Can Church's thesis be viewed as a Carnapian explication?
• On Turing machines knowing their own Gödel-sentences
• Computability. Turing, Gödel, Church, and beyond
• Computation and intractability: echoes of Kurt Gödel
• Godel on computability
• Gödel and Turing's thesis
• scientific article; zbMATH DE number 1869992 (Why is no real title available?)
• scientific article; zbMATH DE number 1909820 (Why is no real title available?)
• Gödel's philosophical challenge (to Turing)
• What is the Church-Turing Thesis?
• Gödel, Nagel, minds, and machines
• scientific article; zbMATH DE number 5187689 (Why is no real title available?)
• Logical Approaches to Computational Barriers
• Kurt Gödel's Anticipation of the Turing Machine: A Vitalistic Approach
• Did Turing prove the undecidability of the halting problem?

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5493757)