Algorithmic complexity as a criterion of unsolvability (Q2383595)

From MaRDI portal
Revision as of 06:44, 29 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1684626)
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
    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