{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "Y1N80NR1CG"
    }
  ],
  "body": "\n## Summary\n\nThe priority method is a technique to build [[computably enumerable sets|TN9G24VABN]] with prescribed properties.\nThe desired property is split into infinitely many requirements, ordered by priority, and the set is built in stages.\nWhen requirements conflict, the one of higher priority wins, and a requirement that loses is injured and starts again.\nIt was introduced to solve [[Post's problem|1RVF7DWG8C]] and is the main tool for constructions in the theory of [[Turing degrees|P5N2ND3VCG]].\n\n## Explanations\n\n### L1 human\n\nImagine a list of infinitely many people who each want something from a shared building project.\nTheir wishes may conflict, so each has a rank: the first person always gets their way, the second gets their way unless the first objects, and so on.\nA person whose work is undone just starts over.\nIf each person is disturbed only finitely often, in the end everyone is satisfied.\nIn the [[Friedberg–Muchnik theorem|RA358M9QCN]], the wishes say \"set $A$ is not computed from $B$ by the $e$-th program\" and the same with $A$ and $B$ swapped.\n",
  "commit": "547b6eddb8f2feb8d579f2d633d22a27b7e132fc",
  "front": {
    "kind": "concept",
    "msc": [
      "03D25",
      "03D28"
    ],
    "name": "Priority method",
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Turing_degree"
      }
    ],
    "tag": "3BZFSC5QZ2"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/3BZFSC5QZ2/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/3BZFSC5QZ2.md",
  "msc": [
    "03D25",
    "03D28"
  ],
  "name": "Priority method",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/3BZ/3BZFSC5QZ2.md",
  "status": null,
  "tag": "3BZFSC5QZ2",
  "uri": "m2://3BZFSC5QZ2",
  "url": "https://math2.tamnd.com/wiki/priority-method/",
  "writing": {
    "tag": "3BZFSC5QZ2",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      },
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}