Research3h ago
Transformers Outperform Finite Automata In Expressive Power
Transformers represent formal languages more succinctly than finite automata or Linear Temporal Logic formulas. This high expressive power makes verifying transformer properties EXPSPACE-complete, rendering the process provably intractable. The research establishes a formal theoretical limit on model verification. Practitioners must accept that complete safety guarantees for these architectures are computationally impossible.