Relations between diagonalization, proof systems, and complexity gaps (Q1254105)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Relations between diagonalization, proof systems, and complexity gaps |
scientific article; zbMATH DE number 3619311
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relations between diagonalization, proof systems, and complexity gaps |
scientific article; zbMATH DE number 3619311 |
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
