[1] M. Davis: Computability and Unsolvability. McGraw-Hill New York 1958. MR 0124208 | Zbl 0080.00902

[2] T. L. Fine: Theories of Probability - An Examimation of Foundations. Academic Press New York - London 1973. MR 0433529

[3] I. Kramosil: Monte-Carlo methods from the point of view of algorithmic complexity. In: Trans. 9th Prague Conf. on Inform. Theory. Statist. Dec. Functions and Random Processes, pp. 39-51. Academia, Prague 1983. MR 0757724 | Zbl 0551.68039

[4] I. Kramosil: Recursive classification of pseudo-random sequences. Kybernetika 20 (1984), supplement, pp. 1-34. MR 0758385

[5] I. Kramosil, J. Šindelář: Infinite sequencesof high algorithmic complexity. Kybernetika 20 (1984), 6, 459-466. MR 0777977

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

[7] H. Rogers, Jr.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York 1967. MR 0224462 | Zbl 0183.01401

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