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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

complexity measure [Blum [3]] A pair 〈φ,Φ〉 is an abstract complexity measure if φ is a principal effective enumeration of partial…

2004

We show that any encryption/decryption system can be converted to an algorithm which uses roughly three machine operations per…

1991

Path dissolution is an efficient generalization of the method of analytic tableaux. Both methods feature (in the propositional…

1990

HARTMANIS [4] has observed that the so-called Godel speed-up theorem (see [2, pp. 394-3981, [15]) and many results about the…

1987

In the mid-sixties BLUM [2] announced his speed-up theorem, which affirmed the existence of recursive sets having, in some sense…

1977

1974

1973

Perhaps the two most basic phenomena discovered by the recent application of recursion theoretic methods to the developing…

1973

The relationship between computational complexity and hierarchies of computable Functions is explored. I t is shown that known…

1972

machine-independent) complexity theory is basically a theory which establishes limits on what may be said about the complexity of…