I. Three Apples

There are three apples in human history.

The first: Newton's. It fell on his head (or maybe it didn't), and he saw universal gravitation. This series has covered Newton — he unified the motion of the heavens and the earth in a single equation. That apple was the starting point of a construction.

The second: Turing's. Laced with cyanide, bitten once, and he was dead. June 7, 1954. Forty-one years old.

The third: the Apple logo. An apple with a bite taken out. Steve Jobs was asked many times whether the logo was a tribute to Turing. He said it wasn't. The designer Rob Janoff also said no — the bite was there so people would know it was an apple and not a cherry.

But everyone remembers Turing's apple. Because that bite weighs too much.

A man invented the theoretical foundation of the modern computer, helped crack the Nazi cipher machine, shortened the Second World War, saved an untold number of lives. Then his country, because the person he loved was a man, convicted him of "gross indecency" and injected him with estrogen — chemical castration.

Two years later he bit that apple.

Newton's apple fell and gave humanity an equation. Turing's apple was raised and took a person away.

II. The Tape

1936. Turing was twenty-four. He published a paper: "On Computable Numbers, with an Application to the Entscheidungsproblem."

Inside this paper was a machine. Not a real machine — a thought experiment. An infinitely long tape divided into cells, each cell containing a 0 or a 1. A read-write head that can read the current cell, write a new symbol, and move one cell left or right. The head operates according to a finite set of rules.

This is the Turing machine.

It looks absurdly simple — a tape, a head, a few rules. But Turing proved that this machine can simulate any computational process. Any calculation that can be precisely described can be carried out by this machine.

This is the purest construction imaginable. With the barest materials — tape, symbols, rules — it constructs the largest possible thing: everything that is computable.

Bach built fugues from twelve tones. Newton built mechanics from a handful of equations. Turing built "computation itself" from a strip of tape.

But he did not build this machine in order to construct something. He built it in order to carve.

III. Halting

Turing constructed the Turing machine. Then he used it to carve something: the Entscheidungsproblem — the decision problem.

The decision problem was posed by Hilbert: does there exist a universal mechanical procedure that can determine whether any mathematical proposition is true or false?

Hilbert believed the answer was yes. Mathematics is complete — every question has an answer, and you can find it through a mechanical method. This is the mathematical version of "construction can close" — you can build a machine and let it solve all mathematical problems for you.

Turing proved: no such procedure exists.

His method was the Halting Problem. He asked a simple question: can you write a program that, given any program and its input, determines whether that program will eventually halt (produce a result) or run forever?

The answer is no. Using an elegant diagonal argument — structurally identical to Cantor's proof that the real numbers are uncountable — he showed that such a program cannot exist. If it did, it would contradict itself.

This was the same year as Gödel's incompleteness theorems — Gödel in 1931, Turing in 1936. Two people, two different methods, the same conclusion: any sufficiently powerful formal system cannot fully decide itself. Construction cannot close.

Gödel proved it from inside logic: within the system, there are propositions that are true but unprovable. Turing proved it from outside computation: no universal decision machine exists.

Two chisels, the same wall — Hilbert's dream. The dream that mathematics could be mechanically closed. It cannot.

When this series covered Gödel, it said: he proved that "any sufficiently complex construction has remainder it cannot cover." Turing proved the same thing in a different language: any universal computational program has things it cannot compute.

Remainder does not vanish. Your tape can be infinitely long. Your rules can be endlessly numerous. But there will always be something you cannot calculate.

IV. The War

1939. World War II broke out. Turing was recruited to Bletchley Park.

The Germans had the Enigma machine. The number of cipher combinations it generated daily was astronomical — in theory you would have to try every possibility to crack it. The Germans believed it was unbreakable.

Turing broke it.

Not by brute force. By finding structural weaknesses in Enigma — the machine had certain constraints built into its rules (for instance, a letter could never be encrypted as itself), and these constraints narrowed the search space. Turing designed a machine — the "Bombe" — specifically to exploit these weaknesses and rapidly sift through possible key settings.

This was carving. He did not carve the cipher itself — he carved Enigma's structure. He found the cracks inside that machine's construction and drove through them.

Galileo used a telescope to carve Ptolemy's universe. Turing used another machine to carve Enigma's code.

The work at Bletchley Park was the highest state secret. For decades after the war, no one knew what Turing had done. The lives he saved — historians estimate that cracking Enigma shortened the war by at least two years and may have saved millions of lives — the people whose lives were saved did not know his name.

He did this work. Then he returned to Cambridge. Then his country began to destroy him.

V. The Imitation Game

1950. Turing published a paper: "Computing Machinery and Intelligence."

The opening sentence: "I propose to consider the question, 'Can machines think?'"

Then he immediately did something: he replaced the question.

He said: let us not ask "can machines think." Let us ask a different question — "can a machine fool you?"

He designed a game — later called the Turing Test. A person communicates via text with two interlocutors. One is human, one is a machine. If the person cannot tell which is which, then we say the machine has passed the test.

Notice what he did. He did not define "thinking." He did not say "thinking consists of such-and-such properties, and if a machine satisfies them it counts as thinking." He did precisely the opposite — he carved away the foundation of the concept "thinking."

You say machines cannot think. Fine. What is thinking? You say thinking requires consciousness. Fine. What is consciousness? How do you know the person across from you has consciousness? You cannot see consciousness. All you can see is behavior — what the other party says, what they do. You infer from behavior that there is a "thinking person" on the other side.

If a machine's behavior is indistinguishable from a person's — if it responds to everything you say with equal coherence — then on what grounds do you say it is not thinking? On what grounds do you say your colleague is thinking but the machine is not? All you see in both cases is behavior. You have never "seen" thinking itself.

This is Hume's structure. Hume said you have never seen "causation" — you see A followed by B and call it causation. Turing said you have never seen "thinking" — you see behavior and call it thinking.

Hume carved causation. Turing carved "thinking."

VI. Turing and Gödel

Turing and Gödel. This series has covered Gödel. The two are opposite sides of the same coin.

Gödel proved: in any sufficiently powerful formal system, there exist propositions that are true but unprovable. The system cannot fully account for itself. Turing proved: no universal decision program exists. You cannot write a program that determines whether all programs halt.

Gödel looked from the inside: there are holes within the system. Turing looked from the outside: no machine can plug all the holes.

Gödel's proof is static — there are certain propositions you cannot prove; they simply sit there. Turing's proof is dynamic — the very act of trying to decide generates contradiction.

Both were saying the same thing: construction cannot close. No matter how powerful your system, there is always remainder it cannot cover.

But their postures were different.

Gödel was a Platonist — he believed mathematical objects truly exist, and the incompleteness theorems describe that real world. He stood at the boundary of that world and pointed outward: "there are things out there you cannot prove."

Turing was an engineer — he constructed a machine (the Turing machine), then used that machine to prove the limits of machines. He did not stand at a boundary and point. He built a wall, then proved there was a hole in it you could never seal.

Gödel discovered the limit. Turing constructed the limit.

VII. Turing and Socrates

The structure of the Turing Test is the same as the Socratic method.

Socrates did not tell you what justice is. He asked: what do you think justice is? Then he dismantled your definition. You offered definition A; he found a counterexample. You revised to B; he found another. By the end, you realized you did not know what justice is.

Turing did not tell you what thinking is. He asked: how do you determine whether something is thinking? Then he dismantled your criteria. You say thinking requires consciousness — he says you cannot see consciousness. You say thinking requires understanding — he says how do you verify understanding? All you can verify is behavior.

Socrates carved away your false definition of "justice." Turing carved away your false definition of "thinking."

Neither gave you a new definition. Socrates did not say "justice is this." Turing did not say "thinking is this." They did the same thing: dismantled what you thought you knew and left you standing on open ground.

Socrates' open ground: "I know that I know nothing." Turing's open ground: "You cannot tell human from machine."

Two patches of open ground. The same kind of carving.

VIII. Chemical Castration

1952. Turing was forty-one. He reported a burglary at his home. During the investigation, police discovered he had been in a sexual relationship with a man.

In 1952 Britain, homosexuality was a crime. Turing was prosecuted. The charge was "gross indecency" — the same law under which Oscar Wilde had been convicted in 1895.

He was found guilty. The court gave him two options: prison, or chemical castration — injections of estrogen.

He chose chemical castration. Because prison would have meant he could no longer do research.

Sima Qian chose castration — because death would have meant he could never finish the Records of the Grand Historian. Turing chose chemical castration — because prison would have meant he could never continue his work. The same choice: to keep carving, accept the destruction of the body.

The estrogen injections changed his body. He grew breasts. He became depressed. His security clearance was revoked — he was no longer permitted to access any work related to cryptography. The hero of Bletchley Park had become a criminal.

A man who had helped save his country was convicted by that same country.

Galileo was tried by the Church — he said the Earth moves; the Church said it doesn't. The remainder of science did not care how the trial went. The Earth kept moving. Turing was tried by the state — he loved a man; the state said he couldn't. The remainder of a person did not care how the trial went either. He was still himself.

Galileo's body was confined; his method survived. Turing's body was chemically altered, but he could not stop. After castration he was still working. He began researching morphogenesis — how the patterns and shapes of living organisms emerge from simple chemical reactions. Inside a body that had been ruined, he kept carving.

IX. That Apple

June 7, 1954. England. Turing was found dead at home. On his bedside table was an apple, one bite taken. The cause of death was cyanide poisoning.

The coroner ruled it suicide. But his mother maintained for the rest of her life that it was an accident — Turing ran chemical experiments at home involving cyanide; he may have ingested it by mistake. The apple was never tested — no one checked whether it contained cyanide.

He was forty-one when he died.

2009. British Prime Minister Gordon Brown issued a formal apology on behalf of the government. 2013. Queen Elizabeth II granted Turing a posthumous royal pardon. 2021. Turing's portrait appeared on the new British fifty-pound note.

Apology. Pardon. Banknote. All too late. He had already bitten the apple.

Galileo waited 359 years before the Church admitted its error. Turing waited 59. But Galileo died of natural causes. Turing did not.

One more at the bridgehead. He is young — forty-one, one of the youngest here. He is holding an apple.

Socrates stands on open ground. Plato crouches over his blueprint. Hume sits playing billiards. Schopenhauer looks down beneath the bridge. Kierkegaard has leaped.

Turing stands on the bridge and looks at his own hands. His hands are quiet. Those hands designed the Turing machine, broke Enigma, wrote the paper asking whether machines can think. Those hands were injected with estrogen by the state.

He does not look at the bridge. He does not look at the view. He looks at the apple in his hand.

Newton's apple fell and gave humanity an equation. Turing's apple was raised and took a person away.

He takes a bite.

Everyone at the bridgehead watches. No one speaks. This time even Hume does not say "fancy a game."

Some remainder is not conserved. Some remainder is simply consumed. Not consumed by a system — consumed by the world. Turing is the remainder the world consumed.

Whether that apple contained cyanide, to this day no one knows.

But he is gone.

Notes

[1] The relationship between Turing's "that apple" and the chisel-construct cycle and remainder concepts in Self-as-an-End theory: the core argument for the chisel-construct cycle can be found in the Methodological Overview (DOI: 10.5281/zenodo.18842450). Turing's unique position is twofold: he both constructed the purest construction (the Turing machine — building "computation itself" from minimal materials) and performed one of the deepest carvings (the Halting Problem — proving no universal decision procedure exists). The Halting Problem and Gödel's incompleteness theorems are two sides of the same coin: Gödel proved from within the system that there are true but unprovable propositions; Turing proved from outside that no universal decision machine exists. Both say: construction cannot close. The Turing Test is a different kind of carving — he did not define "thinking" but carved away the false definition, structurally equivalent to Socrates carving false knowledge. Turing's death is the heaviest remainder in this series: a man who helped save his country was chemically castrated and died, paralleling Galileo's trial by the Church but with a crueler outcome. "Some remainder is not conserved — some remainder is simply consumed" supplements the remainder-conservation principle: in most cases remainder is conserved (returning in new form), but under extreme violence, remainder can be genuinely destroyed — at the cost of losing everything that remainder carried.

[2] Turing's life draws primarily on Andrew Hodges, Alan Turing: The Enigma (1983/2014). "On Computable Numbers, with an Application to the Entscheidungsproblem" (1936), published in Proceedings of the London Mathematical Society. The Turing machine concept and proof of the Halting Problem appear therein. The Entscheidungsproblem was posed by Hilbert and Ackermann (1928). Gödel's incompleteness theorems (1931). Bletchley Park and the breaking of Enigma: Hodges and Hugh Sebag-Montefiore, Enigma: The Battle for the Code (2000). The Bombe machine design: Hodges. "Computing Machinery and Intelligence" (1950), published in Mind; the Turing Test is introduced therein. Turing's conviction for "gross indecency" (1952) and chemical castration: Hodges. Oscar Wilde's conviction under the same law (1895). Turing's death (June 7, 1954); the detail that the apple was never tested for cyanide: Hodges. "The Chemical Basis of Morphogenesis" (1952), published in Philosophical Transactions of the Royal Society. Gordon Brown's apology (September 10, 2009). Royal pardon (December 24, 2013). Fifty-pound note (issued June 23, 2021). This is the fifth essay of Round Three. All previous essays are available at nondubito.net.