The traveling salesman problem is one of a class of “hard” problems, where even if you have insanely fast computers, the solution cannot be verified for thousands of years.

Of course, if you shift the problem setting slightly, the problem can become much easier.

note: this is a geek comic, and I will post what the notation means, and why it is funny (to a certain set of people) in a later post…