- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Turing's thesis
Abstract
In the sole extended break from his life and varing in this way we can associate a sysied career in England, Alan Turing spent the tem of logic with any constructive ordinal. It may be asked whether such a years 1936–1938 doing graduate work at..Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Only published works are available at libraries.
My notes
Similar books and articles
Turing’s Thesis.B. Jack Copeland - 2006 - In Adam Olszewski, Jan Wolenski & Robert Janusz (eds.), Church's Thesis After 70 Years. Ontos Verlag. pp. 147-174.
Reflections on gödel's and Gandy's reflections on Turing's thesis.David Israel - 2002 - Minds and Machines 12 (2):181-201.
Is Turing's Thesis the Consequence of a More General Physical Principle?Matthew P. Szudzik - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 714--722.
Alan Turing's systems of logic: the Princeton thesis.Andrew W. Appel (ed.) - 2012 - Woodstock, England: Princeton University 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.
The scope of Turing's analysis of effective procedures.Jeremy Seligman - 2002 - Minds and Machines 12 (2):203-220.
Alan Turing's systems of logic: the Princeton thesis.Alan Turing - 2012 - Woodstock, England: Princeton University Press. Edited by Andrew W. Appel & Solomon Feferman.
Analytics
Added to PP
2009-01-28
Downloads
42 (#533,351)
6 months
6 (#862,561)
2009-01-28
Downloads
42 (#533,351)
6 months
6 (#862,561)
Historical graph of downloads
References found in this work
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.
Transfinite recursive progressions of axiomatic theories.Solomon Feferman - 1962 - Journal of Symbolic Logic 27 (3):259-316.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-9l5tj dc2