Skip to main content
SpringerLink
Log in

Kolmogorov Complexity

  • Reference work entry
Encyclopedia of Optimization

  • 181 Accesses

Article Outline

Keywords and Phrases

See also

References

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 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.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

Similar content being viewed by others

References

  1. Adami C (1998) Introduction to artificial life. Springer, Berlin

    MATH  Google Scholar 

  2. Bennett C (1982) The thermodynamics of computation - a review. Internat J Theoret Physics 21:905–940

    Article  Google Scholar 

  3. Bohm D (1980) Wholeness and the implicate order. Routledge and Kegan Paul, London

    Google Scholar 

  4. Chaitin G (1966) On the length of programs for computing binary sequences. J ACM 13:547–569

    Article  MATH  MathSciNet  Google Scholar 

  5. Chaitin G (1970) On the difficulty of computations. IEEE Trans Inform Theory 16:5–9

    Article  MATH  Google Scholar 

  6. Chaitin G (1975) Randomness and mathematical proof. Scientif Amer 232:47–52

    Article  Google Scholar 

  7. Chaitin G (1975) A theory of program size formally identical to information theory. J ACM 22:329–340

    Article  MATH  MathSciNet  Google Scholar 

  8. Gardner M (1979) Mathematical games. Scientif Amer 10:20–34

    Google Scholar 

  9. Kirchherr W, Li M, Vitanyi P (1997) The miraculous universal distribution. Math Intelligencer 19(4):7–15

    Article  MATH  MathSciNet  Google Scholar 

  10. Kolmogorov A (1950) Foundations of the theory of probability. Chelsea, New York

    Google Scholar 

  11. Kolmogorov A (1965) Three approaches to the definition of the concept “quantity of information”. Probl Inform Transmission 1:1–7

    Google Scholar 

  12. Kolmogorov A (1983) Combinatorial foundations of information theory and the calculus of probabilities. Russian Math Surveys 38:29

    Article  MATH  Google Scholar 

  13. Korotkich V (1999) A mathematical structure for emergent computation. Kluwer, Dordrecht

    MATH  Google Scholar 

  14. Li M, Vitanyi P (1997) An introduction to Kolmogorov complexity and its applications. second, revised and expanded edn. Springer, Berlin

    MATH  Google Scholar 

  15. Penrose R (1995) Shadows of the mind. Vintage, London

    MATH  Google Scholar 

  16. Solomonoff R (1964) A formal theory of inductive inference. Inform and Control 7:1–22

    Article  MATH  MathSciNet  Google Scholar 

  17. Zurek W (1989) Algorithmic randomness and physical entropy. Phys Rev A 40:4731–4751

    Article  MathSciNet  Google Scholar 

  18. Zvonkin A, Levin L (1970) The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Math Surv 256:83–124

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Central Queensland University, Mackay, Australia

    Victor Korotkich

Authors
  1. Victor Korotkich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Korotkich, V. (2008). Kolmogorov Complexity . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_315

Download citation

Publish with us

Policies and ethics

Search

Navigation