Algorithmically complex residually finite groups

作者：Kharlampovich Olga; Myasnikov Alexei; Sapir Mark^*

来源：Bulletin of Mathematical Sciences, 2017, 7(2): 309-352.

DOI：10.1007/s13373-017-0103-z

• Word problem
• Depth function
• Dehn function
• Minsky machine

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.

• 出版日期2017-8