{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nThe **low basis theorem** is one of several basis theorems in computability theory, each of which show that, given an infinite subtree of the binary tree $2^{\u003c\\omega}$, it is possible to find an infinite path through the tree with particular computability properties. The low basis theorem, in particular, shows that there must be a path which is low; that is, the Turing jump of the path is Turing equivalent to the halting problem $\\emptyset'$.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "inventory": [
      "7P0QV62QQY"
    ],
    "kind": "statement",
    "name": "Low basis theorem",
    "role": "proposition",
    "same_as": {
      "wikidata": "Q6692975",
      "wikipedia": "Low basis theorem"
    },
    "sources": [
      {
        "locator": "Low basis theorem",
        "mention": "wikipedia://en/9767227",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:9767227@r1367028045"
      }
    ],
    "tag": "G8WRRVC0Z3"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/G8WRRVC0Z3/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/G8WRRVC0Z3.md",
  "msc": null,
  "name": "Low basis theorem",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/G8W/G8WRRVC0Z3.md",
  "status": null,
  "tag": "G8WRRVC0Z3",
  "uri": "m2://G8WRRVC0Z3",
  "url": "https://math2.tamnd.com/wiki/low-basis-theorem/",
  "writing": {
    "tag": "G8WRRVC0Z3",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}