The Church-Turing Thesis
The thesis identifies effectively computable procedures with what a Turing machine can compute.
The Mechanism: The Church-Turing thesis proposes that any function computable by an effective mechanical procedure can be computed by a Turing machine. It connects an informal notion of calculation to a precise mathematical model.
The Philosophical Pivot: A simple abstract machine can capture a broad idea of what it means to follow a finite, explicit procedure. This gives researchers a common language for comparing algorithms.
The Horizon: The thesis is foundational in computer science, but it is not itself a theorem proved from a formal definition of every possible human procedure. Its status depends on the intuitive notion of effective computability.
Physical models of computation raise additional questions about resources, quantum effects, and the actual universe. The classical thesis is about computability, not the speed or energy cost of every computation.
A claim that a system computes beyond the Turing model requires unusually careful definitions and evidence.
The thesis clarifies what algorithms can do while leaving open what kinds of reasoning are not algorithmic.
A precise model can capture a broad idea without turning that idea into a proven law of nature.
When I call a process intelligent, am I describing its outcome or making a claim about how it reaches that outcome?