Title: Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
Publisher: Cambridge University Press
Publication Date: 1987
Language: English
ISBN 10: 0521343062
ISBN 13: 9780521343060
Binding: Hardcover
Condition: new

About this title

Synopsis

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.

Review

"If you're interested in computability theory and computational complexity, Algorithmic Information Theory belongs on your bookshelf." AI Expert

"About this title" may belong to another edition of this title.

Store Description

We love books and pride ourselves of giving the customer the best buying experience.

Visit Seller's Storefront

Seller's business information

Toscana Books
TX, U.S.A.

Sale & Shipping Terms

Terms of Sale

All returns are accepted within 30 days.

Right of cancellation

Shipping Terms

All books will be shipped through media mail. All books will be shipped within 2 business days.

Shipping rates from U.S.A. to United Kingdom

Shipping rates from U.S.A. to United Kingdom
Order quantity	36 to 42 business days	24 to 30 business days
First item	� 22.28	� 33.64

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.