Skip to main content
SpringerLink
Log in

Algorithmic Chaos and the Incompressibility Method

  • Chapter
Kolmogorov’s Heritage in Mathematics

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chaitin, G.J.: A theory of program size formally identical to information theory. J. Assoc. Comp. Mach., 22, 329-340 (1975)

    MATH  MathSciNet  Google Scholar 

  2. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press, Cambridge (1990)

    Google Scholar 

  3. Devaney, R.L.: An Introduction to Chaos Dynamical Systems. Addison-Wesley, 2nd Edition (1989)

    Google Scholar 

  4. Erdös, P., Spencer, J.: Probabilistic Methods in Combinatorics. Academic Press, New York (1974)

    MATH  Google Scholar 

  5. Ford, J.: How random is a random coin toss? Physics Today, 36, 40-47 (April 1983)

    Article  Google Scholar 

  6. Kolmogorov, A.N.: Three approaches to the definition of the concept of ‘quantity of information’. Problems in Information Transmission, 1, 1-7 (1965)

    MathSciNet  Google Scholar 

  7. Levin, L.A.: Laws of information conservation (non-growth) and aspects of the foundation of probability theory. Problems in Information Transmission, 10, 206-210 (1974)

    Google Scholar 

  8. Li, M., Vitanyi, P.M.B.: An Introduction to Kolmogorov Complexity and its Applications, 2nd Edition. Springer-Verlag, New York (1997)

    MATH  Google Scholar 

  9. Martin-Löf, P.: On the definition of random sequences. Information and Control, 9, 602-619 (1966)

    Article  MathSciNet  Google Scholar 

  10. Rogers, H.J. Jr.: Theory of Recursive Functions and Effective Computability. McGraw-Hill (1967)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centrum voor Wiskunde en Informatica (CWI), Amsterdam, The Netherlands

    Paul Vitanyi

Authors
  1. Paul Vitanyi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut de Mathématiques, Université Bordeaux 1, 351 cours de la Libération, 33405 Talence Cedex, France

    Éric Charpentier

  2. Laboratoire de Physique Théorique de la Matiére Condensée, Université Pierre et Marie Curie, Case 121 Tour 24-25 - 4ème étage pièce 407, 4 Place Jussieu, 75252 Paris, France

    Annick Lesne

  3. Institut des Hautes Études Scientifiques Le Bois-Marie, 35 route de Chartres, 91440 Bures-sur-Yvette, France

    Annick Lesne

  4. Institut de Mathématiques, Université Bordeaux 1, 351 cours de la Libréation, 33405 Talence Cedex, France

    Nikolaï K. Nikolski

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Vitanyi, P. (2007). Algorithmic Chaos and the Incompressibility Method. In: Charpentier, É., Lesne, A., Nikolski, N.K. (eds) Kolmogorov’s Heritage in Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36351-4_15

Download citation

Publish with us

Policies and ethics

Search

Navigation