Computational Complexity and P vs. NP: Paul Stepahin Latest Audio Salon Podcasts from the Exploratorium

Paul Stepahin is an Exploratorium exhibit developer who has a background in physics. He's worked on exhibits such as Elephant Turntable and Additor. Paul's knowledge and love of computer science and complex math has made him a resource for Exploratorium staff. In this program, Paul discusses the theoretical math P versus NP problem.