A hypothetical general-purpose computer machine, described in a paper by the English mathematician Alan Turing in the late 1930s.

a hypothetical computer with an infinitely long memory tape

a black box with an input tape and an output tape and a central processing unit

a central processor of finite size with an infinite tape

a device in which a person tries to tell the difference between a human and a computer through a series of blind questions and answers

a finite-state machine yet the inverse is not true

a formal computer with potentially infinite memory operating on binary data

a mathematical formalism to describe any computer, created by Alan Turing

a mathematical toy that was an important part of the theoretical base of nowadays computers

a mechanism that implements the minimum number of instructions needed to be a stored program computer

an abstraction, a creation of logic and mathematics

an abstract representation of a computing device

an idealised computing device consisting of a read/write head (or 'scanner') with a paper tape passing through it

an imaginary computing machine invented by Alan Turing to describe what it means to compute something

a purely logical construct and consists on a tape divided on cells (the medium) and a processing head

a pushdown automaton made more powerful by relaxing the last-in-first-out requirement of its stack

a random access, read-write, finite state automaton

a simple computational device with an infinite length of 'tape' to store data on

a simple mathematical construct that can be imagined as a recordable tape of infinite length coupled to a mechanical unit with read/write capability

a simple model of computation

a state machine with an infinite tape for input and output and storage

a theoretical computing machine invented by Alan

a very simple machine, but it's capable of computing anything that can be computed by any mechanical computing device

a very simple machine, but, logically speaking, has all the power of any digital computer

a very simple model for computation which, as it turns out, is not a whole lot different from the computer I presented

A form of universal computer, assumed to take its instructions from an infinite paper punched tape and output results to the same medium before stopping upon completion of the program.

A theoretical machine imagined by Alan Turing that has an infinite tape running that it can read from or write to. It can change its state by reading certain symbols (in binary code) on the tape.

An infinite loop of squares, containing either 0 or 1, passing through a device which can either change or retain that symbol. Such a machine can solve any problem which can be clearly stated (Alan Turing).

A machine created by Alan Turing, that broke the Enigma

A MODEL OF COMPUTATION that uses an underlying FINITE-STATE AUTOMATON but also has a infinite tape to use as memory. Turing machines are capable of UNIVERSAL COMPUTATION.