Sign inSign in

Hierarchy theorems

Theorems stating that allowing more computational resources (time or space) enables solving a strictly larger set of problems.
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.

Lecturers

1
  • Michael Sipser

    MIT · Undergraduate

    • 1:38Hierarchy Theorems

Connections

4

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

Concepts2

Lectures2

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.