{
  "aliases": [
    "course-of-value-recursion"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn computability theory, **course-of-values recursion** is a technique for defining number-theoretic functions by recursion. In a definition of a function *f* by course-of-values recursion, the value of *f*(*n*) is computed from the sequence $\\langle f(0),f(1),\\ldots,f(n-1)\\rangle$.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "aliases": [
      "course-of-value-recursion"
    ],
    "inventory": [
      "BJYV3GNRZ8"
    ],
    "kind": "concept",
    "name": "Course-of-values recursion",
    "same_as": {
      "wikidata": "Q5178160",
      "wikipedia": "Course-of-values recursion"
    },
    "sources": [
      {
        "locator": "Course-of-values recursion",
        "mention": "wikipedia://en/3989260",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:3989260@r1317129591"
      }
    ],
    "tag": "PZHY7SB06A"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/PZHY7SB06A/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/PZHY7SB06A.md",
  "msc": null,
  "name": "Course-of-values recursion",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/PZH/PZHY7SB06A.md",
  "status": null,
  "tag": "PZHY7SB06A",
  "uri": "m2://PZHY7SB06A",
  "url": "https://math2.tamnd.com/wiki/course-of-values-recursion/",
  "writing": {
    "tag": "PZHY7SB06A",
    "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
      }
    ]
  }
}