Ray Solomonoff, Date of Birth, Place of Birth, Date of Death

    

Ray Solomonoff

American artificial intelligence researcher

Date of Birth: 25-Jul-1926

Place of Birth: Cleveland, Ohio, United States

Date of Death: 07-Dec-2009

Profession: computer scientist, artificial intelligence researcher

Nationality: United States

Zodiac Sign: Leo


Show Famous Birthdays Today, United States

👉 Worldwide Celebrity Birthdays Today

About Ray Solomonoff

  • Ray Solomonoff (July 25, 1926 – December 7, 2009) was the inventor of algorithmic probability, his General Theory of Inductive Inference (also known as Universal Inductive Inference), and was a founder of algorithmic information theory.
  • He was an originator of the branch of artificial intelligence based on machine learning, prediction and probability.
  • He circulated the first report on non-semantic machine learning in 1956.Solomonoff first described algorithmic probability in 1960, publishing the theorem that launched Kolmogorov complexity and algorithmic information theory.
  • He first described these results at a Conference at Caltech in 1960, and in a report, Feb.
  • 1960, "A Preliminary Report on a General Theory of Inductive Inference." He clarified these ideas more fully in his 1964 publications, "A Formal Theory of Inductive Inference," Part I and Part II.Algorithmic probability is a mathematically formalized combination of Occam's razor, and the Principle of Multiple Explanations. It is a machine independent method of assigning a probability value to each hypothesis (algorithm/program) that explains a given observation, with the simplest hypothesis (the shortest program) having the highest probability and the increasingly complex hypotheses receiving increasingly small probabilities. Solomonoff founded the theory of universal inductive inference, which is based on solid philosophical foundations and has its root in Kolmogorov complexity and algorithmic information theory.
  • The theory uses algorithmic probability in a Bayesian framework.
  • The universal prior is taken over the class of all computable measures; no hypothesis will have a zero probability.
  • This enables Bayes' rule (of causation) to be used to predict the most likely next event in a series of events, and how likely it will be.Although he is best known for algorithmic probability and his general theory of inductive inference, he made many other important discoveries throughout his life, most of them directed toward his goal in artificial intelligence: to develop a machine that could solve hard problems using probabilistic methods.

Read more at Wikipedia

See Also