# AoC 2017 Day 25: Turing

### Source: The Halting Problem

Part 1:Implement a Turing machine defined as such:`Begin in state A. Perform a diagnostic checksum after 6 steps. In state A: If the current value is 0: - Write the value 1. - Move one slot to the right. - Continue with state B. If the current value is 1: - Write the value 0. - Move one slot to the left. - Continue with state B. ...`

What is the final number of

`1s`

on the tape?