What does it mean to compute? A remarkable claim holds that every intuitive notion of mechanical calculation amounts to the same thing. Different formalisms, invented independently, all capture exactly one class of the computable.
The core idea
The Church-Turing thesis proposes that anything effectively calculable can be computed by a simple universal machine. Every reasonable model of computation devised has turned out equivalent in power. The intuitive and the formal coincide.
Why it holds
The mechanism of support is convergence. Independent attempts to formalize computation all define the same set of computable functions, a coincidence too strong to be accidental. The agreement is the evidence.
A deeper reading
The turn is that this is a thesis, not a theorem. It cannot be proved because it links a formal notion to an informal one, yet it is universally accepted. Its truth rests on evidence, not deduction.
The tension within
The claim draws a boundary. It says the computable is a fixed class, so no physically realizable device transcends it, absent new physics. The limits of one machine are the limits of all.
Where it fails
The implication unifies the study of computation. Because all models agree, results about one apply to all, and the notion of the computable is robust. Computation has a single, universal meaning.
The larger point
The Church-Turing thesis holds that all reasonable models of computation capture the same class of the computable, supported by their striking convergence. It is an unprovable but accepted claim that fixes the boundary of computation. Computation has one universal meaning. What makes the idea durable is not that it settles a question but that it reframes many. It teaches where to look and what to discount, which is often more valuable than any particular answer it yields. Understood in this spirit, it becomes a habit of attention rather than a doctrine, and habits of attention are what distinguish deep comprehension from mere knowledge.
