History
Throughout the history of the subject, computations in groups have been carried out using various normal forms. These usually implicitly solve the word problem for the groups in question. In 1911 Max Dehn proposed that the word problem was an important area of study in its own right, (Dehn 1911), together with the conjugacy problem and the group isomorphism problem. In 1912 he gave an algorithm that solves both the word and conjugacy problem for the fundamental groups of closed orientable two-dimensional manifolds of genus greater than or equal to 2, (Dehn 1912). Subsequent authors have greatly extended Dehn's algorithm and applied it to a wide range of group theoretic decision problems.
It was shown by Pyotr Novikov in 1955 that there exists a finitely generated (in fact, a finitely presented) group G such that the word problem for G is undecidable. It follows immediately that the uniform word problem is also undecidable. A different proof was obtained by William Boone in 1958.
The word problem was one of the first examples of an unsolvable problem to be found not in mathematical logic or the theory of algorithms, but in one of the central branches of classical mathematics, algebra. As a result of its unsolvability, several other problems in combinatorial group theory have been shown to be unsolvable as well.
It is important to realize that the word problem is in fact solvable for many groups G. For example, polycyclic groups have solvable word problems since the normal form of an arbitrary word in a polycyclic presentation is readily computable; other algorithms for groups may, in suitable circumstances, also solve the word problem, see the Todd–Coxeter algorithm and the Knuth–Bendix completion algorithm. On the other hand the fact that a particular algorithm does not solve the word problem for a particular group does not show that the group has unsolvable word problem. For instance Dehn's algorithm does not solve the word problem for the fundamental group of the torus. However this group is the direct product of two infinite cyclic groups and so has solvable word problem.
Read more about this topic: Word Problem For Groups
Famous quotes containing the word history:
“Three million of such stones would be needed before the work was done. Three million stones of an average weight of 5,000 pounds, every stone cut precisely to fit into its destined place in the great pyramid. From the quarries they pulled the stones across the desert to the banks of the Nile. Never in the history of the world had so great a task been performed. Their faith gave them strength, and their joy gave them song.”
—William Faulkner (1897–1962)
“Jesus Christ belonged to the true race of the prophets. He saw with an open eye the mystery of the soul. Drawn by its severe harmony, ravished with its beauty, he lived in it, and had his being there. Alone in all history he estimated the greatness of man.”
—Ralph Waldo Emerson (1803–1882)
“Bias, point of view, fury—are they ... so dangerous and must they be ironed out of history, the hills flattened and the contours leveled? The professors talk ... about passion and point of view in history as a Calvinist talks about sin in the bedroom.”
—Catherine Drinker Bowen (1897–1973)