Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs (Q494650)

From MaRDI portal
Revision as of 11:57, 22 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
scientific article

    Statements

    Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs (English)
    0 references
    0 references
    1 September 2015
    0 references

    Identifiers