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:
“And meanwhile we have gone on living,
Living and partly living,
Picking together the pieces,
Gathering faggots at nightfall,
Building a partial shelter,
For sleeping and eating and drinking and laughter.”
—T.S. (Thomas Stearns)
“I cant quite define my aversion to asking questions of strangers. From snatches of family battles which I have heard drifting up from railway stations and street corners, I gather that there are a great many men who share my dislike for it, as well as an equal number of women who ... believe it to be the solution to most of this worlds problems.”
—Robert Benchley (18891945)
“Go bring him home to his people.
Lay him in state on a sepal.
Wrap him for shroud in a petal.
Embalm him with ichor of nettle.
This is the word of your Queen.”
—Robert Frost (18741963)
“A curious thing about the ontological problem is its simplicity. It can be put in three Anglo-Saxon monosyllables: What is there? It can be answered, moveover, in a wordEverything.”
—Willard Van Orman Quine (b. 1908)