‘Reverse Mathematics’ Illuminates Why Hard Problems Are Hard

When it comes to hard problems, computer scientists seem to be stuck. Consider, for example, the notorious problem of finding the shortest round-trip route that passes through every city on a map exactly once. All known methods for solving this “traveling salesperson problem” are painfully slow on maps with many cities, and researchers suspect there’s no way to do better. But nobody knows how to…

Source