# Turing machine

(redirected from*Deterministic Turing machine*)

Also found in: Thesaurus, Acronyms, Encyclopedia.

## Turing machine

*n.*

A hypothetical computing device capable of storing information and responding to computational questions, used in mathematical studies of computability.

[After Alan Mathison

**Turing***who conceived such a machine*.]## Turing machine

*n*

(Computer Science) a hypothetical universal computing machine able to modify its original instructions by reading, erasing, or writing a new symbol on a moving tape of fixed length that acts as its program. The concept was instrumental in the early development of computer systems

## Tu′ring machine`

(ˈtʊər ɪŋ, ˈtyʊər-)*n.*

a hypothetical computing device used in mathematical studies of the computability of numbers and in theories of automata.

[after Alan M.

*Turing*(1912–54), English mathematician, who described such a machine in 1936]ThesaurusAntonymsRelated WordsSynonyms

**Legend:**Switch to new thesaurus

Noun | 1. | Turing machine - a hypothetical computer with an infinitely long memory tapecomputer, computing device, computing machine, data processor, electronic computer, information processing system - a machine for performing calculations automatically |

Translations

**Turingův stroj**

**Turingov stroj**

Want to thank TFD for its existence? Tell a friend about us, add a link to this page, or visit the webmaster's page for free fun content.

Link to this page: