Algorithmic complexity as a criterion of unsolvability (Q2383595)

From MaRDI portal
Revision as of 22:11, 3 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
Algorithmic complexity as a criterion of unsolvability
scientific article

    Statements

    Algorithmic complexity as a criterion of unsolvability (English)
    0 references
    0 references
    19 September 2007
    0 references
    0 references
    Kolmogorov complexity
    0 references
    recursive algorithmic complexity
    0 references
    inductive Turing machine
    0 references
    algorithmic problem
    0 references
    inductive algorithmic complexity
    0 references
    decidability
    0 references
    super-recursive algorithm
    0 references