Relations between diagonalization, proof systems, and complexity gaps (Q1254105): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036722394 / rank
 
Normal rank

Revision as of 15:24, 19 March 2024

scientific article
Language Label Description Also known as
English
Relations between diagonalization, proof systems, and complexity gaps
scientific article

    Statements

    Relations between diagonalization, proof systems, and complexity gaps (English)
    0 references
    1979
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    One-Tape Turing Machines
    0 references
    Diagonal Processes over Time Bounded Computations
    0 references
    Proof Systems
    0 references
    Existence of Sharp Time Bounds
    0 references
    Complexity Classes
    0 references
    Gap Theorem
    0 references
    Tape Bound Computations
    0 references
    0 references
    0 references