phil 230 paper 1 (Turing Test)

phil 230 paper 1 (Turing Test) - Throughout his paper,...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Throughout his paper, “Computing Machinery and Intelligence”, Alan Turing explains his test for intelligence; the Turing Test. Turing proposes that if a machine can pass the Turing Test, also known as the “imitation game”, then the object is unquestionably an intelligent, appropriately sophisticated Physical Symbol System, which is how psychology is beginning to define the brain. However, John Searle writes a criticism, the Chinese Room, of this test in “Minds, Brains, and Computers.” Searle’s example has serious implications on Turing’s test and even raises questions as to its validity. The Turing Test is setup like this: There is one human being, one non-human machine, and one interrogator, a human. The interrogator asks questions in a question-answer format to try and figure out which one is the machine. The questions can be phrased in any form, about any topic, and can be as sophisticated or simple as the interrogator likes. If the interrogator can’t accurately decide which one is the machine, then the machine has successfully passed the Turing Test and is attributed intelligence in the same way human beings are attributed intelligence. Turing restricts the machines in the test to digital computers, claiming digital computers are the closest machine to “thinking machines”. A digital computer is a super computer capable of any task of any human made computer. Because it is a human made computer, it follows strict rules and will never deviate from those rules. Therefore, we will know how the machine works and will understand how something is intelligent. Turing creates this restriction because it may be possible that a machine passes the test, but whose way of passing is unknown. HOW IN DEPTH SHOULD WE EXPLAIN DIGITIAL COMPUTERS?????????????????????? The Turing Test is really a test of “Are there imaginable digital computers which would
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/24/2008 for the course PHIL 230 taught by Professor Sabo during the Fall '07 term at UNC.

Page1 / 3

phil 230 paper 1 (Turing Test) - Throughout his paper,...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online