Abstract
To what extent is incomputability relevant to the material Universe? We look at ways in which this question might be answered, and the extent to which the theory of computability, which grew out of the work of Gödel, Church, Kleene and Turing, can contribute to a clear resolution of the current confusion. It is hoped that the presentation will be accessible to the non-specialist reader.
The first author would like to acknowledge the support of EPSRC Research Grant no. GR/M 91419 “Turing Definability” during the preparation of this paper, and also the encouragement and clarification derived from a number of useful conversations with George Barmpalias while preparing the final version for publication
Both authors’ research was partially supported by INTAS-RFBR Research Grant no. 97-0139, “Computability and Models”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. B. Cooper, Clockwork or Turing U/universe? — remarks on causal determinism and computability, in Models and Computability (S. B. Cooper and J. K. Truss, eds.), London Mathematical Society Lecture Note Series 259, Cambridge University Press, Cambridge, New York, Melbourne, 1999, pp. 63–116.
R. P. Feynman, Simulating physics with computers, Int. J. Theor. Phys., 21 (1982), 467–488.
G. Kreisel, Church’s Thesis: a kind of reducibility axiom for constructive mathematics, in Intuitionism and proof theory: Proceedings of the Summer Conference at Buffalo N.Y. 1968 (A. Kino, J. Myhill and R. EVesley, eds.) North-Holland, Amsterdam, London, 1970, pp. 121–150.
P. Odifreddi, Classical Recursion Theory, North-Holland, Amsterdam, New York, Oxford, 1989.
M. B. Pour-El and J. I. Richards, Noncomputability in analysis and physics, Adv. Math., 48 (1983), 44–74.
M. B. Pour-El and J. I. Richards, Computability in Analysis and Physics, Springer-Verlag, Berlin, Heidelberg, New York, London, Paris, Tokyo, 1989.
R. I. Soare, Computability and recursion, Bull. Symbolic Logic, 2 (1996), 284–321.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Cooper, S.B., Odifreddi, P. (2003). Incomputability in Nature. In: Computability and Models. The University Series in Mathematics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0755-0_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0755-0_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5225-9
Online ISBN: 978-1-4615-0755-0
eBook Packages: Springer Book Archive