Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,000,553 papers from all fields of science
Search
Sign In
Create Free Account
Blum's speedup theorem
Known as:
Blum’s Speed-up Theorem
, Speedup theorem
, Blum
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Algorithm
Asymptotically optimal algorithm
Blum axioms
Computable function
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Topological Speedups
Drew D. Ash
2016
Corpus ID: 119322135
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…
Expand
2007
2007
Unbounded Proof-Length Speed-Up in Deduction Modulo
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…
Expand
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
Highly Cited
2000
Highly Cited
2000
The Fastest and Shortest Algorithm for all Well-Defined Problems
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…
Expand
1991
1991
Improving tableau deductions in multiple-valued logics
Neil V. Murray
,
Erik Rosenthal
[] Proceedings of the Twenty-First International…
1991
Corpus ID: 27077227
Path dissolution is an efficient generalization of the method of analytic tableaux. Both methods feature (in the propositional…
Expand
Highly Cited
1985
Highly Cited
1985
Some results concerning linear iterative (systolic) arrays
O. Ibarra
,
M. Palis
,
Sam M. Kim
J. Parallel Distributed Comput.
1985
Corpus ID: 24954710
1974
1974
Minimum Times and Memories Needed to Compute the Values of a Function
P. Elias
Journal of computer and system sciences (Print)
1974
Corpus ID: 12226284
1973
1973
Easy constructions in complexity theory: Gap and speed-up theorems
Paul Young
1973
Corpus ID: 27045186
Perhaps the two most basic phenomena discovered by the recent application of recursion theoretic methods to the developing…
Expand
1970
1970
On the Efficiency of Programs in Subrecursive Formalisms (Incomplete Version, Extended Abstract)
R. Constable
,
A. Borodin
Scandinavian Workshop on Algorithm Theory
1970
Corpus ID: 34467655
We study the effect of program structure on computational efficiency in a class of abstract languages which model actual high…
Expand
Highly Cited
1967
Highly Cited
1967
On the Size of Machines
M. Blum
Information and Control
1967
Corpus ID: 17034011
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE