Algorithmic Information Theory

Algorithmic Information Theory - Cambridge Tracts in Theoretical Computer Science

Hardback (15 Oct 1987)

Not available for sale

Includes delivery to the United States

Out of stock

This service is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Publisher's 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.

Book information

ISBN: 9780521343060
Publisher: Cambridge University Press
Imprint: Cambridge University Press
Pub date:
DEWEY: 004
DEWEY edition: 22
Language: English
Number of pages: 192
Weight: 489g
Height: 247mm
Width: 174mm
Spine width: 14mm