Conference Paper (published): Woodward J (2005) Invariants of Function Complexity under Primitive Recursive Functions. In: Mirkin B & Magoulas G (eds.) UKCI 2005: Proceedings of the 2005 UK Workshop ...

A primative recursive function is a little more complicated. According to wikipedia: "In computability theory, primitive recursive functions are a class of functions that are defined using primitive ...

In a previous paper we introduced a system of recursion operators for formulating pure logic programs, dispensing with explicit recursions. The recursion operators, some of which are similar to higher ...

Getting along. tdammers answers (112 votes): Recursion is not intrinsically better or worse than loops—each has advantages and disadvantages, and those even depend on the programming language ...

Woodward J (2006) Invariance of function complexity under primitive recursive functions. In: Collet P, Tomassini M, Ebner M, Gustafson S & Ekart A (eds.) Genetic Programming: 9th European Conference, ...