Algorithmically finite groups

Alexei Myasnikov, Denis Osin

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)2789-2796
Number of pages8
JournalJournal of Pure and Applied Algebra
Volume215
Issue number11
DOIs
StatePublished - Nov 2011

Fingerprint

Dive into the research topics of 'Algorithmically finite groups'. Together they form a unique fingerprint.

Cite this