  We call a group $G$ {\it 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.

Group Theory