News for hackers. Stuff that matters.
Re:Galactic Algorithm by codeflo on Saturday October 05, 2019 @08:14AM (#21165083)
Interesting, I don’t remember this proof (maybe I learned it, but it’s been a couple of years since university). Do you remember the “stop condition”? At some point the algorithm would have to “give up” and declare the problem unsatisfiable.
Re:Galactic Algorithm by Gehinnn on Saturday October 05, 2019 @08:28AM (#21165122)
I don't know. You could also enumerate all proofs and check whether P is a proof that a turing machine T solves SAT in polytime (if P=NP, this requires a finite number of steps ^) and then run T.

^ It would be funny though if P=NP, but for no turing machine exists a proof that it solves SAT. This would have to be ruled out for the algorithm to work.