On the computability of Solomonoff induction and AIXI (Q1704559): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Merging of Opinions with Increasing Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relation between descriptional complexity and algorithmic probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Universal Theory of Artificial Intelligence based on Algorithmic Probability and Sequential Decision Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: New error bounds for Solomonoff prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal artificial intelligence. Sequential decisions based on algorithmic probability. / rank
 
Normal rank
Property / cites work
 
Property / cites work: No Free Lunch versus Occam’s Razor in Supervised Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Optimal Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: General time consistent discounting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computability of Solomonoff Induction and Knowledge-Seeking / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to Kolmogorov complexity and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the undecidability of probabilistic planning and related stochastic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of finite-horizon Markov decision process problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Knowledge-Seeking Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic non-learnability of universal agents with computable horizon functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal knowledge-seeking agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Knowledge-Seeking Agents for Stochastic Environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A philosophical treatise of universal induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity-based induction systems: Comparisons and convergence theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Putnam's diagonal argument and the impossibility of a universal learning machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4626283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monte-Carlo AIXI Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Non-)Equivalence of Universal Priors / rank
 
Normal rank

Revision as of 07:02, 15 July 2024

scientific article
Language Label Description Also known as
English
On the computability of Solomonoff induction and AIXI
scientific article

    Statements

    On the computability of Solomonoff induction and AIXI (English)
    0 references
    0 references
    0 references
    12 March 2018
    0 references
    Solomonoff induction
    0 references
    AIXI
    0 references
    general reinforcement learning
    0 references
    knowledge-seeking agents
    0 references
    computability
    0 references
    arithmetical hierarchy
    0 references
    0 references
    0 references

    Identifiers