Origin of Turing machine

after Turing, its originator# Turing machine

Turing machine

**MLA Style**

"Turing machine." YourDictionary, n.d. Web. 05 December 2018. <https://www.yourdictionary.com/turing-machine>.

**APA Style**

Turing machine. (n.d.). Retrieved December 05th, 2018, from https://www.yourdictionary.com/turing-machine

## Turing machine

noun

Origin of Turing machine

AfterAlan Mathison**Turing**

*who conceived such a machine*

**MLA Style**

"Turing machine." YourDictionary, n.d. Web. 05 December 2018. <https://www.yourdictionary.com/turing-machine>.

**APA Style**

Turing machine. (n.d.). Retrieved December 05th, 2018, from https://www.yourdictionary.com/turing-machine

**finite state machine**. It has been shown that if the answer to a computational problem can be computed in a finite amount of time, then there exists an abstract Turing machine that can compute it.

**MLA Style**

"Turing machine." YourDictionary, n.d. Web. 05 December 2018. <https://www.yourdictionary.com/turing-machine>.

**APA Style**

Turing machine. (n.d.). Retrieved December 05th, 2018, from https://www.yourdictionary.com/turing-machine

(*plural* Turing machines)

- (computing theory) An abstract computing machine introduced in 1936 by Alan Turing to give a mathematically precise definition of computability.

From Alan Turing English mathematician, logician, and cryptographer

**MLA Style**

**APA Style**

## turing machine - Computer Definition

An abstract form of a computing device that is more like a software program than a piece of hardware. Any so-called Turing machine can be implemented on an infinite number of computing devices. A Turing machine would have a read/write head that scans a one-dimensional, bidirectional tape divided into equal-sized sections inscribed with a 1 or a 0. Computation starts when the mechanism in a given “state” scans a section, erasing what it discovers there, printing a 0 or a 1, moving to an adjacent section, and going into a new state.

This behavior is determined by three key parameters: (1) the state the mechanism is in; (2) the value in the section the mechanism is scanning; and (3) a set of instructions. For decades, a number of computer scientists have proven that if conventional digital computers are considered in isolation from random external inputs (for example, a stream of bits produced by radioactive decay), then with enough time and tape, a Turing machine could calculate any function a digital computer could calculate.

See Also: Computer.

Stanford Encyclopedia of Philosophy. Turing Machine. [Online, May 27, 2003.] Stanford Encyclopedia of Philosophy Website. http://plato.stanford.edu/entries/turing- machine/; Computing Corporation Website. http://www.securecomputing.com/index.cfm? skey=738.

Published by Wiley Publishing, Inc., Indianapolis, Indiana.

Used by arrangement with John Wiley & Sons, Inc.

**MLA Style**

**APA Style**