Asymptotically, can supercomputers easily solve the Travelling Salesman Problem, why or why not?

Question

I just want to know if supercomputers could easily solve the TSMP or would still take a lot of time, as it does now?

Answer 1

You must understand that no classical computer in the world nor in the universe will ever solve a large TSMP.

Supercomputer are barely one million times faster than personal computers, this is nothing compared to, say $100!$. A supercomputer would just allow you to add a handful of points for the same running time.