The following pages link to Computability of Følner sets (Q4596402):
Displaying 13 items.
- The complexity types of computable sets (Q1190982) (← links)
- Følner functions and the generic word problem for finitely generated amenable groups (Q1663531) (← links)
- Warsaw discs and semicomputability (Q1709073) (← links)
- On decidability of amenability in computable groups (Q2085571) (← links)
- Partial word and equality problems and Banach densities (Q2180889) (← links)
- Sofic profiles of \(S(\omega)\) and computability (Q2663344) (← links)
- Singular coverings and non‐uniform notions of closed set computability (Q3528149) (← links)
- Computable copies of ℓ p 1 (Q4601032) (← links)
- (Q4849079) (← links)
- Computable paradoxical decompositions (Q5084297) (← links)
- Graph automaton groups (Q5154177) (← links)
- Computable Følner monotilings and a theorem of Brudno (Q5156795) (← links)
- Fluctuation bounds for ergodic averages of amenable groups (Q6175069) (← links)