Blum's speedup theorem
Quizzes for review
(computing theory) 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.
Blum's speedup theorem
Blum's speedup theorem shows that for every reasonable complexity measure there are computable functions that lack a single optimal program, because one can always find programs with progressively better resource bounds.
Blum's speedup theorem shows that for every reasonable complexity measure there are computable functions that lack a single optimal program, because one can always find programs with progressively better resource bounds.
English - English
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1