Algorithms & EmergenceComputational Complexity
P vs NP
A million-dollar question about whether finding is harder than checking
A million dollars waits for whoever answers one question about puzzles. Why has nobody claimed it since 2000?
You'll find out
- What “quick” really means to a computer
- Why one answer would topple encryption
- What most experts are betting
Why it matters
Your bank's encryption, delivery routes and even math itself hang on whether finding is truly harder than checking.
Play this lesson
Free to play in your browser or on iPhone