ConceptTheory & Algos
Lower-semicomputable function
A function is lower-semicomputable if the set of pairs (x, q) where q is less than f(x) is enumerable.
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.
Computable function1Enumerability1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.