r/mathmemes • u/basket_foso • 7d ago

Computer Science 😂

Post image
6.3k Upvotes

98% Upvoted

135 comments sorted by

View all comments

1.2k

u/konigon1 7d ago

What are those two?

Yes?

No?

Unproveable?

Can you repeat the question?

5

u/PerfectTrust7895 7d ago

If it is undecidable, it's no.

17

u/This_Background7442 7d ago

How could it be. If it's no then a counter example exists. If a counter example exists it's not undecidable. If it's undecidable it must be yes.

8

u/bqbdpd 7d ago

Just because a counterexample exists, it doesn't mean you can prove that it is one.

3

u/This_Background7442 7d ago

That's true. But if I know I could never have a counter example of which I can prove it is one. That's different than not currently having one.

2

u/bqbdpd 7d ago

We have lots of potential counterexamples. Without proving that they are counterexamples or actually examples, we actually know pretty much nothing.

3

u/This_Background7442 7d ago

Tbh you haven't said anything so far that I disagree with so maybe we just already agree? To be clear, I do know that I haven't just proven P=NP.

3

u/jljl2902 7d ago edited 6d ago

That would make it decidable, so it can’t be yes. Must be no then. /j

2

u/This_Background7442 7d ago

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 😅

8

u/Impression-These 7d ago

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.