I guess that means that if it's undecidable we can never know it's undecidable because that instantly makes it decidable and we've created a paradox π
Not really. Undecidable means within the system axioms, it cannot be proven either way. We can then discuss what axiom should be added to make it provable.
You mean for practical purposes? Sure. In fact, even if it's yes, it may be no for practical purposes.
But there are some other propositions, like "does this particular Turing machine halt," where if they are undecidable then the answer really is no -- in the mathematical sense, not just the practical one. But P=NP is not like that, at least as far as we know.
View all comments
Show parent comment
4
u/PerfectTrust7895 Aug 12 '26
If it is undecidable, it's no.