Maths at: Travelling Salesman
May 06, 2019
Listen to this episode in Metacast mobile app
Don't just listen to podcasts. Learn from them with transcripts, summaries, and chapters for every episode. Skim, search, and bookmark insights. Learn more
Episode description
The government didn't want you to hear this podcast. They tried to pay us off! Just remember as you listen to it: we are not responsible for any repercussions if you decide to watch Travelling Salesman.
Today's discussion points:
In you're interested in watching Travelling Salesman you don't need to buy it off Amazon, you can just watch it on YouTube! They can't even give it away!
Further reading:
Subscribe via iTunes.
Follow us on twitter @PodcastMathsAt, as well as @ThomasEWoolley and @benmparker.
Today's discussion points:
- How many tickets do you have to buy to win the lottery?
- Squashed research!
- How many actors can you have playing the same character?
In you're interested in watching Travelling Salesman you don't need to buy it off Amazon, you can just watch it on YouTube! They can't even give it away!
Further reading:
- Should you feel guilty about watching the film on YouTube, you can give the creators your money, through their official website.
- An easy description of the P vs NP problem.
- Sorting algorithms through dance.
- Color visualization of sorting algorithms.
Subscribe via iTunes.
Follow us on twitter @PodcastMathsAt, as well as @ThomasEWoolley and @benmparker.
For the best experience, listen in Metacast app for iOS or Android