Blum's speedup theorem
nameEtymology
First stated by Manuel Blum in 1967.
Definitions
A fundamental theorem about the complexity of computable functions, stating that for any…
A fundamental theorem about the complexity of computable functions, stating that for any complexity measure there are computable functions that are not optimal with respect to that measure.
The neighborhood
Vish — recursive loop
No curated loop yet for Blum's speedup theorem. Loops are being traced one word at a time while the ingestion pipeline matures.
sense glosses and etymology drawn from English Wiktionary · source · CC-BY-SA