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.
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.
Get Algorithmic Information Theory by Gregory. J. Chaitin at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Cambridge University Press and it has 192 pages.
Our digital collection is currently being curated to ensure the best possible reading experience on Werezi. We'll be launching our Ebooks platform shortly.
Your privacy, your choice
Make Werezi work for you
We use essential cookies for your cart and sign-in. With your permission, optional cookies help us understand how Werezi is used and improve your book recommendations.
Essential cookies are always active. Optional analytics stay off unless you choose Allow all.