Turing machine

Turing machine
A mathematical device used by the English mathematician Alan Turing (1912–54) to make precise the notion of an algorithm, or an effective computation. A Turing machine is a computer with a potentially infinite linear tape in both directions, divided into discrete squares that are scanned one at a time. Symbols in the squares are from a finite alphabet. The instructions for the machine are sets of ordered quintuples: <qi, si, sk, M, qj >. qi is the state the machine is in at the first moment, si is the symbol it reads on the square, sk a symbol with which it replaces it, M is the instruction to move one square right or left or remain where it is, and qj the state at the next moment. A function f(x ) is Turing computable if, when some representation of the argument x is put on the tape, the machine halts on a representation of the value f(x ). The class of Turing computable functions is identical with the class of general recursive functions (see also Church's thesis ).

Philosophy dictionary. . 2011.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Turing machine — Turing o mašina statusas T sritis automatika atitikmenys: angl. Turing machine vok. Turing Maschine, f rus. машина Тьюринга, f pranc. machine de Turing, f ryšiai: sinonimas – Tiuringo mašina …   Automatikos terminų žodynas

  • Turing machine — 1937, named for English mathematician and computer pioneer Alan M. Turing (1912 1954), who described such a device in 1936 …   Etymology dictionary

  • Turing machine — n. [after TURING Alan Mathison, its originator] an early hypothetical model for a simple computer capable theoretically of solving complex problems by performing a small number of basic operations …   English World dictionary

  • Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… …   Wikipedia

  • Turing machine — /toor ing, tyoor /, Math. a hypothetical device with a set of logical rules of computation: the concept is used in mathematical studies of the computability of numbers and in the mathematical theories of automata and computers. [after Alan M.… …   Universalium

  • Turing machine — noun An abstract computing machine introduced in 1936 by Alan Turing to give a mathematically precise definition of computability. See Also: universal Turing machine, Turing complete, Turing function …   Wiktionary

  • Turing machine equivalents — Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine Read only right moving Turing Machines Probabilistic Turing machine Multi track Turing machine Turing machine… …   Wikipedia

  • Turing machine examples — The following are examples to supplement the article Turing machine.Turing s very first exampleThe following table is Turing s very first example (Turing 1936):: 1. A machine can be constructed to compute the sequence 0 1 0 1 0 1... ( Undecidable …   Wikipedia

  • Turing machine gallery — The following article is a supplement to the article Turing machine. Turing machine as a mechanical device The Turing machine shown here consists of a special paper tape that can be erased as well as written with a tally mark . Perhaps the TABLE… …   Wikipedia

  • Turing Machine (band) — Infobox musical artist | Name = Turing Machine Img capt = Img size = Landscape = Background = group or band Origin = New York City, New York, USA Genre = Post rock, Instrumental rock, Math rock, Years active = 1998 ndash; present Label =… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”