- Gap theorem
:"See also
Gap theorem (disambiguation) for other gap theorems inmathematics ."In
computational complexity theory the Gap theorem is a major theorem about the complexity ofcomputable function s. [Lance Fortnow, Steve Homer, [http://theorie.informatik.uni-ulm.de/Personen/toran/beatcs/column80.pdf "A Short History of Computational Complexity] ", Bulletin of the European Association for Theoretical Computer Science, The Computational Complexity Column, Number 80, June, 2003] It essentially states that there are arbitrarily large computable gaps in the hierarchy ofcomplexity class es. For anycomputable function that represents an increase incomputational resource s, 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 in 1964 [cite journal|author=Boris Trakhtenbrot|title=Turing computations with logarithmic delay|journal=Algebra and Logic|language=Russian|volume=3|issue=4|pages= 33–48|year=1964] andAllan Borodin in 1972. [cite journal|author=Allan Borodin|title=Computational complexity and the existence of complexity gaps|journal=Journal of the ACM |volume=19|issue=1|pages=158–174|year=1972|month=January |doi=10.1145/321679.321691] .Gap theorem
Given two
total computable function s and with:then there exists a total computable function with:and thecomplexity class es with boundary function and are identical.For the special case of time complexity, this can be stated in more modern notation as::for any total computable function such that , there exists a space bound such that .
See also
*
Blum's speedup theorem References
Wikimedia Foundation. 2010.