Press Space to continue
Why P=NP Might Have a Proof Only Machines Can Check
Press Space to continue
If P=NP but with the caveat that the proof is so convoluted, complex and long that only a machine is be able to verify it, what does that mean Also why could then we never get any NP problem doen to P And what is the proof or algo that will get down NP problems to P ones?
open on xViews and clicks count once per visitor per day. Clicks are opens of this post on X.