TY - JOUR
T1 - Algorithmically complex residually finite groups
AU - Kharlampovich, Olga
AU - Myasnikov, Alexei
AU - Sapir, Mark
N1 - Publisher Copyright:
© 2017, The Author(s).
PY - 2017/8/1
Y1 - 2017/8/1
N2 - We construct the first examples of algorithmically complex finitely presented residually finite groups and the first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn functions, and arbitrarily large depth functions. The groups are solvable of class 3.
AB - We construct the first examples of algorithmically complex finitely presented residually finite groups and the first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn functions, and arbitrarily large depth functions. The groups are solvable of class 3.
KW - Dehn function
KW - Depth function
KW - Minsky machine
KW - Word problem
UR - http://www.scopus.com/inward/record.url?scp=85024378829&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85024378829&partnerID=8YFLogxK
U2 - 10.1007/s13373-017-0103-z
DO - 10.1007/s13373-017-0103-z
M3 - Article
AN - SCOPUS:85024378829
SN - 1664-3607
VL - 7
SP - 309
EP - 352
JO - Bulletin of Mathematical Sciences
JF - Bulletin of Mathematical Sciences
IS - 2
ER -