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.

About 4 min7 interactive slides · 5 questionsLesson 657 · Zone 73

Play this lesson

Free to play in your browser or on iPhone

More in this zone

  1. 649NumbersLogarithmsWhy earthquakes and sound use strange scales
  2. 650Biomedical EngineeringThe Mind-Controlled HandMuscle signals can move an artificial hand
  3. 651TopologyThe Klein BottleA bottle with no inside that can't exist in our world
  4. 652Probability FoundationsBertrand's ParadoxOne question about a random line has three correct answers
  5. 653Software HistoryLinux Was ‘Just a Hobby’A student's side project now runs most of the world's servers
  6. 654Content ProvenanceWatermarking AIGenerated media can carry hidden clues about where it came from
  7. 655Space ExplorationThe Pale Blue DotEarth seen from 6 billion kilometers is a speck in a sunbeam
  8. 656Computational ComplexityEasy to Check, Hard to SolveChecking a sudoku takes seconds; solving one can take ages