Sign inSign in

Computability theory

Sort of like a precursor to complexity theory that asks what computational tasks can be solved at all.
as Ryan O'Donnell defines itCarnegie Mellon University
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Michael Sipser

    MIT · Undergraduate

    The study of what can be computed with an algorithm in principle.
    • 1:01Introduction, Finite Automata, Regular Expressions

Lectures that assume it

10

Connections

20

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

2 lecturers. 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.