Algorithmic randomness and monotone complexity on product space (Q627131)

From MaRDI portal
Revision as of 19:43, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithmic randomness and monotone complexity on product space
scientific article

    Statements

    Algorithmic randomness and monotone complexity on product space (English)
    0 references
    0 references
    21 February 2011
    0 references
    The author studies algorithmic randomness and monotone complexity on a product of Cantor spaces. A number of results are proved. The major one is Lambalgen's theorem for correlated probability.
    0 references
    0 references
    0 references
    algorithmic randomness
    0 references
    Lambalgen's theorem
    0 references
    monotone complexity
    0 references
    0 references
    0 references