The Turing Machine

Lesson notes

Overview

A head reading and writing on an infinite tape is a model of everything computers can compute. This topic is rated advanced and is number 54 of 117 in Computer Science. Deeper models, formal results and harder reasoning.

What you are seeing

The panel above shows an interactive animation of the idea. Every slider changes one quantity so you can see its effect on the outcome. The animation is drawn live from the model, so everything you see responds to the sliders. Press Space to pause, use Restart to replay from the start, and change the speed to slow down quick events.

In depth

Alan Turing’s 1936 machine consists of a head that reads and writes symbols on an infinite tape, moves left or right, and changes state according to a table, δ(q, a) = (q′, b, ±1). Despite its simplicity, it can compute anything that any computer can, according to the Church–Turing thesis. Turing used it to show that some problems, such as the halting problem of deciding whether a program ever stops, cannot be solved by any algorithm.

Reading the relationship

The expression "δ(q, a) = (q′, b, ±1)" is a compact summary of the idea. It uses the symbols δ, q, a, b; name what each one stands for before you start. Then use the sliders to see how changing one quantity changes the others.

A guided exploration

1. Run the animation once with the default settings and describe in words what happens. 2. Change one slider at a time and note which quantity responds most. 3. Push each slider to its extreme and decide whether the result still makes sense.

Try this

Try to explain why the pattern holds, not just what it is. Look for limiting cases and what happens at the edges.

Common pitfalls

Test small inputs by hand and then the largest ones. Off-by-one errors and forgetting how cost grows with input size are the most common traps.

How it connects

It builds on “Pattern Matching Automata”, the topic before it in Computer Science. Once you are comfortable, continue with “Caesar Cipher”.

Why it matters

Computing ideas decide how fast, how safely and how well software can solve problems.