Research4h 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 provably intractable, specifically EXPSPACE-complete. The findings prove that these models compress complex concepts far more efficiently than traditional logic. Practitioners must accept that formal verification of these architectures remains computationally impossible.