Avi Wigderson : The "P vs. NP" problem: efficient computation, Internet security, and the limits to human knowledge

Posted by Dhruv Mubayi , part of the Distinguished Lecture Series.

At

Oct. 15, 2014, 4 p.m.

In

2LCC C6

Abstract

The "P vs. NP" problem, formulated by computer theorists in the 1970s, quickly became a central outstanding problem of science and mathematics. In this talk I will attempt to describe its mathematical, scientific and philosophical content. I will discuss its status, and the implications of its resolution on science and technology (making clear that the \$1M prize on solving it pales in comparison with these implications). No special background will be assumed.