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
[–] jasory@programming.dev 18 points 1 month ago (2 children)

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.

[–] bold_omi@lemmy.today 9 points 1 month ago (1 children)

Yes, they are deterministic. LLMs are not.

[–] bold_omi@lemmy.today 1 points 1 month ago

I am curious about the downvotes; what I said is factual. LLMs use random numbers in deciding output, so they are not deterministic.