So what confuses me is that let's consider a function f. According to a definition from a text book it asserts that f is called recursive, if there is a Turing machine that computes it (for all input strings output of the machine should be equal to output of the function given the same input).
But in general, we say that a function is recursive if it calls itself or maybe firstly another function and then that other function calls our initial function again and again until some initial condition.
So these two definitions are seems to be different. Should I choose the meaning of recursion based on context or am I missing something ? Thanks in advance