Clip

Michael Bligman on the P vs. NP Problem, Cryptography, and Computational Complexity
listen on Spotify
06:00 - 07:23 (01:23)

In this episode of the Lex Fridman podcast, Michael Bligman talks about the P vs. NP problem, cryptography as a source of paranoia, and the beauty of computational complexity theory.

Similar Clips