{
  "id": "1109.6128",
  "version": "v1",
  "published": "2011-09-28T08:54:38.000Z",
  "updated": "2011-09-28T08:54:38.000Z",
  "title": "Strong jump traceability and Demuth randomness",
  "authors": [
    "Noam Greenberg",
    "Daniel Turetsky"
  ],
  "comment": "28 pages",
  "categories": [
    "math.LO"
  ],
  "abstract": "We solve the covering problem for Demuth randomness, showing that a computably enumerable set is computable from a Demuth random set if and only if it is strongly jump-traceable. We show that on the other hand, the class of sets which form a base for Demuth randomness is a proper subclass of the class of strongly jump-traceable sets.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-09-28T08:54:38.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "demuth randomness",
      "strong jump traceability",
      "demuth random set",
      "proper subclass",
      "computably enumerable set"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 28,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1109.6128G"
    }
  }
}