Understanding NP-Hard Problems in AI and Encryption | Scott Aaronson

Can one math problem unlock AI, break encryption, and solve it all? Watch the full interview with Scott Aaronson here: https://www.youtube.com/watch?v=EYyOSD4qdJQ&list=PL87anKnyrxSINa7feABRBcXA_fIQzqPH0&index=4 In this clip, theoretical computer scientist Scott Aaronson explains the stakes of the legendary P vs NP problem, why so many optimization challenges—from the traveling salesman problem to training large neural networks—are “NP-complete,” and how solving just one of them efficiently would let us solve all of them. Scott breaks down NP-hardness, NP-completeness, and the surprising link between classic math puzzles and modern AI training. He also discusses approximation theory, why some problems resist even near-perfect solutions, and what it would mean for cryptography if a fast algorithm were found. Whether you’re curious about quantum computing, AI optimization, or the future of encryption, this is a masterclass in computational complexity. Follow us for more technical interviews with the world’s greatest scientists: www.youtube.com/@UCy_GEzh0W9Ul0YFl4Dup7Sg Twitter: https://x.com/632nmPodcast Instagram: https://www.instagram.com/632nmpodcast?utm_source=ig_web_button_share_sheet&igsh=ZDNlZDc0MzIxNw== LinkedIn: https://www.linkedin.com/company/632nm/about/ Substack: https://632nmpodcast.substack.com/ Follow our hosts! Michael Dubrovsky: https://x.com/MikeDubrovsky Misha Shalaginov: https://x.com/MYShalaginov Xinghui Yin: https://x.com/XinghuiYin Subscribe: Apple Podcasts: https://podcasts.apple.com/us/podcast/632nm/id1751170269 Spotify: https://open.spotify.com/show/4aVH9vT5qp5UUUvQ6Uf6OR Website: https://www.632nm.com #PvsNP #ScottAaronson #ComplexityTheory #QuantumComputing #NPComplete #Cryptography #AI #MachineLearning #Algorithms #ComputerScience #Mathematics #NPHard