[1] C. Calude, I. Chiţescu: Random strings according to A. N. Kolmogorov and P. Martin-Löf - Classical approach. Found. Control Engng. (to appear). MR 0691575

[2] A. N. Kolmogorov: Three approaches to the quantitative definition of information. Problems Inform. Transmission 1 (1965), 1 - 7. MR 0243922

[3] M. Machtey, P. Young: An Introduction to General Theory of Algorithms. North-Holland, New York 1978. MR 0483344

[4] P. Martin-Löf: The definition of random sequences. Inform. and Control 19 (1966), 602-619. MR 0223179

[5] H. Rogers, Jr.: The Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York 1967. MR 0224462

[6] A. Zvonkin, L. Levin: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. (in Russian). Uspechi Mat. Nauk 156 (1970), 85-127. MR 0307889 | Zbl 0222.02027