Glossary
Who was Alan Turing
In short
Alan Turing was a mathematician who described the universal computing machine and proposed the Turing test, a way to check whether a machine can think.
People · Alan Turing
MMOOZZGG.com editorsChecked: 1 min read
For a child
Imagine a riddle game through a closed door. You write questions on slips of paper, and answers come back from behind the door. Who is hiding there, a friend or a robot? If you cannot tell, the robot answers just like a person. Alan Turing invented this game. He also invented, on paper, a machine that can calculate anything that can be calculated at all, if it gets clear rules.
In plain words
Turing lived long before neural networks, but he asked a question people still discuss: can a machine think? To avoid arguing about words, he suggested a test. A person writes to two partners they cannot see, and one of them is a computer. If the person cannot tell which is which, the machine passes. Today this is called the Turing test. Earlier, he had shown that one machine with a set of simple rules can do any calculation if it gets the right program. All computers rest on this idea, from a phone to a server that runs a chatbot.
For business
Business uses two of Turing’s ideas every day. The first is universality: any computer runs any program, so the same server calculates payroll today and runs a neural network tomorrow. The second is judging by results. Turing proposed to judge a machine by its answers, not by its design. Check an AI assistant in a company the same way: not by the model’s advertising, but by how many errors it makes on real customer requests. Remember the limit too: an answer that sounds human is not always correct. So check the figures and facts from AI, and run a blind test before launch. The page on the four floors of AI shows step by step how AI works inside a company.
For a specialist
In 1936, in “On Computable Numbers”, Turing introduced an abstract machine, the Turing machine: an endless tape of symbols, a read-write head and a finite table of states. In the same paper he described a universal machine, which reads the description of any other machine and repeats its work. This gave a strict meaning to computability and answered Hilbert’s decision problem. In the 1950 paper “Computing Machinery and Intelligence”, he replaced the argument about thinking machines with the imitation game: a judge holds a text dialogue with a person and a machine and tries to tell them apart. This setup was later called the Turing test. A talk in 1947 and a 1948 report on intelligent machinery came before the paper. The ACM award, often called the Nobel Prize of computer science, carries Turing’s name.
Example
A company launches an AI assistant in its support chat and runs a blind test in Turing’s spirit. A manager reads a mix of answers from the assistant and from staff and marks the errors. This shows whether the assistant is ready to talk to customers.
Related terms
Questions and answers
Sources
- Andrew Hodges, The Alan Turing Internet Scrapbook: Computable Numbers and the Turing Machine, 1936turing.org.uk
- Andrew Hodges, The Alan Turing Internet Scrapbook: The Turing Test, 1950turing.org.uk
- NYU Tandon School of Engineering, Professor Yann LeCun wins A.M. Turing Award, 27.03.2019engineering.nyu.edu
Not sure whether your company needs this?
AI solutions map