Turing Machines - Princeton University
introcs.cs.princeton.edu › java › 52turingJun 30, 2017 · To describe how this is accomplished, we first review an algorithm for incrementing a binary integer by 1: scan the bits from right to left, changing 1's to 0's until you see a 0. Then change the 0 to a 1. The Turing machine repeatedly knocks off one A at a time and increments the binary number. Our Turing machine mimics this strategy.