Are autoregressive transformers really Turing-complete? Not so fast. Researchers from Renmin University of China show that most proofs of Turing-completeness rely on scaling model size or context length, but real-world LLMs operate with fixed settings. Their key insight:

→ View original post on X — @jiqizhixin