ConceptTheory & Algos
Prefix universal Turing machine
A universal Turing machine whose simulation property works with prefix-free inputs or code concatenation such that U(q * p) simulates M(p).
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.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.