On the Computability of Solomonoff Induction and Knowledge-Seeking
Publication:2835643
DOI10.1007/978-3-319-24486-0_24zbMath1388.68252arXiv1507.04124OpenAlexW905556285WikidataQ58012195 ScholiaQ58012195MaRDI QIDQ2835643
Publication date: 30 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.04124
complexitycomputabilityasymptotic optimalityuniversal Turing machinearithmetical hierarchyexplorationAIXISolomonoff inductiongeneral reinforcement learningknowledge-seeking agentsBayesExp
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 (4)
Cites Work
- Universal knowledge-seeking agents
- A philosophical treatise of universal induction
- On the relation between descriptional complexity and algorithmic probability
- On the computability of Solomonoff induction and AIXI
- Universal artificial intelligence. Sequential decisions based on algorithmic probability.
- Asymptotic non-learnability of universal agents with computable horizon functions
- On the Computability of Solomonoff Induction and Knowledge-Seeking
- Universal Knowledge-Seeking Agents for Stochastic Environments
- (Non-)Equivalence of Universal Priors
- Universal Prediction of Selected Bits
- Universal Knowledge-Seeking Agents
- Asymptotically Optimal Agents
- Merging of Opinions with Increasing Information
- Complexity-based induction systems: Comparisons and convergence theorems
- Optimality Issues of Universal Greedy Agents with Static Priors
- Computability and Randomness
- 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 Knowledge-Seeking
