Cover Image

Softmax Transformers are Turing-Complete

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jiang, Hongjian, Hahn, Michael, Zetzsche, Georg, Lin, Anthony Widjaja
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory Machine Learning Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Synthesis and Verification of Transformer Programs (Technical Report)
by: Jiang, Hongjian, et al.
Published: (2026)

Length Generalization Bounds for Transformers
by: Yang, Andy, et al.
Published: (2026)

The Counting Power of Transformers
by: Sälzer, Marco, et al.
Published: (2025)

Fast Ramsey Quantifier Elimination in LIRA (with applications to liveness checking)
by: Lichtner, Kilian, et al.
Published: (2025)

Counting Like Transformers: Compiling Temporal Counting Logic Into Softmax Transformers
by: Yang, Andy, et al.
Published: (2024)

Slice closures of indexed languages and word equations with counting constraints
by: Ciobanu, Laura, et al.
Published: (2024)

Existential Definability over the Subword Ordering
by: Baumann, Pascal, et al.
Published: (2022)

Transformers are Inherently Succinct
by: Bergsträßer, Pascal, et al.
Published: (2025)

An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)

General Decidability Results for Systems with Continuous Counters
by: Balasubramanian, A. R., et al.
Published: (2025)

HornStr: Invariant Synthesis for Regular Model Checking as Constrained Horn Clauses(Technical Report)
by: Jiang, Hongjian, et al.
Published: (2025)

The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective
by: Bergsträßer, Pascal, et al.
Published: (2024)

The Role of Logic and Automata in Understanding Transformers
by: Lin, Anthony W., et al.
Published: (2025)

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
by: Shakiba, Yousef, et al.
Published: (2025)

The complexity of downward closures of indexed languages
by: Mandel, Richard, et al.
Published: (2026)

Masked Hard-Attention Transformers Recognize Exactly the Star-Free Languages
by: Yang, Andy, et al.
Published: (2023)

Stochastic Process Turing Machines
by: Wolpert, David, et al.
Published: (2024)

What Formal Languages Can Transformers Express? A Survey
by: Strobl, Lena, et al.
Published: (2023)

Parikh's Theorem Made Symbolic
by: Hague, Matthew, et al.
Published: (2023)

A Completeness Theorem for Probabilistic Regular Expressions
by: Różowski, Wojciech, et al.
Published: (2023)

Complete Test Suites for Automata in Monoidal Closed Categories
by: Kocsis, Bálint, et al.
Published: (2024)

A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead
by: Nakamura, Yoshiki
Published: (2026)

RNN Generalization to Omega-Regular Languages
by: Pert, Charles, et al.
Published: (2025)

On the Expressiveness of State Space Models via Temporal Logics
by: Alsmann, Eric, et al.
Published: (2026)

Learning Quantitative Automata Modulo Theories
by: Hsiung, Eric, et al.
Published: (2024)

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
by: Daviaud, Laure, et al.
Published: (2023)

Cypher is Turing-Complete: A Formal Proof via 2-Counter Machine Simulation
by: Halftermeyer, Pierre
Published: (2026)

Image Reflection on Process Graphs -- A Novel Approach for the Completeness of an Axiomatization of 1-Free Regular Expressions Modulo Bisimilarity
by: Zhang, Yuanrui, et al.
Published: (2023)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

Weighted GKAT: Completeness and Complexity
by: Van Koevering, Spencer, et al.
Published: (2025)

Model-Free Learning of Safe yet Effective Controllers
by: Bozkurt, Alper Kamil, et al.
Published: (2021)

Separators in Continuous Petri Nets
by: Blondin, Michael, et al.
Published: (2022)

Dynamic Programming for Symbolic Boolean Realizability and Synthesis
by: Lin, Yi, et al.
Published: (2024)

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)

Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)

Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)

Parameterized Verification of Quantum Circuits (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2025)