Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Given a dynamical system (X, T ) one can define a speedup of (X, T ) as another dynamical system conjugate to S : X → X where S(x… 
2007
2007
  • G. Burel
  • Annual Conference for Computer Science Logic
  • 2007
  • Corpus ID: 16090237
In 1973, Parikh proved a speed-up theorem conjectured by Godel 37 years before: there exist arithmetical formulae that are… 
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… 
Highly Cited
2000
Highly Cited
2000
  • Marcus Hutter
  • International Journal of Foundations of Computer…
  • 2000
  • Corpus ID: 5496821
An algorithm M is described that solves any well-defined problem p as quickly a the fastest algorithm computing a solution to p… 
1991
1991
Path dissolution is an efficient generalization of the method of analytic tableaux. Both methods feature (in the propositional… 
Highly Cited
1985
Highly Cited
1985
1974
1974
  • P. Elias
  • Journal of computer and system sciences (Print)
  • 1974
  • Corpus ID: 12226284
1973
1973
Perhaps the two most basic phenomena discovered by the recent application of recursion theoretic methods to the developing… 
1970
1970
We study the effect of program structure on computational efficiency in a class of abstract languages which model actual high… 
Highly Cited
1967
Highly Cited
1967
  • M. Blum
  • Information and Control
  • 1967
  • Corpus ID: 17034011