Algorithmically finite groups. (Q640937)

The authors say that a finitely generated group is algorithmically finite if no algorithm can produce an infinite subset of the group. Using Golod-Shafarevich presentations as a tool, they build what they call Dehn monsters, that is infinite and recursively presented groups which are also algorithmically finite. They mention the challenging problem of imposing further the finite presentability of the group. The authors also study some properties of their Dehn monsters; for instance, they show that in such groups the Equality Problem is decidable only on sets of inputs which are strongly negligible in some appropriate sense.