Step by recursive step: Church's analysis of effective calculability

Bulletin of Symbolic Logic 3 (2):154-180 (1997)
Abstract
Alonzo Church's mathematical work on computability and undecidability is well-known indeed, and we seem to have an excellent understanding of the context in which it arose. The approach Church took to the underlying conceptual issues, by contrast, is less well understood. Why, for example, was "Church's Thesis" put forward publicly only in April 1935, when it had been formulated already in February/March 1934? Why did Church choose to formulate it then in terms of Gödel's general recursiveness, not his own λ -definability as he had done in 1934? A number of letters were exchanged between Church and Paul Bernays during the period from December 1934 to August 1937; they throw light on critical developments in Princeton during that period and reveal novel aspects of Church's distinctive contribution to the analysis of the informal notion of effective calculability. In particular, they allow me to give informed, though still tentative answers to the questions I raised; the character of my answers is reflected by an alternative title for this paper, Why Church needed Gödel's recursiveness for his Thesis. In Section 5, I contrast Church's analysis with that of Alan Turing and explore, in the very last section, an analogy with Dedekind's investigation of continuity
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/421012
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,188
Through your library
References found in this work BETA
A Note on the Entscheidungsproblem.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (1):40-41.
Finite Combinatory Processes-Formulation.Emil L. Post - 1936 - Journal of Symbolic Logic 1 (3):103-105.
Paper Machines.Daniele Mundici & Wilfried Seig - 1995 - Philosophia Mathematica 3 (1):5-30.
Ein Verfahren der Mathematischen Logik.Jozéf Pepis - 1938 - Journal of Symbolic Logic 3 (2):61-76.

Add more references

Citations of this work BETA
Sign and the Lambda-Term.Kumiko Tanaka-Ishii & Yuichiro Ishii - 2008 - Semiotica 2008 (169):197-220.
Diagonalisation and Church's Thesis: Kleene's Homework.Enrique Alonso & Maria Manzano - 2005 - History and Philosophy of Logic 26 (2):93-113.
1999 Spring Meeting of the Association for Symbolic Logic.Charles Parsons - 1999 - Bulletin of Symbolic Logic 5 (4):479-484.

Add more citations

Similar books and articles
Church's Thesis: Prelude to a Proof.Janet Folina - 1998 - Philosophia Mathematica 6 (3):302-323.
Witness and Service to the World. Discovering Protestant Church Renewal in Europe.Henning Theißen - 2011 - Neue Zeitschrift für Systematicsche Theologie Und Religionsphilosophie 53 (2):225-239.
Computability and Recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
SAD Computers and Two Versions of the Church–Turing Thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Is the Church-Turing Thesis True?Carol E. Cleland - 1993 - Minds and Machines 3 (3):283-312.
The Church-Turing Thesis.B. Jack Copeland - 2008 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Stanford University.
How Not To Use the Church-Turing Thesis Against Platonism.R. Urbaniak - 2011 - Philosophia Mathematica 19 (1):74-89.

Monthly downloads

Added to index

2009-01-28

Total downloads

28 ( #179,106 of 2,153,830 )

Recent downloads (6 months)

1 ( #398,274 of 2,153,830 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums