Clip

Richard Karp on Computational Complexity and the Nature of Computation
In this episode, Lex Fridman interviews Richard Karp on the computational complexity and the nature of computation, including the P versus NP problem, cryptography, Alice and Bob, simulation and quantum mechanics, neural networks, and artificial intelligence.