The Application of Algorithmic Probability to Problems in Artificial Intelligence

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.

[1]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[2]  Marvin Minsky,et al.  A framework for representing knowledge" in the psychology of computer vision , 1975 .

[3]  Patrick Henry Winston,et al.  Learning structural descriptions from examples , 1970 .

[4]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part I , 1964, Inf. Control..

[5]  Marvin Minsky,et al.  A framework for representing knowledge , 1974 .

[6]  R. Solomonott.  Inductive Inference Theory - A Unified Approach to Problems in Pattern Recognition and Artificial Intelligence , 1975, IJCAI.

[7]  Gregory J. Chaitin,et al.  Information-Theoretic Limitations of Formal Systems , 1974, JACM.

[8]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[9]  J ChaitinGregory.  Information-Theoretic Limitations of Formal Systems , 1974 .

[10]  Ray J. Solomonoff,et al.  Complexity-based induction systems: Comparisons and convergence theorems , 1978, IEEE Trans. Inf. Theory.

[11]  G. Chaitin.  Randomness and Mathematical Proof , 1975 .

[12]  James J. Horning,et al.  A Procedure for Grammatical Inference , 1971, IFIP Congress.

[13]  Patrick Henry Winston,et al.  The psychology of computer vision , 1976, Pattern Recognit..

[14]  Per Martin-Löf,et al.  The Definition of Random Sequences , 1966, Inf. Control..

[15]  Andrei N. Kolmogorov,et al.  Logical basis for information theory and probability theory , 1968, IEEE Trans. Inf. Theory.

[16]  Gregory J. Chaitin,et al.  A recent technical report , 1974, SIGA.