A Turing machine is described that decides the language of strings with an equal number of 0s and 1s. The machine scans the input string, marking the first unmarked 0 and 1. If it finds an unmarked 1 after marking all 0s, it rejects, otherwise it accepts if no unmarked 1s remain after another scan.