We haven't proven whether it's possible to always determine, using only a finite number of steps, whether two given mathematical expressions are truly equivalent.
open
Global / Unspecified, Global
WS01288
Certain classes of expressions can be checked for equivalence efficiently, but a fully general and guaranteed method covering every possible mathematical expression remains unresolved. This unresolved question has real consequences for automated theorem proving and symbolic computation.