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
How Do You Get More?
In P space, we now have interesting things that we're not in NP. For example, from a given position in chess, does white or black have the win? And another thing in P space would be some really hard constraint satisfaction problem. There's also what you can efficiently do doing polynomial time using a quantum computer called BQP.
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