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. © 2012 Springer-Verlag.
CITATION STYLE
Potapov, A., Svitenkov, A., & Vinogradov, Y. (2012). Differences between Kolmogorov complexity and Solomonoff probability: Consequences for AGI. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7716 LNAI, pp. 252–261). https://doi.org/10.1007/978-3-642-35506-6_26
Mendeley helps you to discover research relevant for your work.