Sign inSign in

Space hierarchy theorem

A theorem stating that giving a Turing machine more space allows it to solve strictly more problems.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 5 definitions
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

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A theorem stating that more space allows you to compute strictly more problems.
    • 51:06Space Complexity
    • 37:16Hierarchy Theorems (Time, Space, and Nondeterministic)
    • 3:13Hopcroft–Paul–Valiant Theorem
  • Michael Sipser

    MIT · Undergraduate

    A theorem stating that if a Turing machine is given more space, it can solve more problems.

Connections

8

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

Concepts3

Lectures5

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.