I remember when "real programmers" were supposed to look at the assembly code generated by compilers because it was bloated, inefficient, and totally unsuitable to use in a real system.
Cue in "non-determinism" retort.
I think the problem is less determinism than predictability. Hashing algorithms are deterministic.
Will people start .gitignore-ing their src directories and only save prompts?
That you anticipated a retort isn’t enough. You also have to refute it.
Yeah compilers are deterministic and LLMs are not. The response to that?
The answer could very well be something like what’s in TFA namely formal verification. But an answer here is needed.
Hardware restrictions might have contributed to that. Anyway, analogs and metaphors do not prove what they sneakily try to imply. They might help thinking about a problem, but they leave out the actual argument, and in this case, the jump is substantial.