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

From MaRDI portal
Revision as of 11:10, 20 March 2024 by Maintenance script (talk | contribs) (rollbackEdits.php mass rollback)
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
    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

    Identifiers

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