Higher Types, Finite Domains and Resource-bounded Turing Machines (Q2882561)

From MaRDI portal
Revision as of 08:31, 22 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
Higher Types, Finite Domains and Resource-bounded Turing Machines
scientific article

    Statements

    Higher Types, Finite Domains and Resource-bounded Turing Machines (English)
    0 references
    0 references
    7 May 2012
    0 references
    higher type
    0 references
    recursion
    0 references
    domain theory Gödel's T
    0 references
    PCF
    0 references

    Identifiers

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