{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn computability theory, a Turing degree \\[*X*\\] is **low** if its Turing jump \\[*X*′\\] = 0′. A subset $S \\subset \\mathbb{N}$ is **low** if its Turing degree is low.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "inventory": [
      "G7RDZXC5TC"
    ],
    "kind": "concept",
    "name": "Low (computability)",
    "same_as": {
      "wikidata": "Q6692805",
      "wikipedia": "Low (computability)"
    },
    "sources": [
      {
        "locator": "Low (computability)",
        "mention": "wikipedia://en/9767106",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:9767106@r1350018931"
      }
    ],
    "tag": "DKQG0X84D9"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/DKQG0X84D9/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/DKQG0X84D9.md",
  "msc": null,
  "name": "Low (computability)",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/DKQ/DKQG0X84D9.md",
  "status": null,
  "tag": "DKQG0X84D9",
  "uri": "m2://DKQG0X84D9",
  "url": "https://math2.tamnd.com/wiki/low-computability/",
  "writing": {
    "tag": "DKQG0X84D9",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}