On computational speed-up

  • Authors:

  • Albert Meyer;Patrick C. Fischer

  • Affiliations:

  • -;-

  • Venue:
  • SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
  • Year:
  • 1968

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let F be any effective mapping from total functions on the integers to total functions. Composition and iterated composition are examples of such mappings. The "operator speed-up" theorem in this paper establishes the existence of a computable function f such that for any program computing f(x) in p1(x) steps for all x, there is another program computing f(x) in p2(x) steps and F(p2)