Sequential predictions based on algorithmic complexity (Q2581758)

From MaRDI portal
Revision as of 03:11, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/jcss/Hutter06, #quickstatements; #temporary_batch_1731462974821)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Sequential predictions based on algorithmic complexity
scientific article

    Statements

    title
    Sequential predictions based on algorithmic complexity (English)
    0 references
    author
    Marcus Hutter
    0 references
    publication date
    10 January 2006
    0 references
    zbMATH Keywords
    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
    cites work
    Q5556137
    0 references
    Q5822308
    0 references
    Q4074808
    0 references
    Q3214803
    0 references
    Q3487241
    0 references
    Q4070738
    0 references
    Q4337021
    0 references
    Learning Theory
    0 references
    Q3046708
    0 references
    Q4131415
    0 references

    Identifiers

    zbMATH DE Number
    2245143
    0 references
    Wikidata QID
    Q58012439
    0 references
    OpenAlex ID
    W2058908939
    0 references
    arXiv ID
    cs/0508043
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2581758&oldid=37893615"
    Powered by MediaWiki