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

Computable paradoxical decompositions

“…Groups of computable permutations of N are becoming an attractive object of investigations in computable algebra. We recommend the survey article [18] and the recent paper of the second author [10]. Theorem 1 shows how naturally these groups appear in computable amenability.…”