1) Algorithmic 2) Indefinitely repeatable 3) Of or relating to a recursion 1) Algorithmic 
Strictly speaking, a set or function is recursive if it is computable; however, in the usual sense of the word, a function is said to be recursive if its definition make reference to itself. For example, factorial can be defined as x! = x * (x - 1)! with the base case of 1! equal to 1. See also self-referential. 
An algorithm that operates by repeating itself.
[adj] - of or relating to a recursion
adjective of or relating to a recursion