Call Boomerang Books 1300 36 33 32

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.

Buy Algorithmic Information Theory book by Gregory J. Chaitin from Australia's Online Independent Bookstore, Boomerang Books.

Book Details

ISBN: 9780521616041
ISBN-10: 0521616042
Format: Paperback
(247mm x 174mm x 10mm)
Pages: 192
Imprint: Cambridge University Press
Publisher: Cambridge University Press
Publish Date: 2-Dec-2004
Country of Publication: United Kingdom

Other Editions


» Have you read this book? We'd like to know what you think about it - write a review about Algorithmic Information Theory book by Gregory J. Chaitin and you'll earn 50c in Boomerang Bucks loyalty dollars (you must be a Boomerang Books Account Holder - it's free to sign up and there are great benefits!)

Write Review

Books By Author Gregory J. Chaitin

Goedel's Way by Gregory J. Chaitin

Goedel's Way

Paperback, October 2011
Meta Maths by Gregory J. Chaitin

Meta Maths

Paperback, August 2007