ENGLISH

Algorithmic information theory

By Chaitin , Gregory J.

Book information

Publisher
CUP
ISBN
0521343062, 9780521343060
LCC
QA267 .C48 1987
Language
english
Format
DJVU
Filesize
1011 kB (1035533 bytes)
Series
Cambridge Tracts in Theoretical Computer Science, Volume 1
Edition
Revised edition
Pages
192\192
Library
Kolxo3
DPI
300
Orientation
portrait
Paginated
no
Scanned
yes
Time added
2011-07-22 07:35:22

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

Similar books