Avi Wigderson
👤 SpeakerAppearances Over Time
Podcast Appearances
Sure, yeah.
What's the intuition behind that?
Like, let's say I have a proof for P equals NP and we want to convert it to a zero knowledge proof.
How does that work?
So with the zero knowledge proofs, you can never be 100% sure.
No, no.
Okay, but practically, I mean exponentially approaching.
When I think of cryptography, one-way functions, there's this idea of quantum computation that's kind of changed complexity theory a bit.
A bit, yeah.
Big time, yeah.
Yeah, and I wanted to ask your thoughts on how quantum computation or that model of computation is changing complexity theory.
What are the big takeaways?
That's incredible, yeah.
I mean, in complexity theory, there's these...
what do you call them?
I guess like Venn diagrams of all possible problems.
And the implicit assumption in this picture is that these are decidable problems.
Yeah, yeah, yeah, yeah.
In some of these diagrams, there's a little, in the corner, there's just undecidable ones.
Yeah, unreachable, yeah.