Complexity theory has a couple of interesting "sandwiches" as a prof called them.
For example, we know that LOGTIME is a subset of PTIME, which is a subset of NPTIME and PSPACE, both of which are a subset of EXPTIME. We also know that EXPTIME is strictly bigger than LOGTIME and PTIME.
So somewhere between PTIME, NP, PSPACE and EXPTIME, there must be a change in computational capability. We just don't know where.
This also exists between constant-depth circuit networks and algorithms using LOGSPACE. A circuit network of depth of log^2(input_size) can compute more than any nondeterministic LOGSPACE algorithm, which can compute more than a circuit network of constant depth using threshold gates. We also know that a deeper circuit network has strictly more computational power than the constant depth one.
But where is the specific jump in computational power? We don't know.
That makes the "practical applications" very strange to consider.
I keep jesting, the funniest resolution of P vs NP would be that P = NP, except it has a cost factor that stops any practical collapse, like a proven minimum of O(n^<number of atoms in the universe>). That'd be the most annoying resolution of them all.