• Recursion (computer science)
  Recursion (computer science)
  Recursion in computer science is a method where the solution to a problem depends on solutions to smaller instances of the same problem. The approach can be applied to many types of problems, and is one of the central ideas of computer science....
  
  , a procedure or subroutine, implemented in a programming language, whose implementation references itself
• A total computable function
  Computable function
  Computable functions are the basic objects of study in computability theory. Computable functions are the formalized analogue of the intuitive notion of algorithm. They are used to discuss computability without referring to any concrete model of computation such as Turing machines or register...
  
  , a function which is defined for all possible inputs

See also

• μ-recursive function, defined from a particular formal model of computable functions using primitive recursion and the μ operator
• Recurrence relation
  Recurrence relation
  In mathematics, a recurrence relation is an equation that recursively defines a sequence, once one or more initial terms are given: each further term of the sequence is defined as a function of the preceding terms....
  
  , in mathematics, an equation that defines a sequence recursively