A Turing machine is a mathematical model of computation that uses an infinite tape and a head to perform calculations, fundamental in computer science and computability theory. Created by Alan Turing in the late 1930s, it operates by reading, writing, and modifying symbols on the tape based on its internal state. Turing used this model to explore the limits of computing and to demonstrate that there is no general solution to the Entscheidungsproblem.

9. A Turing machine is a mathematical model of a computer that uses a tape and a head
to perform calculations. It is a fundamental model in computer science and
computability theory
How it works
•The Turing machine has a head that moves along an infinite tape.
•The tape is divided into squares, each of which can be blank or contain a symbol.
•The head can read, write, erase, and move to any square on the tape.
•The head can also change its internal state at any time.
•The machine's internal state and the condition of the square it's reading determine what it does next.
•The machine's output is the solution to a problem, which can be read from the tape once the machine stops.
Who created it?
•Alan Turing, a British computer scientist, first described the Turing machine in 1936–7.
•Alonzo Church named the machine after Turing in a review of his paper.
What it was used for?
•Turing created the Turing machine to investigate the limits of computing real numbers.
•He also used it to prove that there was no general way to solve the Entscheidungsproblem, a problem that requires
a yes or no answer at every step.