Algorithmic information theory

By Gregory J. Chaitin

ISBN: 0521616042
Publisher: Cambridge University Press
Year: 2004
Pages: 192

About This Book

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.

Product Details

Publisher Cambridge University Press
Publication date January 1, 2004
Language English
Print length 192 pages
ISBN-10 0521616042
ISBN-13 978-0521616041
Item Weight 0.76 pounds

Editorial Reviews

Editorial Review

Review"If you're interested in computability theory and computational complexity, Algorithmic Information Theory belongs on your bookshelf." AI ExpertBook DescriptionExpounds Gödel's incompleteness theorey using an information theoretic approach based on the size of computer programs.
Shipping set per seller
Compare book + shipping totals for each offer
Seller-error returns
Returns accepted for seller errors. Ask the seller about change-of-mind returns
Partner purchases
MedicalBook.online handles payment, shipping and returns for its orders
Email Support
[email protected] for buyers and sellers