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.
Execute Program
Looking for something more interactive? Try Execute Program, an interactive learning platform from Destroy All Software LLC! It has courses on TypeScript, SQL, regular expressions, JavaScript concurrency, and more. All Destroy All Software subscriptions include full access to Execute Program, or you can subscribe to Execute Program directly.