[lostmsu]

> It always finishes in finite time so it is not Turing complete.

This is incorrect. The simplest LLM inference is basically a `do { choose_word(...); } until (word == '<special stop word>');` loop. That loop may never stop.