Algorithmic Information Theory
(Part of the Cambridge Tracts in Theoretical Computer Science Series)
No Customer Reviews
Select Format
Select Condition 
Book Overview
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.
Format:Paperback
Language:English
ISBN:0521616042
ISBN13:9780521616041
Release Date:December 2004
Publisher:Cambridge University Press
Length:192 Pages
Weight:1.06 lbs.
Dimensions:0.4" x 7.4" x 9.7"
Customer Reviews
0 rating
Copyright © 2025 Thriftbooks.com
Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks ® and the ThriftBooks ® logo are registered trademarks of Thrift Books Global, LLC
ThriftBooks ® and the ThriftBooks ® logo are registered trademarks of Thrift Books Global, LLC
