[leereeves]

That's assuming computational resources could grow forever without limit, which of course they can't.

[QML]

To add on: Moore's law is "dying", and that places further pressure on algorithms to get faster.

However, even in an exponential world, I am reminded of a quote:

"exponential algorithms make polynomially slow progress, while polynomial algorithms advance exponentially fast".

[babypistol]

Yeah, in this case we are back to square one and P vs NP again seems irrelevant to me.