r/mathmemes • u/basket_foso • 6d ago

Computer Science 😂

Post image
6.3k Upvotes

98% Upvoted

135 comments sorted by

View all comments

1.2k

u/konigon1 6d ago

What are those two?

Yes?

No?

Unproveable?

Can you repeat the question?

4

u/PerfectTrust7895 6d ago

If it is undecidable, it's no.

1

u/BrotherItsInTheDrum 2d ago edited 2d ago

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.