word problem.

Unsolvability of the uniform word problem

The criterion given above, for the solvability of the word problem in a single group, can be extended by a straightforward argument. This gives the following criterion for the uniform solvability of the word problem for a class of finitely presented groups:

::To solve the uniform word problem for a class of groups, it is sufficient to find a recursive function that takes a finite presentation for a group and a word in the generators of , such that whenever

1.Previous
3.Next