ConceptTheory & Algos
Non-deterministic Turing machine simulation
Simulating a k-tape non-deterministic Turing machine on a fixed number of tapes in linear time using non-deterministic guessing.
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
3The lectures that define it or assume it, and the concepts next to it.