A coding theorem for enumerable output machines (Q2390302)

From MaRDI portal
Revision as of 00:10, 4 August 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
A coding theorem for enumerable output machines
scientific article

    Statements

    A coding theorem for enumerable output machines (English)
    0 references
    0 references
    21 July 2009
    0 references
    0 references
    coding theorem
    0 references
    Kolmogorov complexity
    0 references
    algorithmic information theory
    0 references
    enumerable output machine
    0 references
    theory of computation
    0 references