Menu
Sign In Search Podcasts Libraries Charts People & Topics Add Podcast API Blog Pricing

Ryan Peterman

๐Ÿ‘ค Speaker
2230 total appearances

Appearances Over Time

Podcast Appearances

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

I mean, modeling things then give rise to problems that you want to understand.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

So I think the modeling part in the theory of computation, modeling various forms of computation, is a large part of it.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

Theoretical computer science manifests itself in particular in cryptography.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

There are models of adversely distributed computation.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

I think modeling, just asking questions and making definitions, is a very central part of the field.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

And it happens more than in mathematics, maybe because they are more ancient than maybe definitions happened earlier.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

But I want to stress this.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

That's a very important thing.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

For example, we discussed randomness.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

And our definition of randomness is totally different.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

And it gives rise to very surprising and interesting practically theorems.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

Okay, now that we said that,

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

What motivates me or what motivates other people, of course everybody has their own motivation.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

I am a product of computer science education.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

All my undergrad and grad school and postdoc and everything were in computer science.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

So I think that I certainly am sorry that I didn't take many more math courses because then I wouldn't have to learn things later in life.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

But that aside, I think that the focus on computation, which is what computer science education gives you,

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

different systems and different issues.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

There are, of course, algorithms in databases and algorithms in programming languages and, in fact, famous algorithms.

The Peterman Pod
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

In other fields, there are models and algorithms.