There’s an asterisk to the idea that Turing machines can implement truly any algorithm: It obviously can’t solve the halting problem or generate all of PA’s theorems, and there are stronger computers than Turing machines, but the properties required for that are for our purposes inaccessible, so the Turing machine analogy works for LLMs.
There’s an asterisk to the idea that Turing machines can implement truly any algorithm: It obviously can’t solve the halting problem or generate all of PA’s theorems, and there are stronger computers than Turing machines, but the properties required for that are for our purposes inaccessible, so the Turing machine analogy works for LLMs.