Sign inSign in

Lower-semicomputable function

A function is lower-semicomputable if the set of pairs (x, q) where q is less than f(x) is enumerable.
Watch it explained

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

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.