Algorithmic Information Theory
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 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.
Jilid:
1
Tahun:
1997
Penerbit:
Cambridge University Press
Bahasa:
english
Halaman:
192
ISBN 10:
0521616042
ISBN 13:
9780521616041
Nama siri:
Cambridge Tracts in Theoretical Computer Science
Fail:
PDF, 897 KB
IPFS:
,
english, 1997