New error bounds for Solomonoff prediction

Journal of Computer and System Sciences

Volumn 62, Issue 4, 2001, Pages 653-667

  Hutter, Marcus ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

Algorithmic probability; Bayesian; Deterministic prediction; Induction; Kolmogorov complexity; Solomonoff

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; PROBABILITY DISTRIBUTIONS;

SOLOMONOFF PREDICTIONS;

BINARY SEQUENCES;

EID: 0035360790     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2000.1743     Document Type: Article

References (12)

1. Inductive inference: Theory and methods
2. An essay towards solving a problem in the doctrine of chances
3. Three approaches to the quantitative definition of information
4. Laws of information conservation (non-growth) and aspects of the foundation of probability theory
5. Inductive reasoning and Kolmogorov complexity
6. A formal theory of inductive inference, Parts 1 and 2
7. Complexity-based induction systems: Comparisons and convergence theorems
8. The discovery of algorithmic probability
9. Computational complexity and probability constructions
10. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms