1 / 22

Announcements

Announcements. Turn your papers into your TA. There will be a review session on Wednesday June 11 at 5-7 PM, in GIRV 1004 . Final exam is Friday June 13 th here, from 8-11 AM. Can Machines Think?. The Turing Test.

ura
Download Presentation

Announcements

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Announcements Turn your papers into your TA. There will be a review session on Wednesday June 11 at 5-7 PM, in GIRV 1004. Final exam is Friday June 13thhere, from 8-11 AM

  2. Can Machines Think?

  3. The Turing Test Turing wants an answer to the question of whether or not it is possible that a machine could have intelligence Intelligence=the ability think that an ordinary adult human possesses

  4. The Turing Test But he sees that this question could get hopelessly complicated very fast. So he proposes a different question: can a computer win at “The Imitation Game”? What Turing calls “The Imitation Game” is now called “The Turing Test.”

  5. The Turing Test The Turing Test for Intelligence • There are three rooms. In A you have the tester. In B you have a person, and in C you have a computer. • The person in A can send messages via computer to B and C. • The person in A has a conversation with B and C for as long as she likes. The computer passes the test if the person in A cannot tell which room has the computer.

  6. The Turing Test

  7. The Turing Test Turing makes two claims about his test: • If something can pass the test, then it is intelligent. • It is possible that a computer could pass. From this it follows that machine intelligence is possible.

  8. Language is Cool This test may seem really bad until one reflects on the sorts of capacities required to fool another person. First and foremost, the machine would have to be a competent language user.

  9. Language is Cool This seems unremarkable to us, because we use language effortlessly all the time. However, being a competent language user requires that one have rather remarkable capacities.

  10. Language is Cool In virtue of understanding a language using a finite number of words you can: • Use your finite mental capacities to understand a potential infinity of possible sentences • Understand totally novel expressions that no one has ever uttered in the history of the world: • “Jennifer Lawrence is eating a grilled cheese sandwich while riding a donkey on the top of the Sears Tower.”

  11. Language is Cool If you could build a machine that could carry out a conversation it would have to be able to duplicate these capacities.

  12. Language is Cool Turing thought that we would have computers passing his test relatively soon. But it turned out to be a lot more difficult than he thought it would be.

  13. Language is Cool With all of our advances, there isn’t a computer around that can come close to passing the Turing test.

  14. Language is Cool

  15. Language is Cool These things are called CAPTCHA’s. • This is an acronym for “Completely Automated Public Turing test to tell Computers and Humans Apart” • They typically rely on linguistic and perceptual capacities that computers have a hard time duplicating.

  16. Objections to the Turing Test But just because no computer can pass, doesn’t mean one never will. But what if one does? Does that mean that it is thinking?

  17. The Chinese Room Searle presents a case that is supposed to show two things: • Passing the Turing Test is not sufficient to establish that something is thinking. • A computer could never think, even in principle.

  18. The Chinese Room • There is a man in a room who is a native English speaker, and has never learned a word of Chinese. • In the room he has a pile of books that have a set of instructions written down on them. • The instructions say: “when you see….then write…” where the blanks are filled with Chinese symbols.

  19. The Chinese Room • There is a slot through which a native Chinese speaker passes notes written in Chinese • The instructions in the books are such that no matter what the person writes down, if the man in the room follows them, what results is a sensible response written in Chinese

  20. The Chinese Room

  21. The Chinese Room Does the man in the room understand Chinese? • Searle says no! • But the man does pass the Turing Test. • Passing the Turing Test does not establish that the thing being tested can even understand the words that are being used.

  22. The Chinese Room More fundamentally, Searle thinks the case shows that a computer could never think. • This is because computers work by manipulating meaningless symbols (think 1’s and 0’s in binary) • That is exactly the kind of process that the man in the Chinese room is employing. • By manipulating symbols in this way, one will never get meaningful thought.

More Related