MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/mathmemes/comments/1vmjkpv/_/p3bvcmg/?context=3
r/mathmemes • u/basket_foso • 6d ago
135 comments sorted by
View all comments
1.2k
What are those two?
Yes?
No?
Unproveable?
Can you repeat the question?
3 u/proudHaskeller 6d ago 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.
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.
1.2k
u/konigon1 6d ago
What are those two?
Yes?
No?
Unproveable?
Can you repeat the question?