* 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.

The Turing test is commonly cited in discussions of artificial intelligence as a proposed criterion for machine consciousness ; it has provoked a great deal of philosophical debate.

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 ).

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.

A Turing machine that is able to simulate any other Turing machine is called a universal Turing machine ( UTM, or simply a universal machine ).

) Another common reformulation is simply a deterministic Turing machine with an added tape full of random bits called the random tape.

The Turing Police may have simply gotten the name from the hotel's registry, but it is sometimes speculated to be her original name.

Absolute turmites are two-dimensional analogues of conventional Turing machines, so are occasionally referred to as simply " Two-dimensional Turing machines ".

Turing Plus extends original Turing with processes and monitors ( as specified by C. A. R.

Subsequent formalizations were framed as attempts to define " effective calculability " or " effective method "; those formalizations included the Gödel – Herbrand – Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church's lambda calculus of 1936, Emil Post's " Formulation 1 " of 1936, and Alan Turing's Turing machines of 1936 – 7 and 1939.

It was not a Turing complete computer, which distinguishes it from more general machines, like contemporary Konrad Zuse's Z3 ( 1941 ), or later machines like the 1946 ENIAC, 1949 EDVAC, the University of Manchester designs, or Alan Turing's post-War designs at NPL and elsewhere.

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 >.

Turing disavowed any interest in terminology, saying that even " Can machines think?

To make a Turing machine that speaks Chinese, Searle gets in a room stocked with algorithms programmed to respond to Chinese questions, i. e., Turing machines, programmed to correctly answer in Chinese questions asked in Chinese, and he finds he's able to process the inputs to outputs perfectly without having any understanding of Chinese, nor having any idea what the questions and answers could possibly mean.

Equivalent definitions can be given using μ-recursive functions, Turing machines or λ-calculus as the formal representation of algorithms.

And in a proof-sketch added as an " Appendix " to his 1936 – 37 paper, Turing showed that the classes of functions defined by λ-calculus and Turing machines coincided.

This was done by Alonzo Church in 1936 with the concept of " effective calculability " based on his λ calculus and by Alan Turing in the same year with his concept of Turing machines.

Turing reduced the halting problem for Turing machines to the.

Since NC contains NL, it is also unknown whether a space-efficient algorithm for computing the GCD exists, even for nondeterministic Turing machines.

It is still used in the area of computability theory, although Turing machines are arguably the preferred model for computation.

Alternatively, NP can be defined using deterministic Turing machines as verifiers.

Configurations and the yields relation on configurations, which describes the possible actions of the Turing machine given any possible contents of the tape, are as for standard Turing machines, except that the yields relation is no longer single-valued.

In particular, nondeterministic Turing machines are equivalent with deterministic Turing machines.

Minsky: " But we will also maintain, with Turing.

:: "... prose used to define the way the Turing machine uses its head and the way that it stores data on its tape.

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.

Structured programming, canonical structures: Per the Church-Turing thesis any algorithm can be computed by a model known to be Turing complete, and per Minsky's demonstrations Turing completeness requires only four instruction types — conditional GOTO, unconditional GOTO, assignment, HALT.

Alan Mathison Turing, OBE, FRS ( ; 23 June 1912 – 7 June 1954 ), was a British mathematician, logician, cryptanalyst, and computer scientist.

He was highly influential in the development of computer science, giving a formalisation of the concepts of " algorithm " and " computation " with the Turing machine, which can be considered a model of a general purpose computer.

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

During World War II, Turing worked for the Government Code and Cypher School ( GCCS ) at Bletchley Park, Britain's codebreaking centre.

In 1948 Turing joined Max Newman's Computing Laboratory at Manchester University, where he assisted in the development of the Manchester computers and became interested in mathematical biology.

Turing died in 1954, just over two weeks before his 42nd birthday, from cyanide poisoning.

As of May 2012 a private member's bill was before the House of Lords which would grant Turing a statutory pardon if enacted.

Turing was conceived at Chhatrapur, Orissa, in British India.

However, both Julius and Ethel wanted their children to be brought up in England, so they moved to Maida Vale, London, where Turing was born on 23 June 1912, as recorded by a blue plaque on the outside of the house of his birth, later the Colonnade Hotel.

Loops and conditional branching were possible, and so the language as conceived would have been Turing-complete as later defined by Alan Turing.

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

A model of computation may be defined in terms of an abstract computer, e. g., Turing machine, and / or by postulating that certain operations are executed in unit time.

This topic was further developed in the 1930s by Alonso Church and Alan Turing, who on the one hand gave two independent but equivalent definitions of computability, and on the other gave concrete examples for undecidable questions.

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.

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.

* A. M. Turing Award