P vs NP episode artwork

EPISODE · Nov 17, 2017 · 38 MIN

P vs NP

from Data Skeptic · host Kyle Polich with Lance Fortnow

In this week's episode, host Kyle Polich interviews author Lance Fortnow about whether P will ever be equal to NP and solve all of life's problems. Fortnow begins the discussion with the example question: Are there 100 people on Facebook who are all friends with each other? Even if you were an employee of Facebook and had access to all its data, answering this question naively would require checking more possibilities than any computer, now or in the future, could possibly do. The P/NP question asks whether there exists a more clever and faster algorithm that can answer this problem and others like it.

Episode metadata supplied by the publisher feed · Published Nov 17, 2017

Embed this episode

Ready to play

P vs NP

0:00 38:48

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of Data Skeptic?

This episode is 38 minutes long.

When was this Data Skeptic episode published?

This episode was published on November 17, 2017.

Can I download this Data Skeptic episode?

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