ConceptTheory & Algos
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.
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
3Each in their own terms, from the easiest level.
Ryan O'Donnell
A graph where vertices represent Turing machine configurations and edges represent valid transitions.Michael Sipser
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
A graph where each vertex represents a possible state of a system, and edges represent transitions between states.
Connections
11The lectures that define it or assume it, and the concepts next to it.