Radio and PodcastRadio and PodcastLive Radio & Podcasts
Computational Complexity and P vs. NP: Paul Stepahin artwork
Arts

Computational Complexity and P vs. NP: Paul Stepahin

Latest Audio Salon Podcasts from the Exploratorium

Mar 18, 2009Arts

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

About This Episode

Computational Complexity and P vs. NP: Paul Stepahin is an episode 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...

Podcast

This episode belongs to Latest Audio Salon Podcasts from the Exploratorium.

Listen Online

Use the player on this page to stream the episode online.

Episode Details

Published Mar 18, 2009, audio available.

Related Episodes

Continue listening to more episodes from Latest Audio Salon Podcasts from the Exploratorium.

NPR: Neighborhood Public Radio

Jul 3, 2009

NPR, or Neighborhood Public Radio is an artists collective and community radio project founded in 2004 by...

The Sound of Ice: Terje Isungset

Mar 11, 2009

Terje Isungset is one of Europe's most accomplished and innovative percussionists. With over two decades...

A Walk With Walter Kitundu

Feb 6, 2009

Walter Kitundu, 2008 MacArthur Fellow and longtime Exploratorium friend, is an accomplished instrument bu...

Questions About This Episode

What is Computational Complexity and P vs. NP: Paul Stepahin about?

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.

Where can I listen to Computational Complexity and P vs. NP: Paul Stepahin?

You can listen to Computational Complexity and P vs. NP: Paul Stepahin online on Radio and Podcast. Open the player on this page to stream the available audio.

Which podcast is Computational Complexity and P vs. NP: Paul Stepahin from?

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

How long is this episode?

The episode duration depends on the source podcast feed and may not always be available.

When was this episode published?

This episode was published on Mar 18, 2009.

Can I save Computational Complexity and P vs. NP: Paul Stepahin for later?

Yes. Use the heart button on the episode page to add it to your favorite episodes list.

Are there related episodes from Latest Audio Salon Podcasts from the Exploratorium?

Yes. This page shows related episodes from Latest Audio Salon Podcasts from the Exploratorium when more episodes are available from the podcast feed.

Quick Answers About This Episode

Where can I listen to Computational Complexity and P vs. NP: Paul Stepahin?

You can listen to Computational Complexity and P vs. NP: Paul Stepahin on this page when the episode audio is available from the podcast feed.

Which podcast is this episode from?

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

What are the episode details?

Published Mar 18, 2009