Lex Fridman

I have to ask about P versus NP.

This is one of the big open problems in complexity theory.

So for people who don't know, it's about the relationship between computation time and problem complexity.

Do you think it will ever be solved?

And is there any chance the weird counterintuitive thing might be true that P equals NP?

And on the third hand, like you said, we already have approximation algorithms that, from a pragmatic perspective, solve all the actual real engineering problems of human civilization.

Sorry to ask the ridiculous question, but who is the greatest mathematician of all time?

Who are the possible candidates?

Euler, Gauss, Newton, Ramanujan, Hilbert.

We mentioned girdle touring, if you throw them into the bucket.

So you don't have like, you know, some people have like a Taylor Swift poster.

What do you make of that?

Because I see that sometimes when...

mathematicians, this also applies in physics and science, where completely separately discoveries are made, maybe at a very similar time.

What does that mean?

Do you understand where ideas come from?

I mean, what's your own process when you're thinking through a problem?

And sometimes it actually involves now more and more something like the Lean programming language where some parts are automated.

Yeah, I see.

Your curiosity draws you towards simplicity.