Godel on computability

DOI10.1093/PHILMAT/NKJ005MaRDI QIDQ3422400zbMATH OpenOpenAlexFDO

Authors Wilfried Sieg

Publication date 13 February 2007

Published in Philosophia Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/philmat/nkj005

zbMATH Keywords

effective calculabilityrecursiveness

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) Philosophical and critical aspects of logic and foundations (03A05)

Recommendations

• Logical Approaches to Computational Barriers
• Gödel and Turing's thesis
• Gödel's reception of Turing's model of computability: the shift of perception in 1934
• Publication:4941989
• scientific article; zbMATH DE number 5064404

Cited in

(13)

• What is the concept of computation?
• Gödel's reception of Turing's model of computability: the shift of perception in 1934
• Computability. Turing, Gödel, Church, and beyond
• Computation and intractability: echoes of Kurt Gödel
• Gödel's Introduction to Logic in 1939
• Why Turing’s Thesis Is Not a Thesis
• Hilbert's axiomatics as `symbolic form'?
• Wittgenstein's diagonal argument: a variation on Cantor and Turing
• scientific article; zbMATH DE number 5064404 (Why is no real title available?)
• Effectiveness
• Logical Approaches to Computational Barriers
• Logical Approaches to Computational Barriers
• On mind \& Turing's machines

This page was built for publication: Godel on computability

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