In computer science there are some famous named problems and algorithms: the Sleeping Barber Problem, the Byzantine Generals problem, the Firing Squad problem, the Travelling Salesman problem come to mind. Is there a name for this class of names? Anyone know any other colorful ones?

There's also the dining philosophers problem. Isn't this similar to a naming strategy in philosophy (logic), e.g., pons asinorum, ignoratio elenchi.

A little more information about the problems for those who don't know:

The Travelling Salesman problem is about finding an optimal route to traverse to every city, visiting each only once, as a travelling salesmen would. The problem is named after the how you would use the solution.