On the computability of Solomonoff induction and AIXI
Authors:
- Jan LeikeJLJan Leike
- Marcus HutterMHMarcus Hutter
- 1 March 2018
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 716, 28-49
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Australian Research Council (DP150104590)
This publication has 14 references indexed in Scilit:
- General time consistent discountingTheoretical Computer Science, 2014
- Asymptotic non-learnability of universal agents with computable horizon functionsTheoretical Computer Science, 2013
- A Philosophical Treatise of Universal InductionEntropy, 2011
- On the undecidability of probabilistic planning and related stochastic optimization problemsArtificial Intelligence, 2003
- New Error Bounds for Solomonoff PredictionJournal of Computer and System Sciences, 2001
- Complexity of finite-horizon Markov decision process problemsJournal of the ACM, 2000
- On the relation between descriptional complexity and algorithmic probabilityTheoretical Computer Science, 1983
- Complexity-based induction systems: Comparisons and convergence theoremsIEEE Transactions on Information Theory, 1978
- A formal theory of inductive inference. Part IInformation and Control, 1964
- Merging of Opinions with Increasing InformationThe Annals of Mathematical Statistics, 1962