A Turing machine time hierarchy (Q593780): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q55969688, #quickstatements; #temporary_batch_1707252663060
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(83)90015-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2144345645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Simulation of Multihead Tape Units / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Nondeterministic Time Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5666533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3854629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3867186 / rank
 
Normal rank

Latest revision as of 11:02, 14 June 2024

scientific article
Language Label Description Also known as
English
A Turing machine time hierarchy
scientific article

    Statements

    A Turing machine time hierarchy (English)
    0 references
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    languages over a single-letter alphabet
    0 references
    multi-tape nondeterministic Turing machines
    0 references
    universal machine
    0 references
    modified time complexity measure
    0 references
    Turing machine computations
    0 references
    complexity hierarchy
    0 references
    nondeterminism
    0 references
    unpadding
    0 references
    diagonalization
    0 references
    0 references
    0 references