• Recursion
  Recursion
  Recursion is the process of repeating items in a self-similar way. For instance, when the surfaces of two mirrors are exactly parallel with each other the nested images that occur are a form of infinite recursion. The term has a variety of meanings specific to a variety of disciplines ranging from...
  
  , the technique of functions calling themselves
• Recursive function, 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...
  
  
• Recursive language
  Recursive language
  In mathematics, logic and computer science, a formal language is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language...
  
  , a language which is decidable (in mathematics, logic and computer science)
• Recursive set
  Recursive set
  In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether or not a given number belongs to the set....
  
  , a set which is decidable
• Recursive acronym
  Recursive acronym
  A recursive acronym is an acronym or initialism that refers to itself in the expression for which it stands...
  
  , an acronym which refers to itself
• Recursive filter
  Recursive filter
  In signal processing, a recursive filter is a type of filter which re-uses one or more of its outputs as an input. This feedback typically results in an unending impulse response , characterised by either exponentially growing, decaying, or sinusoidal signal output components.However, a recursive...
  
  

See also

• Recursively enumerable language
  Recursively enumerable language
  In mathematics, logic and computer science, a recursively enumerable language is a type of formal language which is also called partially decidable or Turing-acceptable. It is known as a type-0 language in the Chomsky hierarchy of formal languages...
  
  
• Recursively enumerable set
  Recursively enumerable set
  In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable, semidecidable, provable or Turing-recognizable if:...
  
  
• Primitive recursive function
  Primitive recursive function
  The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the total µ-recursive functions...
  
  
• 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....
  
  
• Recursive definition
  Recursive definition
  In mathematical logic and computer science, a recursive definition is used to define an object in terms of itself ....
  
  
• Recursive