AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
3min chapter
#130 – Scott Aaronson: Computational Complexity and Consciousness
Lex Fridman Podcast
Quantum Computers Can't Solve the Stopping Problem, Right?
BQP is basically, you know, well, it's contained in like P with the magic power to solve Sharp P problems. What was BQP contained in P space? Oh, that's an excellent question. So anything you can do with a quantum computer, I could simulate with a classical computer, if I only have exponentially more time. It's enough to show that quantum computers could not solve the halting problem,. They could never do anything that is literally uncomputable in any sense.
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