3 ms·
LLMs are turing complete ( https://arxiv.org/abs/2411.01992 https://arxiv.org/abs/2411.01992 ). Or what is your definition of 'count'?
by zihotki 1y ago
LLMs are turing complete ( https://arxiv.org/abs/2411.01992 https://arxiv.org/abs/2411.01992 ). Or what is your definition of 'count'?
- yencabulator 1y agoThat's not what the paper says. It says it possible to construct weights that when run through inference will perform Turing machine -equivalent operations on prompts that are specifically made for that purpose. That does not mean weights derived from a pile of books will do such a thing.