Recursivity or Recursion are expressions used in Computer Programming, Mathematics and Language.

In Computer Programming the term is used for the ability of a subroutine or program module to call itself. It is helpful for writing routines that solve problems by repeatedly processing the output of the same process.

In mathematics - 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, certain conditions cause the process to terminate, thus avoiding spinning out of control.

It seems clear to the perticular set of topics that constitute this site's main focus then that a self - generating building structure will depend also on the concept of recursion or recursivity.