Algorithmic Information Theory
by Gregory Chaitin
192 pages· 1987· ISBN 9780521343060
About
Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Godel'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."
Discuss Algorithmic Information Theory with other readers
Join or start a book club for Algorithmic Information Theory on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Algorithmic Information Theory?
Sign up free on Readfeed, then browse public clubs or start your own club with Algorithmic Information Theory as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Algorithmic Information Theory with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Algorithmic Information Theory with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.