Update

You are looking at 1-20 of 227 entries  for:

  • All: Turing machine x
clear all

View:

Overview

Turing machine

A theoretical machine which operates according to extremely simple rules, invented by Turing with the aim of obtaining a mathematically precise definition of what is ‘computable’. It has ...

Turing machine

Turing machine   Quick reference

A Dictionary of Physics (8 ed.)

Reference type:
Subject Reference
Current Version:
2019
Subject:
Science and technology, Physics
Length:
36 words

...Turing machine A mathematical concept for deciding whether there is an algorithm for solving a mathematical problem. This concept has been applied to several issues in physics and may be fundamental. See also quantum Turing machine...

Turing machine

Turing machine   Quick reference

The Concise Oxford Dictionary of Linguistics (3 ed.)

Reference type:
Subject Reference
Current Version:
2014
Subject:
Linguistics
Length:
34 words

... machine A device, conceived in the abstract by the mathematician Alan Turing in the 1930s, capable of performing any finite computation; hence e.g. of producing or processing sentences in any formal ...

Turing machine

Turing machine   Quick reference

The Concise Oxford Dictionary of Mathematics (6 ed.)

Reference type:
Subject Reference
Current Version:
2021

...Turing machine A theoretical machine which operates according to extremely simple rules, invented by Turing with the aim of obtaining a mathematically precise definition of what is computable . It has been generally agreed that the machine can calculate or compute anything for which there is an ‘effective’ algorithm ( see Church’s thesis...

Turing machine

Turing machine   Reference library

Adam Morton

The Oxford Companion to Philosophy (2 ed.)

Reference type:
Subject Reference
Current Version:
2005
Subject:
Philosophy
Length:
214 words

...is a ‘universal’ Turing machine which can mimic the output of any other machine; ( c ) there is no Turing machine which, given a specification of any arbitrary Turing machine and an input, will halt when that machine halts, given that input. The last, ( c ), is closely related to Gödel's theorem. Turing machines can give substance to functionalism in the philosophy of mind. Prof. Adam Morton See also computer ; Gödel's theorem . George Boolos and Richard Jeffrey , Computability and Logic , 3rd edn. (Cambridge, 1990). The Essential Turing , ed. B. J....

Turing machine

Turing machine   Quick reference

A Dictionary of Philosophy (3 ed.)

Reference type:
Subject Reference
Current Version:
2016
Subject:
Philosophy
Length:
202 words

... 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: <q i , s i , s k , M, q j > · q i is the state the machine is in at the first moment, s i is the symbol it reads on the...

Turing machine

Turing machine   Quick reference

A Dictionary of Electronics and Electrical Engineering (5 ed.)

Reference type:
Subject Reference
Current Version:
2018

... machine A mathematical model of a device that changes its internal state and reads from, writes on, and moves a potentially infinite tape, all in accordance with its present state, thereby constituting a model for computer-like behaviour. The model was published by Alan Turing in 1936. ...

Turing machine

Turing machine   Quick reference

A Dictionary of Computer Science (7 ed.)

Reference type:
Subject Reference
Current Version:
2016
Subject:
Science and technology, Mathematics and Computer Science
Length:
451 words
Illustration(s):
4

...algorithms. In a deterministic Turing machine the overall course of the computation is completely determined by the Turing machine (program), the starting state, and the initial tape-inputs; in a nondeterministic Turing machine there are several possibilities at each stage of the computation: it can execute one out of possibly several machine instructions. The class of problems solvable by deterministic Turing machines in polynomial time is the class P ; the class of problems solvable by nondeterministic Turing machines in polynomial time is the class ...

Turing machine

Turing machine n.   Quick reference

A Dictionary of Psychology (4 ed.)

Reference type:
Subject Reference
Current Version:
2015

...one frame to the right. A universal Turing machine incorporates a coded description of a Turing machine in the form of a table of instructions and also a sequence of symbols that it encounters on the tape when it operates. For any possible computation, a Turing machine can, in principle, be constructed, and a universal Turing machine can compute anything computable, given sufficient time. See also algorithm , artificial intelligence , cellular automaton . [Named after the English mathematician Alan Mathison Turing ( 1912–54 ) who first described it in...

Turing machine

Turing machine   Quick reference

A Dictionary of Statistics (3 ed.)

Reference type:
Subject Reference
Current Version:
2014

... machine A theoretical model of a computer, in which the machine functions in a sequence of discrete operations. The machine can be in only one of a finite list of internal states at any given moment. It consists of an infinite tape carrying symbols, which represent instructions, and a mechanism that can move the tape and read from, or write to, the tape. The mechanism can also change the internal state of the machine in accordance with instructions read from the...

universal Turing machine

universal Turing machine   Quick reference

A Dictionary of Psychology (4 ed.)

Reference type:
Subject Reference
Current Version:
2015

...Turing machine See Turing machine...

universal Turing machine

universal Turing machine   Quick reference

A Dictionary of Computer Science (7 ed.)

Reference type:
Subject Reference
Current Version:
2016

...Turing machine A Turing machine M that, given any input x and a suitable encoding of any Turing machine K, outputs the result of applying the Turing machine K to the input x . A universal Turing machine therefore can perform all the computations for the class of Turing machines. The existence of such a machine was discovered by Alan Turing in 1936 . It lead to the concept of the stored-program...

multitape Turing machine

multitape Turing machine   Quick reference

A Dictionary of Computer Science (7 ed.)

Reference type:
Subject Reference
Current Version:
2016

...Turing machine A Turing machine that has a finite number of tapes, each tape having a tape head that can move independently. Such machines have the same computational power as single-tape Turing machines. Consider a multitape Turing machine M. If for no input word of length n does M scan more than L ( n ) cells on any tape then M is said to be an L(n) tape-bounded Turing machine . If for no input word of length n does M make more than T ( n ) moves before halting then M is said to be a T(n) time-bounded Turing machine...

quantum Turing machine

quantum Turing machine   Quick reference

A Dictionary of Physics (8 ed.)

Reference type:
Subject Reference
Current Version:
2019
Subject:
Science and technology, Physics
Length:
47 words

...quantum Turing machine A mathematical concept which has the same relation to a quantum computer as a Turing machine does to a traditional computer. This means that a quantum Turing machine is concerned with the problem of whether systematic algorithms exist for problems in quantum...

Turing machine

Turing machine   Reference library

Brewer's Dictionary of Modern Phrase & Fable (2 ed.)

Reference type:
Subject Reference
Current Version:
2011

... machine . A hypothetical computing machine for performing simple reading, writing and shifting operations in accordance with a prescribed set of rules. It is invoked in theories of computability and automata and takes its name from the British mathematician Alan Turing ( 1912–54 ), who described such a machine in 1936 . During the Second World War Turing was one of the team that cracked the German Enigma ...

Turing machine

Turing machine   Quick reference

The Oxford Dictionary of Phrase and Fable (2 ed.)

Reference type:
Subject Reference
Current Version:
2006

... machine a mathematical model of a hypothetical computing machine which can use a predefined set of rules to determine a result from a set of input variables. It is named for the English mathematician Alan Mathison Turing ( 1912–54 ), who developed the concept of a theoretical computing machine, a key step in the development of the first computer, and carried out important code-breaking work in the Second World...

Turing machine

Turing machine noun   Quick reference

New Oxford American Dictionary (3 ed.)

Reference type:
English Dictionary
Current Version:
2015
Subject:
English Dictionaries and Thesauri
Length:
49 words
Turing machine

Turing machine noun   Quick reference

Oxford Dictionary of English (3 ed.)

Reference type:
English Dictionary
Current Version:
2015
Subject:
English Dictionaries and Thesauri
Length:
52 words
Turing machine

Turing machine  

A theoretical machine which operates according to extremely simple rules, invented by Turing with the aim of obtaining a mathematically precise definition of what is ‘computable’. It has been ...
quantum Turing machine

quantum Turing machine  

A mathematical concept which has the same relation to a quantum computer as a Turing machine does to a traditional computer. This means that a quantum Turing machine is concerned with the problem of ...
multitape Turing machine

multitape Turing machine  

A Turing machine that has a finite number of tapes, each tape having a tape head that can move independently. Such machines have the same computational power as single-tape Turing machines. Consider ...

View: