title: Single tape turing machine for converting binary number to unary?
body: <p>I'm stuck on a problem I've been trying to solve, namely converting a binary number with no leading zeros to a unary representation on the same tape.</p>
  
  <p>E.g. 110 -> xxxxxx</p>
  
  <p>I found markov's algorithm as a potential solution, but am unable to implement it. Would appreciate some direction!</p>
  
  <p>Edit: figured it out on my own. Write a machine for binary subtraction, then write an x for each subtraction.</p>