Sign inSign in

Configuration graph

A directed graph whose vertices are all possible configurations of a Turing machine on an input and whose edges represent valid state transitions.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 6 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

3

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A graph where vertices represent Turing machine configurations and edges represent valid transitions.
    • 1:10:30Savitch's Theorem and NL
    • 1:12:29From P-Completeness to PSPACE-Completeness
  • Michael Sipser

    MIT · Undergraduate

    A graph whose nodes are all configurations of a Turing machine on an input, with edges representing valid single-step transitions between configurations.
  • Erik Demaine

    MIT · Undergraduate

    A graph where each vertex represents a possible state of a system, and edges represent transitions between states.
    • 10:44Breadth-First Search (BFS)

Connections

11

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

3 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.