this is very wrong. LLMs are very much not Turing complete, but they are algorithms on a computer so they definitely can't compute anything uncomputable
"Essentially"
This is the #1 pedantic thing HN frequenters flail over.
Turing built a limited machine, bound to a finite tape.
Bravo.
This is immediately obvious if you look at it through a statistical learning lens and not the mysticism crystal ball that many view NN’s through.
That is the existential, $1T question.