Why are computable functions also called recursive functions?

Question

In computability theory, computable functions are also called recursive functions. At least at first sight, they do not have anything in common with what you call "recursive" in day-to-day programming (i.e., functions that call themselfes).What is the actual meaning of recursive in the context of computability? Why are those functions called "recursive"?To put it in other words: What is the connection between the two meanings of "recursiveness"?

Answer 1

In the context of computability, a computable or recursive function is (sort of) simply one that given an input n, can reliably be expected to produce the value f(n). There are differing opinions as to whether there are various degrees of recursiveness however. I suggest you check the Wiki article on Computability_theory which discusses the matter at length.