Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-13T08:57:07.935Z Has data issue: false hasContentIssue false

Unsolvable Problems in Groups With Solvable Word Problem

Published online by Cambridge University Press:  20 November 2018

James McCool*
Affiliation:
University of Toronto, Toronto, Ontario
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let G be a finitely presented group with solvable word problem. It is of some interest to ask which other decision problems must necessarily be solvable for such a group. Thus it is easy to see that there exist effective procedures to determine whether or not such a group is trivial, or nilpotent of a given class. On the other hand, the conjugacy problem need not be solvable for such a group, for Fridman [5] has shown that the word problem is solvable for the group with unsolvable conjugacy problem given by Novikov [9].

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1970