We show that Turing machines can achieve three results that we're familiar with from everyday programming: repetition, conditionals, and compound data structures. We use all three in an example that implements integer addition. We also see how arrays, strings, and nested data structures can be built using the same techniques.