Computational Complexity and P vs. NP: Paul Stepahin
Mar 18, 2009
Listen to this episode in Metacast mobile app
Don't just listen to podcasts. Learn from them with transcripts, summaries, and chapters for every episode. Skim, search, and bookmark insights. Learn more
Episode description
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.
For the best experience, listen in Metacast app for iOS or Android