turing machines

الإنجليزية - التركية

تعريف turing machines في الإنجليزية التركية القاموس.
turing machine: turing makinası
turing machine: (Bilgisayar) turing makinesi
Turing machine: Turing makinasi

الإنجليزية - الإنجليزية

تعريف turing machines في الإنجليزية الإنجليزية القاموس.: plural form of Turing machine
Turing machine: An abstract computing machine introduced in 1936 by Alan Turing to give a mathematically precise definition of computability
universal Turing machines: plural form of universal Turing machine
Turing machine: A hypothetical computing device capable of storing information and responding to computational questions, used in mathematical studies of computability. Hypothetical computing device proposed by Alan M. Turing (1936). Not actually a machine, it is an idealized mathematical model that reduces the logical structure of any computing device to its essentials. It consists of an infinitely extensible tape, a tape head that is capable of performing various operations on the tape, and a modifiable control mechanism in the head that can store instructions. As envisaged by Turing, it performs its functions in a sequence of discrete steps. His extrapolation of the essential features of information processing was instrumental in the development of modern digital computers, which share his basic scheme of an input/output device (tape and tape reader), central processing unit (CPU, or control mechanism), and stored memory
turing machine: A hypothetical computing device, invented by Alan Turing in 1936, used to study the nature of algorithms and computation
turing machine: name for a theoretical machine that can make simple input/output actions which are used to in mathematical proofs
turing machine: A hypothetical machine defined in 1935-6 by Alan Turing and used for computability theory proofs It consists of an infinitely long "tape" with symbols (chosen from some finite set) written at regular intervals A pointer marks the current position and the machine is in one of a finite set of "internal states" At each step the machine reads the symbol at the current position on the tape For each combination of current state and symbol read, a program specifies the new state and either a symbol to write to the tape or a direction to move the pointer (left or right) or to halt
turing machine: A mathematical model of a computer consisting of an automaton travelling along a tape The automaton at any given time is in some state depending on its previous state and the data at its current position along the tape, and its state also determines whether it moves down the tape and what it writes to the tape at its current position
turing machine: a hypothetical computer with an infinitely long memory tape
turing 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 behavior
turing machine: A simple mechanical device consisting solely of a tape, a read/write head, and a finite state machine Turing was able to show that this machine is able to perform all the operations a person working with a logical system would be able to perform <Discussion> <References> Chris Eliasmith
turing machine: 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
turing machine: a kind of automaton invented by the logician Alan Turing for the purpose of establishing the existence of unsolvable problems
turing machine: A theoretical model of a computing device, devised by Alan Turing