Skip to main content

Lecture — Undecidability & Randomness in Pure Mathematics

  • Chapter
Conversations with a Mathematician

Abstract

I have shown that God not only plays dice in physics, but even in pure mathematics, in elementary number theory, in arithmetic! My work is a fundamental extension of the work of Gödel and Turing on undecidability in pure mathematics. I show that not only does undecidability occur, but in fact sometimes there is complete randomness, and mathematical truth becomes a perfect coin toss.

Originally published in G. J. Chaitin, Information, Randomness & Incompleteness, 2nd Edition, World Scientific, 1990, pp. 307–313.

This lecture was given at a Solvay physics conference on complexity in Brussels in 1989, one of the historic series of meetings that originally involved such great names as Madame Curie, Rutherford and Poincaré. This was in fact my second Solvay conference on complexity, both of them extremely stimulating, both organized by Ilya Prigogine. At them I had the pleasure of speaking in the same place where the historic Solvay conferences were held, and of meeting the then King and Queen of Belgium and also Mr. Honda, the founder of the Japanese auto company, who provided funding for the meetings.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 49.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Further Reading

  1. I. Stewart, “The ultimate in undecidability,” Nature, 10 March 1988, pp. 115–116.

    Article  Google Scholar 

  2. J. P. Delahaye, “Une extension spectaculaire du théorème de Gödel: l’équation de Chaitin,” La Recherche, juin 1988, pp. 860–862. English translation, AMS Notices, October 1989, pp. 984–987.

    Google Scholar 

  3. G. J. Chaitin, “Randomness in arithmetic,” Scientific American, July 1988, pp. 80–85.

    Google Scholar 

  4. G. J. Chaitin, Information, Randomness & Incompleteness—Papers on Algorithmic Information Theory, World Scientific, Singapore, 1987.

    Google Scholar 

  5. G. J. Chaitin, Algorithmic Information Theory, Cambridge University Press, Cambridge, 1987.

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag London

About this chapter

Cite this chapter

Chaitin, G.J. (2002). Lecture — Undecidability & Randomness in Pure Mathematics. In: Conversations with a Mathematician. Springer, London. https://doi.org/10.1007/978-1-4471-0185-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0185-7_8

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-1104-7

  • Online ISBN: 978-1-4471-0185-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics