Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
deterministic Turing machines
nondeterministic Turing machines |
| gptkbp:citation |
https://en.wikipedia.org/wiki/Time_hierarchy_theorem
|
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
time hierarchy theorem
|
| gptkbp:implies |
P is a proper subset of EXP
|
| gptkbp:provenBy |
gptkb:Richard_E._Stearns
Jurís Hartmanis |
| gptkbp:relatedTo |
space hierarchy theorem
|
| gptkbp:sentence |
For any time-constructible function f(n), there exists a language decidable in O(f(n)) time but not in o(f(n)/log f(n)) time.
|
| gptkbp:state |
more time allows more computational power for Turing machines
|
| gptkbp:yearProved |
1965
|
| gptkbp:bfsParent |
gptkb:P_vs_EXPTIME
|
| gptkbp:bfsLayer |
6
|