The Topological Trouble With Transformers
Transformers encode structure in sequences via an expanding contextual history. However, their purely feedforward architecture fundamentally limits dynamic state tracking. State tracking—the iterative updating of latent variables reflecting an evolving environment—involves inherently sequential dependencies that feedforward networks struggle to maintain. Consequently, feedforward models push evolving state representations deeper into their layer stack with each new input step, rendering information inaccessible in shallow layers and ultimately exhausting the model’s depth. While this depth limit can be bypassed by dynamic depth models and by explicit or latent thinking that externalizes state representations, these solutions are computationally and memory inefficient. In this article, we argue that temporally extended cognition requires refocusing from explicit thought traces to implicit activation dynamics via recurrent architectures. We introduce a taxonomy of recurrent and continuous-thought transformer architectures, categorizing them by their recurrence axis (depth versus step) and their ratio of input tokens to recurrence steps.
Introduction. Progress in understanding human cognition has resulted from conceptualizing the brain as a dynamical system. In terms of its hardware, the physical brain is composed of billions of interacting neurons whose collective behavior is inherently dynamical. In terms of its function, the emergent mind can be usefully modeled as a dynamical process with a high-dimensional state, s, that evolves over time, modulated by external stimuli, x. These levels can be bridged by formalizing the state progression as st = f(st−1, xt), assuming discrete time t. From this perspective, an ideal architecture for modeling temporally extended cognition would be a recurrent neural network (RNN), which explicitly performs such a state-update operation. In principle, gradient-based training procedures might discover the function f from data such that the important input signals would be integrated into the state representation and held until later required.
Discussion / Conclusion. Although the transformer’s feedforward design has expanded the limits of context-based retrieval, its topological structure remains fundamentally at odds with the iterative nature of state tracking. As we have argued, the current reliance on explicit natural-language-like “thought” to bypass depth limitations is an inefficient workaround for a structural deficiency. By transitioning toward implicit, recurrent activation dynamics, we can move beyond these depth-limited constraints to attain robust long-term coherence and multihop inference. The taxonomy and research directions proposed in this article provide a roadmap for improving sequential inference dependencies without sacrificing the foundational strengths of modern models. Ultimately, bridging the gap between the transformer’s parallel efficiency and the brain’s inherent dynamical nature is essential. The next generation of foundation models must do more than simply re-scan the past; they must maintain a fluid, evolving representation of reality that persists across the many time scales required for temporally extended cognition.
Lines of inquiry this paper opens 24
Research framings built by reading the notes related to this paper — the questions it feeds into.
What structural biases does transformer attention create in language model outputs? Does recurrence enable reasoning capabilities that fixed-depth transformers cannot achieve?- How do transformers perform multi-hop reasoning across distant training documents?
- How does error propagation limit transformer performance on complex tasks?
- Can symbolic mechanisms improve transformer compositional abilities?
- How does circuit complexity limit which grammatical structures transformers can acquire?
- Can latent recurrence and energy minimization both escape the same computational depth constraints?
- Can neural networks implement genuine algorithms or only statistical pattern matching?
- Why do standard transformers fail on problems requiring serial algorithmic reasoning?
- Could graph neural networks fundamentally outperform transformers on structured reasoning?
- Can any architecture fundamentally solve problems that require inherently sequential computation?
- Why do standard transformers fail to encode recursive structure in their hidden states?
- Why do human-designed neural architectures eventually get replaced by learned ones?
- Why do scaling laws fail to predict optimal architectures at small parameter counts?
- How do biological brains organize computation across different cortical timescales?
- Why do hierarchical architectures better implement the deep research definition?
- How do hierarchical architectures separate planning from retrieval differently than flat ones?
- Does architectural design matter more than model scale for reasoning tasks?