Computational Complexity and P vs. NP: Paul Stepahin

from 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.

Episode details come from the podcast's RSS feed.

Embed this episode

Attribution link and audio player

Ready to play

Computational Complexity and P vs. NP: Paul Stepahin

No transcript yet.

Requests help us decide what to transcribe next.

Share this episode

Similar podcasts

French Your Way Jessica: Native French teacher founder of French Your Way Boost your French listening skills and test your comprehension with this one of a kind series of podcasts. Get the chance to listen to a real conversation between native speakers talking at normal speed AND customise your learning experience through carefully designed sets of questions (2 levels of difficulty) available for download at www.frenchvoicespodcast.com. All interviews also come with the transcript. French teacher Jessica interviews native speakers of French from around the world who share a bit of their life and passion. Where else would you meet in one same place a French yoga teacher based in Melbourne, a soap manufacturer from Provence, or a couple cycling around the world?

Frequently asked questions

When was this Latest Audio Salon Podcasts from the Exploratorium episode published?

This episode was published on March 18, 2009.

Can I download this Latest Audio Salon Podcasts from the Exploratorium episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.