Philosophia Mathematica 14 (2):189-207 (2006)
The identification of an informal concept of ‘effective calculability’ with a rigorous mathematical notion like ‘recursiveness’ or ‘Turing computability’ is still viewed as problematic, and I think rightly so. I analyze three different and conflicting perspectives Gödel articulated in the three decades from 1934 to 1964. The significant shifts in Gödel's position underline the difficulties of the methodological issues surrounding the Church-Turing Thesis.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
The Physical Church–Turing Thesis: Modest or Bold?Gualtiero Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733 - 769.
The Physical Church-Turing Thesis: Modest or Bold?G. Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733-769.
Gödel's Introduction to Logic in 1939.P. Cassou-Nogues - 2009 - History and Philosophy of Logic 30 (1):69-90.
Hilbert's Axiomatics as ‘Symbolic Form’?Rossella Lupacchini - 2014 - Perspectives on Science 22 (1):1-34.
On Formalism Freeness: Implementing Gödel's 1946 Princeton Bicentennial Lecture.Juliette Kennedy - 2013 - Bulletin of Symbolic Logic 19 (3):351-393.
Similar books and articles
Step by Recursive Step: Church's Analysis of Effective Calculability.Wilfried Sieg - 1997 - Bulletin of Symbolic Logic 3 (2):154-180.
The Church-Turing ‘Thesis’ as a Special Corollary of Gödel’s Completeness Theorem.Saul A. Kripke - 2013 - In B. J. Copeland, C. Posy & O. Shagrir (eds.), Computability: Turing, Gödel, Church, and Beyond. MIT Press.
Remarks on the Development of Computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 2007 - Cambridge University Press.
Computability: Gödel, Turing, Church, and Beyond.B. J. Copeland, C. Posy & O. Shagrir (eds.) - forthcoming - MIT Press.
A Natural Axiomatization of Computability and Proof of Church's Thesis.Nachum Dershowitz & Yuri Gurevich - 2008 - Bulletin of Symbolic Logic 14 (3):299-350.
Only Two Letters: The Correspondence Between Herbrand and Gödel.Wilfried Sieg - 2005 - Bulletin of Symbolic Logic 11 (2):172-184.
Consistency, Turing Computability and Gödel's First Incompleteness Theorem.Robert F. Hadley - 2008 - Minds and Machines 18 (1):1-15.
Added to index2010-08-24
Total downloads27 ( #185,467 of 2,153,858 )
Recent downloads (6 months)2 ( #279,963 of 2,153,858 )
How can I increase my downloads?