Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Blum's speedup theorem

Known as: Blum’s Speed-up Theorem, Speedup theorem, Blum 
In computational complexity theory Blum's speedup theorem, first stated by Manuel Blum in 1967, is a fundamental theorem about the complexity of… Expand
Wikipedia

Related topics

Related topics

8 relations
AlgorithmAsymptotically optimal algorithmBlum axiomsComputable function
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A Time Hierarchy Theorem for the LOCAL Model
The celebrated Time Hierarchy Theorem for Turing machines states, informally, that more problems can be solved given more time… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Speed-Up Theorems in Type-2 Computations Using Oracle Turing Machines
A classic result known as the speed-up theorem in machine-independent complexity theory shows that there exist some computable… Expand
  • figure 1
Is this relevant?
2007
2007
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by Godel 37 years before: there exist arithmetical formulae that are… Expand
  • figure 1
Is this relevant?
2006
2006
Cellular Automata: Real-Time Equivalence between One-Dimensional Neighborhoods
  • V. Poupet
  • Theory of Computing Systems
  • 2006
    • Corpus ID: 179943
It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The Fastest and Shortest Algorithm for all Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p… Expand
  • figure 1
Is this relevant?
1991
1991
Improving tableau deductions in multiple-valued logics
Path dissolution is an efficient generalization of the method of analytic tableaux. Both methods feature (in the propositional… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 7
  • figure 5
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Some results concerning linear iterative (systolic) arrays
Abstract Characterizations of various types of linear iterative (systolic) arrays in terms of single processor sequential… Expand
Is this relevant?
1974
1974
Minimum Times and Memories Needed to Compute the Values of a Function
  • P. Elias
  • J. Comput. Syst. Sci.
  • 1974
    • Corpus ID: 12226284
A deterministic sequential device receives one input symbol at a time, prints output symbols from left to right on an output tape… Expand
Is this relevant?
1973
1973
Easy constructions in complexity theory: Gap and speed-up theorems
Perhaps the two most basic phenomena discovered by the recent application of recursion theoretic methods to the developing… Expand
Is this relevant?
1970
1970
On the Efficiency of Programs in Subrecursive Formalisms (Incomplete Version, Extended Abstract)
We study the effect of program structure on computational efficiency in a class of abstract languages which model actual high… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE