1 problem
- 0 votes0 replies0 views
Natural computable-isometry examples of finitely generated groups with non-permutation word problems
Let a finitely generated group have a word problem, meaning that its word problem is a co-c.e. equivalence relation on words, but suppose it is not isomorphic to a finite…