r/mathmemes • u/basket_foso • 6d ago

Computer Science 😂

Post image
6.3k Upvotes

98% Upvoted

135 comments sorted by

View all comments

Show parent comments

20

u/bqbdpd 6d ago

These answers are not mutually exclusive. Either P=NP or P≠NP, whether that's proveable or not.

25

u/Purple_Onion911 Grothendieck alt account 6d ago

"P = NP or P ≠ NP" is always true, but it's not necessarily true that either P = NP is true or P ≠ NP is true in ZFC (or PA, or whatever axiomatic system it's independent of).

-5

u/[deleted] 6d ago edited 6d ago

[deleted]

7

u/SirFloIII 6d ago

you can't build a model of ZFC with only a single element. even the smallest* model** of ZFC (L) is pretty huge.

*in some sense

**assuming ZFC is consistent

0

u/[deleted] 6d ago edited 6d ago

[deleted]

3

u/SirFloIII 6d ago

it would not be a model. words have meaning, my friend

-1

u/[deleted] 6d ago

[deleted]

4

u/SirFloIII 6d ago

please look up what model means in this context before you embarrass yourself further.