Any reason why Turing Machine would prevail on recursion theory?
With Turing machines you can talk about computer concepts such as running time and space usage. This is harder with $\mu$-recursive functions.