The ability of a routine to call itself. Recursion enables certain algorithms to be implemented with small, simple routines, but it does not guarantee speed or efficiency. Erroneous use of recursion can cause a program to run out of stack space during execution, causing the program, and sometimes the entire system, to crash. See also call1 (definition 2), routine.