Higher Types, Finite Domains and Resource-bounded Turing Machines (Q2882561): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 20:30, 3 February 2024

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
    0 references
    7 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    higher type
    0 references
    recursion
    0 references
    domain theory Gödel's T
    0 references
    PCF
    0 references