 Church goes on to consider two natural ways one might seek to expand the notion of computability beyond that of recursiveness (or λ-definability) and he argued that each of these methods results in functions that are already recursive (and λ-definable) and so concludes: