Alan Turing and the foundations of computable analysis

Bulletin of Symbolic Logic 17 (3):394-430 (2011)
  Copy   BIBTEX

Abstract

We investigate Turing's contributions to computability theory for real numbers and real functions presented in [22, 24, 26]. In particular, it is shown how two fundamental approaches to computable analysis, the so-called ‘Type-2 Theory of Effectivity' (TTE) and the ‘realRAM machine' model, have their foundations in Turing's work, in spite of the two incompatible notions of computability they involve. It is also shown, by contrast, how the modern conceptual tools provided by these two paradigms allow a systematic interpretation of Turing's pioneering work in the subject

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,401

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Two dogmas of computationalism.Oron Shagrir - 1997 - Minds and Machines 7 (3):321-44.
Deviant encodings and Turing’s analysis of computability.B. Jack Copeland & Diane Proudfoot - 2010 - Studies in History and Philosophy of Science Part A 41 (3):247-252.
Computable Diagonalizations and Turing’s Cardinality Paradox.Dale Jacquette - 2014 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 45 (2):239-262.
Type‐2 computability on spaces of integrable functions.Daren Kunkle - 2004 - Mathematical Logic Quarterly 50 (4):417-430.
On computable numbers with an application to the AlanTuringproblem.C. F. Huws & J. C. Finnis - 2017 - Artificial Intelligence and Law 25 (2):181-203.
Turing's World 3.0 for Mac: An Introduction to Computability Theory.Jon Barwise & John Etchemendy - 1993 - Center for the Study of Language and Information Publications.

Analytics

Added to PP
2011-07-07

Downloads
82 (#264,102)

6 months
9 (#328,796)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Representational Foundations of Computation.Michael Rescorla - 2015 - Philosophia Mathematica 23 (3):338-366.
Turing meets Schanuel.Angus Macintyre - 2016 - Annals of Pure and Applied Logic 167 (10):901-938.

Add more citations

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.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Computability and λ-definability.A. M. Turing - 1937 - Journal of Symbolic Logic 2 (4):153-163.
Recursive unsolvability of a problem of thue.Emil L. Post - 1947 - Journal of Symbolic Logic 12 (1):1-11.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.

Add more references