{
  "aliases": [
    "reducibility-relation",
    "reduction-recursion-theory"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn computability theory, many **reducibility relations** (also called **reductions**, **reducibilities**, and **notions of reducibility**) are studied. They are motivated by the question: given sets $A$ and $B$ of natural numbers, is it possible to effectively convert a method for deciding membership in $B$ into a method for deciding membership in $A$? If the answer to this question is affirmative then $A$ is said to be **reducible to** $B$.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "aliases": [
      "reducibility-relation",
      "reduction-recursion-theory"
    ],
    "inventory": [
      "MJX9D5T7SK"
    ],
    "kind": "concept",
    "name": "Reduction (computability theory)",
    "same_as": {
      "wikidata": "Q7306360",
      "wikipedia": "Reduction (computability theory)"
    },
    "sources": [
      {
        "locator": "Reduction (computability theory)",
        "mention": "wikipedia://en/9719800",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:9719800@r1353400901"
      }
    ],
    "tag": "Y6VV7N0FNE"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/Y6VV7N0FNE/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/Y6VV7N0FNE.md",
  "msc": null,
  "name": "Reduction (computability theory)",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/Y6V/Y6VV7N0FNE.md",
  "status": null,
  "tag": "Y6VV7N0FNE",
  "uri": "m2://Y6VV7N0FNE",
  "url": "https://math2.tamnd.com/wiki/reduction-computability-theory/",
  "writing": {
    "tag": "Y6VV7N0FNE",
    "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
      }
    ]
  }
}