{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "18DPY9J8YP"
    },
    {
      "field": "uses",
      "target": "4H35VQ16DC"
    },
    {
      "field": "uses",
      "target": "7RP93F2W47"
    },
    {
      "field": "uses",
      "target": "97QF3KHSBY"
    },
    {
      "field": "uses",
      "target": "AKDR5YBBE2"
    },
    {
      "field": "uses",
      "target": "C19Z3B6V4P"
    },
    {
      "field": "uses",
      "target": "DN5G4NAF95"
    },
    {
      "field": "uses",
      "target": "E6MB6B3YQ0"
    },
    {
      "field": "uses",
      "target": "F3Z30M606H"
    },
    {
      "field": "uses",
      "target": "H5CW67CCST"
    },
    {
      "field": "uses",
      "target": "MWSD85BB4X"
    },
    {
      "field": "uses",
      "target": "W6D5ZJAY9D"
    },
    {
      "field": "uses",
      "target": "Y1N80NR1CG"
    },
    {
      "field": "uses",
      "target": "YWX4FCFPAP"
    },
    {
      "field": "specializes",
      "target": "5NVA2JRHPV"
    },
    {
      "field": "about",
      "target": "AKDR5YBBE2"
    },
    {
      "field": "about",
      "target": "F3Z30M606H"
    },
    {
      "field": "about",
      "target": "YWX4FCFPAP"
    },
    {
      "field": "defines",
      "target": "D9AWNH60RM"
    },
    {
      "field": "instance_of",
      "target": "N470JF7ZJX"
    }
  ],
  "body": "\n## Summary\n\nA computable function is a function on the natural numbers whose values can be calculated by an algorithm.\nFormally, it is a partial function computed by a [[Turing machine|758EYCN27B]], and this class equals the class of partial [[general recursive functions|HBK5QHC1GC]].\nComputable functions are the central objects of [[computability theory|X14Y880PN5]].\nSome functions, such as the one that tells whether a program halts, are well defined but not computable.\n\n## Explanations\n\n### L1 human\n\nA function is computable if there is a mechanical procedure that, given an input, eventually produces the output.\nAddition, multiplication and the test \"is $n$ prime?\" are computable: there are clear step-by-step recipes for them.\nA partial computable function may have no value at some inputs, because the procedure runs forever there.\nThe surprise of the 1930s was that some precisely defined functions have no such procedure at all.\n",
  "commit": "547b6eddb8f2feb8d579f2d633d22a27b7e132fc",
  "front": {
    "kind": "concept",
    "msc": [
      "03D20",
      "03D10"
    ],
    "name": "Computable function",
    "same_as": {
      "wikidata": "Q1148456",
      "wikipedia": "Computable function"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Computable_function"
      }
    ],
    "specializes": [
      "0EPAT51DXQ"
    ],
    "tag": "KZSB5E471K"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/KZSB5E471K/",
  "links": [
    {
      "field": "specializes",
      "target": "0EPAT51DXQ"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/KZSB5E471K.md",
  "msc": [
    "03D20",
    "03D10"
  ],
  "name": "Computable function",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/KZS/KZSB5E471K.md",
  "status": null,
  "tag": "KZSB5E471K",
  "uri": "m2://KZSB5E471K",
  "url": "https://math2.tamnd.com/wiki/computable-function/",
  "writing": {
    "tag": "KZSB5E471K",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}