Skip to main content

speedup theorem

speedup theorem A theorem in complexity theory that, like the gap theorem, can be expressed in terms of abstract complexity measures (see Blum's axioms) but will be more understandable in the context of time.

Given any total recursive function r(n), there exists a recursive language L such that for any Turing machine M recognizing L, say within time bound S(n), there exists another Turing machine M′ that also recognizes L but within a time bound S′(n) that satisfies r(S′(n)) ← S(n)

for all but a finite number of values of n. Thus for this language there can be no fastest program.

Cite this article
Pick a style below, and copy the text for your bibliography.

  • MLA
  • Chicago
  • APA

"speedup theorem." A Dictionary of Computing. . Encyclopedia.com. 15 Aug. 2018 <http://www.encyclopedia.com>.

"speedup theorem." A Dictionary of Computing. . Encyclopedia.com. (August 15, 2018). http://www.encyclopedia.com/computing/dictionaries-thesauruses-pictures-and-press-releases/speedup-theorem

"speedup theorem." A Dictionary of Computing. . Retrieved August 15, 2018 from Encyclopedia.com: http://www.encyclopedia.com/computing/dictionaries-thesauruses-pictures-and-press-releases/speedup-theorem

Learn more about citation styles

Citation styles

Encyclopedia.com gives you the ability to cite reference entries and articles according to common styles from the Modern Language Association (MLA), The Chicago Manual of Style, and the American Psychological Association (APA).

Within the “Cite this article” tool, pick a style to see how all available information looks when formatted according to that style. Then, copy and paste the text into your bibliography or works cited list.

Because each style has its own formatting nuances that evolve over time and not all information is available for every reference entry or article, Encyclopedia.com cannot guarantee each citation it generates. Therefore, it’s best to use Encyclopedia.com citations as a starting point before checking the style against your school or publication’s requirements and the most-recent information available at these sites:

Modern Language Association

http://www.mla.org/style

The Chicago Manual of Style

http://www.chicagomanualofstyle.org/tools_citationguide.html

American Psychological Association

http://apastyle.apa.org/

Notes:
  • Most online reference entries and articles do not have page numbers. Therefore, that information is unavailable for most Encyclopedia.com content. However, the date of retrieval is often important. Refer to each style’s convention regarding the best way to format page numbers and retrieval dates.
  • In addition to the MLA, Chicago, and APA styles, your school, university, publication, or institution may have its own requirements for citations. Therefore, be sure to refer to those guidelines when editing your bibliography or works cited list.