Journal of Mathematical Sciences

, Volume 75, Issue 2, pp 1576–1582 | Cite as

On an algorithm to generate weakly correlated random numbers

  • I. G. Zhurbenko
  • O. S. Smirnova
Probabilistic-Statistical Models

Abstract

Some results of the theory of recursive functions are used for constructing generators of weakly correlated random numbers.

Keywords

Random Number Recursive Function 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. N. Kolmogorov, “On logical foundation of probability theory,”Lecture Notes Math.,1021, Springer-Verlag (1982).Google Scholar
  2. 2.
    A. K. Zvonkin and L. A. Levin, “The complexity of finite objects and foundation of the notions of information and probability on the base of the theory of algorithms,”Soviet Math. Uspekhi,25, No. 6 (1970).Google Scholar
  3. 3.
    A. Sheng, “On the frequency approach to the definition of a random sequence,”Semiotics Informatics,18, (1982).Google Scholar
  4. 4.
    W. Feller,An Introduction to Probability Theory and Its Applications, Wiley, New York (1970).Google Scholar
  5. 5.
    A. V. Mal’tsev,Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).Google Scholar
  6. 6.
    O. S. Smirnova, “On the construction of a sequence of asymptotically composite binary words,” in:Algebraic and Discrete Systems [in Russian], Ivanovo (1988).Google Scholar
  7. 7.
    I. G. Zhurbenko and O. S. Smirnova, “On the simulation of a weakly dependent binary sequence,” in:Multivariate Statistical Analysis and Its Applications to Economics and Quality Control [in Russian], Tartu Univ. Press, Tartu (1989).Google Scholar

Copyright information

© Plenum Publishing Corporation 1995

Authors and Affiliations

  • I. G. Zhurbenko
    • 1
  • O. S. Smirnova
    • 1
  1. 1.Moscow

Personalised recommendations