Algorithmic information theory [EBook] / Gregory J. Chaitin.
Algorithmic information theory [EBook] / Gregory J. Chaitin.
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 probabilit...
Personal Name(s):  Chaitin, Gregory J., (author) 

Imprint: 
Cambridge :
Cambridge University Press,
1987

Physical Description: 
1 online resource (x, 175 pages) 
Note: 
englisch 
ISBN: 
9780521343060 9780511608858 9780521616041 
Series Title: 
Cambridge tracts in theoretical computer science ;
1 
Subject (LOC):  
Full Text 
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 socalled exponential diophantine equation. 