title: Can a Turing machine perform Quicksort?
body: <p>As far as I know, a Turing machine can be made to execute loops or iterations of instructions encoded on a Tape. This can be done by identifying Line separators and making the Turing machine go back until a specific count of Line separators is reached (that is, inside the loop).
  But, can a Turing machine also execute a recursive program?
  <br><br>Can someone describe various details for such a Turing Machine?<br><br>
  I suppose, if recursion can be executed by a Turing machine, the Quicksort can also be performed?</p>