[permalink] [id link]
Turing now restates the original question as " Let us fix our attention on one particular digital computer C. Is it true that by modifying this computer to have an adequate storage, suitably increasing its speed of action, and providing it with an appropriate programme, C can be made to play satisfactorily the part of A in the imitation game, the part of B being taken by a man?
from
Wikipedia
Some Related Sentences
Turing and now
* British mathematician Alan Turing created a theoretical model for a machine, now called a universal Turing machine, that could carry out calculations from inputs,
Despite the fact that it has not been formally proven, the Church – Turing thesis now has near-universal acceptance.
In it he stated another notion of " effective computability " with the introduction of his a-machines ( now known as the Turing machine abstract computational model ).
Because all these different attempts at formalizing the concept of " effective calculability / computability " have yielded equivalent results, it is now generally assumed that the Church – Turing thesis is correct.
This result is now known as Church's Theorem or the Church – Turing Theorem ( not to be confused with the Church – Turing thesis ).
In 1950, Alan Turing published his famous article " Computing Machinery and Intelligence " which proposed what is now called the Turing test as a criterion of intelligence.
In 1950, Alan Turing published his famous article " Computing Machinery and Intelligence ", which proposed what is now called the Turing test as a criterion of intelligence.
This formulation, which is now called machine-state functionalism, or just machine functionalism, was inspired by the analogies which Putnam and others noted between the mind and the theoretical " machines " or computers capable of computing any given algorithm which were developed by Alan Turing ( called Universal Turing machines ).
Computing Machinery and Intelligence, written by Alan Turing and published in 1950 in Mind, is a seminal paper on the topic of artificial intelligence in which the concept of what is now known as the Turing test was introduced to a wide audience.
In his 1936 paper, Turing described his idea as a " universal computing machine ", but it is now known as the Universal Turing machine.
" The figures the test exceeded 50 %, and you could argue all this to mean that Cleverbot has now passed the Turing Test, here at Techniche 2011.
He was a friend of Alan Turing, becoming his Executor, and now general editor of Turing's collected works.
A closely related and now quite popular concept is the idea of Turing machines.
Turing and original
In the original article (" On computable numbers, with an application to the Entscheidungsproblem ", see also references below ), Turing imagines not a mechanism, but a person whom he calls the " computer ", who executes these deterministic mechanical rules slavishly ( or as Turing puts it, " in a desultory manner ").
In September 2001, " Object Oriented Turing " was renamed " Turing " and the original Turing was renamed " Classic Turing ".
Currently, there are two open source alternative implementations of Turing: Open Turing, an open source version of the original interpreter, TPlus, a native compiler for the concurrent systems programming language variant Turing Plus, and OpenT, an abandoned project to develop a compiler for Turing.
Open Turing is an open-source implementation of the original Turing interpreter for Windows written by Holt Software.
TPlus is an open-source implementation of original ( non-OO ) Turing with systems programming extensions developed at the University of Toronto and ported to Linux, Solaris and Mac OS X at Queen's University in the late 1990s.
TPlus implements Turing + ( Turing Plus ), a concurrent systems programming language based on the original Turing programming language.
Turing Plus extends original Turing with processes and monitors ( as specified by C. A. R.
The word decidable stems from the German word Entscheidungsproblem which was used in the original papers of Turing and others.
* Turing's original oracle machines, defined by Turing in 1939.
Note that " CAPTCHA " is an acronym for " Completely Automated Public Turing test to tell Computers and Humans Apart " so that the original designers of the test regard the test as a Turing test, not specifically a reverse one.
It is known that every set A is Turing reducible to its Turing jump, but the Turing jump of a set is never Turing reducible to the original set.
Turing and question
One of the most influential contributions to this question was an essay written in 1950 by pioneering computer scientist Alan Turing, titled Computing Machinery and Intelligence.
The question whether a given Turing machine halts or not can be formulated as a first-order statement, which would then be susceptible to the decision algorithm.
Intuitively then, the oracle machine can perform all of the usual operations of a Turing machine, and can also query the oracle for an answer to a specific question of the form " is x in A?
Similarly the question of whether a Turing machine T terminates on an initially empty tape ( rather than with an initial word w given as second argument in addition to a description of T, as in the full halting problem ) is still undecidable.
In an influential address to the American Mathematical Society in 1944, he raised the question of the existence of an uncomputable recursively enumerable set whose Turing degree is less than that of the halting problem.
" Since the words " think " and " machine " can't be defined in a clear way that satisfies everyone, Turing suggests we " replace the question by another, which is closely related to it and is expressed in relatively unambiguous words.
Having clarified the question, Turing turned to answering it: he considered the following nine common objections, which include all the major arguments against artificial intelligence raised in the years since his paper was first published.
Here we are asking not a simple question about a prime number or a palindrome, but we are instead turning the tables and asking a Turing machine to answer a question about another Turing machine.
It can be shown ( See main article: Halting problem ) that it is not possible to construct a Turing machine that can answer this question in all cases.
However the Turing machine model only provides an answer to the question of what computability of functions means and, with interactive tasks not always being reducible to functions, it fails to capture our broader intuition of computation and computability.
Turing and Let
denotes an input that encodes the Turing machine M. Let m be the size of the tuple (, x ).
Let T be a Turing machine which " represents " me in the sense that T can prove just the mathematical statements I prove.
Let denote the set of input values for which the Turing machine with index e halts.
Turing and us
Turing suggests that Lovelace's objection can be reduced to the assertion that computers " can never take us by surprise " and argues that, to the contrary, computers could still surprise humans, in particular where the consequences of different facts are not immediately recognizable.
Such Turing machines could tell us that a given string is in the language, but we may never be sure based on its behavior that a given string is not in a language, since it may run forever in such a case.
Turing and our
We can only study their behavior ( i. e., by giving them our own Turing test ).
In a speech celebrating the 30th anniversary of the Berkeley EECS department, fellow Turing Award winner and Berkeley professor Richard Karp said that, " It is to our everlasting shame that we were unable to persuade the math department to give him tenure.
Therefore, if our universe is a gigantic simulation, that simulation is being run on a computer at least as powerful as a Turing machine.
0.540 seconds.