claim
Transformers can statistically approximate Turing machines running in time T with sample complexity polynomial in the alphabet size, state-space size, and T, as demonstrated by Wei et al. (2022a).
Authors
Sources
- A Survey on the Theory and Mechanism of Large Language Models arxiv.org via serper
Referenced by nodes (1)
- Transformers concept