If P=NP, you can break every encryption in the world | Scott Aaronson and Lex Fridman

What will the P=NP proof look like? | Cal Newport and Lex FridmanПодробнее

Scott Aaronson: Quantum Computing | Lex Fridman Podcast #72Подробнее

Theory of Everything | Scott Aaronson and Lex FridmanПодробнее

Can we prove P=NP and not find the algorithm? | Scott Aaronson and Lex FridmanПодробнее

The odds that P=NP is 3% | Scott Aaronson and Lex FridmanПодробнее

If the world is a simulation, can we hack it? | Scott Aaronson and Lex FridmanПодробнее

Cancel Culture is Ridiculous | Scott Aaronson and Lex FridmanПодробнее

Complexity Zoo is the Periodic Table of Algorithms | Scott Aaronson and Lex FridmanПодробнее

Scott Aaronson: Computational Complexity and Consciousness | Lex Fridman Podcast #130Подробнее

Does P=NP? | Po-Shen Loh and Lex FridmanПодробнее