A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Sofic profiles of S(ω ) and computability
[article]
2020
arXiv
pre-print
We realize sofic profiles in the group of computable permutations of N so that the approximating morphisms can be viewed as restrictions of permutations to finite subsets of N. We also study some relevant effectivity conditions.
arXiv:2001.02648v1
fatcat:ttsaukr7hrb2rca4wq2ypzf4pi