Research3h ago
Transformers Outperform Finite Automata In Expressive Succinctness
Transformers represent formal languages more succinctly than finite automata or Linear Temporal Logic formulas. This high expressive power makes verifying transformer properties provably intractable. The researchers categorize this verification task as EXPSPACE-complete. Practitioners must accept that formal guarantees for these models are computationally impossible to verify at scale.