Algorithmically finite groups

作者：Myasnikov Alexei; Osin Denis^*

来源：Journal of Pure and Applied Algebra, 2011, 215(11): 2789-2796.

DOI：10.1016/j.jpaa.2011.03.019

We call a group G algorithmically finite if no algorithm can produce an infinite set of pairwise distinct elements of G. We construct examples of recursively presented infinite algorithmically finite groups and study their properties. For instance, we show that the Equality Problem is decidable in our groups only on strongly (exponentially) negligible sets of inputs.

• 出版日期2011-11