A note on structure and looking back applied to the relative complexity of computable functions (Q1158964)

From MaRDI portal
Revision as of 02:51, 14 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
A note on structure and looking back applied to the relative complexity of computable functions
scientific article

    Statements

    A note on structure and looking back applied to the relative complexity of computable functions (English)
    0 references
    0 references
    0 references
    1981
    0 references
    subrecursive reducibilities
    0 references
    subrecursive degrees
    0 references
    complexity classes
    0 references
    enumeration properties of classes of computable functions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references