Skip to main content
SpringerLink
Log in

On some types of pseudo-random sequences

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1986 (MFCS 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 233))

  • 127 Accesses

Abstract

The finite sequences the algorithmic complexities of which, with respect to a universal Turing machine, do not differ substantially from their corresponding lengths are known to be good simulations of statistically independent random samples from the equiprobable distribution. The aim of this paper is to suggest a possibility how to define, using the apparatus of algorithmic complexity, pseudo-random independent and equally distributed samples from a general probability distribution over a finite set and pseudo-Markov samples with a finite set of possible states.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. S. Chow, H. Teicher: Probability Theory — Independence, Interchangeability, Martingales. Springer Verlag, Berlin-Heidelberg-New York, 1978.

    Google Scholar 

  2. T. L. Fine: Theories of Probability — an Examination of Foundations. Academic Press, New York — London, 1973.

    Google Scholar 

  3. I. Kramosil: Recursive Classification of Pseudo-Random Sequences. Kybernetika (Prague), 20(1984) — Supplement, pp. 1–34.

    Google Scholar 

  4. I. Kramosil, J. Šindelář: Infinite Sequences of High Algorithmic Complexity. Kybernetika 20(1984), 6, pp. 459–466.

    Google Scholar 

  5. I. Kramosil: Independent and Identically Distributed Pseudo-Random Samples. Submitted for publication.

    Google Scholar 

  6. C.-P. Schnorr: Zufälligskeit und Wahrscheinlichkeit. Lect. Notes in Math. Springer-Verlag, Berlin-Heidelberg-New York, 1971.

    Google Scholar 

  7. J. A. Storer: Toward an Abstract Theory of Data Compression. Theoretical Comp. Sci. 24(1983), 3, pp. 221–237.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Theory and Automation, Czechoslovak Academy of Sciences, Pod vodárenskou věží 4, 182 08, Prague, Czechoslovakia

    Ivan Kramosil

Authors
  1. Ivan Kramosil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kramosil, I. (1986). On some types of pseudo-random sequences. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016273

Download citation

  • DOI: https://doi.org/10.1007/BFb0016273

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16783-9

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation