# Partial recursive function and Turing machine

The wikipedia article about primitive recursion states that

An equivalent definition states that a partial recursive function is one that can be computed by a Turing machine.

My question is how one can write down formally this definition?

• If you are interested in the details, I suggest you get an introductory textbook on the matter. – Raphael May 16 '13 at 6:02
• This answer is relevant. – Mars Feb 3 '18 at 18:56