Sofic profiles of $S(\omega )$ and computability

Abstract

We show that for every sofic chunk $E$ there is a bijective homomorphism $f:E_c\to E$, where $E_c$ is a chunk of the group of computable permutations of $\mathbb{N}$ so that the approximating morphisms of $E$ can be viewed as restrictions of permutations of $E_c$ to finite subsets of $\mathbb{N}$. Using this we study some relevant effectivity conditions associated with sofic chunks and their profiles.

This is a revised version of the paper, 21 pages

References in corpus (2)

• Følner functions and the generic Word Problem for finitely generated amenable groups
• Computability of Følner sets