Lex Fridman: belief

Transcript context

…It is possible. I mean, there’s various scenarios. I mean, there’s one where it is technically possible, but in fact it’s never actually implementable. The evidence is sort of slightly pushing in favor of no, that probably P is not a good NP. I mean, it seems like it’s one of those cases similar to Riemann hypothesis. I think the evidence is leaning pretty heavily on the no. Certainly more on the no than on the yes. The funny thing about P equals NP is that we have also a lot more obstructions than we do for almost any other problem. So while there’s evidence, we also have a lot of results ruling out many, many types of approaches to the problem. This is the one thing that the computer science has actually been very good at. It’s actually saying that certain approaches cannot work. No-go theorems. It could be undecidable, yeah, we don’t know.…

Stored transcript either side of the excerpt. The highlighted words are the published quote; the surrounding text is unedited source, never generated.