Skip to main content
SpringerLink
Log in

Exact expressions for some randomness tests

  • Vorträge (In Alphabetischer Reihenfolge)
  • Conference paper
  • First Online:
Theoretical Computer Science 4th GI Conference

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

Abstract

For a computable probability distribution P over the set of infinite binary sequences Martin-Löf defined a test d(x|P) measuring the degree of nonrandomness of the sequence x with respect of P. We give some expressions in terms of Kolmogorov's and other complexities of the initial segments of x whose difference from d(x|P) is bounded by a constant.

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.

Similar content being viewed by others

References

  1. Martin-Löf, Per: The definition of random sequences. Information and Control 6 (1966) 602–619

    Google Scholar 

  2. Zvonkin, A.K., Levin, L.A.: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russ. Math. Surv. 25/6 (1970) 83

    Google Scholar 

  3. Levin, L.A.: On the notion of a random sequence. Soviet Math. Dokl. 14 (1973) 1413

    Google Scholar 

  4. Schnorr, C.P.: Process complexity and effective random tests. J. Comput. Syst. Sci. 7 (1973) 376

    Google Scholar 

  5. Kolmogorov, A.N.: Three approaches to the quantitative definition of information, Prob. Info. Transmission 1/1 (1965) 1

    Google Scholar 

  6. Levin, L.A.: Some theorems on the algorithmic approach to Probability Theory and Information Theory (Ph.D.thesis, 1971)

    Google Scholar 

  7. Chaitin, G.J.: A theory of program-size formally identical to Information Theory, J.A.C.M. 22 (1975) 329

    Google Scholar 

  8. Chaitin, G.J.: Algorithmic Information Theory, IBM J. REs. Dev. (July 1977) 350–359

    Google Scholar 

  9. Schnorr, C.P.: Unpublished manuscript

    Google Scholar 

  10. Martin-Löf, P.: Algorithmen und zufällige Folgen. Lecture Notes, University of Erlangen, 1966

    Google Scholar 

  11. Levin, L.A.: Uniform tests of randomness, Soviet Math. Doklady 17 (1976) 337

    Google Scholar 

  12. Gács, P.: On the symmetry of algorithmic information. Soviet Math. Dokl. 15 (1974) 1477–1480, Corrections ibid. No. 6, V.

    Google Scholar 

Download references

Authors
  1. Péter Gács
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Weihrauch

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gács, P. (1979). Exact expressions for some randomness tests. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-09118-1_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-35517-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation