A recursive function is a function generated by (1) Addition, (2) Multiplication, (3) selection of an element from a list, and (4) determination of the truth or falsity of the Inequality according to the technical rules:
See also Turing Machine
References
Kleene, S. C. Introduction to Metamathematics. Princeton, NJ: Van Nostrand, 1952.