Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1) - Hardcover

Chaitin, Gregory. J.

 
9780521343060: Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)

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.

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

Review

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

Book Description

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.

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

Other Popular Editions of the Same Title

9780521616041: Algorithmic Information Theory: 1 (Cambridge Tracts in Theoretical Computer Science, Series Number 1)

Featured Edition

ISBN 10:  0521616042 ISBN 13:  9780521616041
Publisher: Cambridge University Press, 2008
Softcover