Meet the Youngest Ever Winner of Gödel Prize, The Nobel of Theoretical Computer Science.
For centuries, the greatest minds in history, from the ancient Greeks to Gauss, hunted for a fast, perfect way to determine if a number is prime. In the summer of 2002, three researchers at IIT Kanpur did what the world thought was impossible.
We dive into the life and work of Nitin Saxena, a quiet student from Prayagraj who preferred symbols over words. You'll see how a simple idea involving polynomials led to the AKS algorithm, the first to be general, deterministic, and polynomial-time. Beyond the discovery, we follow Nitin’s journey through Computational Complexity, winning Gödel Prize, called the Nobel of Computer Science, and his current mission leading the Wadhwani School of AI.
TIMESTAMPS:
00:00 - The 2,000-Year-Old Prime Number Riddle
04:45 - The "Impossible" Problem: Primality Testing Explained
10:15 - The Breakthrough: How the AKS Algorithm Works
13:40 - August 2002: The Math World in Shock
16:10 - Beyond Primes: Algebraic Complexity & P vs NP
19:25 - Building the Future: The Wadhwani School of AI
#sciencedocumentary #inspiringscience #indiangenius #sciencestories
Listen to 100s of Science Documentaries on Turing for Free. Checkout the App at
iOS: https://apps.apple.com/in/app/the-turing-app/id6752724106
Android: https://play.google.com/store/apps/details?id=com.theturingapp.turing&hl=en
or listen at https://theturingapp.com
