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:
“We were soon in the smooth water of the Quakish Lake,... and we had our first, but a partial view of Ktaadn, its summit veiled in clouds, like a dark isthmus in that quarter, connecting the heavens with the earth.”
—Henry David Thoreau (18171862)
“To the questions of the officiously meddling police Falter replied absently and tersely; but, when he finally grew tired of this pestering, he pointed out that, having accidentally solved the riddle of the universe, he had yielded to artful exhortation and shared that solution with his inquisitive interlocutor, whereupon the latter had died of astonishment.”
—Vladimir Nabokov (18991977)
“The crime of book purging is that it involves a rejection of the word. For the word is never absolute truth, but only mans frail and human effort to approach the truth. To reject the word is to reject the human search.”
—Max Lerner (b. 1902)
“And just as there are no words for the surface, that is,
No words to say what it really is, that it is not
Superficial but a visible core, then there is
No way out of the problem of pathos vs. experience.”
—John Ashbery (b. 1927)


