{
  "id": "2001.02648",
  "version": "v1",
  "published": "2020-01-08T17:46:37.000Z",
  "updated": "2020-01-08T17:46:37.000Z",
  "title": "Sofic profiles of $S(ω)$ and computability",
  "authors": [
    "A. Ivanov"
  ],
  "comment": "17 pages",
  "categories": [
    "math.LO",
    "math.GR"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-01-08T17:46:37.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "03D45",
      "20A15",
      "20B35"
    ],
    "keywords": [
      "computability",
      "relevant effectivity conditions",
      "realize sofic profiles",
      "finite subsets",
      "computable permutations"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 17,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}