Sequential predictions based on algorithmic complexity (Q2581758): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2005.07.001 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q58012439 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058908939 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: cs/0508043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum complexity density estimation / 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: Q5556137 / 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: On the relation between descriptional complexity and algorithmic probability / 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: New error bounds for Solomonoff prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and loss bounds for bayesian sequence prediction / 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: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3487241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness conservation inequalities; information and independence in mathematical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal-program complexity measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of the Kolmogorov concept of complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Learning Theory / 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: Q3046708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process complexity and effective random tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131415 / 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: Minimum description length induction, Bayesianism, and Kolmogorov complexity / 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
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jcss/Hutter06 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2005.07.001 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:46, 19 December 2024

scientific article
Language Label Description Also known as
English
Sequential predictions based on algorithmic complexity
scientific article

    Statements

    Sequential predictions based on algorithmic complexity (English)
    0 references
    0 references
    10 January 2006
    0 references
    Sequence prediction
    0 references
    Algorithmic information theory
    0 references
    Solomonoff's prior
    0 references
    Monotone Kolmogorov complexity
    0 references
    Minimal description length
    0 references
    Convergence
    0 references
    Self-optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers