Computability and analysis: the legacy of Alan Turing
arXiv:1206.3431 · doi:10.1017/CBO9781107338579.002
Abstract
We discuss the legacy of Alan Turing and his impact on computability and analysis.
arXiv comment49 pages
References in corpus (11)
- The Bolzano-Weierstrass Theorem is the Jump of Weak König's Lemma
- Local stability of ergodic averages
- Effective Choice and Boundedness Principles in Computable Analysis
- Weihrauch Degrees, Omniscience Principles and Weak Computability
- Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete
- Real Hypercomputation and Continuity
- On the (semi)lattices induced by continuous reducibilities
- Computable de Finetti measures
- Parabolic Julia Sets are Polynomial Time Computable
- A proof of strong normalisation using domain theory
- Uncomputably noisy ergodic limits