Research2d ago
Transformers Outperform Finite Automata in Expressive Power
Transformers represent formal languages more succinctly than Linear Temporal Logic or finite automata. This high expressivity proves that verifying specific transformer properties is EXPSPACE-complete. The finding confirms that formal verification of these models is provably intractable. Researchers must now find alternative methods to ensure reliability since traditional verification fails at scale.