Recursive classification of pseudo-random sequences
Kybernetika (1984)
- Volume: 20, Issue: Suppl1, page (1)-34
- ISSN: 0023-5954
Access Full Article
topHow to cite
topReferences
top- M. Davis, Computability and Unsolvability, McGraw Hill Book Company, New York-Toronto-London 1958. (1958) Zbl0080.00902MR0124208
- T. L. Fine, Theories of Probability. An Examination of Foundations, Academic Press, New York-London 1973. (1973) Zbl0275.60006MR0433529
- 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. (1983) Zbl0551.68039MR0757724
- I. Kramosil, Pseudo-random Monte-Carlo methods, Ann. Soc. Math. Polon. Ser. IV. Fund. Inform. 5 (1982), 3-4, 301-312. (1982) Zbl0502.65082
- I. Kramosil, On pseudo-random sequences over finite alphabets, Ann. Soc. Math. Polon. Ser. IV. Fund. Inform. (to appear).