Differences between Kolmogorov Complexity and Solomonoff Probability: Consequences for AGI (Potapov et. al.)

Added by Deon Garrett about 7 years ago

Kolmogorov complexity and algorithmic probability are compared in the context of the universal algorithmic intelligence. Accuracy of time series prediction based on single best model and on averaging over multiple models is estimated. Connection between inductive behavior and multi-model prediction is established. Uncertainty as a heuristic for reducing the number of used models without losses of universality is discussed. The conclusion is made that plurality of models is the essential feature of artificial general intelligence, and this feature should not be removed without necessity.

paper_7.pdf (493 kB)