Algorithmically finite groups.

DOI10.1016/j.jpaa.2011.03.019zbMath1233.20031arXiv1012.1653OpenAlexW1979073518MaRDI QIDQ640937

Alexei G. Myasnikov, Denis V. Osin

Publication date: 21 October 2011

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.1653

zbMATH Keywords

algorithmsfinitely generated groupsword problemconjugacy problemalgorithmically finite groupsrecursively presented groupsequality problemDehn monsters

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (11)

Residually finite algorithmically finite groups, their subgroups and direct products. ⋮ GOLOD–SHAFAREVICH GROUPS: A SURVEY ⋮ Følner functions and the generic word problem for finitely generated amenable groups ⋮ Partial word and equality problems and Banach densities ⋮ Classifying word problems of finitely generated algebras via computable reducibility ⋮ Random equations in nilpotent groups. ⋮ Asymptotic Density and the Theory of Computability: A Partial Survey ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS ⋮ Finitely presented expansions of groups, semigroups, and algebras ⋮ Search problems in groups and branching processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average-case complexity and decision problems in group theory.
• Exponentially generic subsets of groups
• Golod-Shafarevich groups with property \((T)\) and Kac-Moody groups.
• A simple presentation of a group with unsolvable word problem
• Elementary amenable groups
• Cogrowth and amenability of discrete groups
• Generic-case complexity, decision problems in group theory, and random walks.
• The halting problem is decidable on a set of asymptotic probability one
• Simple examples of groups with unsolvable word problem
• Kazhdan quotients of Golod-Shafarevich groups
• The Word Problem for Groups
• On the algorithmic insolvability of the word problem in group theory
• Generic complexity of undecidable problems
• Non-Backtracking Random Walks and Cogrowth of Graphs
• MULTIPLICATIVE MEASURES ON FREE GROUPS
• Recursive Unsolvability of a problem of Thue
• The word problem

This page was built for publication: Algorithmically finite groups.