Word Problem (mathematics)
In mathematics and computer science, a word problem for a set S with respect to a system of finite encodings of its elements is the algorithmic problem of deciding whether two given representatives represent the same element of the set. The problem is commonly encountered in abstract algebra, where given a presentation of an algebraic structure by generators and relators, the problem is to determine if two expressions represent the same element; a prototypical example is the word problem for groups. Less formally, the word problem in an algebra is: given a set of identities E, and two expressions x and y, is it possible to transform x into y using the identities in E as rewriting rules in both directions? While answering this question may not seem hard, the remarkable (and deep) result that emerges, in many important cases, is that the problem is undecidable.
Many, if not most all, undecidable problems in mathematics can be posed as word problems; see the list of undecidable problems for many examples.
Read more about Word Problem (mathematics): Background and Motivation, The Word Problem in Combinatorial Calculus, The Word Problem in Universal Algebra, See Also
Famous quotes containing the words word and/or problem:
““Mother” is the first word that occurs to politicians and columnists and popes when they raise the question, “Why isn’t life turning out the way we want it?””
—Mary Kay Blakely (20th century)
“You are a problem and rune,
you are mystery;
writ on a stone.”
—Hilda Doolittle (1886–1961)