Guys it’s just a joke about the name of an old math problem. OP linked it and everything.
this post was submitted on 24 May 2025
341 points (100.0% liked)
memes
16161 readers
2411 users here now
Community rules
1. Be civil
No trolling, bigotry or other insulting / annoying behaviour
2. No politics
This is non-politics community. For political memes please go to [email protected]
3. No recent reposts
Check for reposts when posting a meme, you can only repost after 1 month
4. No bots
No bots without the express approval of the mods or the admins
5. No Spam/Ads
No advertisements or spam. This is an instance rule and the only way to live.
A collection of some classic Lemmy memes for your enjoyment
Sister communities
- [email protected] : Star Trek memes, chat and shitposts
- [email protected] : Lemmy Shitposts, anything and everything goes.
- [email protected] : Linux themed memes
- [email protected] : for those who love comic stories.
founded 2 years ago
MODERATORS
I try to sprinkle in a little math stuff between shitpost memes
Heard, keeping the ledger balanced
It's the basis of how governments, social systems, businesses, companies and even all world religions are based on.
If not for fast talking manipulative humans .... we'd probably be living in a utopia right now .... or we would have descended into a violent society of cannibalism and eugenics.
I think this is about the travelling salesman math/computer science problem:
what a humbling read lmao thank you
Maybe a third option, a grammar checker.
It says “most brilliant mathematicians an computer scientists”, not English majors. /s
Miller presented a general O(1) solution to the Traveling Salesman Problem back in 1949.
How expirienced is the traveling salesman? How long has he been doing it and how many places does he go? What kinds of goods does he sell? How heavy are those? How many of them has he carried at one time?
And what kinds of things do the computer scientists do with computers? do they design 3D topigraphical maps? Do they make antivirus software?
I don't really know what kinds of things the computer scientists do or how that would come in handy for a race, but since the traveling saleman already travels to many places I'd give the win to the salesman
Also, is the race point-to-point? is it a track in a loop of some sort? is it a race around the entire planet?
The race is on a loop, you only pass each point one time. You get from the starting place and return there, passing at each point 1 time, what would be the shortest/fastest path? That's the problem.
You can probably put weights on the fuel efficiency, based on the cargo weight, distance/speed he can drive (based on the experience and expected value for him), fueling stops, etc. Just add that to A* and some tinkering, I think you could make a good algorithm.