magine an infinitely long tape containing $0$ in every position. Write a three state Turing machine that $1)$ makes the longest continuous set of $1$s on the tape and $2)$ halts when it is done.