A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
We apply a construction of Rips to show that a number of algorithmic problems concerning certain small cancellation groups and, in particular, word hyperbolic groups, are recursively unsolvable. Given any integer k > 2, there is no algorithm to determine whether or not any small cancellation group can be generated by either two elements or more than k elements. There is a small cancellation group E such that there is no algorithm to determine whether or not any finitely generated subgroup of Edoi:10.1112/blms/26.1.97 fatcat:5hettjmfq5aqrmxg6wtmedftgy