I heard on Stephen Wolfram’s podcast the other day that all NP Hard problems are equivalent. For example, you can embed the halting problem within the traveling salesman problem and vice versa. I believe this means that solving one would automatically solve all the others.