Any reason why Turing Machine would prevail on recursion theory? Nowadays, most introduction books, videos, and comments about theoretical computer science talk about Turing machines but don't discuss recursion theory anymore. These approaches are known to be equivalent.
What is the reason behind this? Has recursion theory simply gone out of fashion or is there a fundamental/mathematical reason explaining this?
With Turing machines you can talk about computer concepts such as running time and space usage. This is harder with $\mu$-recursive functions.