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.
NOW PLAYING
P vs NP
No transcript for this episode yet
Similar Episodes
May 11, 2026 ·66m
May 11, 2026 ·67m
May 5, 2026 ·4m
May 4, 2026 ·4m