Turing Recursive Definition vs General Perception
A function is recursive if it can be defined using certain constructs, one of which is recursive calls.

A function is computable if it can be implemented by a Turing machine.

Theorem: A function is computable if, and only if, it is recursive.

Because of the above theorem people are sometimes a bit imprecise about using the correct words and definitions, and they conflate recursive and computable functions. They should not. It confuses students.