On the Computability of Solomonoff Induction and Knowledge-Seeking (Q2835643): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
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: 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: Asymptotically Optimal Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Prediction of Selected Bits / 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: On the computability of Solomonoff induction and AIXI / 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: Computability and Randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality Issues of Universal Greedy Agents with Static Priors / 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: 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: (Non-)Equivalence of Universal Priors / rank
 
Normal rank

Latest revision as of 00:07, 13 July 2024

scientific article
Language Label Description Also known as
English
On the Computability of Solomonoff Induction and Knowledge-Seeking
scientific article

    Statements

    On the Computability of Solomonoff Induction and Knowledge-Seeking (English)
    0 references
    0 references
    0 references
    30 November 2016
    0 references
    Solomonoff induction
    0 references
    exploration
    0 references
    knowledge-seeking agents
    0 references
    general reinforcement learning
    0 references
    asymptotic optimality
    0 references
    computability
    0 references
    complexity
    0 references
    arithmetical hierarchy
    0 references
    universal Turing machine
    0 references
    AIXI
    0 references
    BayesExp
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references