Devil’s advocating for the sense of completeness here rather than bickering, but wouldn’t two of the same compiler on two of the same machine with the same code still create the same output? That is to say, it is deterministic rather than stochastic but it just takes unpredictable variables into account when compiling?
I think the difference would be that a compiler will always give you something understandable and explainable even if it’s opaque, but an LLM is literally using RNG to generate its output, so could come out with something completely left field. If it switches to Chinese that’s one thing because you can just ignore that, but equally a hallucinated bug that looks right but is actually very dangerous could slip in instead.
RNG is pseudorandom. Every computer program is deterministic in some sense, even if the seed is obfuscated or dependent on ephermal environment variables. Being able to predict the output is very different from determinism.
Devil’s advocating for the sense of completeness here rather than bickering, but wouldn’t two of the same compiler on two of the same machine with the same code still create the same output? That is to say, it is deterministic rather than stochastic but it just takes unpredictable variables into account when compiling?
I think the difference would be that a compiler will always give you something understandable and explainable even if it’s opaque, but an LLM is literally using RNG to generate its output, so could come out with something completely left field. If it switches to Chinese that’s one thing because you can just ignore that, but equally a hallucinated bug that looks right but is actually very dangerous could slip in instead.
RNG is pseudorandom. Every computer program is deterministic in some sense, even if the seed is obfuscated or dependent on ephermal environment variables. Being able to predict the output is very different from determinism.