On generalized computable universal priors and their convergence (Q860822): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: cs/0503026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Program Size Formally Identical to Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5822308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and Error Bounds for Universal Prediction of Nonbinary Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory and Kernel Machines / 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: Algorithmic Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Von Mises' definition of random sequences reconsidered / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part II / 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: Minimum description length induction, Bayesianism, and Kolmogorov complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3790370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS / rank
 
Normal rank

Latest revision as of 12:16, 25 June 2024

scientific article
Language Label Description Also known as
English
On generalized computable universal priors and their convergence
scientific article

    Statements

    On generalized computable universal priors and their convergence (English)
    0 references
    0 references
    9 January 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    sequence prediction
    0 references
    algorithmic information theory
    0 references
    Solomonoff's prior
    0 references
    universal probability
    0 references
    mixture distributions
    0 references
    posterior convergence
    0 references
    computability concepts
    0 references
    Martin-Löf randomness
    0 references
    0 references
    0 references
    0 references