this post was submitted on 16 Oct 2026
178 points (88.4% liked)
Linux
15518 readers
367 users here now
A community for everything relating to the GNU/Linux operating system (except the memes!)
Also, check out:
Original icon base courtesy of lewing@isc.tamu.edu and The GIMP
founded 3 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Don't compilers have some guarantee of behaviours? I.e even if you don't know exactly what instructions and order the compiler generates there is a guarantee that it is computationally/mathematically equivalent to the statements you wrote. Otherwise it would be a pretty terrible compiler. That's a pretty big jump to writing instructions you don't understand, since LLMs can't make the same guarantees about a prompt/request.
Yes, they are deterministic. LLMs are not.
I am curious about the downvotes; what I said is factual. LLMs use random numbers in deciding output, so they are not deterministic.
What was the non-determinism in compilers? Honest question. Like, where does it comes from?
If you had a bug in a compiler, and a code that caused it, would it, for the same input and architecture only show some of the time? Does it included randomness in how it handles output?
Being bug-ridden is not the same as non-determinstic, if you can reproduce the bug everywhere and thus fix it, so I'm honestly curious where would the non-determinism of compilers come from.
that is still deterministic.... you don't understand what deterministic means.
go ahead and show us an llm that is deterministic with a parameter passed to the inference engine. I'll wait.
Anyone claiming to do “real programming” shouldn’t be listened to. It’s incredibly clear you don’t know what deterministic means.