This article seems to assume that problems in P are computable no matter the size. If it is shown NP=P, but the best algorithm we have is O(n^100), we still don't have a computer that can actually finish the computation.