[algorias]

Correct, but I didn't claim what you are refuting. I just said that there is no upper bound to "how polynomiallly hard" a problem can get, i.e. Knuths intuition is wrong.

[baddox]

Look at the quote. Knuth is explicitly only talking about NP problems.