Lex Fridman PodcastRichard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111
Summaries, chapters, transcripts, and FAQs on this page are made by uListen, not YouTube.
Episode Details
EPISODE INFO
- Released
- July 26, 2020
- Duration
- 2h 7m
- Channel
- Lex Fridman Podcast
- Watch on YouTube
- ▶ Open ↗
EPISODE DESCRIPTION
Richard Karp is a professor at Berkeley and one of the key figures in the history of theoretical computer science. In 1985, he received the Turing Award for his research in the theory of algorithms, including the development of the Edmonds–Karp algorithm for solving the maximum flow problem on networks, Hopcroft–Karp algorithm for finding maximum cardinality matchings in bipartite graphs, and his landmark paper in complexity theory called "Reducibility Among Combinatorial Problems", in which he proved 21 problems to be NP-complete. This paper was probably the most important catalyst in the explosion of interest in the study of NP-completeness and the P vs NP problem. Support this podcast by signing up with these sponsors:
- Eight Sleep: https://eightsleep.com/lex
- Cash App - use code "LexPodcast" and download:
- Cash App (App Store): https://apple.co/2sPrUHe
- Cash App (Google Play): https://bit.ly/2MlvP5w
EPISODE LINKS: Richard's wikipedia: https://en.wikipedia.org/wiki/Richard_M._Karp PODCAST INFO: Podcast website: https://lexfridman.com/podcast Apple Podcasts: https://apple.co/2lwqZIr Spotify: https://spoti.fi/2nEwCF8 RSS: https://lexfridman.com/feed/podcast/ Full episodes playlist: https://www.youtube.com/playlist?list=PLrAXtmErZgOdP_8GztsuKi9nrraNbKKp4 Clips playlist: https://www.youtube.com/playlist?list=PLrAXtmErZgOeciFP3CBCIEElOJeitOr41 OUTLINE: 0:00 - Introduction 3:50 - Geometry 9:46 - Visualizing an algorithm 13:00 - A beautiful algorithm 18:06 - Don Knuth and geeks 22:06 - Early days of computers 25:53 - Turing Test 30:05 - Consciousness 33:22 - Combinatorial algorithms 37:42 - Edmonds-Karp algorithm 40:22 - Algorithmic complexity 50:25 - P=NP 54:25 - NP-Complete problems 1:10:29 - Proving P=NP 1:12:57 - Stable marriage problem 1:20:32 - Randomized algorithms 1:33:23 - Can a hard problem be easy in practice? 1:43:57 - Open problems in theoretical computer science 1:46:21 - A strange idea in complexity theory 1:50:49 - Machine learning 1:56:26 - Bioinformatics 2:00:37 - Memory of Richard's father CONNECT:
- Subscribe to this YouTube channel
- Twitter: https://twitter.com/lexfridman
- LinkedIn: https://www.linkedin.com/in/lexfridman
- Facebook: https://www.facebook.com/LexFridmanPage
- Instagram: https://www.instagram.com/lexfridman
- Medium: https://medium.com/@lexfridman
- Support on Patreon: https://www.patreon.com/lexfridman
SPEAKERS
Lex Fridman
hostRichard Karp
guestNarrator
other
EPISODE SUMMARY
In this episode of Lex Fridman Podcast, featuring Lex Fridman and Richard Karp, Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111 explores Richard Karp Explores Algorithms, NP-Completeness, and Human Intelligence Limits Richard Karp discusses his early love of geometry and formal proofs, then builds up the core ideas of algorithms, polynomial-time complexity, and the P vs NP problem. He explains NP-completeness, reductions between classic combinatorial problems, and why most experts believe P ≠ NP despite lacking a proof. Karp highlights elegant algorithms such as the Hungarian method, stable matching, and Rabin–Karp string search, and reflects on randomized algorithms, average-case behavior, and the gap between theory and practice. He also shares skeptical views on superhuman AI, thoughts on machine learning’s limits, applications of algorithms in biology, and personal reflections on teaching and his intellectual development.
RELATED EPISODES
