Recursive classification of pseudo-random sequences

Ivan Kramosil

Kybernetika (1984)

  • Volume: 20, Issue: Suppl1, page (1)-34
  • ISSN: 0023-5954

How to cite

top

Kramosil, Ivan. "Recursive classification of pseudo-random sequences." Kybernetika 20.Suppl1 (1984): (1)-34. <http://eudml.org/doc/27615>.

@article{Kramosil1984,
author = {Kramosil, Ivan},
journal = {Kybernetika},
keywords = {algorithmic complexity; Turing machine; criterion of randomness},
language = {eng},
number = {Suppl1},
pages = {(1)-34},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Recursive classification of pseudo-random sequences},
url = {http://eudml.org/doc/27615},
volume = {20},
year = {1984},
}

TY - JOUR
AU - Kramosil, Ivan
TI - Recursive classification of pseudo-random sequences
JO - Kybernetika
PY - 1984
PB - Institute of Information Theory and Automation AS CR
VL - 20
IS - Suppl1
SP - (1)
EP - 34
LA - eng
KW - algorithmic complexity; Turing machine; criterion of randomness
UR - http://eudml.org/doc/27615
ER -

References

top
  1. M. Davis, Computability and Unsolvability, McGraw Hill Book Company, New York-Toronto-London 1958. (1958) Zbl0080.00902MR0124208
  2. T. L. Fine, Theories of Probability. An Examination of Foundations, Academic Press, New York-London 1973. (1973) Zbl0275.60006MR0433529
  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. (1983) Zbl0551.68039MR0757724
  4. I. Kramosil, Pseudo-random Monte-Carlo methods, Ann. Soc. Math. Polon. Ser. IV. Fund. Inform. 5 (1982), 3-4, 301-312. (1982) Zbl0502.65082
  5. I. Kramosil, On pseudo-random sequences over finite alphabets, Ann. Soc. Math. Polon. Ser. IV. Fund. Inform. (to appear). 

NotesEmbed ?

top

You must be logged in to post comments.