turi̇ng

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

تعريف turi̇ng في الإنجليزية التركية القاموس.
turing: turatma
Turing machine: Turing makinasi
turing equivalence: (Pisikoloji, Ruhbilim) turing eşdeğeri
ture: (Kanun) mütareke

التركية - التركية

تعريف turi̇ng في التركية التركية القاموس.: (Hukuk) Gezinti,seyahat
TURİNG KLÜBÜ: (Hukuk) Esas olarak kazanç amacı olmaksızın daha kolay turistik gezi yapılabilmesini sağlamak için kurulan dernek

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

تعريف turi̇ng في الإنجليزية الإنجليزية القاموس.
Turing: Surname of Germanic origin
Turing: A programming language (named after Alan Turing, British logician)
turing: English mathematician who conceived of the Turing machine and broke German codes during World War II (1912-1954)
Turing: Turing machine Turing test Turing Alan Mathison
Turing complete: Equivalent in power to a universal Turing machine; equivalently, functionally complete
Turing computable function: Any function whose value may be computed using a Turing machine
Turing degree: Given a set of natural numbers, a measure of the level of algorithmic unsolvability of the set
Turing machine: An abstract computing machine introduced in 1936 by Alan Turing to give a mathematically precise definition of computability
Turing machines: plural form of Turing machine
Turing tarpit: The situation in which a programming language is only minimally Turing complete, so that "everything is possible but nothing is easy"
Without more abstract notions of what constitutes important aspects of a programming language, one is seriously in danger of falling into the Turing Tarpit.
Turing tarpits: plural form of Turing tarpit
Turing test: A test of a computer's ability to demonstrate intelligence, as measured by whether a human judge can reliably distinguish the computer from another human being by conversing with both in natural language over a terminal
Turing tests: plural form of Turing test
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 test: Test proposed by Alan M. Turing to determine whether a computer can be said to "think. " Turing suggested the "imitation game," wherein a remote human interrogator, within a fixed time frame, must distinguish between a computer and a human subject based on their replies to questions posed by the interrogator. A series of such tests would measure the computer's success at "thinking" by the probability of its being misidentified as the human subject. The test is performed today in competitions that test the success of artificial intelligence
Turing test: test defined by the mathematician Allen Turing for testing the ability of a machine to simulate human intelligence
turing machine: A theoretical model of a computing device, devised by Alan Turing
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 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 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 hypothetical computer with an infinitely long memory tape
turing machine: name for a theoretical machine that can make simple input/output actions which are used to in mathematical proofs
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 hypothetical computing device, invented by Alan Turing in 1936, used to study the nature of algorithms and computation
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 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
universal Turing machine: A Turing machine capable of simulating the behavior of any Turing machine
universal Turing machines: plural form of universal Turing machine
Alan Mathison Turing: born June 23, 1912, London, Eng. died June 7, 1954, Wilmslow, Cheshire English mathematician and logician. He studied at the Universityof Cambridge and at Princeton's Institute for Advanced Study. In his seminal 1936 paper "On Computable Numbers," he proved that there cannot exist any universal algorithmic method of determining truth in mathematics and that mathematics will always contain undecidable (as opposed to unknown) propositions. That paper also introduced the Turing machine. He believed that computers eventually would be capable of thought indistinguishable from that of a human and proposed a simple test (see Turing test) to assess this capability. His papers on the subject are widely acknowledged as the foundation of research in artificial intelligence. He did valuable work in cryptography during World War II; after the war he taught at the University of Manchester. His apparent suicide at 41 followed an arrest for homosexual acts and extreme medical treatments aimed at changing his sexual orientation
Alan Turing: a British mathematician and computer scientist, who developed ideas which were later used to build the first electronic computer, and which also influenced the development of the study of artificial intelligence. During World War II he helped to find out the meaning of the German military codes (=secret writing system used for sending messages) (1912-54). born June 23, 1912, London, Eng. died June 7, 1954, Wilmslow, Cheshire English mathematician and logician. He studied at the Universityof Cambridge and at Princeton's Institute for Advanced Study. In his seminal 1936 paper "On Computable Numbers," he proved that there cannot exist any universal algorithmic method of determining truth in mathematics and that mathematics will always contain undecidable (as opposed to unknown) propositions. That paper also introduced the Turing machine. He believed that computers eventually would be capable of thought indistinguishable from that of a human and proposed a simple test (see Turing test) to assess this capability. His papers on the subject are widely acknowledged as the foundation of research in artificial intelligence. He did valuable work in cryptography during World War II; after the war he taught at the University of Manchester. His apparent suicide at 41 followed an arrest for homosexual acts and extreme medical treatments aimed at changing his sexual orientation
Alan Turing: {i} (1912-1954) British mathematician and inventor of a mathematical model for computer technology, cryptographer who helped decipher the code of the Nazi "Enigma" system during WW II