Hacker News
points by carefree-bob 3 days ago | 0 comments
I'm beginning to wonder whether P!=NP is undecidable.
[–] teiferer 2 days ago
That statement is nonsensical for the usual formal notion of "undecidable" which is about infinite sets of inputs that a machine is asked to classify as "yes" or "no" instances, also called a decision problem.

P-vs-NP is no such decision problem. It has a single instance, we just don't know its validity.

[–] IAmBroom 2 days ago
It was not a formal statement.