Foundations of Probability Theory for AI - The Application of Algorithmic Probability to Problems in Artificial Intelligence

03/27/2013
by   Ray Solomonoff, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

page 7

research
07/14/2011

Diverse Consequences of Algorithmic Probability

We reminisce and discuss applications of algorithmic probability to a wi...
research
05/08/2019

Tropical probability theory and an application to the entropic cone

In a series of articles, we have been developing a theory of tropical di...
research
04/03/2000

A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

Decision theory formally solves the problem of rational agents in uncert...
research
01/05/2018

An equivalence between learning of data and probability distributions, and some applications

Algorithmic learning theory traditionally studies the learnability of ef...
research
02/21/2018

Algorithmic Collusion in Cournot Duopoly Market: Evidence from Experimental Economics

Algorithmic collusion is an emerging concept in current artificial intel...
research
07/30/2018

Objective and Subjective Solomonoff Probabilities in Quantum Mechanics

Algorithmic probability has shown some promise in dealing with the proba...
research
10/07/2019

Algorithmic Probability-guided Supervised Machine Learning on Non-differentiable Spaces

We show how complexity theory can be introduced in machine learning to h...

Please sign up or login with your details

Forgot password? Click here to reset