Ray Solomonoff


Ray Solomonoff
Ray Solomonoff
Naissance 25 juillet 1926
Cleveland, Ohio (États-Unis)
Décès 7 décembre 2009 (à 83 ans)
Nationalité Drapeau des États-Unis États-Unis
Profession Informaticien, chercheur
Compléments
Inventeur de la probabilité algorithmique

Ray J. Solomonoff, né le 25 juillet 1926 à Cleveland, Ohio (États-Unis) et mort le 7 décembre 2009 d'une rupture d'anévrisme, est un informaticien et chercheur américain.

Il est connu pour être à l'origine du concept de probabilité algorithmique et des premières approches d'apprentissage automatique probabiliste en intelligence artificielle.

Sommaire

Biographie

Distinction reçues

Voir aussi

Articles connexes

Liens externes

Références


Wikimedia Foundation. 2010.

Contenu soumis à la licence CC-BY-SA. Source : Article Ray Solomonoff de Wikipédia en français (auteurs)

Regardez d'autres dictionnaires:

  • Ray Solomonoff — (born 1926, Cleveland, Ohio, son of Russianimmigrants) invented [http://scholarpedia.org/article/Algorithmic probability Algorithmic Probability] in 1960. He first described his results at a Conference at Cal Tech, 1960, [Paper from conference on …   Wikipedia

  • Kolmogorov complexity — In algorithmic information theory (a subfield of computer science), the Kolmogorov complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object. It is named after Soviet Russian… …   Wikipedia

  • AI@50 — AI@50, which is formally known as the Dartmouth Artificial Intelligence Conference: The Next Fifty Years (July 13 15, 2006), commemorated the 50th anniversary of the Dartmouth Conferences which effectively inaugurated the history of artificial… …   Wikipedia

  • Inductive inference — This article is about the mathematical concept, for inductive inference in logic, see Inductive reasoning. Around 1960, Ray Solomonoff founded the theory of universal inductive inference, the theory of prediction based on observations; for… …   Wikipedia

  • Occam's razor — For the aerial theatre company, see Ockham s Razor Theatre Company. It is possible to describe the other planets in the solar system as revolving around the Earth, but that explanation is unnecessarily complex compared to the modern consensus… …   Wikipedia

  • Колмогоровская сложность — В алгоритмической теории информации колмогоровская сложность объекта (такого, как текст) есть мера вычислительных ресурсов, необходимых для точного определения этого объекта. Колмогоровская сложность также известна как описательная сложность,… …   Википедия

  • Algorithmic probability — is a concept in theoretical computer science; it quantifies the idea of theories and predictions with reference to short programs and their output. Around 1960, Ray Solomonoff invented the concept of algorithmic probability: take a universal… …   Wikipedia

  • Matthew effect (sociology) — In sociology, the Matthew effect (or accumulated advantage) is the phenomenon where the rich get richer and the poor get poorer .[1][2] Those who possess power and economic or social capital can leverage those resources to gain more power or… …   Wikipedia

  • Marcus Hutter — (born 1967) is a German computer scientist and professor at the Australian National University. Hutter was born and educated in Munich, where he studied physics and computer science. In 2000 he joined Jürgen Schmidhuber s group at the Swiss… …   Wikipedia

  • Algorithmic information theory — is a subfield of information theory and computer science that concerns itself with the relationship between computation and information. According to Gregory Chaitin, it is the result of putting Shannon s information theory and Turing s… …   Wikipedia