[stefl14]

Turing Completeness is an incredibly low bar and it doesn't undermine this criticism. Conway's Game of Life is Turing Complete, but try writing modern software with it. That Transformers can express arbitrary programs in principle doesn't mean SGD can find them. Following gradients only works when the data being modelled lies on a continuous manifold, otherwise it will just give a statistical approximation at best. All sorts of data we care about lie in topological spaces with no metric: algorithms in computer science, symbolic reasoning in math, etc. If SGD worked for these cases LLMs would push research boundaries in maths and physics or at the very least have a good go at Chollet's ARC challenge, which is trivial for humans. Unfortunately, they can't do this because SGD makes the wrong assumption about how to search for programs in discrete/symbolic/topological spaces.

[naasking]

> Turing Completeness is an incredibly low bar and it doesn't undermine this criticism.

It does. "Just statistics" is not Turing complete. These systems are Turing complete, therefore these systems are not "just statistics".

> or at the very least have a good go at Chollet's ARC challenge, which is trivial for humans.

I think you're overestimating humans here.