ConceptTheory & Algos
Nondeterminism
A computational model where a machine can have multiple possible next states at any given step.
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.
Algorithm1Deterministic algorithm1Deterministic finite automata1Finite automata1Model of computation1State machine1State relations1Turing machine1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
3Each in their own terms, from the easiest level.
Michael Sipser
A computational model where the machine can make multiple choices at once, effectively exploring all paths.Ryan O'Donnell
A feature added to a model of computation where an algorithm can branch into multiple execution paths simultaneously.Leslie Lamport
A model where a current state allows multiple possible next states through multiple variable assignments.
Lectures that assume it
1Connections
15The lectures that define it or assume it, and the concepts next to it.
Concepts9
- Algorithm
- Deterministic algorithm
- Finite automata
- Model of computation
- Configuration graph
- Nondeterministic decider