Recursive function

• Recursion (computer science)
  Recursion (computer science)
  
  Recursion is a way of thinking about and solving problems. In fact, Recursion_ is one of the central ideas of computer science. Solving a problem using recursion means the solution depends on solutions to smaller instances of the same problem....
  : a procedure or subroutine, implemented in a programming language, whose implementation references itself
• µ-recursive function, defined from a particular formal model of computable functions using primitive recursion and the µ operator
• Computable function
  Computable function
  
  Computable functions are the basic objects of study in recursion theory. The set of computable functions is equivalent to the set of Turing-computable functions and partial recursive functions....
  , or total recursive function, a function computable by a Turing machine
  Turing machine
  
  Turing machines are basic abstract symbol-manipulating devices which, despite their simplicity, can be adapted to simulate the logic of any computer algorithm....
  

See also

• Recursive
  Recursive
  
  Recursive may refer to:*Recursion*Recursively enumerable language*Recursively enumerable set*Recursive filter*Recursive function*Recursive language...