From Heisenberg to Gödel via Chaitin
In 1927 Heisenberg discovered that the “more precisely the position is determined, the less precisely the momentum is known in this instant, and vice versa.” Four years later Gödel showed that a finitely specified, consistent formal system which is large enough to include arithmetic is incomplete. As both results express some kind of impossibility it is natural to ask whether there is any relation between them, and, indeed, this question has been repeatedly asked for a long time. The main interest seems to have been in possible implications of incompleteness to physics. In this note we will take interest in the converse implication and will offer a positive answer to the question: Does uncertainty imply incompleteness? We will show that algorithmic randomness is equivalent to a “formal uncertainty principle” which implies Chaitin’s information-theoretic incompleteness. We also show that the derived uncertainty relation, for many computers, is physical. In fact, the formal uncertainty principle applies to all systems governed by the wave equation, not just quantum waves. This fact supports the conjecture that uncertainty implies algorithmic randomness not only in mathematics, but also in physics.
Key wordsalgorithmic randomness uncertainty incompleteness
- Barrow, J. D. (1998). Impossibility: The Limits of Science and the Science of Limits, Oxford University Press, Oxford.Google Scholar
- Calude, C. S. and Pavlov, B. (2002). The Poincaré–Hardy inequality on the complement of a Cantor set. In lpay, D., Gohberg, I., and Vinnikov, V., eds., Interpolation Theory, Systems Theory and Related Topics, Operator Theory: Advances and Applications, Vol. 134, pp. 187–208. Birkhäuser Verlag, Basel.Google Scholar
- Casti, J. L. and Traub, J. F., eds. (1994). On Limits. Santa Fe Institute Report 94-10-056, Santa Fe, NM.Google Scholar
- Casti, J. L. and Karlquist, A., eds. (1996). Boundaries and Barriers. On the Limits to Scientific Knowledge. Addison-Wesley, Reading, MA.Google Scholar
- Chaitin, G. J. (1975a). A theory of program size formally identical to information theory. Journal of the Association for Computing Machinery 22, 329–340. (Received April 1974) (Reprinted in: Chaitin, 1990, pp. 113–128).Google Scholar
- Chaitin, G. J. (1990). Information, Randomness and Incompleteness, Papers on Algorithmic Information Theory, 2nd edn. World Scientific, Singapore.Google Scholar
- Chaitin, G. J. (1992). Information-Theoretic Incompleteness. World Scientific, Singapore.Google Scholar
- Delahaye, J.-P. (1994). Information, Complexité et Hasard. Hermes, Paris.Google Scholar
- Deutsch, D. (1997). The Fabric of Reality. Allen Lane, Penguin Press, New York.Google Scholar
- Feferman, S., Dawson, J. Jr., Kleene, S. C., Moore, G. H., Solovay, R. M., van Heijenoort, J., eds. (1986). Kurt Gödel Collected Works, Vol. I. Oxford University Press, New York.Google Scholar
- Feferman, S., Dawson, J. Jr., Kleene, S. C., Moore, G. H., Solovay, R. M., van Heijenoort, J., eds. (1990) Kurt Gödel Collected Works, Vol. II. Oxford University Press, New York.Google Scholar
- Gödel, K. (1931). Über formal unentscheidbare Sätze der Principia Mathematica und verwandter. Systeme Monatshefte für Mathematik und Physik 38, 173–198 (Received 17 November 1930).Google Scholar
- Hawking, S. W. (2002). Gödel and the end of physics. Dirac Centennial Celebration, Cambridge, UK, July 2002, http://www.damtp.cam.ac.uk/strtst/dirac/hawking/.
- Heisenberg, W. (1927). Über den Anschaulichen Inhalt der Quantentheoretischen Kinematik und Mechanik. Zeitschrift für Physik 43, 172–198. (Received 23 March 1927) English translation. In Wheeler, J. A., and Zurek, H. eds., Quantum Theory and Measurement, pp. 62–84. Princeton University Press, Princeton, 1983.Google Scholar
- Pauli, W. (1979). In Hermann, A., von Meyenn, K., and Weiskopf, V. F., eds., Wissentschaftlicher Briefwechsel mit Bohr, Einstein, Heisenberg u.a. Volume 1 (1919–1929). Springer-Verlag, Berlin.Google Scholar
- Solovay, R. M. (2000). A version of Ω for which ZFC can not predict a single bit. In Calude, C. S., and Păun, G., eds., Finite Versus Infinite. Contributions to an Eternal Dilemma, pp. 323–334. Springer-Verlag, London.Google Scholar
- Svozil, K. (2005). Computational universes, CDMTCS Research Report 216, May 2003; Chaos, Solitons & Fractals 25(4), 845–859.Google Scholar
- Svozil, K. (2004). Private communication to Calude, 8 February 2004.Google Scholar
- Tadaki, K. (2002). Upper bound by Kolmogorov complexity for the probability in computable POVM measurement, Los Alamos preprint archive, http://arXiv:quant-ph/0212071, 11 December 2002.