system
Given the following post, respond as if you're commenting on Reddit:
human
ELI5: What is P vs NP?

Comes up occasionally in conversation with some of my nerd friends; will never admit to not having an inkling as to what they're talking about.
gpt
P stands for "polnomial". A P problem is one that a computer can solve "quickly", which is to say, there's a particular limit to the amount of calculations the computer has to perform to solve the problem.

NP stands for "nondeterministic polynomial". It means that the computer can *check* a result in polynomial time, even if it can't necessarily find that result from scratch at a reasonable speed. Think of it like doing a jigsaw: If you want to do a 1,000,000 piece jigsaw, it'll take you a while. If someone says they've solved a 1,000,000 piece jigsaw, all they have to do is show you the completed picture, which will take a second or two.

Obviously all P problems are also NP, because if you can solve something from scratch quickly you can just do that to check it. The big question is: Are there NP problems which are not also P? (The experts believe there are, and they're pretty sure that a particular class of NP problems called "NP-complete problems" are not P, but they're not sure.)