Course contentsShow
← Computer Science
Lesson 1861 of 2,87242. Turing Machines and ComputabilityFree lesson

Turing's Model of Computation

Overview of how Turing machines capture the intuitive notion of mechanical computation through finite rules.

Turing's Model of Computation

What you'll learn: How Turing machines elegantly capture what it means to compute anything mechanically using simple, finite rules.

The Core Idea

In 1936, Alan Turing asked a profound question: What does it mean to compute something? Before computers existed, he needed a precise mathematical model that captured every possible mechanical calculation a human could perform by following fixed instructions.

Turing's answer was brilliantly simple: imagine a machine with:

  • An infinite tape (memory) divided into cells
  • A read/write head that can move left or right
  • A finite set of internal states
  • A finite table of rules telling it what to do

The key insight: No matter how complex a computation seems, if it can be done by following step-by-step instructions, it can be broken down into these elementary operations: read a symbol, write a symbol, move one cell, change state.

Why This Matters

Turing's model isn't about building actual machines—it's about understanding the fundamental nature of computation itself. Any computation you can describe precisely enough to program can be expressed as a Turing machine. This includes everything from adding numbers to running modern operating systems (though practical implementations use different architectures).

The model succeeds because it matches our intuition: computation is following definite, mechanical rules without requiring insight or creativity at each step. The finite transition function embodies all the "intelligence"—after that, execution is purely mechanical.

Key Takeaway: Turing's model captures the essence of mechanical computation by showing that any algorithmic process can be reduced to simple operations (read, write, move, change state) governed by a finite set of rules—making it the foundational mathematical definition of what it means to compute.