Word problem (mathematics)
Decision problem pertaining to equivalence of expressions / From Wikipedia, the free encyclopedia
This article is about algorithmic word problems in mathematics and computer science. For other uses, see Word problem.
In computational mathematics, a word problem is the problem of deciding whether two given expressions are equivalent with respect to a set of rewriting identities. A prototypical example is the word problem for groups, but there are many other instances as well. A deep result of computational theory is that answering this question is in many important cases undecidable.[1]