Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson
On the other hand, it's related to computation because the kind of questions we ask ourselves, the problems we are trying to solve, are partly motivated by trying to understand computation.
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson
There are notions, in algebra you are trying to understand equations or systems of equations, and in analysis you are trying to understand, very generally speaking, inequalities and continuous spaces.
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson
And this can be a sequence of bits or it can be the DNA of a person from which you produce proteins using computation or you produce a new baby using the evolution of a fertilized egg or the weather.
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson
We care about resources, how much resources are exerted in any such computation and trying to model it, trying to understand the algorithms that underline natural phenomena.
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson
We have the rigorous side coming from, and the aesthetic side, I would say, like creating models of proof systems because they are nice, because they are interesting, not because they are implementable necessarily.