Quoted By:
I don't see the problem is. Most of his interviews are with AI meme men, but well, just don't watch those. Podcasts aren't sports teams, you can pick more than one and don't have to listen to everything on it.
I like that he has lengthy interviews with TCS pioneers like Knuth and Karp, and let those guys do most of the talking.
Of course, Lex is an AI meme man himself. Most of the time he successfully hides behind the ignorance of his supposed audience, but during the Karp interview, I think he really didn't understand it himself. He was somehow very much amazed about the fact that NP-complete problems were a thing and that so many interesting problems turn to be in that class. Karp didn't want to spoil this man's bewilderment, but the simple answer to this question is that polynomial time reduction is a very powerful transformation method, unlike say, logspace reductions.
