Geodesic
Infinite pseudo-random sequences of high algorithmic complexity
Kybernetika, Tome 20 (1984) no. 6, pp. 429-437 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 60A05, 65C10, 68Q25, 68Q30 
@article{KYB_1984_20_6_a0,
     author = {Kramosil, Ivan and \v{S}indel\'a\v{r}, Jan},
     title = {Infinite pseudo-random sequences of high algorithmic complexity},
     journal = {Kybernetika},
     pages = {429--437},
     year = {1984},
     volume = {20},
     number = {6},
     mrnumber = {777977},
     zbl = {0558.68035},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1984_20_6_a0/}
}
TY  - JOUR
AU  - Kramosil, Ivan
AU  - Šindelář, Jan
TI  - Infinite pseudo-random sequences of high algorithmic complexity
JO  - Kybernetika
PY  - 1984
SP  - 429
EP  - 437
VL  - 20
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/KYB_1984_20_6_a0/
LA  - en
ID  - KYB_1984_20_6_a0
ER  - 
%0 Journal Article
%A Kramosil, Ivan
%A Šindelář, Jan
%T Infinite pseudo-random sequences of high algorithmic complexity
%J Kybernetika
%D 1984
%P 429-437
%V 20
%N 6
%U http://geodesic.mathdoc.fr/item/KYB_1984_20_6_a0/
%G en
%F KYB_1984_20_6_a0
Kramosil, Ivan; Šindelář, Jan. Infinite pseudo-random sequences of high algorithmic complexity. Kybernetika, Tome 20 (1984) no. 6, pp. 429-437. http://geodesic.mathdoc.fr/item/KYB_1984_20_6_a0/

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

[2] A. N. Kolmogorov: Combinatoric foundations of information theory and probability calculus. (in Russian). Uspehi matem. nauk 38 (1983), 4 (232), 27-36. | MR

[3] I. Kramosil: On pseudo-random sequences over finite alphabets. Fundamenta Informaticae (to appear).

[4] I. Kramosil: Recursive classification of pseudo-random sequences. Supplement to Kybernetika 20 (1984), 1-36. | MR