Re:Math writing is dull when it neglects the human dimension
by js8 on Friday March 29, 2024 @10:07AM
(#39864285)
> Even is SAT is P that doesn't imply a solution can feasibly be found.
It does, because in this case you also assumed that running numerical algorithm was feasible. So if your SAT solver fails to find the answer, it is either suboptimal method (because numerical method exists), or (if the instance is UNSAT) the numerical method gives you a flawed result.
Re:Math writing is dull when it neglects the human dimension
by constantcrying on Friday March 29, 2024 @10:19AM
(#39864413)
Do you not understand that an O(n^100) algorithm is in P, but can never be run feasibly on a computer for any non trivial amounts of n? For n=10 you are already far beyond the number of Atoms in the universe.
I don't think you have any clue what you are actually talking about.
Re:Math writing is dull when it neglects the human dimension
by Tainnor on Saturday March 30, 2024 @10:14AM
(#39875095)
> And if P neq NP, then SAT might not be P.
Small correction: If P != NP, then SAT definitely isn't in P. That's because SAT is NP-complete, so if it was in P, every other NP problem could be polynomially reduced to it and would hence also be in P.
The negative outcome will have exactly zero implications about anything. Except "turns out we were right all along" polynomial problems are just fundamentally less hard than problems you can verify the solution of in polynomial time. This has ZERO implications on anyone, except the mathematicians who prove it, who will get a price and quite a bit of academic fame. That is literally it.
>But doing that is more complicated than, assuming there is a SAT solver, plug the SAT instance into it and see if there is a solution (and you can get, for a finite family of instances, a similar guarantee you would get from the existence proof).
Even is SAT is P that doesn't imply a solution can feasibly be found. And if P neq NP, then SAT might not be P.