ConceptTheory & Algos
Lower semi-computable
A function is lower semi-computable if there exists a computable sequence of computable functions that monotonically converge to it from below.
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
3The lectures that define it or assume it, and the concepts next to it.