You could still have used big O notation: "what if some NP-hard problems could be solved in O(n^(1000^1000))?" That is polynomial time so those problems would

You could still have used big O notation: "what if some NP-hard problems could be solved in O(n^(1000^1000))?" That is polynomial time so those problems would be in P, but in practice they would be intractable.