ISBN is

978-0-521-34306-0 / 0521343062

Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science)

by Chaitin, Gregory. J.

Publisher:Cambridge University Press

Edition:Hardcover

Language:English

Prices INCLUDE standard shipping to United States
Show prices without shipping
Change shipping destination
Shipping prices may be approximate. Please verify cost before checkout.

About the 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.

Search under way...

Search complete.

Click on the price to find out more about a book.

New books: 1 - 25 of 27

   

Used books: 1 - 25 of 96