I tried, but I could not design a turing machine for the following problem:Turing machine that takes as input a tape containing a series of n 1s,where n >= 0, terminated by an = sign. The Turing machine head is initially positioned onthe leftmost 1. The end state should be a tape containing the input, followed by the reverse of the sequence of 0s and 1s that represents n in binary.
Can anyone provide me answer/guide on how to design a turing machine for this case?
turing machines