ConceptTheory & Algos
Computable function
A function is computable if there is a Turing machine that halts with the function's output on its tape for any given input string.
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.
Turing machine3Computability theory1Lower semi-computable function1Lower-semicomputable function1Turing machine halting1Upper semi-computable function1Upper-semicomputable function1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Michael Sipser
Bruno Bauwens
A function that has a solution in terms of a program that halts or converges to the right answer, without regard to speed.
Lectures that assume it
2Connections
14The lectures that define it or assume it, and the concepts next to it.