<s>
In	O
computational	O
complexity	O
theory	O
,	O
a	O
speedup	B-General_Concept
theorem	I-General_Concept
is	O
a	O
theorem	O
that	O
considers	O
some	O
algorithm	O
solving	O
a	O
problem	O
and	O
demonstrates	O
the	O
existence	O
of	O
a	O
more	O
efficient	B-General_Concept
algorithm	I-General_Concept
solving	O
the	O
same	O
problem	O
.	O
</s>
<s>
Linear	O
speedup	B-General_Concept
theorem	I-General_Concept
,	O
that	O
the	O
space	O
and	O
time	O
requirements	O
of	O
a	O
Turing	B-Architecture
machine	I-Architecture
solving	O
a	O
decision	O
problem	O
can	O
be	O
reduced	O
by	O
a	O
multiplicative	O
constant	O
factor	O
.	O
</s>
<s>
Blum	O
's	O
speedup	B-General_Concept
theorem	I-General_Concept
,	O
which	O
provides	O
speedup	O
by	O
any	O
computable	O
function	O
(	O
not	O
just	O
linear	O
,	O
as	O
in	O
the	O
previous	O
theorem	O
)	O
.	O
</s>
