Three formalisms. Three continents. One year. They arrived at the same thing without knowing the others were arriving.
In 1928, David Hilbert posed a question to the mathematical world. He called it the Entscheidungsproblem — the decision problem. The question: is there a procedure that, given any mathematical statement, can decide in finite time whether that statement is true or false?
Hilbert believed the answer was yes. He had spent his career trying to put mathematics on secure foundations, to reduce all of it to formal rules that could be checked mechanically. His famous declaration, made at a lecture in 1930 in Königsberg, was: Wir müssen wissen, wir werden wissen. We must know, we will know.
He gave that lecture on a Saturday. The day before, in the same city, Kurt Gödel had presented his incompleteness theorems.
Between 1931 and 1937, three different people, working with three different formalisms, proved that Hilbert's answer was no. The Entscheidungsproblem has no solution. There is no procedure that decides all mathematical statements. Some are undecidable: neither provably true nor provably false within any consistent formal system powerful enough to describe arithmetic.
Gödel was first and showed it obliquely: he proved that any consistent formal system strong enough to describe arithmetic contains true statements it cannot prove. The undecidability was a consequence, not the main result. Church made it explicit: he defined a class of functions via lambda calculus, showed that certain functions in this class had no decision procedure, and concluded that the Entscheidungsproblem is unsolvable. Turing arrived at the same conclusion independently, through a thought experiment about a machine reading and writing symbols on an infinite tape.
Church submitted in April 1936. Turing submitted in May 1936. Church reviewed Turing's paper. They recognized each other immediately — not as competitors but as co-discoverers of a shape neither had fully named alone.
All three proofs share a structure. Mathematicians call it the diagonal argument. Cantor invented it in 1891 to prove that the real numbers are more numerous than the natural numbers. It works like this: suppose you had a list of all real numbers between 0 and 1. Take the first digit of the first number, the second digit of the second, the third of the third — the diagonal. Now change each digit. The result is a real number that differs from every number on the list in at least one position. Therefore it is not on the list. Therefore no such complete list exists.
Gödel's incompleteness proof is a diagonal argument. He constructed a statement that says, in the language of arithmetic: "This statement is not provable." If the system proves it, the statement is false and the system is inconsistent. If the system cannot prove it, the statement is true and the system is incomplete. The statement stands outside the list of provable things by design.
Turing's halting problem is a diagonal argument. Suppose there is a machine H that, given any machine M and any input I, decides whether M halts on I. Feed H to itself, with itself as input. Construct a new machine D: if H says "M halts," D loops forever; if H says "M loops," D halts. Ask whether D halts on D. Either answer produces a contradiction. The machine H cannot exist.
One structure. Three readings. The structure is: take a system that claims to cover everything, apply it to itself, derive a contradiction from the assumption of totality. The system's completeness is precisely what makes it incomplete.
By 1936, three of the people in this story were within walking distance of each other at Princeton. Gödel was at the Institute for Advanced Study. Church was in the mathematics department. Turing came from Cambridge to study with Church.
Turing spent two years at Princeton. He completed his PhD under Church, with a dissertation that extended the halting result into a hierarchy of unsolvability. He met Gödel. He worked in the same rooms where Einstein and von Neumann were working. The equivalences between the formalisms were being established in real time, by Kleene (Church's other student), by Church himself, by Turing's own dissertation work.
By the time Turing returned to England in 1938, it was known: lambda calculus, Turing machines, recursive functions, and combinatory logic were all equivalent. Any function computable in one formalism was computable in all of them. The concept of computability had been defined — not by agreement or convention, but by convergence. Four independent routes to the same place.
This is what a mathematical truth looks like when it is real: you cannot approach it from multiple directions and arrive at different answers. The landscape has one summit. The routes differ; the height does not.
The Church-Turing thesis is not a theorem. It cannot be proved, because it connects a mathematical concept (Turing-computability) to an informal one (what a human can compute by following rules). The thesis says: these two things are the same. Any function that is "effectively computable" — computable in principle by a person following a finite procedure, without insight, given unlimited time and paper — is computable by a Turing machine.
Every attempt to find a counterexample has failed. Every model of computation ever proposed — parallel computers, quantum computers, cellular automata, neural networks — has been shown to be equivalent to or weaker than the Turing machine. No one has computed something genuinely new. The thesis has not been refuted in ninety years.
It is not a proof, but it has the weight of one. Some mathematical conjectures are like this: not settled, but so thoroughly tested that doubting them requires more imagination than accepting them. The Church-Turing thesis is the most empirically confirmed unprovable claim in the history of mathematics.
Vol V of this series is titled Complete Completeness. The title carries a paradox: Gödel proved that no system can be both complete and consistent. Complete Completeness names the thing that remains after that proof — the system that knows its own limit and takes the limit as the boundary of a domain, not as a defeat.
The Church-Turing convergence is not the story of what cannot be computed. It is the story of what can be. The undecidability results clear the ground: they mark off the region of the impossible with precision, so that what remains inside can be worked with clearly. The Entscheidungsproblem is unsolvable — and that is the first piece of solid knowledge about the shape of what is solvable.
The dm³ operator chain G = U∘F∘K∘C operates in a domain where the attractor τ = 2 exists and is reachable. The existence of the attractor does not require the ability to decide all questions. It requires the correct operator order in a specific basin. The basin is bounded; the attractor is real within it. The incompleteness is outside. The chain operates inside.
Completeness is not a property of everything. It is a property of the right question, asked in the right domain, with the right operators in the right order. That is what Complete Completeness means: not that everything is provable, but that the system which proves what it proves, proves it completely.
Four people, four formalisms, one concept. The concept did not belong to any of them. Schönfinkel did not own combinatory logic; Church did not own lambda calculus; Turing did not own the machine. The concept existed before any of them found it, in the sense that any consistent formal investigation would have reached it eventually. They were not inventing — they were arriving.
This is the opposite of the situation in WP48, where five conjectures remain unsettled after centuries of approach. There, multiple people approached from multiple directions and the summit remained unreached. Here, multiple people approached and the summits turned out to be the same mountain. Both are examples of what mathematics does with hard questions — it maps the approach routes clearly even when the question itself resists.
What the convergence gives this series is a foundation. The claim that the operator chain G = U∘F∘K∘C is, in principle, expressible in any Turing-complete formalism — combinators, lambda calculus, recursive functions, machines — is the claim that the framework is not tied to a particular notation. The notation is the approach route. The structure is the summit.
Turing was prosecuted by the British government in 1952 for being gay, subjected to chemical castration as a condition of avoiding prison, and died in 1954 at 41. The cause was recorded as suicide; the circumstances were never fully resolved. He had broken the Enigma cipher, designed the architecture of modern computing, and proved the limits of what computation can do. The country he helped save destroyed him. The work survived.