Alan Turing: the mathematician who gave computation a form

Alan Turing occupies a unique place in the history of computing. A mathematician, logician, cryptanalyst, and pioneer of artificial intelligence, he helped define what computation actually means before the modern computer truly existed.

His name is now associated with several major ideas: the Turing machine, the theoretical limits of computation, the breaking of Enigma during the Second World War, early British computers, and the famous Turing test concerning machine intelligence.

But his life cannot be reduced to a succession of scientific discoveries. Turing was also a victim of British laws that criminalized homosexual relationships at the time. Convicted in 1952, subjected to hormonal treatment, and barred from some sensitive work, he died two years later at only 41.

His influence, insufficiently recognized for many years, is now immense.

A childhood shaped by science

Alan Mathison Turing was born on June 23, 1912, in London.

His father, Julius Mathison Turing, worked in the British administration in India. His mother, Ethel Sara Turing, came from a family of engineers.

From an early age, Alan showed strong scientific curiosity.

At school, he was more interested in mathematics and science than in the classical subjects highly valued in British education at the time.

Yet his school career was not that of a conventional model student. He had a highly personal way of reasoning and often preferred finding his own solution rather than following the methods he had been taught.

That intellectual independence would become one of the defining characteristics of his scientific work.

Christopher Morcom, a decisive friendship

At Sherborne School, Turing formed a deep friendship with another student, Christopher Morcom, who shared his interest in science and mathematics.

Morcom became both a very close friend and an important intellectual influence.

In 1930, Christopher Morcom died suddenly from complications related to bovine tuberculosis contracted in childhood.

Turing was profoundly affected by his death.

In the years that followed, he reflected in particular on the relationship between mind, matter, and consciousness.

This event cannot, of course, explain his later work by itself, but it was a major episode in his youth and intellectual development.

Cambridge and the foundations of mathematics

In 1931, Turing entered King’s College at the University of Cambridge.

He studied mathematics during an especially fertile period for mathematical logic.

Mathematicians were trying to understand the foundations of their discipline.

One question became central: is there a systematic method capable of determining whether any mathematical proposition can be proved?

German mathematician David Hilbert had notably formulated the Entscheidungsproblem, or “decision problem.”

To answer such a question, however, it was first necessary to define precisely what it means to perform a calculation according to a method.

This is where Turing made a decisive contribution.

1936: the Turing machine

In 1936, Alan Turing published the paper that would become famous:

On Computable Numbers, with an Application to the Entscheidungsproblem.

In it, he imagined an extremely simple abstract machine.

This Turing machine essentially consists of:

• a theoretically unlimited tape divided into cells;
• a head capable of reading and writing symbols;
• a set of internal states;
• rules determining the next action.

Depending on the symbol being read and its current state, the machine can write a symbol, move its head left or right, and change state.

The model appears rudimentary.

Yet it provides a mathematical definition of what a computational procedure is.

A Turing machine is therefore not a blueprint for a physical computer. It is a theoretical model of computation.

The universal machine: an extraordinarily modern idea

Turing went even further.

He showed that it is possible to imagine a universal machine capable of reading the description of another machine and simulating its operation.

In other words, the same machine can perform different processes depending on the instructions supplied to it.

This idea has a remarkable similarity to modern computers: the hardware remains the same while the program changes.

Several decades earlier, Charles Babbage had already imagined a general-purpose machine with his Analytical Engine, whose behavior could be controlled by instructions. Punched cards were intended to provide operations and data.

Turing approached the problem from a different angle. He was not primarily trying to build a mechanism, but to define the logical limits of what a calculating machine could accomplish.

Can every problem be computed?

One of the deepest results of Turing’s work is that some problems cannot be solved by any general algorithm.

He demonstrated, in particular, the impossibility of a universal method capable of deciding in every case whether a program will eventually stop or continue forever.

This is the famous halting problem.

The discovery is fundamental.

It means that the limits of computing do not arise only from processor speed, memory capacity, or available technology.

Some limits are mathematical.

Even an ideal computer with enormous resources cannot automatically solve every conceivable problem.

Princeton and Alonzo Church

After Cambridge, Turing continued his research at Princeton University in the United States.

There he worked in the intellectual environment of logician Alonzo Church.

Church had independently developed the lambda calculus, another formal model for studying functions and computation.

The work of Church and Turing converged toward an idea now known as the Church-Turing thesis: any computation that can be carried out by an effective method can be represented by these equivalent formal models.

It is not a theorem that can be proved in the usual sense, because the intuitive notion of an “effective method” is precisely what must be connected to a formal definition.

Nevertheless, the thesis became one of the conceptual foundations of theoretical computer science.

War changes Turing’s path

In September 1939, the United Kingdom entered the war against Nazi Germany.

Turing joined Bletchley Park, Britain’s center for decrypting enemy communications.

German forces used the Enigma machine to encrypt many military messages.

Enigma transformed letters using a system of rotors and electrical connections whose configuration changed.

The number of possible settings was enormous.

Decrypting the messages therefore did not simply mean “breaking a code” once and for all: cryptanalysts regularly had to recover the settings being used.

Turing did not break Enigma alone

Popular history sometimes reduces the breaking of Enigma to Alan Turing.

The reality was far more collective.

Before the war, Polish mathematicians and cryptanalysts, notably Marian Rejewski, Jerzy Różycki, and Henryk Zygalski, had already made essential breakthroughs and passed their knowledge to the Allies.

At Bletchley Park, thousands of people then contributed to the British effort: mathematicians, linguists, operators, engineers, and administrative staff.

Turing nevertheless played a major role, particularly in work concerning the Enigma system used by the German navy.

He also helped devise methods for automating the search for possible configurations.

The Bombe: automating the search for settings

Turing contributed to the British design of the Bombe, developed with engineer Gordon Welchman and built in particular by the British Tabulating Machine Company.

The Bombe was not a general-purpose computer.

It was a specialized electromechanical machine designed to test hypotheses about Enigma settings rapidly.

It exploited clues known as cribs: fragments of text believed to appear in the original message.

Using these assumptions and the logical properties of Enigma, the machine could quickly eliminate many impossible configurations.

The objective was not simply to try every possibility blindly, but to reduce the search space intelligently.

This combination of mathematical reasoning and automation is characteristic of Turing’s work.

Hut 8 and the Battle of the Atlantic

Turing worked notably in Hut 8, the Bletchley Park section responsible for German naval communications.

These messages were particularly important during the Battle of the Atlantic.

German U-boats threatened the convoys carrying food, equipment, and troops to the United Kingdom.

Being able to read some German naval communications gave the Allies a major strategic advantage.

Turing developed several cryptanalytic methods and worked on procedures for exploiting intercepted messages.

Intelligence derived from decrypted communications formed part of the extremely secret body of information known as Ultra.

Turing and Colossus: a common misconception

Alan Turing is sometimes described as the designer of Colossus, one of the earliest electronic programmable computers.

That is inaccurate.

Colossus was primarily designed by engineer Tommy Flowers to help decrypt communications produced by the Lorenz cipher system used by the German high command.

Mathematician Max Newman, who knew Turing’s theoretical work, also played an important role in the project.

Turing did work at Bletchley Park and his ideas belonged to the same intellectual environment, but not every machine developed there should be attributed to him.

This distinction matters because the real history of computing is almost always the result of collective effort.

After the war: building real computers

At the end of the war, Turing joined the National Physical Laboratory (NPL).

He worked on the ACE, or Automatic Computing Engine, project.

This time, the subject was no longer an abstract machine like the one described in 1936.

Turing was helping design a real stored-program electronic computer.

His 1945 report proposed an ambitious architecture.

This period was especially important in computing history: several teams were simultaneously trying to turn theoretical ideas and wartime experience into general-purpose electronic computers.

The article on von Neumann architecture explains the stored-program principle that became central to modern computers.

ACE: an ambitious project

Turing’s ACE project aimed for high performance and notably used mercury delay lines for memory.

But construction progressed more slowly than he hoped.

Administrative, technical, and organizational constraints delayed the project.

A smaller version, the Pilot ACE, eventually ran in 1950.

Turing had already left the NPL by the time it was completed.

Pilot ACE nevertheless became one of Britain’s early operational stored-program electronic computers and demonstrated the value of many ideas in the original design.

Manchester and early software

In 1948, Turing joined the University of Manchester, where a team was working on early stored-program computers.

He contributed to programming questions and to the use of the Manchester Mark I.

His interests were no longer limited to hardware construction.

Once a programmable machine exists, another problem appears: how can it be made to perform tasks effectively?

This transition between hardware and software is essential in the history of computing.

The computer gradually becomes a general platform on which many different problems can be represented as programs.

“Can machines think?”

In 1950, Turing published a famous paper in the journal Mind:

Computing Machinery and Intelligence.

It begins with a question:

“Can machines think?”

Turing quickly argues that the question is too ambiguous.

Rather than trying to define the words “machine” and “think” philosophically, he proposes a more concrete experiment: the imitation game.

An interrogator communicates remotely, through text, with different participants and tries to determine which one is human.

The question then becomes: can a machine produce responses convincing enough that the interrogator cannot reliably distinguish it from a human?

This proposal became what is commonly known as the Turing test.

Does the Turing test really measure intelligence?

The Turing test is often oversimplified.

Turing did not provide a final definition of intelligence.

Instead, he proposed replacing a difficult philosophical question with a behavioral criterion that could be discussed and tested.

Successfully carrying on a conversation does not necessarily prove that a machine understands the world, is conscious, or reasons like a human.

Conversely, failing the test does not necessarily mean that a system has no form of intelligence.

The test remains historically important because it placed a provocative idea at the center of debate in 1950: the intellectual abilities of machines could become a concrete scientific question.

Turing anticipated machine learning

The 1950 paper also contains remarkably modern reflections.

Turing suggested that instead of trying to program a complete adult mind directly, one might construct a kind of “child machine” and then educate it.

With all necessary differences acknowledged, the idea resembles the general principle of machine learning: some capabilities can emerge not because every rule has been explicitly programmed, but through a learning process.

He also discussed objections to machine intelligence, creativity, mistakes, and the ability of machines to surprise their creators.

It would be anachronistic to call Turing the inventor of modern AI.

But his questions clearly anticipate several debates that remain active today.

Another scientific passion: morphogenesis

Turing’s work was not limited to computing or cryptanalysis.

Near the end of his life, he became deeply interested in mathematical biology.

In 1952, he published The Chemical Basis of Morphogenesis.

He sought to understand how chemical processes could spontaneously produce patterns found in living organisms, such as stripes, spots, or structures that emerge during development.

He proposed a model in which chemical substances diffuse and react with one another.

These mechanisms, now associated with Turing patterns, have had a lasting influence on the mathematical study of biological form.

The research illustrates the breadth of his scientific curiosity: for Turing, mathematics was a way to explore very different phenomena.

A high-level athlete

A less familiar aspect of Turing’s life was his passion for running.

He regularly practiced long-distance running and reached an excellent level.

By the late 1940s, his marathon performances brought him close to the level of Britain’s leading runners of the period.

Running was an important part of his daily life.

This aspect contrasts with the caricature of a mathematician absorbed only in equations.

Turing was a far more complex figure: scientist, inventor, cryptanalyst, athlete, and profoundly independent thinker.

1952: the conviction

In 1952, Turing’s life changed dramatically.

Following a police investigation connected to a burglary at his home, he acknowledged having had a relationship with a man.

At the time, sexual relationships between men were criminalized in the United Kingdom.

Turing was prosecuted for gross indecency.

He was convicted.

Rather than imprisonment, he accepted probation conditional on hormonal treatment with estrogen, often described as chemical castration.

The treatment caused significant physical effects.

His conviction also affected his professional activities connected to intelligence and security.

A man who had contributed to Britain’s wartime effort only a few years earlier was prosecuted by his own country because of his homosexuality.

The death of Alan Turing

On June 8, 1954, Alan Turing was found dead at his home in Wilmslow.

He was 41.

The inquest concluded that he had died by suicide from cyanide poisoning.

A partly eaten apple was found near him, which later fueled many stories and speculations.

There is, in particular, no solid evidence supporting the popular story that Apple’s logo was inspired by Turing’s death.

Some authors have also discussed the possibility of an accident, since Turing used cyanide in some experiments.

The official conclusion, however, remains suicide.

It is therefore important to distinguish established facts from legends that later grew around his death.

Recognition came late

For decades, much of Bletchley Park’s work remained secret.

Turing’s role in wartime cryptanalysis was therefore not immediately known to the general public.

Perceptions of his work gradually changed as information was declassified and the history of computing developed as a field.

At the same time, his 1952 conviction increasingly came to symbolize institutional injustice.

In 2009, following a public campaign, British Prime Minister Gordon Brown issued an official apology on behalf of the government for the way Turing had been treated.

In 2013, Queen Elizabeth II granted him a posthumous royal pardon.

The “Alan Turing law”

Recognition later extended beyond Turing’s individual case.

In the United Kingdom, legal provisions introduced through the Policing and Crime Act 2017 allowed posthumous pardons for many people convicted under historical laws concerning homosexual relationships that are no longer criminal offenses.

These measures are commonly nicknamed the “Alan Turing law.”

Turing’s name thus became associated not only with computing history, but also with the memory of people who suffered under discriminatory laws.

The Turing Award

Since 1966, the Association for Computing Machinery (ACM) has awarded the A.M. Turing Award.

The prize recognizes major contributions to computing.

It is often described as the equivalent of a Nobel Prize for computer science.

Its name reflects Turing’s importance to the field.

His work touches several of its foundations:

• what is computation?
• which problems can a machine solve?
• how can an algorithm be represented?
• how can general-purpose machines be built and programmed?
• to what extent can a machine be described as intelligent?

Few researchers have influenced so many fundamental questions at once.

Turing, Babbage, and von Neumann: three different stages

It is tempting to tell computing history as a simple succession of isolated geniuses.

The reality is richer.

Charles Babbage imagined a nineteenth-century mechanical general-purpose machine whose behavior could be controlled by instructions.

Alan Turing provided a powerful twentieth-century mathematical model for defining computation and the universal machine.

John von Neumann and other researchers later contributed to the formalization and construction of electronic stored-program computers.

These contributions are neither identical nor interchangeable.

They complement one another.

To follow this evolution, see the articles on the Difference Engine, punched cards, and von Neumann architecture.

Why does Alan Turing still matter today?

Today’s computers are incomparably more powerful than any machine Turing knew.

Yet many of the questions he asked remain central.

Developers still use languages and machines based on the concept of algorithms.

Theoretical computer scientists still study what is and is not computable.

Cybersecurity still involves a confrontation between encryption, analysis, and computing power.

Artificial intelligence has once again brought to the foreground the question of how machine behavior should be evaluated and what it really means to “understand.”

Computational biology continues to use mathematics to study complex natural phenomena.

Turing did not single-handedly invent the computer, cryptanalysis, or artificial intelligence.

His importance lies in something deeper: he helped formulate some of the fundamental questions that computing continues to address.

Key takeaways

Alan Turing is one of the founding figures of modern computing.

His work spans several major fields:

• in 1936, he formalized computation through the Turing machine;
• he showed that some problems are fundamentally uncomputable;
• during the Second World War, he played a major role in the cryptanalysis of Enigma at Bletchley Park;
• after the war, he contributed to the design of real electronic computers through the ACE project;
• in 1950, he raised the question of machine intelligence and proposed what became the Turing test;
• in mathematical biology, he developed an influential model of morphogenesis.

His life also stands as a reminder of a major historical injustice.

Convicted in 1952 because of a homosexual relationship, subjected to hormonal treatment, and dead two years later at the age of 41, Turing never lived to see the international recognition he receives today.

His legacy now extends far beyond his biography.

His name identifies a fundamental model of computation, one of computer science’s most prestigious awards, and a question that remains extraordinarily relevant:

what can a machine really do?

Frequently asked questions

Who was Alan Turing?

Alan Turing was a British mathematician, logician, and cryptanalyst born in 1912. His work was fundamental to computation theory, wartime cryptanalysis, early computers, and thinking about artificial intelligence.

Did Alan Turing invent the computer?

No. The modern computer emerged from the work of many researchers and engineers. Turing nevertheless contributed fundamental theoretical concepts, including the universal machine, and later participated in designing real computers such as ACE.

Did Alan Turing break Enigma by himself?

No. Breaking Enigma was a collective effort, preceded by essential work by Polish cryptanalysts and continued by thousands of people at Bletchley Park. Turing nevertheless played a major role, particularly regarding German naval communications.

What is a Turing machine?

It is an abstract mathematical model consisting of a tape, a read-write head, and operating rules. Despite its simplicity, it provides a way to formalize the concepts of algorithm and computation.

What is the Turing test?

It derives from the “imitation game” proposed by Turing in 1950. In its common form, a human communicates by text with a machine and another human and tries to distinguish between them. The test evaluates conversational behavior; it is not proof of consciousness or understanding.

Why was Alan Turing convicted?

In 1952, he was convicted in the United Kingdom for a homosexual relationship, which was criminalized at the time. He accepted hormonal treatment as a condition of probation. The British government officially apologized in 2009, and Turing received a posthumous royal pardon in 2013.

How did Alan Turing die?

He died in June 1954 at the age of 41 from cyanide poisoning. The official inquest concluded that he died by suicide, although the possibility of an accident has occasionally been discussed.