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. © 1996 Wiley Periodicals, Inc., a Wiley Company.