ConceptTheory & Algos
Bounded halting problem
A family of languages defined as pairs of a Turing machine and an input word that accept within a time bound proportional to the cube of the input length.
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.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.