The Problem at the Heart of Computer Science | The Traveling Salesman Problem with Nathan Klein
Channel: Socratic Studios
Date: 2020-11-24

Recently, a PhD student named Nathan Klein was able to devise the most efficient algorithm for the Traveling Salesman problem. By doing so, he has brought us ever closer to enjoying the benefits of solving the problem, which include the ability to cure cancer, into reality. Join us as we discuss what the problem is in the first place, how he was able to improve the solution, and what this means for the world. 

About us: Socratic Studios empowers the scientists of tomorrow by allowing them to communicate the discoveries of today. It's co-founders, Vishnu Veeravalli and Sunjum Sanghari, both sophomores in high school, are science lovers and are on a mission to share their passion with the world.
#documentary #computerscience