The following pages link to Algorithmically finite groups. (Q640937):
Displaying 20 items.
- Residually finite algorithmically finite groups, their subgroups and direct products. (Q276638) (← links)
- Random equations in nilpotent groups. (Q435936) (← links)
- An algorithm computing homotopy groups. (Q1565828) (← links)
- Følner functions and the generic word problem for finitely generated amenable groups (Q1663531) (← links)
- Computability theory. Abstracts from the workshop held January 7--13, 2018 (Q1731969) (← links)
- Partial word and equality problems and Banach densities (Q2180889) (← links)
- Detecting properties from descriptions of groups (Q2309493) (← links)
- Algorithms determining finite simple images of finitely presented groups (Q2326469) (← links)
- Algorithmic recognition of infinite cyclic extensions (Q2396795) (← links)
- Algorithms for permutability in finite groups. (Q2440508) (← links)
- An algorithm for constructing representations of finite groups. (Q2456566) (← links)
- Algorithmic recognizability of the finiteness property of finite-definite systems (Q2885204) (← links)
- Generalized algorithm for modeling periodic groups. (Q2885298) (← links)
- Golod-Shafarevich groups: a survey. (Q2909484) (← links)
- Asymptotic Density and the Theory of Computability: A Partial Survey (Q2970976) (← links)
- Search problems in groups and branching processes (Q5252307) (← links)
- ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS (Q5401598) (← links)
- Finitely presented expansions of groups, semigroups, and algebras (Q5401728) (← links)
- Classifying word problems of finitely generated algebras via computable reducibility (Q6116397) (← links)
- Self-avoiding walks on Cayley graphs through the lens of symbolic dynamics (Q6635179) (← links)
