Algorithmic Information Theory
Format:Paperback
Publisher:Cambridge University Press
Published:2nd Dec '04
Currently unavailable, and unfortunately no date known when it will be back
Expounds Gödel's incompleteness theorey 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.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.
ISBN: 9780521616041
Dimensions: 246mm x 188mm x 20mm
Weight: 345g
192 pages