1. G.J. Chaitin, “Algorithmic Information Theory,” in Encyclopedia of Statistical Sciences, Vol. 1, Wiley, New York, 1982, pp. 38–41.
2. A.K. Dewdney, “A Computer Trap for the Busy Beaver, the Hardest-Working Turing Machine,” Computer Recreations Dept., Sci. Am., 251, No. 2, pp. 19–23 (Aug. 1984).
3. M. Davis, “What Is a Computation?” in Mathematics Today: Twelve Informal Essays, L. A. Steen (ed.), Springer-Verlag, New York, 1978, pp. 241–267.
4. G.J. Chaitin, “Randomness and Mathematical Proof,” Sci. Am., 232, No. 5, pp. 47–52 (May 1975).
5. G.J. Chaitin, “Gödel’s Theorem and Information,” Int. J. Theor. Phys., 22, pp. 941–954 (1982).