Algorithmic Information Theory Paperback / softback
by Gregory. J. Chaitin
Part of the Cambridge Tracts in Theoretical Computer Science series
Paperback / softback
Description
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.
Information
-
Out of stock
- Format:Paperback / softback
- Pages:192 pages, Worked examples or Exercises
- Publisher:Cambridge University Press
- Publication Date:02/12/2004
- Category:
- ISBN:9780521616041
Information
-
Out of stock
- Format:Paperback / softback
- Pages:192 pages, Worked examples or Exercises
- Publisher:Cambridge University Press
- Publication Date:02/12/2004
- Category:
- ISBN:9780521616041
