Abstract
Computability originated from Logic and followed the original path proposed by the founding fathers of the modern foundational analysis of Mathematics (Frege, Hilbert). This theoretical path departed in principle from the contemporary renewed relations between Geometry and Physics. In particular, the key issue of physical measure, as our only access to “reality”, is not part of its theoretical frame, in contrast to Physics, since Poincaré, Planck and Einstein. Computability though, by its fine analysis of undecidability, provides a very useful tool for the investigation of “unpredictability” in Physics. Unpredictability coincides with physical randomness, in classical and quantum frames. And an understanding of randomness turns out to be a key component of intelligibility in Physics.
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.
References
Bailly, F., Longo, G.: Mathematics and Natural Sciences. In: The Physical Singularity of Life Phenomena. Imperial College Press/World Scientific (2010) (In French: Hermann, Paris, 2006)
Bailly, F., Longo, G.: Randomness and Determination in the interplay between the Continuum and the Discrete. Mathematical Structures in Computer Science 17(2), 289–307 (2007)
Braverman, M., Yampolski, M.: Non-computable Julia sets. Journ. Amer. Math. Soc. 19, 551–578 (2006)
Bell, J.: A Primer in Infinitesimal Analysis. Cambridge U.P., Cambridge (1998)
Calude, C.: Information and randomness. Springer, Berlin (2002)
Cooper, B.S., Odifreddi, P.: Incomputability in Nature. In: Cooper, et al. (eds.) Computability and Models - Perspectives East and West, pp. 137–160. Kluwer Academic/Plenum, New York (2003)
Einstein, A., Podolsky, B., Rosen, N.: Can Quantum-Mechanical Description of Physical Reality be Considered complete? Phys. Rev. 41, 777 (1935)
Gacs, P., Hoyrup, M., Rojas, C.: Randomness on Computable Metric Spaces: A dynamical point of view. In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009 (2009)
Laskar, J.: Large scale chaos in the Solar System. Astron. and Astrophys 287, 9–12 (1994)
Longo, G.: Reflections on Incompleteness. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol. 2277, pp. 160–180. Springer, Heidelberg (2002)
Longo, G.: Critique of Computational Reason in the Natural Sciences. In: Gelenbe, E., Kahane, J.-P. (eds.) Fundamental Concepts in Computer Science. Imperial College Press/World Sci. (2008)
Longo, G.: From exact sciences to life phenomena: following Schroedinger and Turing on Programs, Life and Causality. Special issue of Information and Computation 207(5), 543–670 (2009)
Longo, G.: Interfaces of Incompleteness, downloadable, Italian version. La Matematica, Einaudi (2010); French version, Les Mathématiques, Editions du CNRS (2011)
Petersen, K.: Ergodic Theory. Cambridge Univ. Press, Cambridge (1983)
Pilyugin, S.Y.: Shadowing in Dynamical Systems. Springer, Heidelberg (1999)
Pour-El, M.B., Richards, J.I.: Computability in analysis and physics. In: Perspectives in Mathematical Logic. Springer, Berlin (1989)
Riemann, B.: On the hypothesis which lie at the basis of Geometry (1854); English Transl. by Clifford, W., Nature (1873)
Svozil, K.: Randomness and undecidability in Physics. World Sci., Singapore (1993)
Turing, A.M.: Computing Machines and Intelligence. Mind LIX(236), 433–460 (1950)
Turing, A.M.: The Chemical Basis of Morphogenesis. Philo. Trans. Royal Soc. B237, 37–72 (1952)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Longo, G. (2010). Incomputability in Physics. In: Ferreira, F., Löwe, B., Mayordomo, E., Mendes Gomes, L. (eds) Programs, Proofs, Processes. CiE 2010. Lecture Notes in Computer Science, vol 6158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13962-8_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-13962-8_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13961-1
Online ISBN: 978-3-642-13962-8
eBook Packages: Computer ScienceComputer Science (R0)