Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.
- ISBN13 9780521343060
- Publish Date 15 October 1987
- Publish Status Inactive
- Out of Print 2 March 2005
- Publish Country GB
- Imprint Cambridge University Press
- Format Hardcover
- Pages 192
- Language English