Research4h 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 specific model properties is now proven to be EXPSPACE-complete. Practitioners face a fundamental wall where increased model efficiency makes formal safety verification computationally intractable.