ConceptTheory & Algos
Universal Turing machine
A Turing machine that takes a description of a machine and input and simulates its execution.
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 Turing machine that takes as input an encoding of any Turing machine and a string , and simulates the execution of on .Blaise Agüera y Arcas
A Turing machine that can emulate any other Turing machine by writing the rules for the computation on the tape itself.
Lectures that assume it
3Connections
17The lectures that define it or assume it, and the concepts next to it.