English
Related papers

Related papers: Softmax Transformers are Turing-Complete

200 papers

The expressive power of transformers over inputs of unbounded size can be studied through their ability to recognize classes of formal languages. In this paper, we establish exact characterizations of transformers with hard attention (in…

Formal Languages and Automata Theory · Computer Science 2024-10-31 Andy Yang , David Chiang , Dana Angluin

Previous work has shown that the languages recognized by average-hard attention transformers (AHATs) and softmax-attention transformers (SMATs) are within the circuit complexity class TC$^0$. However, these results assume limited-precision…

Computational Complexity · Computer Science 2025-01-06 David Chiang

Chain-of-Thought (CoT) reasoning enables Large Language Models (LLMs) to solve complex reasoning tasks by generating intermediate reasoning steps. However, most existing approaches focus on hard token decoding, which constrains reasoning…

Computation and Language · Computer Science 2025-05-28 Yige Xu , Xu Guo , Zhiwei Zeng , Chunyan Miao

Constant bit-size Transformers are known to be Turing complete, but existing constructions require $\Omega(s(n))$ chain-of-thought (CoT) steps per simulated Turing machine (TM) step, leading to impractical reasoning lengths. In this paper,…

Computational Complexity · Computer Science 2025-12-03 Qian Li , Yuyi Wang

Chain-of-thought (CoT) supervision can substantially improve transformer performance, yet the mechanisms by which models learn to follow and benefit from CoT remain poorly understood. We investigate these learning dynamics through the lens…

Machine Learning · Computer Science 2025-10-31 Zihan Pengmei , Costas Mavromatis , Zhengyuan Shen , Yunyi Zhang , Vassilis N. Ioannidis , Huzefa Rangwala

Length generalization refers to the ability to extrapolate from short training sequences to long test sequences and is a challenge for current large language models. While prior work has proposed some architecture or data format changes to…

Machine Learning · Computer Science 2024-07-04 Kaiying Hou , David Brandfonbrener , Sham Kakade , Samy Jelassi , Eran Malach

Previous work on the learnability of transformers \textemdash\ focused primarily on examining their ability to approximate specific algorithmic patterns through training \textemdash\ has largely been data-driven, offering only probabilistic…

Machine Learning · Computer Science 2026-04-23 Debanjan Dutta , Anish Chakrabarty , Faizanuddin Ansari , Swagatam Das

Transformers are being used extensively across several sequence modeling tasks. Significant research effort has been devoted to experimentally probe the inner workings of Transformers. However, our conceptual and theoretical understanding…

Machine Learning · Computer Science 2020-10-13 Satwik Bhattamishra , Arkil Patel , Navin Goyal

Few-shot Chain-of-Thought (CoT) prompting has demonstrated strong performance in improving the reasoning capabilities of large language models (LLMs). While theoretical investigations have been conducted to understand CoT, the underlying…

Computation and Language · Computer Science 2024-10-23 Yingqian Cui , Pengfei He , Xianfeng Tang , Qi He , Chen Luo , Jiliang Tang , Yue Xing

It has been observed that transformers with greater depth (that is, more layers) have more capabilities, but can we establish formally which capabilities are gained? We answer this question with a theoretical proof followed by an empirical…

Computation and Language · Computer Science 2026-01-21 Andy Yang , Michaël Cadilhac , David Chiang

Vision transformers (ViTs) have pushed the state-of-the-art for various visual recognition tasks by patch-wise image tokenization followed by self-attention. However, the employment of self-attention modules results in a quadratic…

Computer Vision and Pattern Recognition · Computer Science 2022-05-03 Jiachen Lu , Jinghan Yao , Junge Zhang , Xiatian Zhu , Hang Xu , Weiguo Gao , Chunjing Xu , Tao Xiang , Li Zhang

One way to interpret the reasoning power of transformer-based language models is to describe the types of logical rules they can resolve over some input text. Recently, Chiang et al. (2023) showed that finite-precision transformers can be…

Machine Learning · Computer Science 2025-09-12 William Merrill , Ashish Sabharwal

Chain of thought is a natural inference-time method for increasing the computational power of transformer-based large language models (LLMs), but comes at the cost of sequential decoding. Are there more efficient alternatives to expand a…

Machine Learning · Computer Science 2025-11-07 William Merrill , Ashish Sabharwal

It is imperative to ensure the stability of every prediction made by a language model; that is, a language's prediction should remain consistent despite minor input variations, like word substitutions. In this paper, we investigate the…

Computation and Language · Computer Science 2024-06-06 Qian Lou , Xin Liang , Jiaqi Xue , Yancheng Zhang , Rui Xie , Mengxin Zheng

While Chain-of-Thought (CoT) prompting boosts Language Models' (LM) performance on a gamut of complex reasoning tasks, the generated reasoning chain does not necessarily reflect how the model arrives at the answer (aka. faithfulness). We…

Computation and Language · Computer Science 2023-09-22 Qing Lyu , Shreya Havaldar , Adam Stein , Li Zhang , Delip Rao , Eric Wong , Marianna Apidianaki , Chris Callison-Burch

We study succinctness as a measure of the expressive power of transformers. Succinctness -- how compactly a formalism can describe a language relative to other formalisms -- is a classical notion in logic and automata theory. We prove that…

Formal Languages and Automata Theory · Computer Science 2026-05-18 Pascal Bergsträßer , Ryan Cotterell , Anthony W. Lin

Chain-of-Thought (CoT) reasoning successfully enhances the reasoning capabilities of Large Language Models (LLMs), yet it incurs substantial computational overhead for inference. Existing CoT compression methods often suffer from a critical…

Machine Learning · Computer Science 2026-05-26 Yuntian Tang , Bohan Jia , Wenxuan Huang , Lianyue Zhang , Jiao Xie , Wenxi Li , Wei Li , Jie Hu , Xinghao Chen Rongrong Ji , Shaohui Lin

Generalization to novel compound tasks under distribution shift is important for deploying transformer-based language models (LMs). This work investigates Chain-of-Thought (CoT) reasoning as a means to enhance OOD generalization. Through…

Computation and Language · Computer Science 2026-03-31 Ru Wang , Wei Huang , Selena Song , Haoyu Zhang , Qian Niu , Yusuke Iwasawa , Yutaka Matsuo , Jiaxian Guo

Chain-of-thought (CoT) prompting boosts Large Language Models accuracy on multi-step tasks, yet whether the generated "thoughts" reflect the true internal reasoning process is unresolved. We present the first feature-level causal study of…

Computation and Language · Computer Science 2025-08-01 Xi Chen , Aske Plaat , Niki van Stein

Chain of Thought (CoT) prompting has been shown to significantly improve the performance of large language models (LLMs), particularly in arithmetic and reasoning tasks, by instructing the model to produce intermediate reasoning steps.…

Machine Learning · Computer Science 2025-03-03 Jianhao Huang , Zixuan Wang , Jason D. Lee