Standard CoT transformers are limited to TC^0 for length-generalizable reasoning but can simulate Turing machines with linear-length traces if vocabulary grows, using signpost tokens and change encodings.
Thus the generated CoT is a string overΞ∪ C
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Barriers to Universal Reasoning With Transformers (And How to Overcome Them)
Standard CoT transformers are limited to TC^0 for length-generalizable reasoning but can simulate Turing machines with linear-length traces if vocabulary grows, using signpost tokens and change encodings.