ConceptTheory & Algos
Non-deterministic algorithm
An algorithm that can make non-deterministic choices, such as branching into multiple paths using 'go-to-both' operations.
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
2Each in their own terms, from the easiest level.
Michael Sipser
An algorithm that can make multiple choices at each step, effectively exploring multiple computational paths simultaneously.
Connections
6The lectures that define it or assume it, and the concepts next to it.