Skip to main content
SpringerLink
Log in

Philosophical issues in Kolmogorov complexity

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1992)

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

Included in the following conference series:

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. C.H. Bennett. The thermodynamics of computation—review. International J. of Theoretical Physics, 21:905–940, 1982.

    Google Scholar 

  2. R.G. Brewer and E.L. Hahn. Atomic memory. Scientific American, 251(6):50–57, 1984.

    PubMed  Google Scholar 

  3. G.J. Chaitin. Information-theoretic characterizations of recursive infinite strings. Theoret. Comp. Sci., 2:45–48, 1976.

    Article  Google Scholar 

  4. P.C.W. Davies. Why is the physical world so comprehensible? In W.H. Zurek, editor, Complexity, entropy and the physics of information, pages 61–70. Addison-Wesley, 1991.

    Google Scholar 

  5. P. Erdös and A. Rényi. On two problems of information theory. Publ. Hungar. Ac. Sci., 8:241–254, 1963.

    Google Scholar 

  6. J. Ford. Chaos: solving the unsolvable, predicting the unpredictable. In M.F. Barnsley and S.G. Demko, editors, Chaotic dynamics and fractals. Academic Press, 1986.

    Google Scholar 

  7. N. Goodman. Fact, Fiction, and Forecast Harvard University Press, 1955.

    Google Scholar 

  8. A.N. Kolmogorov. Combinatorial foundations of information theory and the calculus of probabilities. Russian Mathematical Surveys, 38(4):29–40, 1983.

    Google Scholar 

  9. D.K. Kondepudi. Non-equilibrium polymers, entropy, and algorithmic information. In W.H. Zurek, editor, Complexity, entropy and the physics of information, pages 199–206. Addison-Wesley, 1991.

    Google Scholar 

  10. M. Li and P.M.B. Vitányi. Two decades of applied Kolmogorov complexity: In memoriam A.N. Kolmogorov 1903–1987. In Proc. 3rd IEEE Conference on Structure in Complexity Theory, pages 80–101, 1988.

    Google Scholar 

  11. M. Li and P.M.B. Vitányi. Kolmogorov complexity and its applications. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter IV, pages 187–254. Elsevier and MIT Press, 1990.

    Google Scholar 

  12. M. Li and P.M.B. Vitányi. A theory of learning simple concepts under simple distributions. SIAM J. Comput., 20(5):915–935, 1991.

    Article  Google Scholar 

  13. M. Li and P.M.B. Vitányi. An introduction to Kolmogorov complexity and its applications. Addison-Wesley, 1992. To appear.

    Google Scholar 

  14. D.W. Loveland. A variant of the Kolmogorov concept of complexity. Information and Control, 15:510–526, 1969.

    Google Scholar 

  15. L. Moser. The second moment method in combinatorial analysis. In Combinatorial Structures and their applications, pages 283–384. Gordon and Breach, New York, 1970.

    Google Scholar 

  16. N. Pippenger. An information-theoretic method in combinatorial theory. J. Comb. Theory, Ser. A, 23:99–104, 1977.

    Google Scholar 

  17. J. Rissanen. Modeling by the shortest data description. Automatica-J.IFAC, 14:465–471, 1978.

    Article  Google Scholar 

  18. R.J. Solomonoff. Complexity-based induction systems: comparisons and convergence theorems. IEEE Transactions on Information Theory, IT-24:422–432, 1978.

    Article  Google Scholar 

  19. S. Spiegelman. An in vitro analysis of a replicating molecule. American Scientist, 55(3):221–264, 1967.

    PubMed  Google Scholar 

  20. L.G. Valiant. A theory of the learnable. Comm. ACM, 27:1134–1142, 1984.

    Article  Google Scholar 

  21. O. Watanabe, editor. Kolmogorov complexity and its relation to computational complexity theory. Springer-Verlag. EATCS Monographs on Theoretical Computer Science, To appear in 1992.

    Google Scholar 

  22. E. Wigner. The unreasonable effectiveness of mathematics in natural sciences. Comm. Pure Appl. Math, 13:1, 1960.

    Google Scholar 

  23. C.H. Woo. Laws and boundary conditions. In W.H. Zurek, editor, Complexity, entropy and the physics of information, pages 127–135. Addison-Wesley, 1991.

    Google Scholar 

  24. W.H. Zurek. Algorithmic randomness and physical entropy. Physical Review, series A, 40(8):4731–4751, 1989.

    Google Scholar 

  25. W.H. Zurek, editor. Complexity, entropy and the physics of information. Addison-Wesley, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Ming Li

  2. CWI, Kruislaan 413, 1098, SJ Amsterdam, The Netherlands

    Paul M. B. Vitányi

Authors
  1. Ming Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paul M. B. Vitányi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W. Kuich

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, M., Vitányi, P.M.B. (1992). Philosophical issues in Kolmogorov complexity. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_59

Download citation

  • DOI: https://doi.org/10.1007/3-540-55719-9_59

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55719-7

  • Online ISBN: 978-3-540-47278-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation