Gap theorem
- See also Gap theorem (disambiguation) for other gap theorems in mathematics.
In computational complexity theory, the Gap Theorem, also known as the Borodin–Trakhtenbrot Gap Theorem, is a major theorem about the complexity of computable functions.[1]
It essentially states that there are arbitrarily large computable gaps in the hierarchy of complexity classes. For any computable function that represents an increase in computational resources, one can find a resource bound such that the set of functions computable within the expanded resource bound is the same as the set computable within the original bound.
The theorem was proved independently by Boris Trakhtenbrot[2] and Allan Borodin.[3][4] Although Trakhtenbrot's derivation preceded Borodin's by several years, it was not known nor recognized in the West until after Borodin's work was published.
Gap theorem
The general form of the theorem is as follows.
- Suppose Φ is an abstract (Blum) complexity measure. For any total computable function g for which [math]\displaystyle{ g(x) \geq x }[/math] for every x, there is a total computable function t such that with respect to Φ, the complexity classes with boundary functions t and [math]\displaystyle{ g \circ t }[/math] are identical.
The theorem can be proved by using the Blum axioms without any reference to a concrete computational model, so it applies to time, space, or any other reasonable complexity measure.
For the special case of time complexity, this can be stated more simply as:
- for any total computable function [math]\displaystyle{ g : \, \omega \,\to\, \omega }[/math] such that [math]\displaystyle{ g(x) \geq x }[/math] for all x, there exists a time bound [math]\displaystyle{ T(n) }[/math] such that [math]\displaystyle{ \mathsf{DTIME}(g(T(n))) = \mathsf{DTIME}(T(n)) }[/math].
Because the bound [math]\displaystyle{ T(n) }[/math] may be very large (and often will be nonconstructible) the Gap Theorem does not imply anything interesting for complexity classes such as P or NP,[5] and it does not contradict the time hierarchy theorem or space hierarchy theorem.[6]
See also
References
- ↑ Fortnow, Lance; Homer, Steve (June 2003). "A Short History of Computational Complexity". Bulletin of the European Association for Theoretical Computer Science (80): 95–133. http://theorie.informatik.uni-ulm.de/Personen/toran/beatcs/column80.pdf.
- ↑ Trakhtenbrot, Boris A. (1967). The Complexity of Algorithms and Computations (Lecture Notes). Novosibirsk University.
- ↑ Borodin, Allan (1969). "Complexity classes of recursive functions and the existence of complexity gaps". in Fischer, Patrick C.; Ginsburg, Seymour; Harrison, Michael A.. Proceedings of the 1st Annual ACM Symposium on Theory of Computing, May 5–7, 1969, Marina del Rey, CA, USA. Association for Computing Machinery. pp. 67–78.
- ↑ Borodin, Allan (January 1972). "Computational complexity and the existence of complexity gaps". Journal of the ACM 19 (1): 158–174. doi:10.1145/321679.321691.
- ↑ Allender, Eric W.; Loui, Michael C.; Regan, Kenneth W. (2014). "Chapter 7: Complexity Theory". in Gonzalez, Teofilo; Diaz-Herrera, Jorge; Tucker, Allen. Computing Handbook, Third Edition: Computer Science and Software Engineering. CRC Press. p. 7-9. ISBN 9781439898529. https://books.google.com/books?id=vMqSAwAAQBAJ&pg=SA7-PA9. "Fortunately, the gap phenomenon cannot happen for time bounds t that anyone would ever be interested in".
- ↑ Zimand, Marius (2004). Computational Complexity: A Quantitative Perspective. North-Holland Mathematics Studies. 196. Elsevier. p. 42. ISBN 9780080476667. https://books.google.com/books?id=j-nhMYoZhgYC&pg=PA42..
 |  |
