The "P vs. NP" Problem: Efficient Computation, Internet Security, and the Limits of Human Knowledge

The "P vs. NP" problem is a central outstanding problem of computer science and mathematics. In this talk, Professor Wigderson attempts to describe its technical, scientific, and philosophical content, its status, and the implications of its two possible resolutions.