ConceptTheory & Algos
Computing functions with a non-deterministic machine
A non-deterministic machine computes a function if all its branches either output the correct function value or reject, and at least one branch outputs the correct value.
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
2The lectures that define it or assume it, and the concepts next to it.