Summary and Info
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.
More About the Author
Gregory John Chaitin (/ˈtʃaɪtᵻn/ CHY-tən; born 15 November 1947) is an Argentine-American mathematician and computer scientist.
Review and Comments
Rate the Book
Algorithmic information theory 0 out of 5 stars based on 0 ratings.