Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms (Q1899150)

From MaRDI portal
Revision as of 01:28, 29 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
Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms
scientific article

    Statements

    Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms (English)
    0 references
    0 references
    14 February 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    partial primitive recursive functionals
    0 references
    prenormal terms
    0 references
    structural complexity
    0 references