their use of P!=NP is not incongruent with its meaning; I understood it as saying the tasks that LLMs are good for are analogous to NP in the verification being significantly faster than the search.
and at least in the things I use LLMs for (arithmetic with special functions and combinatorial arrays, which is often of the form "find a pathway of manipulations bringing the left side to the right" with a well-defined goal) verification is indeed able to be certain, often via computer algebra systems (that weren't themselves able to find the path, but can verify each step); even if the suitability of historical casework for a lawyer is not absolute and can't be definitively decided complete (since one person can't read everything), they can at least check that it adheres to the law
No comments yet.