1. Adleman, L 1979 Time, Space, and Randomness. MIT Report LCS/TM-131, April 1979.
2. Barzdin, J.M. 1968 Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set. Sov. Math. Dokl. 9(1968) 12514254.
3. Bennett, C.H. 1979 On Random and Hard-to-Describe Numbers, IBM Report RC 7483 (1979), and Gardner, Martin, Mathematical games, Sci}. Am. 20-34 (November 1979) based on this report.
4. Bennett, C.H. 1982 On the logical depth of sequences and their reducibilities to random sequences. Unpublished manuscript (1982).
5. Bennett, C.H. 1985 Information, dissipation, and the definition of organization. In: Emerging Syntheses in Science, ed. D. Pines, pp 297–313. Santa Fe, NM: Santa Fe Institute (1985).