“Joel David Hamkins believes that the practical importance of a P=NP proof is often overstated, as the asymptotic nature of the question means a polynomial-time algorithm could still be impractical due to enormous coefficients or high degrees.”