The odds that P=NP is 3% | Scott Aaronson and Lex Fridman

Please support this podcast by checking out our sponsors:

PODCAST INFO:

CONNECT:
- Subscribe to this YouTube channel

[sebastjansslavitis]

the very important part of this is that some problems that thought to be NP at the beginning was later discovered as P.
That's why we ask is there a chance that all NP are actually P and we simply approach them wrong way.

[tjejojyj]

“If we were physicists we would have just declared that to be a law of nature.” 😂

[KevinFi]

This is probably the best explanation of P vs NP I've heard.

[Pfaeff]

What I find so interesting about theoretical computer science, is that many of these problems are fairly easy to understand. Stuff like sorting numbers or coloring maps. Yet when you analyse their complexity, you find interesting relations such as that some problems can be reduced to other problems, meaning that there are sets of problems that are essentially equivalent. You can take the algorithm that solves one of those problems and use it to solve any of the other in the same set by transforming the input and the result.
I find it fascinating that problems can be "ranked" by their difficulty and what the landscape of algorithmically solvable problems looks like.

[Vohtwomax]

Not going to pretend I really understood any of that, but it sounds like you guys are having fun and that’s what makes this enjoyable.

[brendonpitcher]

"in p" vs "np" - very confusing choice of words

[tobuslieven]

The way it's described here it sounds like P=NP means: Does any hard to compute algorithm who's solutions can be checked easily, actually have an alternative easy to compute algorithm, that we just haven't found yet? Is that right?

[carson]

There is a 100% chance I'm a PIMP

[MrEengstrom]

Curious is if P=NP are dreamers, glass half full, lottery players and P<>NP are realists, glass half empty, hex players?

[spungoflex]

I didn’t understand a single word of this. But I’m glad guys like this exist.

[simonfunwithtrains]

When I was working I never had the time to think about whether P = NP has too busy thinking about the latest project end date or whether T equals chips.

[Danny-qhsu]

Scott Aaronson is a comedian omg his joke I'm dying laughing

[Sunmarkobjects]

I really want to understand this conversation

[stefanaursulesei]

So you're telling me there's a chance?

[ozzy]

sounds so fantastical to even expect that such an amazing thing could be possible at all.

[checkboxxxproductions]

1% enjoyed this to the fullest. Thanks for the mingasm.

[lucasb]

Lol five dislikes from Nobel prize in physics recipients

[derrsonn]

This is one of the 7 Millenium Prize Problems outstanding as of 2000. Solving or in (all) most cases, proving, the idea true or false will net you USD$1 million. Only one of the 7 has been solved, the Poincaré Conjecture, which dealt with hyperspheres. It was solved in 2006 by Russian mathematician Grigori Perelman, who refused the $1 million cash prize. Fascinating.

[MikeIsCannonFodder]

My favorite big-O, which is very NP, is 2^(2^n). The doubling doubles!

[Iaminationman]

Can you please do a long-form interview with GPT-3? Its responses depend heavily on the questions asked and I think you could extract some fascinating answers from it.