Algorithmic randomness and monotone complexity on product space (Q627131)

From MaRDI portal
Revision as of 01:49, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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