1. C. Calude, P. Hertling, B. Khoussainov, Y. Wang, Recursively enumerable reals and Chaitin's Ω number, in: STACS’98, Lecture Notes in Computer Science, vol. 1373, Springer, Berlin, 1998, pp. 596–606.
2. A theory of program size formally identical to information theory;Chaitin;J. Assoc. Comput. Mach.,1975
3. Incompleteness theorems for random reals;Chaitin;Adv. in Appl. Math.,1987
4. Algorithmic Information Theory;Chaitin,1987
5. R.G. Downey, Some computability-theoretical aspects of reals and randomness, in: P. Cholak (Ed.), Lecture Notes in Logic, to appear.