How simple rules can create complex behavior
Meet the simplest model of computation and see how a machine with almost no memory, no intuition, and only a few rules can still perform meaningful work.
Before We Begin
The Turing machine is not important because anyone builds computers this way today. It matters because it strips computation down to its bare essentials: read a symbol, follow a rule, write a new symbol, move, and repeat. Once students understand that loop, programming stops feeling magical and starts feeling mechanical in the best possible way.
How this lesson fits
This module builds the mental model underneath everything else in the curriculum. We start with explicit rules, then add uncertainty, then explore search, so students can see AI as a chain of concrete decisions rather than a pile of mysterious buzzwords.
The big question
How can a machine move from rigid step-by-step instructions to making sensible choices in a messy, uncertain world?
Why You Should Care
This lesson gives students a clean answer to a foundational question: what does it actually mean for a computer to compute? It shows that sophisticated output can emerge from extremely small local actions, which is a theme that keeps returning throughout AI.
Where this is used today
Think of it like this
Picture a student standing beside an endless roll of paper with a tiny instruction card in hand. They can only inspect one square at a time, but the rule card tells them exactly what to write and where to move next. That is enough to create surprisingly rich behavior, just very slowly.
Easy mistake to make
A Turing machine is not a literal blueprint for modern laptops. It is a deliberately minimal model that helps us reason about what computation is and where its limits are.
Think about this first
If you were only allowed to inspect one binary digit at a time, how would you add 1 to the number 0111? Describe the exact sequence of checks and moves you would make.
Words we will keep using
A Turing machine is just a strip of paper, a pen, and a list of rules. Yet this tiny setup can compute anything your laptop can — just much, much slower. It is the theoretical foundation of all modern computing.
The machine's rulebook as a picture. The orange node tracks where the machine is right now. Step through to watch it move.
Edge labels: read/write,direction. Double circle = accept state.
Flips every bit: 0→1 and 1→0. Head moves right until blank, then accepts.
This matters because it strips computing down to its bare idea: rule-following. Modern computers are far more powerful than this toy model, but the central lesson is identical — complex behaviour grows out of very simple instructions applied repeatedly.