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

[2] C. Calude, I. Chiţescu: On the representability of P. Martin-Löf tests. Kybernetika 19 (1983), 42-47. MR 0734837

[3] C. Calude, I. Chiţescu: Representability of recursive P. Martin-Löf tests. Kybernetika 19 (1983), 526-536. MR 0734837

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

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

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

[7] C. P. Schnorr: Zufälligkeit und Wahrscheinlichkeit. (Lecture Notes in Mathematics 218.) Springer-Verlag, Berlin 1971. MR 0414225 | Zbl 0232.60001

[8] A. K. Zvonkin, L. A. Levin: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Soviet Math. Survs. 25 (1970), 83-124. MR 0307889 | Zbl 0222.02027