How Hard is too Hard? An Introduction to Complexity - Colva Roney-Dougal
Gresham College · 44:22
This lecture by a pure mathematician explains P versus NP: whether every problem whose solution can be checked quickly can also be solved quickly. She says most researchers believe P ≠ NP, but nobody can prove it, bec...