Transformers represent formal languages more succinctly than finite automata or Linear Temporal Logic formulas. This high expressive power comes with a cost. Researchers prove that verifying transformer properties is EXPSPACE-complete, making the process provably intractable. This finding warns practitioners that formal verification of large-scale models remains computationally impossible for most practical applications.