Computing Machinery and Intelligence
"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 th...
Computing Machinery and Intelligence - Wikipedia
Turing test
The Turing test is a test of a machine's ability to exhibit intelligent behavior equivalent to, or indistinguishable from, that of a human. In the original illustrative example, a human judge engages ...
Turing test - Wikipedia
Turing machine
A Turing machine is a hypothetical device that manipulates symbols on a strip of tape according to a table of rules. Despite its simplicity, a Turing machine can be adapted to simulate the logic of an...
Turing machine - Wikipedia
Church-Turing thesis
In computability theory, the Church–Turing thesis (also known as the Turing–Church thesis, the Church–Turing conjecture, Church's thesis, Church's conjecture, and Turing's thesis) is a hypothesis ("t...
Philosophy of artificial intelligence
The philosophy of artificial intelligence attempts to answer such questions as:These three questions reflect the divergent interests of AI researchers, cognitive scientists and philosophers respective...
Philosophy of artificial intelligence - Wikipedia
Ethics of artificial intelligence
The ethics of artificial intelligence is the part of the ethics of technology specific to robots and other artificially intelligent beings. It is typically divided into roboethics, a concern with the ...
Turing machine equivalents
A Turing machine is a hypothetical device with an infinite memory capacity, first conceived by Alan Turing in 1936. The machine manipulates symbols on a potentially infinite strip of tape according to...
Turing machine equivalents - Wikipedia
Chinese room
The Chinese room is a thought experiment presented by John Searle to challenge the claim that it is possible for a computer running a program to have a "mind" and "consciousness" in the same sense tha...
Chinese room - Wikipedia
Reverse Turing test
A reverse Turing test is a Turing test in which the objective or roles between computers and humans have been reversed.Conventionally, the Turing test is conceived as having a human judge and a comput...
Post-Turing machine
A Post–Turing machine is a "program formulation" of an especially simple type of Turing machine, comprising a variant of Emil Post's Turing-equivalent model of computation described below. (Post's mo...
Post-Turing machine - Wikipedia
Synthetic intelligence
Synthetic intelligence (SI) is an alternative term for artificial intelligence which emphasizes that the intelligence of machines need not be an imitation or any way artificial; it can be a genuine fo...
Loebner Prize
The Loebner Prize is an annual competition in artificial intelligence that awards prizes to the chatterbot considered by the judges to be the most human-like. The format of the competition is that of ...
Minimum Intelligent Signal Test
The minimum intelligent signal test, or MIST, is a variation of the Turing test proposed by Chris McKinstry in which only boolean (yes/no or true/false) answers may be given to questions. The purpose...
Computational complexity theory
Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent ...
Effectively calculable
In logic, mathematics and computer science, especially metalogic and computability theory, an effective method or effective procedure is a procedure for solving a problem from a specific class. An eff...
CAPTCHA
A CAPTCHA (an acronym for "Completely Automated Public Turing test to tell Computers and Humans Apart") is a type of challenge-response test used in computing to determine whether or not the user is h...
Physical symbol system
A physical symbol system (also called a formal system) takes physical patterns (symbols), combining them into structures (expressions) and manipulating them (using processes) to produce new expression...
Universal Turing machine
In computer science, a universal Turing machine (UTM) is a Turing machine that can simulate an arbitrary Turing machine on arbitrary input. The universal machine essentially achieves this by reading b...
Subject matter expert Turing test
A subject matter expert Turing test is a variation of the Turing test where a computer system attempts to replicate an expert in a given field such as chemistry or marketing. It is also known as a Fe...
Register machine
In mathematical logic and theoretical computer science a register machine is a generic class of abstract machines used in a manner similar to a Turing machine. All the models are Turing equivalent.