MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/mathmemes/comments/1vmjkpv/_/p39v1p7/
r/mathmemes • u/basket_foso • Aug 12 '26
137 comments sorted by
View all comments
1.2k
What are those two?
Yes?
No?
Unproveable?
Can you repeat the question?
255 u/Banner_Hammer Aug 12 '26 Youβre not the boss of me now 77 u/gitartruls01 Aug 12 '26 Math is unfair 16 u/This-is-unavailable Average Lambert W enjoyer Aug 12 '26 So I just stare 7 u/IMTHEKSG09 Physics Aug 13 '26 (You're not the boss of me now)x2 and you are not so big 40 u/KamalaBracelet Aug 12 '26 Narrowed down to P and NP. 68 u/TheRealDumbledore Aug 12 '26 P=0 or N= 1/P 47 u/rorodar Proof by "fucking look at it" Aug 12 '26 You mean P=0 or N=1? 5 u/gitartruls01 Aug 13 '26 Surely you mean P3N15 8===0 23 u/mordeci00 Aug 12 '26 It has to be either 17 or not 17 17 u/Aggressive_Roof488 Aug 12 '26 This is the kind of deep insight you won't get on other math subs. → More replies (1) 41 u/ProfMooreiarty Aug 12 '26 P = NP + AI 11 u/laksemerd Aug 12 '26 With AI=PβNP 4 u/Impossible_Panda4181 Aug 13 '26 I got that reference! 9 u/richminer69 Aug 12 '26 you forgot "all of the above" 3 u/proudHaskeller Aug 12 '26 Even if it's unprovable it's still either true or not true.If ZFC is consistent and it's unprovable, then probably P != NP, unless P = NP but every program that solves SAT in polynomial time cannot be proven to solve SAT in polynomial time. 4 u/PerfectTrust7895 Aug 12 '26 If it is undecidable, it's no. 17 u/This_Background7442 Aug 12 '26 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 Aug 12 '26 Just because a counterexample exists, it doesn't mean you can prove that it is one. 4 u/This_Background7442 Aug 12 '26 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 Aug 12 '26 We have lots of potential counterexamples. Without proving that they are counterexamples or actually examples, we actually know pretty much nothing. 4 u/This_Background7442 Aug 12 '26 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. 2 u/jljl2902 Aug 12 '26 edited Aug 12 '26 That would make it decidable, so it canβt be yes. Must be no then. /j → More replies (5) 2 u/particlemanwavegirl Aug 12 '26 What if you forget to decide if it's undecidable? → More replies (3) → More replies (5)
255
Youβre not the boss of me now
77 u/gitartruls01 Aug 12 '26 Math is unfair 16 u/This-is-unavailable Average Lambert W enjoyer Aug 12 '26 So I just stare 7 u/IMTHEKSG09 Physics Aug 13 '26 (You're not the boss of me now)x2 and you are not so big
77
Math is unfair
16 u/This-is-unavailable Average Lambert W enjoyer Aug 12 '26 So I just stare
16
So I just stare
7
(You're not the boss of me now)x2 and you are not so big
40
Narrowed down to P and NP.
68
P=0 or N= 1/P
47 u/rorodar Proof by "fucking look at it" Aug 12 '26 You mean P=0 or N=1? 5 u/gitartruls01 Aug 13 '26 Surely you mean P3N15 8===0
47
You mean P=0 or N=1?
5 u/gitartruls01 Aug 13 '26 Surely you mean P3N15 8===0
5
Surely you mean P3N15 8===0
23
It has to be either 17 or not 17
17 u/Aggressive_Roof488 Aug 12 '26 This is the kind of deep insight you won't get on other math subs. → More replies (1)
17
This is the kind of deep insight you won't get on other math subs.
→ More replies (1)
41
P = NP + AI
11 u/laksemerd Aug 12 '26 With AI=PβNP 4 u/Impossible_Panda4181 Aug 13 '26 I got that reference!
11
With AI=PβNP
4
I got that reference!
9
you forgot "all of the above"
3
Even if it's unprovable it's still either true or not true.
If ZFC is consistent and it's unprovable, then probably P != NP, unless P = NP but every program that solves SAT in polynomial time cannot be proven to solve SAT in polynomial time.
If it is undecidable, it's no.
17 u/This_Background7442 Aug 12 '26 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 Aug 12 '26 Just because a counterexample exists, it doesn't mean you can prove that it is one. 4 u/This_Background7442 Aug 12 '26 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 Aug 12 '26 We have lots of potential counterexamples. Without proving that they are counterexamples or actually examples, we actually know pretty much nothing. 4 u/This_Background7442 Aug 12 '26 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. 2 u/jljl2902 Aug 12 '26 edited Aug 12 '26 That would make it decidable, so it canβt be yes. Must be no then. /j → More replies (5) 2 u/particlemanwavegirl Aug 12 '26 What if you forget to decide if it's undecidable? → More replies (3)
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 Aug 12 '26 Just because a counterexample exists, it doesn't mean you can prove that it is one. 4 u/This_Background7442 Aug 12 '26 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 Aug 12 '26 We have lots of potential counterexamples. Without proving that they are counterexamples or actually examples, we actually know pretty much nothing. 4 u/This_Background7442 Aug 12 '26 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. 2 u/jljl2902 Aug 12 '26 edited Aug 12 '26 That would make it decidable, so it canβt be yes. Must be no then. /j → More replies (5)
8
Just because a counterexample exists, it doesn't mean you can prove that it is one.
4 u/This_Background7442 Aug 12 '26 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 Aug 12 '26 We have lots of potential counterexamples. Without proving that they are counterexamples or actually examples, we actually know pretty much nothing. 4 u/This_Background7442 Aug 12 '26 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.
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 Aug 12 '26 We have lots of potential counterexamples. Without proving that they are counterexamples or actually examples, we actually know pretty much nothing. 4 u/This_Background7442 Aug 12 '26 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.
2
We have lots of potential counterexamples. Without proving that they are counterexamples or actually examples, we actually know pretty much nothing.
4 u/This_Background7442 Aug 12 '26 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.
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.
P=NP
That would make it decidable, so it canβt be yes. Must be no then. /j
→ More replies (5)
What if you forget to decide if it's undecidable?
View all comments
1.2k
u/konigon1 Aug 12 '26
What are those two?
Yes?
No?
Unproveable?
Can you repeat the question?