Algorithmic Information Theory (Cambridge Tracts in

Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
- Used Book in Good Condition
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.
Country USA
Brand Cambridge University Press
Manufacturer Cambridge University Press
Binding Paperback
UnitCount 1
EANs 9780521616041
ReleaseDate 0000-00-00

Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)