Research3h ago
Transformers Outperform Finite Automata In Expressive Power
A new proof demonstrates that Transformers represent formal languages more succinctly than finite automata or Linear Temporal Logic formulas. This high expressive power creates a critical trade-off. Verifying transformer properties is now provably intractable, specifically EXPSPACE-complete. Practitioners must accept that formal verification of these models remains computationally impossible for complex properties.