{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T19:57:46Z","timestamp":1772827066898,"version":"3.50.1"},"reference-count":29,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2014,1,15]],"date-time":"2014-01-15T00:00:00Z","timestamp":1389744000000},"content-version":"unspecified","delay-in-days":867,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Bull. symb. log"],"published-print":{"date-parts":[[2011,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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 \u2018Type-2 Theory of Effectivity\u2019 (TTE) and the \u2018realRAM machine\u2019 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.<\/jats:p>","DOI":"10.2178\/bsl\/1309952319","type":"journal-article","created":{"date-parts":[[2011,7,6]],"date-time":"2011-07-06T11:38:57Z","timestamp":1309952337000},"page":"394-430","source":"Crossref","is-referenced-by-count":12,"title":["Alan Turing and the Foundations of Computable Analysis"],"prefix":"10.1017","volume":"17","author":[{"given":"Guido","family":"Gherardi","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2014,1,15]]},"reference":[{"key":"S1079898600000433_ref002","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0701-6"},{"key":"S1079898600000433_ref028","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9"},{"key":"S1079898600000433_ref024","first-page":"544","article-title":"On computable numbers, with an application to the \u2018Entscheidungsproblem\u2019. A correction","volume":"43","author":"Turing","year":"1937","journal-title":"Proceedings of the London Mathematical Society"},{"key":"S1079898600000433_ref004","first-page":"3","article-title":"Begr\u00fcndung der Mengenlehre unabh\u00e4ngig vom logischen Satz vom ausgeschlossenen Dritten. Zweiter Teil: Theorie der Punktmengen","volume":"1","author":"Brouwer","year":"1919","journal-title":"Verhandelingen der Koninklijke Nederlandse Akademie van Wetenschappen"},{"key":"S1079898600000433_ref007","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.2001.0607"},{"key":"S1079898600000433_ref001","first-page":"1024","article-title":"Computing over the reals: where Turing meets Newton","volume":"51","author":"Blum","year":"2004","journal-title":"Notices of the American Mathematical Society"},{"key":"S1079898600000433_ref008","volume-title":"Computability and unsolvability","author":"Davis","year":"1958"},{"key":"S1079898600000433_ref016","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1082418543"},{"key":"S1079898600000433_ref025","first-page":"180","article-title":"A method for the calculation of the Zeta-function","volume":"48","author":"Turing","year":"1943","journal-title":"Proceedings of the London Mathematical Society"},{"key":"S1079898600000433_ref026","doi-asserted-by":"publisher","DOI":"10.1093\/qjmam\/1.1.287"},{"key":"S1079898600000433_ref003","first-page":"3","article-title":"Begr\u00fcndung der Mengenlehre unabh\u00e4ngig vom logischen Satz vom ausgeschlossenen Dritten","volume":"1","author":"Brouwer","year":"1918","journal-title":"Erster Teil: allgemeine Mengenlehre, Verhandelingen der Koninklijke Nederlandse Akademie van Wetenschappen"},{"key":"S1079898600000433_ref009","doi-asserted-by":"crossref","first-page":"168","DOI":"10.4064\/fm-42-1-168-202","article-title":"Computable functionals","volume":"42","author":"Grzegorczick","year":"1955","journal-title":"Fundamenta Mathematicae"},{"key":"S1079898600000433_ref018","volume-title":"The annotated Turing","author":"Petzold","year":"2008"},{"key":"S1079898600000433_ref013","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90208-7"},{"key":"S1079898600000433_ref023","doi-asserted-by":"publisher","DOI":"10.2307\/2268280"},{"key":"S1079898600000433_ref019","doi-asserted-by":"publisher","DOI":"10.2307\/2267170"},{"key":"S1079898600000433_ref015","volume-title":"Computational analysis","author":"Mazur","year":"1963"},{"key":"S1079898600000433_ref021","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7"},{"key":"S1079898600000433_ref029","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2006.08.015"},{"key":"S1079898600000433_ref011","volume-title":"Introduction to metamathematics","author":"Kleene","year":"1952"},{"key":"S1079898600000433_ref010","doi-asserted-by":"crossref","first-page":"61","DOI":"10.4064\/fm-44-1-61-71","article-title":"On the definitions of computable real continuous functions","volume":"44","author":"Grzegorczick","year":"1957","journal-title":"Fundamenta Mathematicae"},{"key":"S1079898600000433_ref005","first-page":"1","article-title":"\u00dcber die Bedeutung des Satzes vom ausgeschlossenen Dritten in der Mathematik, insbesondere in der Funktiontheorie","volume":"154","author":"Brouwer","year":"1924","journal-title":"Journal fur die reine und angewandte Mathematik"},{"key":"S1079898600000433_ref012","volume-title":"Intuitionistic mathematics especially in relation to recursive functions","author":"Kleene","year":"1965"},{"key":"S1079898600000433_ref006","volume-title":"Meta math! The quest for Omega","author":"Chaitin","year":"2006"},{"key":"S1079898600000433_ref017","volume-title":"Classical recursion theory","author":"Odifreddi","year":"1989"},{"key":"S1079898600000433_ref020","volume-title":"Theory of recursive functions and effective computability","author":"Rogers","year":"1967"},{"key":"S1079898600000433_ref014","first-page":"151","article-title":"Extension de la notion de fonction r\u00e9cursive aux fonctions d'une ou plusieurs variables r\u00e9elles III","volume":"241","author":"Lacombe","year":"1955","journal-title":"Comptes Rendus Acad\u00e9mie des Sciences Paris"},{"key":"S1079898600000433_ref022","first-page":"230","article-title":"On computable numbers, with an application to the \u2018Entscheidungsproblem\u2019","volume":"42","author":"Turing","year":"1936","journal-title":"Proceedings of the London Mathematical Society"},{"key":"S1079898600000433_ref027","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-3.1.99"}],"container-title":["The Bulletin of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1079898600000433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T05:36:55Z","timestamp":1556343415000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1079898600000433\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["S1079898600000433"],"URL":"https:\/\/doi.org\/10.2178\/bsl\/1309952319","relation":{},"ISSN":["1079-8986","1943-5894"],"issn-type":[{"value":"1079-8986","type":"print"},{"value":"1943-5894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9]]}}}