ConceptTheory & Algos
Manual Blum's Speedup theorem
Theorem showing that there exist computable functions (and languages) that do not possess a fastest algorithm.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Algorithm complexity1Computable function1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.