Infinite pseudo-random sequences of high algorithmic complexity
Kybernetika (1984)
- Volume: 20, Issue: 6, page 429-437
- ISSN: 0023-5954
Access Full Article
top
How to cite
topKramosil, Ivan, and Šindelář, Jan. "Infinite pseudo-random sequences of high algorithmic complexity." Kybernetika 20.6 (1984): 429-437. <http://eudml.org/doc/27757>.
@article{Kramosil1984,
author = {Kramosil, Ivan, Šindelář, Jan},
journal = {Kybernetika},
language = {eng},
number = {6},
pages = {429-437},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Infinite pseudo-random sequences of high algorithmic complexity},
url = {http://eudml.org/doc/27757},
volume = {20},
year = {1984},
}
TY - JOUR
AU - Kramosil, Ivan
AU - Šindelář, Jan
TI - Infinite pseudo-random sequences of high algorithmic complexity
JO - Kybernetika
PY - 1984
PB - Institute of Information Theory and Automation AS CR
VL - 20
IS - 6
SP - 429
EP - 437
LA - eng
UR - http://eudml.org/doc/27757
ER -
References
top- T L. Fine, Theories of Probability- An Examination of Foundations, Academic Press, New York-London 1973. (1973) Zbl0275.60006MR0433529
- A. N. Kolmogorov, Combinatoric foundations of information theory and probability calculus, (in Russian). Uspehi matem. nauk 38 (1983), 4 (232), 27-36. (1983) MR0710113
- I. Kramosil, On pseudo-random sequences over finite alphabets, Fundamenta Informaticae (to appear).
- I. Kramosil, Recursive classification of pseudo-random sequences, Supplement to Kybernetika 20 (1984), 1-36. (1984) MR0758385
Citations in EuDML Documents
topNotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.