* Turing test:

" is too loaded with spurious connotations to be meaningful ; but he proposed to replace all such questions with a specific operational test, which has become known as the Turing test.

For example, Daniel Dennett and Douglas Hofstadter argue that anything capable of passing the Turing test is necessarily conscious, while David Chalmers argues that a philosophical zombie could pass the test, yet fail to be conscious.

If the experiment were done in English, since Searle knows English, he would be able to take questions and give answers without any algorithms for English questions, and he would be affectively aware of what was being said and the purposes it might serve: Searle passes the Turing test of answering the questions in both languages, but he's only conscious of what he's doing when he speaks English.

Another way of putting the argument is to say computational computer programs can pass the Turing test for processing the syntax of a language, but that semantics cannot be reduced to syntax in the way Strong AI advocates hoped: processing semantics is conscious and intentional because we use semantics to consciously produce meaning by what we say.

But other thinkers sympathetic to his basic argument have suggested that the necessary ( though perhaps still not sufficient ) extra conditions may include the ability to pass not just the verbal version of the Turing test, but the robotic version, which requires grounding the robot's words in the robot's sensorimotor capacity to categorize and interact with the things in the world that its words are about, Turing-indistinguishably from a real person.

As a third issue, philosophers who dispute the validity of the Turing test may feel that it is possible, at least in principle, for verbal report to be dissociated from consciousness entirely: a philosophical zombie may give detailed verbal reports of awareness in the absence of any genuine awareness.

Suppose, says Searle, that this computer performs its task so convincingly that it comfortably passes the Turing test: it convinces a human Chinese speaker that the program is itself a live Chinese speaker.

As the computer had passed the Turing test this way, it is fair, says Searle, to deduce that he would be able to do so as well, simply by running the program manually.

We can only study their behavior ( i. e., by giving them our own Turing test ).

" The Turing test simply extends this " polite convention " to machines.

However, these causal properties can't be detected by anyone outside the mind, otherwise the Chinese Room couldn't pass the Turing test — the people outside would be able to tell there wasn't a Chinese speaker in the room by detecting their causal properties.

The discovery of the ELIZA effect was an important development in artificial intelligence, demonstrating the principle of using social engineering rather than explicit programming to pass a Turing test.

* Turing test

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.

* Turing test

* Raymond Kurzweil predicts machine intelligence will be capable of passing the Turing test by this year.

The primary aim of such simulation has been to fool the user into thinking that the program's output has been produced by a human ( the Turing test ).

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.

Chatterbot competitions focus on the Turing test or more specific goals.

Gurevich: "... Turing's informal argument in favor of his thesis justifies a stronger thesis: every algorithm can be simulated by a Turing machine ... according to Savage, an algorithm is a computational process defined by a Turing machine ".

There is a wide variety of representations possible and one can express a given Turing machine program as a sequence of machine tables ( see more at finite state machine, state transition table and control table ), as flowcharts ( see more at state diagram ), or as a form of rudimentary machine code or assembly code called " sets of quadruples " ( see more at Turing machine ).

But Minsky shows ( as do Melzak and Lambek ) that his machine is Turing complete with only four general types of instructions: conditional GOTO, unconditional GOTO, assignment / replacement / substitution, and HALT.

Turing is widely considered to be the father of computer science and artificial intelligence.

We could, alternatively, choose an encoding for Turing machines, where an encoding is a function which associates to each Turing Machine M a bitstring < M >.

If M is a Turing Machine which, on input w, outputs string x, then the concatenated string < M > w is a description of x.

This is formalised by a human-assisted Turing machine.

The complexity of executing an algorithm with a human-assisted Turing machine is given by a pair, where the first element represents the complexity of the human's part and the second element is the complexity of the machine's part.

The complexity of solving the following problems with a human-assisted Turing machine is:

This extreme growth can be exploited to show that f, which is obviously computable on a machine with infinite memory such as a Turing machine and so is a computable function, grows faster than any primitive recursive function and is therefore not primitive recursive.

Among the famous mathematicians and cryptanalysts working there, the most influential and the best-known in later years was Alan Turing who is widely credited with being " The Father of Computer Science ".

In computational complexity theory, BPP, which stands for bounded-error probabilistic polynomial time is the class of decision problems solvable by a probabilistic Turing machine in polynomial time, with an error probability of at most 1 / 3 for all instances.

This class is defined for a quantum computer and its natural corresponding class for an ordinary computer ( or a Turing machine plus a source of randomness ) is BPP.

There are several models in use, but the most commonly examined is the Turing machine.

The yet unproven but commonly accepted Church-Turing thesis states that a Turing machine and all equivalent formal languages such as the lambda calculus perform and represent all formal operations respectively as applied by a computing human.

Although CHR is Turing complete, it is not commonly used as a programming language in its own right.

These include: In 1959 he became a fellow of the American Academy of Arts and Sciences ; in 1967 he was elected to the National Academy of Sciences ; the ACM's Turing Award for making " basic contributions to artificial intelligence, the psychology of human cognition, and list processing " ( 1975 ); the Nobel Memorial Prize in Economics " for his pioneering research into the decision-making process within economic organizations " ( 1978 ); the National Medal of Science ( 1986 ); and the APA's Award for Outstanding Lifetime Contributions to Psychology ( 1993 ).

An early explorer of this view was Alan Turing who sought to prove the limits of expressive complexity of human genes in the late 1940s, to put bounds on the complexity of human intelligence and so assess the feasibility of artificial intelligence emerging.

Turing is " frequently credited for being the Father of theoretical computer science and artificial intelligence ".

This storyline involves the contemplation of the limits of Turing machines and the nature of artificial intelligence.

* Turing test, the artificial intelligence test

The ability to generate conversation that cannot be distinguished from a human participant has been one test of a successful artificial intelligence ( The Turing Test ).

He was awarded the ACM's A. M. Turing Award along with Herbert A. Simon in 1975 for their basic contributions to artificial intelligence and the psychology of human cognition.

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.

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.

* October-Publication of Alan Turing's paper " Computing Machinery and Intelligence ", seminal in the study of artificial intelligence and presenting the Turing test.

He is the 2011 winner of the ACM Turing Award, the highest distinction in computer science, " for fundamental contributions to artificial intelligence through the development of a calculus for probabilistic and causal reasoning.

The stated purpose of the project is to create an artificial intelligence that is capable of passing the Turing Test.

It was achieved largely because of the efforts of Twinn, Knox, Alan Turing ( who later became the father of artificial intelligence ) and others at Bletchley Park.

As Dr. Eppes applies the Turing Test to a seemingly unique artificial intelligence, he is tricked only to come to the realization that the computer only uses a recursive algorithm to apply the most human responses, while simultaneously being tempted by an offer to work for DARPA.