Sign inSign in

Log space

Computation model where a two-tape Turing machine uses logarithmic space with a read-only input tape and a read/write work tape.
as Michael Sipser defines itMITThe wording closest to all 3 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.

  • Michael Sipser

    MIT · Undergraduate

    • 57:51Games, Generalized Geography
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A complexity class where the algorithm uses only logarithmic space relative to the input size.
    • 1:10:05The Immerman-Szelepcsényi Theorem

Lectures that assume it

1

Connections

11

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.