Alan Turing and the foundations of computable analysis
From MaRDI portal
Publication:3174639
DOI10.2178/BSL/1309952319zbMATH Open1238.03003OpenAlexW2142519528MaRDI QIDQ3174639FDOQ3174639
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
Recommendations
History of mathematics in the 20th century (01A60) Computation over the reals, computable analysis (03D78) History of mathematical logic and foundations (03-03)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
- Revising Type-2 Computation and Degrees of Discontinuity
- Theory of representations
- Degrees of unsolvability of continuous functions
- Meta math! The quest for omega
- Real computations with fake numbers
- Computability and λ-definability
Cited In (16)
- Title not available (Why is that?)
- The Legacy of Turing in Numerical Analysis
- Title not available (Why is that?)
- Alan Turing and John von Neumann - Their Brains and Their Computers
- The foundations of computation, physics and mentality: the Turing legacy
- Alan Turing and the Central Limit Theorem
- Title not available (Why is that?)
- On the computational content of convergence proofs via Banach limits
- On Alan Turing's anticipation of connectionism
- Turing’s Revolution
- Conceptual Confluence in 1936: Post and Turing
- Computer Science for Continuous Data
- Title not available (Why is that?)
- Philosophical explorations of the legacy of Alan Turing. Turing 100
- On computable numbers, with an application to the Druckproblem
- Turing meets Schanuel
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)
