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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
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
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
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
  • 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
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
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
Abstract Characterizations of various types of linear iterative (systolic) arrays in terms of single processor sequential… Expand
Is this relevant?
1974
1974
  • 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
Perhaps the two most basic phenomena discovered by the recent application of recursion theoretic methods to the developing… Expand
Is this relevant?
1970
1970
We study the effect of program structure on computational efficiency in a class of abstract languages which model actual high… Expand
Is this relevant?