arXiv Analytics

Sign in

arXiv:2001.02648 [math.LO]AbstractReferencesReviewsResources

Sofic profiles of $S(ω)$ and computability

A. Ivanov

Published 2020-01-08Version 1

We realize sofic profiles in the group of computable permutations of $\mathbb{N}$ so that the approximating morphisms can be viewed as restrictions of permutations to finite subsets of $\mathbb{N}$. We also study some relevant effectivity conditions.

Comments: 17 pages
Categories: math.LO, math.GR
Subjects: 03D45, 20A15, 20B35
Related articles: Most relevant | Search more
arXiv:2007.14801 [math.LO] (Published 2020-07-29)
On the computability of ordered fields
arXiv:math/9711204 [math.LO] (Published 1997-11-25)
Aspects of Computability in Physics
arXiv:1509.02992 [math.LO] (Published 2015-09-10)
On computability and disintegration

Links

Toolbox