A new version of algorithmic information theory
Gregory J. Chaitin · Complexity · 1996
Abstract We present a much more concrete version of algorithmic information theory in which one can actually run on a computer the algorithms in the proofs of a number of key information‐theoretic incompleteness theorems.