Hacker News new | ask | show | jobs
by famouswaffles 1063 days ago
With memory they are. https://arxiv.org/abs/2301.04589
1 comments

You are mixing up LLMs with Transformers. Transformers with memory are Turing complete, but AFAIK, current state of the art LLMs aren't trained with any kind of memory.
I'm not. The paper specifically deals with language models in particular. Memory is just dynamically inserted context
So as I see it, it's possible to teach SOTA LLM with prompts to emulate a state machine part of the Turing machine. Am I right?
Ok. I see. Sorry.