1. Chaitin, G. J. (1990). Information, Randomness & Incompleteness, second edition, World Scientific, Singapore
2. Chaitin, G. J. (1992). Algorithmic Information Theory, fourth printing, Cambridge. University Press, Cambridge.
3. Chaitin, G. J. (1992). Information-Theoretic Incompleteness, World Scientific, Singapore
4. Chaitin, G. J. (1993). “On the number of n-bit strings with maximum complexity”, Applied Mathematics and Computation 59: 97–100
5. Chaitin, G. J. (1993). “Randomness in arithmetic and the decline and fall of reductionism in pure mathematics”, Bulletin of the European Association for Theoretical Computer Science No. 50 (June 1993), pp. 314–328