Abstract
This is the story of Ray Solomonoff’s Life and Times. He was there at Dartmouth in 1956 when Artificial Intelligence was first given its name, and took part in the major events during this unique era right up to his death in 2009. His invention in 1960 of Algorithmic Probability, with its multiple descriptions of data, led to better ways of handling data and prediction for machine learning. The theorems that are part of his discovery lie at the heart of Algorithmic Information Theory. Ray championed probability in AI during the decades it was unpopular and lived to see a renaissance in systems that learn and reason using probability. The story of his life is the story of a great adventure.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Carnap, R.: Logical Foundations of Probability (1950)
Chomsky, A.N.: Three models for the description of language. IRE Transactions on Information Theory, IT-2(3), 113–124 (1956)
Gács, P., Vitányi, P.: Raymond J. Solomonoff 1926 – 2009. IEEE Information Theory Society Newsletter 61(11) (March 2011)
Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Problems of Information Transmission 1(1), 1–7 (1965)
Levin, L.A.: Universal search problems. Problemy Peredaci Informacii (9), 115–116 (1973); Translated in Problems of Information Transmission 9, 265–266
Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer, N.Y. (2008)
Rathmanner, S., Hutter, M.: A philosophical treatise of universal induction. Entropy (13), 1076–1136 (2011)
Shannon, C.E.: The mathematical theory of communication. Bell System Technical Journal (27), 379–423, 623–656 (1948)
Solomonoff, R.J.: An inductive inference machine. Dartmouth Summer Research Project on Artificial Intelligence (August 1956); A privately circulated report
Solomonoff, R.J.: A preliminary report on a general theory of inductive inference. Technical Report V-131, Zator Co. and Air Force Office of Scientific Research, Cambridge, Mass. (February 1960)
Solomonoff, R.J.: A preliminary report on a general theory of inductive inference (revision of Report V-131). Technical Report ZTB-138, Zator Co. and Air Force Office of Scientific Research, Cambridge, Mass. (November 1960)
Solomonoff, R.J.: A formal theory of inductive inference: Part I. Information and Control 7(1), 1–22 (1964)
Solomonoff, R.J.: A formal theory of inductive inference: Part II. Information and Control 7(2), 224–254 (1964)
Solomonoff, R.J.: Inductive inference theory - a unified approach to problems in pattern recognition and artificial intelligence. In: Proceedings of the Fourth International Joint Conference on Artificial Intelligence, Tbilisi, Georgia, U.S.S.R., vol. 1, pp. 274–280 (September 1975)
Solomonoff, R.J.: Complexity-based induction systems: Comparisons and convergence theorems. IEEE Transactions on Information Theory, IT-24(4), 422–432 (1978)
Solomonoff, R.J.: The time scale of artificial intelligence; reflections on social effects. Human Systems Management 5, 149–153 (1985)
Solomonoff, R.J.: The application of algorithmic probability to problems in artificial intelligence. In: Kanal, L.N., Lemmer, J.F. (eds.) Uncertainty in Artificial Intelligence, pp. 473–491. Elsevier Science Publishers, B.V., B.V (1986); Kochen, M., Hastings, H.M. (eds.) Advances in Cognitive Science. AAAS Selected Symposia Series, pp. 210–227. AAAS, Washington, D.C (1988)
Solomonoff, R.J.: The discovery of algorithmic probability. Journal of Computer and System Sciences 55(1), 73–88 (1997)
Solomonoff, R.J.: Three kinds of probabilistic induction: Universal distributions and convergence theorems. The Computer Journal 51(5), 566–570 (2008); Christopher Stewart Wallace (1933-2004) Memorial Special issue
Turing, A.M.: On computable numbers, with an application to the entsheidungsproblem. Proc. London Math. Soc. 42, 230–265 (1937)
Vitányi, P.: Obituary: Ray Solomonoff, founding father of algorithmic information theory. CWI, Amsterdam (2009)
Wallace, C.S., Boulton, D.M.: An information measure for classification. The Computer Journal 11, 185–194 (1968)
Wallace, C.S., Dowe, D.L.: Minimum message length and Kolmogorov complexity. Computer Journal 42(4), 270–283 (1999); Special Issue on Kolmogorov Complexity
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Solomonoff, G. (2013). Ray Solomonoff and the New Probability. In: Dowe, D.L. (eds) Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence. Lecture Notes in Computer Science, vol 7070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-44958-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-44958-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-44957-4
Online ISBN: 978-3-642-44958-1
eBook Packages: Computer ScienceComputer Science (R0)