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.
Read More
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.
Read Less
Add this copy of Algorithmic Information Theory to cart. $54.95, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2004 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Print on demand Trade paperback (US). Contains: Unspecified. Cambridge Tracts in Theoretical Computer Science . Includes unspecified. Intended for professional and scholarly audience.
