News for hackers. Stuff that matters.

A comment on Terence Tao on GPT-4. Parent comment

Re:Terence Tao on GPT-4 by wetmore on Wednesday April 12, 2023 @10:20AM (#35540138)
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.
[ Parent | on HN ]
Re:Terence Tao on GPT-4 by endisneigh on Wednesday April 12, 2023 @10:24AM (#35540196)
the 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?
[ Parent | on HN ]