Alan Turing and the foundations of computable analysis

DOI10.2178/BSL/1309952319MaRDI QIDQ3174639zbMATH OpenOpenAlexFDO

Authors Guido Gherardi

Publication date 11 October 2011

Published in The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/bsl/1309952319

zbMATH Keywords

computable analysisAlan Turing

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Computation over the reals, computable analysis (03D78) History of mathematical logic and foundations (03-03)

Recommendations

• Computable real numbers according to Alan Turing (an example of a constructive definition)
• scientific article; zbMATH DE number 1101599
• scientific article; zbMATH DE number 2013199
• Computability and analysis, a historical approach
• scientific article; zbMATH DE number 1460545

Cites work

• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Computability and λ-definability
• Degrees of unsolvability of continuous functions
• Meta math! The quest for omega
• ROUNDING-OFF ERRORS IN MATRIX PROCESSES
• Real computations with fake numbers
• Revising type-2 computation and degrees of discontinuity
• Theory of representations

Cited in

(25)

• scientific article; zbMATH DE number 4125367 (Why is no real title available?)
• The Legacy of Turing in Numerical Analysis
• Computability theory
• scientific article; zbMATH DE number 5005840 (Why is no real title available?)
• Incomputability emergent, and higher type computation
• Alan Turing and John von Neumann - Their Brains and Their Computers
• The stability of Turing machine in computing real functions
• The foundations of computation, physics and mentality: the Turing legacy
• scientific article; zbMATH DE number 4068851 (Why is no real title available?)
• Alan Turing and the Central Limit Theorem
• Computable real numbers according to Alan Turing (an example of a constructive definition)
• Computability and Incomputability
• On the computational content of convergence proofs via Banach limits
• Computability and analysis, a historical approach
• Turing oracle machines, online computing, and three displacements in computability theory
• On Alan Turing's anticipation of connectionism
• Turing’s Revolution
• Conceptual Confluence in 1936: Post and Turing
• Computer Science for Continuous Data
• scientific article; zbMATH DE number 5064392 (Why is no real title available?)
• Foundational analyses of computation
• Philosophical explorations of the legacy of Alan Turing. Turing 100
• On the impact of Turing machines
• Turing meets Schanuel
• On computable numbers, with an application to the Druckproblem

This page was built for publication: Alan Turing and the foundations of computable analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174639)