The Application of Algorithmic Probability to Problems in Artificial Intelligence

Abstract

This paper covers two topics: first an introduction to Algorithmic Complexity Theory: how it defines probability, some of its characteristic properties and past successful applications. Second, we apply it to problems in A.I. - where it promises to give near optimum search procedures for two very broad classes of problems.

Cite

Text

Solomonoff. "The Application of Algorithmic Probability to Problems in Artificial Intelligence." Conference on Uncertainty in Artificial Intelligence, 1985. doi:10.1016/B978-0-444-70058-2.50040-1

Markdown

[Solomonoff. "The Application of Algorithmic Probability to Problems in Artificial Intelligence." Conference on Uncertainty in Artificial Intelligence, 1985.](https://mlanthology.org/uai/1985/solomonoff1985uai-application/) doi:10.1016/B978-0-444-70058-2.50040-1

BibTeX

@inproceedings{solomonoff1985uai-application,
  title     = {{The Application of Algorithmic Probability to Problems in Artificial Intelligence}},
  author    = {Solomonoff, Ray J.},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {1985},
  pages     = {473-494},
  doi       = {10.1016/B978-0-444-70058-2.50040-1},
  url       = {https://mlanthology.org/uai/1985/solomonoff1985uai-application/}
}