On characterizations of randomized computation using plain Kolmogorov complexity1 (Q4608445)

From MaRDI portal
Revision as of 14:35, 1 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6851263
Language Label Description Also known as
English
On characterizations of randomized computation using plain Kolmogorov complexity1
scientific article; zbMATH DE number 6851263

    Statements

    On characterizations of randomized computation using plain Kolmogorov complexity1 (English)
    0 references
    0 references
    0 references
    0 references
    16 March 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    Kolmogorov complexity
    0 references
    randomness
    0 references
    truth-table reductions
    0 references