Geodesic
Recursive classification of pseudo-random sequences
Kybernetika, Tome 20 (1984), pp. 1-34
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 60A99, 65C10, 68Q15, 68Q30 
@article{KYB_1984_20_Suppl1_a0,
     author = {Kramosil, Ivan},
     title = {Recursive classification of pseudo-random sequences},
     journal = {Kybernetika},
     pages = {1--34},
     year = {1984},
     volume = {20},
     number = {Suppl1},
     mrnumber = {0758385},
     zbl = {0544.60006},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1984_20_Suppl1_a0/}
}
TY  - JOUR
AU  - Kramosil, Ivan
TI  - Recursive classification of pseudo-random sequences
JO  - Kybernetika
PY  - 1984
SP  - 1
EP  - 34
VL  - 20
IS  - Suppl1
UR  - http://geodesic.mathdoc.fr/item/KYB_1984_20_Suppl1_a0/
LA  - en
ID  - KYB_1984_20_Suppl1_a0
ER  - 
%0 Journal Article
%A Kramosil, Ivan
%T Recursive classification of pseudo-random sequences
%J Kybernetika
%D 1984
%P 1-34
%V 20
%N Suppl1
%U http://geodesic.mathdoc.fr/item/KYB_1984_20_Suppl1_a0/
%G en
%F KYB_1984_20_Suppl1_a0
Kramosil, Ivan. Recursive classification of pseudo-random sequences. Kybernetika, Tome 20 (1984), pp. 1-34. http://geodesic.mathdoc.fr/item/KYB_1984_20_Suppl1_a0/

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

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

[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 | Zbl

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

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