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

[2] C. Calude, I. Chitescu: On representability of P. Martin-Löf tests. Kybernetika 19 (1983), 42-47. MR 0734837 | Zbl 0529.03020

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

[4] M. Machtey, P. Young: An Introduction to the General Theory of Algorithms. North-Holland, Amsterdam 1978. MR 0483344 | Zbl 0376.68027

[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] V. A. Uspensky, A. L. Semenov: What are the gains of the theory of algorithms. In: Algorithms in Modern Mathematics and Computer Science (A. P. Ersov, D. E. Knuth, eds.), Springer-Verlag, Berlin-Heidelberg-New York 1981, 100-234. MR 0657617