Click on a thumbnail to go to Google Books.
Algorithmic Information Theory (1987)
No current Talk conversations about this book.
References to this work on external resources.
Wikipedia in English (1)
Amazon.com Product Description (ISBN 0521343062, Hardcover)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.
(retrieved from Amazon Thu, 12 Mar 2015 18:19:22 -0400)
No library descriptions found.
Is this you?
Become a LibraryThing Author.