scientific article; zbMATH DE number 2089364

MaRDI QIDQ3046708zbMATH OpenFDO

Authors Jürgen Schmidhuber

Publication date 12 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2375/23750216.htm

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computational learning theory (68Q32)

Recommendations

• On the existence and convergence of computable universal priors
• On generalized computable universal priors and their convergence
• Theory and Applications of Models of Computation
• Algorithmic Probability: Theory and Applications
• Is There an Elegant Universal Theory of Prediction?

Cited in

(8)

• Open problems in universal induction \& intelligence
• Fast rates by transferring from auxiliary hypotheses
• On universal prediction and Bayesian confirmation
• Sequential predictions based on algorithmic complexity
• A circuit complexity formulation of algorithmic information theory
• A dilemma for Solomonoff prediction
• Algorithmic complexity bounds on future prediction errors
• Physical limits of inference

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046708)