%0 Journal Article
%T Residually finite algorithmically finite groups, their subgroups and direct products
%A Anton A. Klyachko
%A Ayrana K. Mongush
%J Mathematics
%D 2014
%I arXiv
%R 10.1134/S0001434615090060
%X We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in the sense that $G$ contains an infinite abelian normal subgroup while all finite Cartesian powers of $G$ are algorithmically finite (i.e., for any positive integer $n$, there is no algorithm which writes out an infinite sequence of pairwise different elements of $G^n$). We also state several related problems.
%U http://arxiv.org/abs/1402.0887v2