Earlier quoted context omitted.
Do you not realize that SAT might just be O(2^n) at best? Even if by a gigantic miracle SAT is in P, unless there is another incredibly great miracle and it is something like O(n^3), which would almost certainly be the greatest discovery of CS, it would not replace almost any other algorithms? Simply because many of the most important ones are O(n^2) or even less. >I think there might be a single algorithm, a SAT sol…
> Do you not realize that SAT might just be O(2^n) at best? Yes, but that's the worst case on all possible instances. Even with this worst case performance, there might be an algorithm that works on par with other algorithms that specialize only on certain instances. E.g. there can be an O(2^n) algorithm for general SAT which performs in O(n^(3/2)) on XORSAT. We simply don't understand the problem well enough to tell…
You have a completely utopian idea about what might be computationally feasible. I don't even know what you are arguing. Certainly it is thinkable that SAT is somehow ridiculously simple to calculate, just in the same way that achieving simple and near free fusion energy is thinkable. It just isn't going to happen and speculating on it is pure science fiction.