Algorithmic information theory
β Gregory. J. Chaitin
π Library
π
2004
π Cambridge University Press
π English
β¦ LIBER β¦
π
Algorithmic information theory
β Scribed by Chaitin, Gregory J.
- Publisher
- CUP
- Year
- 1987, 2004
- Tongue
- English
- Leaves
- 192
- Series
- Cambridge Tracts in Theoretical Computer Science, Volume 1
- Edition
- Revised edition
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
β¦ 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.
π SIMILAR VOLUMES
Algorithmic information theory
β Chaitin G.
π Library
π
1997
π English
Algorithmic Information Theory
β G J Chaitin
π Library
π
2003
π cambridge univercity press
π English
Algorithmic Information Theory
β Gregory. J. Chaitin
π Library
π
1987
π Cambridge University Press
π English
Algorithmic Information Theory
β G. J. Chaitin
π Library
π
1987
π Cambridge University Press
π English
Algorithmic Information Theory
β Gregory J. Chaitin
π Library
π
1987
π Cambridge University Press
π English