The Kleene-Rosser paradox can be avoided by noting that this property of lambda calculus is central to computability. The Ackerman function is an example of a function that has this property, but not its primitive(*) variety. The function that defines the Fibonacci numbers and the factorial function also have this property, and it is made use of in such algorithms as Quicksort, in which the sorting function calls itself. 
The Kleene-Rosser paradox can be avoided by noting that this property of lambda calculus is central to computability. The Ackerman function is an example of a function that has this property, but not its primitive(*) variety. The function that defines the Fibonacci numbers and the factorial function also have this property, and it is made use of in such algorithms as Quicksort, in which the sorting function calls itself. For ten points, identify this self-referrentiality in math and programming where functions are defined in terms of themselves.
The Kleene-Rosser paradox can be avoided by noting that this property of lambda calculus is central to computability.
recursivity (accept any word forms, e.g. “recursion”)