## Example 2 of Turing Computing: A Turing program P that, given any input $C_n$ with $n \in \mathbb{N}$, moves the reading head to the leftmost cell on the tape containing 1 and stops

Here is a Turing Machine which does the job: Description of the Machine Given the input tape $C_n$ (without knowing where the reading head will start) this machine will halt on the left-most 1. The initial state of the machine is $q_1$ (indicated by an arrow). At any stage of the computation, having found the…