1. of or relating to a recursion
The Collaborative International Dictionary of English v.0.48:
algorithmic \algorithmic\ adj.
1. of or pertaining to an algorithm. recursive
2. definitively solvable by a finite number of steps; -- said
of mathematical or logical problems. Contrasted with
WordNet (r) 3.0 (2006):
adj 1: of or relating to a recursion
The Free On-line Dictionary of Computing (18 March 2015):
When a function (or procedure)
calls itself. Such a function is called "recursive". If the
call is via one or more other functions then this group of
functions are called "mutually recursive".
If a function will always call itself, however it is called,
then it will never terminate. Usually however, it first
performs some test on its arguments to check for a "base case"
- a condition under which it can return a value without
The canonical example of a recursive function is
factorial 0 = 1
factorial n = n * factorial (n-1)
Functional programming languages rely heavily on recursion,
using it where a procedural language would use iteration.
See also recursion, recursive definition, tail recursion.