Bulletin of Symbolic Logic 17 (3):394-430 (2011)
|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|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Michael Rescorla (2007). Church's Thesis and the Conceptual Analysis of Computability. Notre Dame Journal of Formal Logic 48 (2):253-280.
Oron Shagrir (1997). Two Dogmas of Computationalism. Minds and Machines 7 (3):321-44.
Joseph S. Miller (2004). Degrees of Unsolvability of Continuous Functions. Journal of Symbolic Logic 69 (2):555 - 584.
Robert I. Soare (1996). Computability and Recursion. Bulletin of Symbolic Logic 2 (3):284-321.
Eli Dresner (2008). Turing-, Human- and Physical Computability: An Unasked Question. Minds and Machines 18 (3).
Gualtiero Piccinini (2003). Alan Turing and the Mathematical Objection. Minds and Machines 13 (1):23-48.
Benjamin Wells (2002). Is There a Nonrecursive Decidable Equational Theory? Minds and Machines 12 (2):301-324.
Justin Leiber (2006). Turing's Golden: How Well Turing's Work Stands Today. Philosophical Psychology 19 (1):13-46.
Giangiacomo Gerla (1989). Turing L -Machines and Recursive Computability for L -Maps. Studia Logica 48 (2):179 - 192.
Carol E. Cleland (1995). Effective Procedures and Computable Functions. Minds and Machines 5 (1):9-23.
Gualtiero Piccinini (forthcoming). The Physical Church-Turing Thesis: Modest or Bold. British Journal of Philosophy of Science 62 (4):733-769.
Stuart Shanker (1995). Turing and the Origins of AI. Philosophia Mathematica 3 (1):52-85.
R. Urbaniak (2011). How Not To Use the Church-Turing Thesis Against Platonism. Philosophia Mathematica 19 (1):74-89.
Added to index2011-07-07
Total downloads20 ( #61,589 of 549,546 )
Recent downloads (6 months)2 ( #37,418 of 549,546 )
How can I increase my downloads?