P vs NP is a more fundamental problem that if proven, will have insane consequences, perhaps more than anything else out there. For starters, you would be insantly able to design an an actuall all knowing AGI.
The NS equations are far,far,far less meaningful. Like I mentioned earlier, if you actually want accurate CFD, you dont even use them.
> The NS equations are far,far,far less meaningful. Like I mentioned earlier, if you actually want accurate CFD, you dont even use them.
Sure. Consider this: in algorithm research often the most optimal algorithm in big-O is not the one used IRL; examples are numerous: matrix multiplication, LCA data structures, many variants of shortest paths.
An academic can work two years on faster-in-theory matrix multiplication that no one expects to be used in practice (in our currently imaginable univese). Do you consider that less meaningful than working on faster matmul kernels?
On the flip side if P=NP, that means that instead of dedicating compute to running branching simulations, An AGI can dedicate compute to just solving directly the actions it needs to do for any given outcome. This is a shortcut to reality, which means that reality in itself is compressible.