Partial Solution of The Word Problem
The word problem for a recursively presented group can be partially solved in the following sense:
-
- Given a recursive presentation P = ⟨X|R⟩ for a group G, define:
- then there is a partial recursive function fP such that:
- Given a recursive presentation P = ⟨X|R⟩ for a group G, define:
More informally, there is an algorithm that halts if u=v, but does not do so otherwise.
It follows that to solve the word problem for P it is sufficient to construct a recursive function g such that:
However u=v in G if and only if uv−1=1 in G. It follows that to solve the word problem for P it is sufficient to construct a recursive function h such that:
Read more about this topic: Word Problem For Groups
Famous quotes containing the words partial, solution, word and/or problem:
“It is characteristic of the epistemological tradition to present us with partial scenarios and then to demand whole or categorical answers as it were.”
—Avrum Stroll (b. 1921)
“Who shall forbid a wise skepticism, seeing that there is no practical question on which any thing more than an approximate solution can be had? Is not marriage an open question, when it is alleged, from the beginning of the world, that such as are in the institution wish to get out, and such as are out wish to get in?”
—Ralph Waldo Emerson (18031882)
“FriendMthe finest word in any language.”
—Talbot Jennings (18961985)
“Most childhood problems dont result from bad parenting, but are the inevitable result of the growing that parents and children do together. The point isnt to head off these problems or find ways around them, but rather to work through them together and in doing so to develop a relationship of mutual trust to rely on when the next problem comes along.”
—Fred Rogers (20th century)


