3 ms·
NP is the class of problems for which it's hard to find the answer but easy to verify. The fact such a class even exists should hint to you that finding the ans
by wetmore 3y ago
NP is the class of problems for which it's hard to find the answer but easy to verify. The fact such a class even exists should hint to you that finding the answer and checking correctness can be two different things.
- endisneigh 3y agothe point of my comment is that whether P = NP to begin with is still to be determined. in the case of ChatGPT, it's easy for it to respond, but how difficult is it for you to verify that it was correct, or not? how does that compare with the difficulty in doing the task to begin with?