Comment by ronsor
2 days ago
As the runtime of any program approaches infinity, the probability of the program behaving in an undesired manner approaches 1.
2 days ago
As the runtime of any program approaches infinity, the probability of the program behaving in an undesired manner approaches 1.
That is not universally true. The yes program is a counter example:
https://www.man7.org/linux/man-pages/man1/yes.1.html
Devil's advocate:
(1) Execute yes (with or without arguments, whatever you desire).
(2) Let the program run as long as you desire.
(3) When you stop desiring the program to spit out your argument,
(4) Stop the program.
Between (3) and (4) some time must pass. During this time the program is behaving in an undesired way. Ergo, yes is not a counter example of the GP's claim.
I upvoted your reply for its clever (ab)use of ambiguity to say otherwise to a fairly open and shut case.
That said, I suspect the other person was actually agreeing with me, and tried to state that software incorporating LLMs would eventually malfunction by stating that this is true for all software. The yes program was an obvious counter example. It is almost certain that all LLMs will eventually generate some output that is undesired given that it is determining the next token to output based on probabilities. I say almost only because I do not know how to prove the conjecture. There is also some ambiguity in what is a LLM, as the first L means large and nobody has made a precise definition of what is large. If you look at literature from several years ago, you will find people saying 100 million parameters is large, while some people these days will refuse to use the term LLM to describe a model of that size.
1 reply →