Time hierarchy theorem
In computational complexity theory, the time hierarchy theorems are important statements about time-bounded computation on Turing machines. Informally, these theorems say that given more time, a Turing machine can solve more problems. For example, there are problems that can be solved with n2 time but not n time. . . The analogous theorems for space are the space hierarchy theorems. A similar theorem is not known for time-bounded probabilistic complexity classes, unless the class also has one bit of advice.
- Comment
- enIn computational complexity theory, the time hierarchy theorems are important statements about time-bounded computation on Turing machines. Informally, these theorems say that given more time, a Turing machine can solve more problems. For example, there are problems that can be solved with n2 time but not n time. . . The analogous theorems for space are the space hierarchy theorems. A similar theorem is not known for time-bounded probabilistic complexity classes, unless the class also has one bit of advice.
- Has abstract
- enIn computational complexity theory, the time hierarchy theorems are important statements about time-bounded computation on Turing machines. Informally, these theorems say that given more time, a Turing machine can solve more problems. For example, there are problems that can be solved with n2 time but not n time. The time hierarchy theorem for deterministic multi-tape Turing machines was first proven by Richard E. Stearns and Juris Hartmanis in 1965. It was improved a year later when F. C. Hennie and Richard E. Stearns improved the efficiency of the Universal Turing machine. Consequent to the theorem, for every deterministic time-bounded complexity class, there is a strictly larger time-bounded complexity class, and so the time-bounded hierarchy of complexity classes does not completely collapse. More precisely, the time hierarchy theorem for deterministic Turing machines states that for all time-constructible functions f(n), . The time hierarchy theorem for nondeterministic Turing machines was originally proven by Stephen Cook in 1972. It was improved to its current form via a complex proof by Joel Seiferas, Michael Fischer, and Albert Meyer in 1978. Finally in 1983, Stanislav Žák achieved the same result with the simple proof taught today. The time hierarchy theorem for nondeterministic Turing machines states that if g(n) is a time-constructible function, and f(n+1) = o(g(n)), then . The analogous theorems for space are the space hierarchy theorems. A similar theorem is not known for time-bounded probabilistic complexity classes, unless the class also has one bit of advice.
- Is primary topic of
- Time hierarchy theorem
- Label
- enTime hierarchy theorem
- Link from a Wikipage to an external page
- archive.org/details/introductiontoth00sips
- Link from a Wikipage to another Wikipage
- 2-EXP
- Advice (complexity)
- Albert R. Meyer
- Big O notation
- Cantor's diagonal argument
- Category:Articles containing proofs
- Category:Structural complexity theory
- Category:Theorems in computational complexity theory
- Cobham's thesis
- Complexity class
- Computational complexity theory
- Constructible function
- Decision problem
- Exponential hierarchy
- EXPTIME
- Function (mathematics)
- Juris Hartmanis
- Little O notation
- Michael J. Fischer
- NEXPTIME
- Nondeterministic Turing machine
- NP (complexity)
- NTIME
- P (complexity)
- P = NP problem
- Polynomial
- PSPACE
- Richard E. Stearns
- Simulation
- Space hierarchy theorem
- Stephen Cook
- Turing machine
- Universal Turing machine
- SameAs
- 4ipBL
- m.0194wb
- Q5251122
- Teorema de hierarquia de tempo
- Teorema de la jerarquía temporal
- Time hierarchy theorem
- Định lý cấp bậc thời gian
- 時間階層定理
- Subject
- Category:Articles containing proofs
- Category:Structural complexity theory
- Category:Theorems in computational complexity theory
- WasDerivedFrom
- Time hierarchy theorem?oldid=1079205179&ns=0
- WikiPageLength
- 14614
- Wikipage page ID
- 184120
- Wikipage revision ID
- 1079205179
- WikiPageUsesTemplate
- Template:Cite book
- Template:Reflist
- Template:Short description
- Template:Use dmy dates