3min chapter

Lex Fridman Podcast cover image

#130 – Scott Aaronson: Computational Complexity and Consciousness

Lex Fridman Podcast

CHAPTER

Is It Possible That P Equals NP Exists?

If P equals NP, it would mean that there is such an algorithm. That it exists. Now, you know, in practice, normally the way that we would prove anything like that would be by finding the algorithm. But there is such a thing as a non-constructive proof that an algorithm exists.

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