AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
4min chapter
#130 – Scott Aaronson: Computational Complexity and Consciousness
Lex Fridman Podcast
What Are the Classes You Learned in Computer Science?
P is the class of problems that you can solve with a deterministic algorithm. If your algorithm is linear time, like adding numbers, okay, that problem is in P. The next super important class is called NP and it stands for non-determable polynomial. So if you can easily check the answer to a computational problem, does that mean that you can also easily find the answer? Right.
00:00
Transcript
Episode notes
Get the Snipd
podcast app
Unlock the knowledge in podcasts with the podcast player of the future.
AI-powered
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