Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Goedel'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.

Expounds Goedel's incompleteness theorey using an information theoretic approach based on the size of computer programs.

Book Information
ISBN 9780521616041
Author Gregory. J. Chaitin
Format Paperback
Page Count 192
Imprint Cambridge University Press
Publisher Cambridge University Press
Weight(grams) 345g
Dimensions(mm) 246mm * 188mm * 20mm