On today’s episode of Strongly Connected Components I am joined by Timothy Lanzone the writer and director of the forthcoming movie, Travelling Salesman. The movie is an intellectual thriller about four mathematicians tasked with solving the hardest problem in computer science, and I speak with Timothy about where he got the idea for the movie, how he made sure that the mathematics was correct, and why science movies just may be the new comic book movies. You can find out more about Travelling Salesman by visiting the movie’s website, or by following it on twitter.
Download this Episode
[wpaudio url=”http://media.blubrry.com/scc/acmescience.com/Podcasts/SCC/46lanzone.mp3″ text=”SCC 46: Timothy Lanzone” dl=”0″]
Please remember to update your RSS Feed or iTunes Subscription to make sure that you get the new episodes.
Subscribe in iTunes(and leave us a review)
Follow @acmescience on twitter too!
Thanks for sharing that over at GLL—as I commented there, it is amusing midway where the director acknowledges that Vinay Deolalikar’s proof claim of P != NP threatened the movie…