One of the many formulations of computable functions that arose in the quest to define effective computability is that of recursive functions, due to Gödel. The recursive functions are defined inductively in terms of a set of initial functions and rules for combining functions, as follows.