If you can perfectly simulate your opponent, then a zero sum game is also in NP. Of course, in practice you can’t, but you do have some reasonable beliefs about what the opponent will do, which, I think, moves most real life problems into the same gray-zone as high-reliability engineering.
Also, I suspect that real-life uncertainty about “f” in your NP problems likewise pushes them up in complexity, into that same gray-zone.
There may be two clear clusters in theory, but it’s not certain that they remain distinct in practice.
If you can perfectly simulate your opponent, then a zero sum game is also in NP. Of course, in practice you can’t, but you do have some reasonable beliefs about what the opponent will do, which, I think, moves most real life problems into the same gray-zone as high-reliability engineering.
Also, I suspect that real-life uncertainty about “f” in your NP problems likewise pushes them up in complexity, into that same gray-zone.
There may be two clear clusters in theory, but it’s not certain that they remain distinct in practice.