Hostname: page-component-7b7567c8c-8tzhz Total loading time: 0 Render date: 2026-11-19T15:06:37.157Z Has data issue: false hasContentIssue false

Alan Turing and the Foundations of Computable Analysis

Published online by Cambridge University Press:  15 January 2014

Guido Gherardi*
Affiliation:
Dipartimento Di Filosofia, Universitá Du Bologna, Via Zamboni 38, 40126 Bologna, Italy E-mail: guido.gherardi@unibo.it

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable