Translator Disclaimer
September 2011 Alan Turing and the foundations of computable analysis
Guido Gherardi
Bull. Symbolic Logic 17(3): 394-430 (September 2011). DOI: 10.2178/bsl/1309952319

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.

Citation

Download Citation

Guido Gherardi. "Alan Turing and the foundations of computable analysis." Bull. Symbolic Logic 17 (3) 394 - 430, September 2011. https://doi.org/10.2178/bsl/1309952319

Information

Published: September 2011
First available in Project Euclid: 6 July 2011

zbMATH: 1238.03003
MathSciNet: MR2856079
Digital Object Identifier: 10.2178/bsl/1309952319

Rights: Copyright © 2011 Association for Symbolic Logic

JOURNAL ARTICLE
37 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.17 • No. 3 • September 2011
Back to Top