Algorithmic complexity of recursive and inductive algorithms (Q1434367)

From MaRDI portal
Revision as of 10:18, 21 July 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 of recursive and inductive algorithms
scientific article

    Statements

    Algorithmic complexity of recursive and inductive algorithms (English)
    0 references
    0 references
    4 August 2004
    0 references
    Efficiency
    0 references
    Complexity
    0 references
    Dual complexity measure
    0 references
    Kolmogorov complexity
    0 references
    Recursive algorithm
    0 references
    Turing machine
    0 references
    Super-recursive algorithm
    0 references
    Inductive Turing machine
    0 references

    Identifiers