A curated collection of educational Turing Machines written in plain YAML. Each example comes with a step-by-step README and an interactive turingmachine.io link, demonstrating classic problems such as:

• Binary XOR writer – computes w1 ⊕ w2 on a single tape
• Recognizer for 1ⁿ 0ᵐ 1ⁿ⁺ᵐ – checks equal-length prefixes/suffixes around a 0-block
• Decider for “0’s ≠ 2 × 1’s” – accepts all strings where the 0-count is not double the 1-count
• Decider for powers-of-two zeros 0^{2ⁿ} – halves the remaining 0’s recursively until one remains

Perfect for automata theory courses, quick demos, or anyone who wants to experiment with Turing Machines in a readable format. Clone, open the provided links, and you can start looking through the states!