Bulletin of Symbolic Logic
- Bull. Symbolic Logic
- Volume 17, Issue 3 (2011), 394-430.
Alan Turing and the foundations of computable analysis
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.
Bull. Symbolic Logic Volume 17, Issue 3 (2011), 394-430.
First available in Project Euclid: 6 July 2011
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Gherardi, Guido. Alan Turing and the foundations of computable analysis. Bull. Symbolic Logic 17 (2011), no. 3, 394--430. doi:10.2178/bsl/1309952319. https://projecteuclid.org/euclid.bsl/1309952319