Welcome to IOU Digital Library

Presents Chaitin’s formal development of algorithmic information theory: formalisms for computation (register machines, LISP), program-size complexity, the halting probability (Ω), randomness, and information-theoretic proofs of Gödel-style incompleteness results. The book mixes conceptual discussion with implementation notes and mathematical detail.

no reviews

245: $a: Algorithmic Information Theory
245: $b:
082: $a:
100: $a: Gregory J. Chaitin
650: $a: Algorithmic information theory
250: $a:
440: $v:
250: $b: Cambridge University Press
250: $c: 1987
020: $a: 978-0-521-34306-0
300: $a: 237