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

Chaitin, Gregory. J.

ISBN 10: 0521343062 / ISBN 13: 9780521343060

Edité par Cambridge University Press, 1987

A propos de cet article

**SHIPPED FROM UK** We believe you will be completely satisfied with our quick and reliable service. All orders are dispatched as swiftly as possible! Buy with confidence! Greener Books.

N° de réf. du vendeur 4878486

Détails bibliographiques

• Titre: Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
• Éditeur: Cambridge University Press
• Date de parution: 1987
• Langue: anglais
• ISBN à 10 chiffres: 0521343062
• ISBN à 13 chiffres: 9780521343060
• Reliure: Hardcover
• État de l'article: Used; Very Good

A propos de ce titre

Synopsis

Expounds Gödel's incompleteness theorey using an information theoretic approach based on the size of computer programs.

Présentation de l'éditeur

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.