  We show that for every sofic chunk $E$ there is a bijective homomorphism $f:
E_c \rightarrow 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.
