AINeutralarXiv – CS AI · 3h ago6/10
🧠
Position: The Turing-Completeness of Autoregressive Transformers Relies Heavily on Context Management
A new arXiv paper challenges the widespread claim that Transformers are Turing-complete, arguing that existing proofs conflate two distinct computational settings. The research clarifies that real-world LLM deployment operates under fixed-system constraints where context management critically determines actual computational power, rather than the idealized scaling-family setting used in most theoretical proofs.