Skip to main content
SpringerLink
Log in

The discovery of algorithmic probability: A guide for the programming of true creativity

  • Conference paper
  • First Online:
Computational Learning Theory (EuroCOLT 1995)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 904))

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. Chaitin, G.W, “On the Length of Programs for Computing Finite Binary Sequences,” Journal of the Assoc. of Comp. Mach., 13, pp. 547–569, 1966.

    Google Scholar 

  2. Chaitin, G.W, “On the Length of Programs for Computing Finite Binary Sequences: Statistical Considerations,” Journal of the Assoc. of Comp. Mach., 16, pp. 145–159, 1969.

    Google Scholar 

  3. Chaitin, G.W, “A Theory of Program Size Formally Identical to Information Theory,” Journal of the Assoc. of Comp. Mach., vol. 22, no. 3, pp. 329–340, July, 1975.

    Google Scholar 

  4. Chomsky, A.N., “Three Models for the Description of Language,” IRE Transactions on Information Theory, Vol. IT-2, No. 3, Sept. 1956, pp. 113–124.

    Google Scholar 

  5. Cover, T.M. “Universal Gambling Schemes and the Complexity Measures of Kolmogorov and Chaitin,” Rep. 12, Statistics Dept., Stanford Univ., Stanford, Ca, 1974.

    Google Scholar 

  6. Feigenbaum, E.A. and Feldman, J. Computers and Thought, McGraw-Hill Book Co., New York, 1963.

    Google Scholar 

  7. Gács. P. “On the Symmetry of Algorithmic Information,” Soviet Math. Dokl., 15:1477–1480, 1974. Correction, Ibid, 15:1480, 1974.

    Google Scholar 

  8. Hayakawa, S.I. Language in Action, Harcourt, Brace and Co., New York, 1941.

    Google Scholar 

  9. Hillis, D. “Co-evolving Parasites Improves Simulated Evolution as an Optimization Procedure,” Artificial Life II, Langdon, C., Taylor, C., Farmer, J., and Rasmussen, S. (Eds), pp 313–324.

    Google Scholar 

  10. Horning, J. “A Procedure for Grammatical Inference,” Proceedings of the IFIP Congress 71, Amsterdam, North Holland, pp. 519–523, 1971.

    Google Scholar 

  11. Huffman, D.A. “A Method for Construction of Minimum-Redundancy Codes,” Proceedings IRE, 40:1098–1101, 1952.

    Google Scholar 

  12. Johnson, W. People in Quandaries; the Semantics of Personal Adjustment, Harper and Row, New York, 1946.

    Google Scholar 

  13. Kolmogorov, A.N. “Three Approaches to the Quantitative Definition of Information.” Problems Inform. Transmission, 1(1): 1–7, 1965

    Google Scholar 

  14. Kolmogorov, A.N. “Logical Basis for Information Theory and Probability Theory.” IEEE Trans. on Information Theory, IT-14(5):662–664, 1968.

    Google Scholar 

  15. Kolmogorov, A.N. “Some Theorems on Algorithmic Entropy and the Algorithmic Quantity of Information.” Uspekhi Mat. Nauk, 23(2):201, 1968.

    Google Scholar 

  16. Kolmogorov, A.N. “On the Logical Foundations of Information Theory and Probability Theory.” Problems Inform. Transmission, 5:1–4, 1969.

    Google Scholar 

  17. Korzybski, A. Science and Sanity, Internat. Non-Aristotelian Library Pub. Co., Lakeville, Conn., 1958.

    Google Scholar 

  18. Koza, J. “Genetic Programming: A Paradigm for Genetically Breeding Populations of Computer Programs to Solve Problems,” Rep. No. STAN-CS-90-1314, Dept. of Computer Science, Stanford Univ., Stanford, Ca, 1990, pp. 16–24.

    Google Scholar 

  19. Levin, L.A. “Universal Search Problems,” Problemy Peredaci Informacii 9, pp. 115–116, 1973. Translated in Problems of Information Transmission 9, pp. 265–266.

    Google Scholar 

  20. Levin, L.A. “On the Notion of a Random Sequence,” Soviet Math. Dokl, 14:1413–1416, 1973.

    Google Scholar 

  21. Levin, L.A. “Laws of Information Conservation (Non-Growth) and Aspects of the Foundation of Probability Theory,” Problems Inform. Transmission, 10:206–210. 1974.

    Google Scholar 

  22. Levin, L.A. Personal communication.

    Google Scholar 

  23. Li, M. and Vitányi, P. An Introduction to Kolmogorov Complexity and Its Applications, Springer-Verlag, New York, 1993.

    Google Scholar 

  24. Martin-Löf, P. “The Definition of Random Sequences,” Information and Control, 9:602–619, 1966.

    Google Scholar 

  25. Minsky, M.L.. “Steps Toward Artificial Intelligence,” Proceedings of the Institute of Radio Engineers, 49:8–30, 1961.

    Google Scholar 

  26. Minsky, M.L.. “Problems of Formulation for Artificial Intelligence,” Mathematical Problems in the Biological Sciences, Proceedings of Symposia in Applied Mathematics XIV, R.E. Bellman (ed.), pp. 35–46, American Mathematical Society, R.I., 1962.

    Google Scholar 

  27. Rapoport, A. Operational Philosophy, New York, J. Wiley, 1965.

    Google Scholar 

  28. Rissanen, J. “Modeling by the Shortest Data Description,” Automatica, 14:465–471, 1978.

    Google Scholar 

  29. Rissanen, J. Stochastical Complexity and Statistical Inquiry, World Scientific Publishing Company, 1989.

    Google Scholar 

  30. Schnorr, C.P. “Process Complexity and Effective Random Tests,” J. Comput. System Sci., 7:376–388, 1973.

    Google Scholar 

  31. Solomonoff, R.J. “An Inductive Inference Machine,” A privately circulated report, August 1956.

    Google Scholar 

  32. Solomonoff, R.J. “An Inductive Inference Machine,” IRE Convention Record, Section on Information Theory, 1957.

    Google Scholar 

  33. Solomonoff, R.J. “A Progress Report on Machines to Learn to Translate Languages and Retrieve Information,” Advances in Documentation and Library Science, Vol. III, pt. 2, pp. 941–953. (Proceedings of a conference in September 1959).

    Google Scholar 

  34. Solomonoff, R.J. “A Preliminary Report on a General Theory of Inductive Inference,” Report V-131, Zator Co., Cambridge, Mass., Feb. 4, 1960.

    Google Scholar 

  35. Solomonoff, R.J. “A Preliminary Report on a General Theory of Inductive Inference,” (Revision of Report V-131), Contract AF 49(639)-376, Report ZTB-138, Zator Co., Cambridge, Mass., Nov, 1960.

    Google Scholar 

  36. Solomonoff, R.J. “A Formal Theory of Inductive Inference,” Information and Control, Part I: Vol 7, No. 1, pp. 1–22, March 1964.

    Google Scholar 

  37. Solomonoff, R.J. “A Formal Theory of Inductive Inference,” Information and Control, Part II: Vol 7, No. 2, pp. 224–254, June 1964.

    Google Scholar 

  38. Solomonoff, R.J. “Inductive Inference Theory-a Unified Approach to Problems in Pattern Recognition and Artificial Intelligence,” Proceedings of the 4th International Conference on Artificial Intelligence, pp 274–280, Tbilisi, Georgia, USSR, September 1975.

    Google Scholar 

  39. Solomonoff, R.J. “The Adequacy of Complexity Models of Induction,” International Congress of Logic, Methodology and Philosophy of Science, Section VI, pp 19–20, London, Ontario, Canada, September 1975.

    Google Scholar 

  40. Solomonoff, R.J. “Complexity-Based Induction Systems: Comparisons and Convergence Theorems,” IEEE Trans. on Information Theory, Vol IT-24, No. 4, pp. 422–432, July 1978.

    Google Scholar 

  41. Solomonoff, R.J. “Optimum Sequential Search,” Oxbridge Research, P.O. Box 391887, Cambridge, Mass. 02139, June 1984.

    Google Scholar 

  42. Solomonoff, R.J. “The Application of Algorithmic Probability to Problems in Artificial Intelligence,” in Uncertainty in Artificial Intelligence, Kanal, L.N. and Lemmer, J.F. (Eds), Elsevier Science Publishers B.V., PP. 473–491, 1986.

    Google Scholar 

  43. Solomonoff, R.J. “A System for Incremental Learning Based on Algorithmic Probability,” Proceedings of the Sixth Israeli Conference on Artificial Intelligence, Computer Vision and Pattern Recognition, Dec. 1989, pp. 515–527.

    Google Scholar 

  44. van Heerden, P.J. “A General Theory of Prediction,” Technical Report, Polaroid Corp., Cambridge, Mass., 1963.

    Google Scholar 

  45. Wallace, C.S and Boulton, D.M. “An Information Measure for Classification,” Computing Journal, 11:185–195, 1968.

    Google Scholar 

  46. Willis, D.G. “Computational Complexity and Probability Constructions,” Journal of the Assoc. of Comp. Mach., pp. 241–259, April 1970.

    Google Scholar 

  47. Zvonkin, A.K., and 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. Survs, Vol. 25, No. 6, pp. 83–124, 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Oxbridge Research, Box 391887, 02139, Cambridge, Mass., USA

    Ray J. Solomonoff

Authors
  1. Ray J. Solomonoff
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paul Vitányi

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Solomonoff, R.J. (1995). The discovery of algorithmic probability: A guide for the programming of true creativity. In: Vitányi, P. (eds) Computational Learning Theory. EuroCOLT 1995. Lecture Notes in Computer Science, vol 904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59119-2_165

Download citation

  • DOI: https://doi.org/10.1007/3-540-59119-2_165

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59119-1

  • Online ISBN: 978-3-540-49195-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation