Descrizione
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.
Dettagli del libro
Formato
Kindle
Pagine
192 pagine
Lingua
Inglese
Pubblicato
dic 2, 2004
Editore
Cambridge University Press
Edizioni
2 edizioni
ISBN-10
1316268527
ISBN-13
9781316268520