Re:Trained LLMs exclusively on pre-1913 texts
by otabdeveloper4 on Friday December 19, 2025 @06:12AM
(#46324524)
> LLMs are a general purpose computing paradigm.
Yes, so is logistic regression.
Re:Trained LLMs exclusively on pre-1913 texts
by hackinthebochs on Friday December 19, 2025 @06:25AM
(#46324597)
No, not at all.
Re:Trained LLMs exclusively on pre-1913 texts
by otabdeveloper4 on Friday December 19, 2025 @11:27AM
(#46327580)
Yes at all. I think you misunderstand the significance of "general computing". The binary string 01101110 is a general-purpose computer, for example.
Re:Trained LLMs exclusively on pre-1913 texts
by hackinthebochs on Friday December 19, 2025 @12:35PM
(#46328540)
No, that's insane. Computing is a dynamic process. A static string is not a computer.
Re:Trained LLMs exclusively on pre-1913 texts
by MarkusQ on Friday December 19, 2025 @05:09PM
(#46331562)
It may be insane, but it's also true.
Re:Trained LLMs exclusively on pre-1913 texts
by hackinthebochs on Friday December 19, 2025 @09:22PM
(#46333155)
Notice that the Rule 110 string picks out a machine, it is not itself the machine. To get computation out of it, you have to actually do computational work, i.e. compare current state, perform operations to generate subsequent state. This doesn't just automatically happen in some non-physical realm once the string is put to paper.
The sequence of matrix multiplications are the high level constraint on the space of programs discoverable. But the specific parameters discovered are what determines the specifics of information flow through the network and hence what program is defined. The complexity of the trained network is emergent, meaning the internal complexity far surpasses that of the course-grained description of the high level matmul sequences. LLMs are not just matmuls and logits.
[1] https://x.com/karpathy/status/1582807367988654081