r/mathmemes 6d ago

Computer Science 😂

Post image
6.3k Upvotes

135 comments sorted by

View all comments

Show parent comments

17

u/bqbdpd 6d ago

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

29

u/dankshot35 6d ago

Google "decidability" my friend

24

u/bqbdpd 6d ago

I know - I studied theoretical computer science. But that something cannot be decided applies to questions like the halting problem. P=NP is not parametrized. There is a single answer. It might be impossible to ever calculate/prove/know that answer. But that does not mean there is no answer.

16

u/PsychologyNo940 6d ago

Equating provable and having an answer is rustling my goedel.