Comment by YeGoblynQueenne
2 months ago
>> Are you doing the "LLMs don't know how many R's are in 'Raspberry'" thing here?
I don't know. Are you doing the thing were you're arguing against something you don't like that the other person never said?
2 months ago
>> Are you doing the "LLMs don't know how many R's are in 'Raspberry'" thing here?
I don't know. Are you doing the thing were you're arguing against something you don't like that the other person never said?
The model is very capable of checking this counterexample, was my point.
Checking, it how? I mean can you describe the mechanism? How does an LLM "check" that something is (or isn't) a counterexample? Does that involve pattern matching, formal verification or model checking, some other approach?
In this case, the same way I would -- calling out to SymPy.
Once you verify (with SymPy or another CAS, like Mathematica) that the given function has the claimed Jacobian determinant (which involves only taking partial derivatives and taking a determinant) and the given inputs map to the same output (which involves only evaluating polynomials with some inputs), you're done.
1 reply →