On the computability of Solomonoff induction and AIXI
From MaRDI portal
Publication:1704559
DOI10.1016/j.tcs.2017.11.020zbMath1388.68253OpenAlexW2772878991MaRDI QIDQ1704559
Publication date: 12 March 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1885/232674
computabilityarithmetical hierarchyAIXISolomonoff inductiongeneral reinforcement learningknowledge-seeking agents
Learning and adaptive systems in artificial intelligence (68T05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Universal knowledge-seeking agents
- General time consistent discounting
- A philosophical treatise of universal induction
- On the undecidability of probabilistic planning and related stochastic optimization problems
- On the relation between descriptional complexity and algorithmic probability
- Universal artificial intelligence. Sequential decisions based on algorithmic probability.
- Asymptotic non-learnability of universal agents with computable horizon functions
- Putnam's diagonal argument and the impossibility of a universal learning machine
- On the Computability of Solomonoff Induction and Knowledge-Seeking
- Universal Knowledge-Seeking Agents for Stochastic Environments
- No Free Lunch versus Occam’s Razor in Supervised Learning
- (Non-)Equivalence of Universal Priors
- A Monte-Carlo AIXI Approximation
- Universal Knowledge-Seeking Agents
- Asymptotically Optimal Agents
- Complexity of finite-horizon Markov decision process problems
- The Complexity of Markov Decision Processes
- Merging of Opinions with Increasing Information
- Complexity-based induction systems: Comparisons and convergence theorems
- Towards a Universal Theory of Artificial Intelligence based on Algorithmic Probability and Sequential Decision Theory
- A formal theory of inductive inference. Part I
- An introduction to Kolmogorov complexity and its applications
- New error bounds for Solomonoff prediction
This page was built for publication: On the computability of Solomonoff induction and AIXI
