• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Algorithmic Information Theory

Algorithmic Information Theory

Paperback

Series: Cambridge Tracts in Theoretical Computer Science, Book 1

General ComputersProgramming

ISBN10: 0521616042
ISBN13: 9780521616041
Publisher: Cambridge University Press
Published: Dec 2 2004
Pages: 192
Weight: 0.78
Height: 0.41 Width: 7.44 Depth: 9.69
Language: English
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.

Also in

General Computers