“Beyond Computation: The P vs. NP Question” is the topic of a Fri., May 9 presentation by Dr. Michael Sipser, the Barton L. Weller Professor of Mathematics and member of the Computer Science and Artificial Intelligence Laboratory at the Massachusetts Institute of Technology (MIT). The lecture begins at 5:30 p.m. in Berkeley City College’s auditorium, 2050 Center St., downtown Berkeley, a half block from the Berkeley BART Station.
The lecture examines whether every problem for which a solution can be easily verified by a computer can also be easily solved by a computer. An answer to this question would reveal the potential for computers to solve puzzles, crack codes, prove theorems, and optimize many practical tasks. Presented by the Simons Institute for the Theory of Computing, the Mathematical Sciences Research Institute (MSRI) and Berkeley City College, the event is made possible in part by a gift from the Simons Foundation.
The presentation will be followed by a panel discussion. Panel participants include Richard Karp, moderator (UC Berkeley), Ron Fagin (IBM Almaden), Russell Impagliazzo (UC San Diego), Sandy Irani (UC Irvine), Christos Papadimitriou (UC Berkeley), Omer Reingold (Microsoft Research), and Ryan Williams (Stanford University). Read more about this presentation on the Simons Institute site.
Admission is free but seating is limited. You must register for a seat at http://simons.berkeley.edu/events/michael-sipser-register.
Filed under: General