---
tag: PZHY7SB06A
kind: concept
name: Course-of-values recursion
aliases: [course-of-value-recursion]
sources:
  - wikipedia: en:3989260@r1317129591
    locator: Course-of-values recursion
    note: adopted
    mention: wikipedia://en/3989260
    sections: [Summary]
same_as:
  wikidata: Q5178160
  wikipedia: Course-of-values recursion
inventory: [BJYV3GNRZ8]
---

## Summary

In 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$.