3min chapter

Lex Fridman Podcast cover image

#111 – Richard Karp: Algorithms and Computational Complexity

Lex Fridman Podcast

CHAPTER

The Satisfiability Problem in NP Is a Nice Statement of a Really Hard Problem

Cook showed that every problem in NP can be re-expressed as an instance of the satisfiability problem. To do that, he used the observation that a very simple abstract machine called the Turing machine can be used to describe any algorithm. An algorithm for any realistic computer can be translated into an equivalent algorithm on one of these extremely simple machines.

00:00

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode