The Class NP
This video presents the same text shown beside it, spoken and on screen. It adds nothing the text does not say.
State
The nondeterministic polynomial class, NP, holds every problem solvable in polynomial time by a nondeterministic algorithm — a machine free to explore all choices at once, succeeding if any path succeeds.
Show
A puzzle cracked by trying every move simultaneously is the class's thought experiment.
Watch for
No such machine exists; the class is definition, not hardware.