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

[2] T. L. Fine: Theories of Probability. An Examination of Foundations. Academic Press, New York-London 1973. MR 0433529 | Zbl 0275.60006

[3] I. Kramosil: Monte-Carlo methods from the point of view of algorithmic complexity. In: Transactions of the Ninth Prague Conference on Information Theory, Statistical Decision Functions and Random Processes, Academia, Prague 1983, pp. 39-51. MR 0757724 | Zbl 0551.68039

[4] I. Kramosil: Pseudo-random Monte-Carlo methods. Ann. Soc. Math. Polon. Ser. IV. Fund. Inform. 5 (1982), 3-4, 301-312. Zbl 0502.65082

[5] I. Kramosil: On pseudo-random sequences over finite alphabets. Ann. Soc. Math. Polon. Ser. IV. Fund. Inform. (to appear).