Sign inSign in

Space constructible function

A function f(n)f(n) such that a Turing machine can compute the value f(n)f(n) using O(f(n))O(f(n)) space.
as Michael Sipser defines itMITThe wording closest to all 4 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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A function f(n) is space constructible if f(n) is at least log n and you can compute f(n) space.
    • 1:18:08Space Complexity
    • 31:16NL-Completeness and Logspace Reductions
  • Michael Sipser

    MIT · Undergraduate

Lectures that assume it

1

Connections

8

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.