Chapter
Richard Karp on P versus NP and Computational Complexity
2:06:13 - 2:07:36 (01:22)
Richard Karp talks about his journey into theoretical computer science, his contributions to the field, and the significance of his P versus NP paper. No product advertisements found.
Clips
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.
2:06:13 - 2:07:36 (01:22)
computational complexity
Summary
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.