Episode #472 from 2:40:50

P = NP

What would you say is out of these within reach famous problems is the hardest problem we have today? Is it the Riemann hypothesis? Well, it's up there. P equals NP is a good one because that's a meta problem. If you solve that in the positive sense that you can find a P equals NP algorithm, potentially, this solves a lot of other problems as well.

Why this moment matters

What would you say is out of these within reach famous problems is the hardest problem we have today? Is it the Riemann hypothesis? Well, it's up there. P equals NP is a good one because that's a meta problem. If you solve that in the positive sense that you can find a P equals NP algorithm, potentially, this solves a lot of other problems as well.

Starts at 2:40:50
People and topics
All moments
P = NP chapter timestamp | Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI | EpisodeIndex