ConceptTheory & Algos
R
R is the set of all problems that are solvable in finite time.
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.
Computability1Finite time algorithms1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.