[mpoteat]

There exist problems where finding the solution is hard but verifying the solution is easy. example in the general case: prime-factoring numbers.

Are you claiming that for all possible problems posed, verifying the correctness of the output of an LLM is equal or higher difficulty than solving the problem itself? If so, that seems like a claim more arising from emotion than reason.

In the general case, you can have it generate code in a proof based language that "proves" the code is correct against formal specification. Unless you consider math itself to be "bullshit" too.

[hnfong]

The people who are skeptical that it can be easier to verify correctness than to produce a correct work might as well try to prove P=NP (which is the theoretical and formal statement of such).

They also probably never asked people to work on a task either (hint: people can get things wildly wrong, even generally competent ones)

[incrudible]

If it is a well known problem, I might as well find the solution on stack overflow, where actual the actual humans that trained this system discuss it.

As for proof based languages, can it actually do that? Have you tried?