On the computability of Solomonoff induction and AIXI
type: Item
instance of: scholarly article
title: On the computability of Solomonoff induction and AIXI
zbMATH Open document ID: 1388.68253
author: Jan Leike
author: Marcus Hutter
published in: Theoretical Computer Science
publication date: 2018-03-12T00:00:00Z
full work available at URL: http://hdl.handle.net/1885/232674
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 6848991
zbMATH Keywords: Solomonoff induction
zbMATH Keywords: AIXI
zbMATH Keywords: general reinforcement learning
zbMATH Keywords: knowledge-seeking agents
zbMATH Keywords: computability
zbMATH Keywords: arithmetical hierarchy
MaRDI profile type: Publication
OpenAlex ID: W2772878991
cites work: Merging of Opinions with Increasing Information
cites work: On the relation between descriptional complexity and algorithmic probability
cites work: Towards a Universal Theory of Artificial Intelligence based on Algorithmic Probability and Sequential Decision Theory
cites work: New error bounds for Solomonoff prediction
cites work: Universal artificial intelligence. Sequential decisions based on algorithmic probability.
cites work: No Free Lunch versus Occam’s Razor in Supervised Learning
cites work: Asymptotically Optimal Agents
cites work: General time consistent discounting
cites work: On the Computability of Solomonoff Induction and Knowledge-Seeking
cites work: An introduction to Kolmogorov complexity and its applications
cites work: On the undecidability of probabilistic planning and related stochastic optimization problems
cites work: Complexity of finite-horizon Markov decision process problems
cites work: Q3611832
cites work: Universal Knowledge-Seeking Agents
cites work: Asymptotic non-learnability of universal agents with computable horizon functions
cites work: Universal knowledge-seeking agents
cites work: Universal Knowledge-Seeking Agents for Stochastic Environments
cites work: The Complexity of Markov Decision Processes
cites work: A philosophical treatise of universal induction
cites work: A formal theory of inductive inference. Part I
cites work: Complexity-based induction systems: Comparisons and convergence theorems
cites work: Putnam's diagonal argument and the impossibility of a universal learning machine
cites work: Q4626283
cites work: A Monte-Carlo AIXI Approximation
cites work: (Non-)Equivalence of Universal Priors
DOI: 10.1016/J.TCS.2017.11.020
description: scientific article; zbMATH DE number 6848991