Slide 1

Slide 1 text

Can machines really think? The Turing Test and the Chinese Room George Matthews CC 2017

Slide 2

Slide 2 text

From Functionalism to AI

Slide 3

Slide 3 text

From Functionalism to AI

Slide 4

Slide 4 text

From Functionalism to AI If minds are really just programs running in our human hardware, then it should be possible to build a thinking machine, an Artificial Intelligence, shouldn’t it?

Slide 5

Slide 5 text

Possibilities

Slide 6

Slide 6 text

Possibilities

Slide 7

Slide 7 text

Possibilities Logical: there is no contradiction in the idea of a thinking machine.

Slide 8

Slide 8 text

Possibilities Logical: there is no contradiction in the idea of a thinking machine. Physical: thinking machines do not violate the laws of physics.

Slide 9

Slide 9 text

Possibilities Logical: there is no contradiction in the idea of a thinking machine. Physical: thinking machines do not violate the laws of physics. Technological: we know how to actually build a thinking machine.

Slide 10

Slide 10 text

Possibilities Logical: there is no contradiction in the idea of a thinking machine. Physical: thinking machines do not violate the laws of physics. Technological: we know how to actually build a thinking machine. Social/Moral: there is no strong reason we should not build a thinking machine.

Slide 11

Slide 11 text

The Turing Test

Slide 12

Slide 12 text

The Turing Test How can we tell whether a machine is intelligent?

Slide 13

Slide 13 text

The Turing Test How can we tell whether a machine is intelligent? ! Don’t we have to define intelligence first?

Slide 14

Slide 14 text

The Turing Test How can we tell whether a machine is intelligent? ! Don’t we have to define intelligence first? ! Don’t we have to “reverse engineer” ourselves to build an intelligent machine?

Slide 15

Slide 15 text

The Turing Test How can we tell whether a machine is intelligent? ! Don’t we have to define intelligence first? ! Don’t we have to “reverse engineer” ourselves to build an intelligent machine? Turing’s answer: we do not need to define intelligence.

Slide 16

Slide 16 text

The Turing Test How can we tell whether a machine is intelligent? ! Don’t we have to define intelligence first? ! Don’t we have to “reverse engineer” ourselves to build an intelligent machine? Turing’s answer: we do not need to define intelligence. We just need to talk to a machine and not be able to tell its answers apart from human answers.

Slide 17

Slide 17 text

The Chinese Room

Slide 18

Slide 18 text

The Chinese Room Searle doesn’t understand Chinese.

Slide 19

Slide 19 text

The Chinese Room Searle doesn’t understand Chinese. The instruction book enables the room to pass the Turing Test.

Slide 20

Slide 20 text

The Chinese Room Searle doesn’t understand Chinese. The instruction book enables the room to pass the Turing Test. Computers function like this.

Slide 21

Slide 21 text

The Chinese Room Searle doesn’t understand Chinese. The instruction book enables the room to pass the Turing Test. Computers function like this. So Artificial Intelligence is impossible.

Slide 22

Slide 22 text

Making sense of language

Slide 23

Slide 23 text

Making sense of language

Slide 24

Slide 24 text

Making sense of language Syntax

Slide 25

Slide 25 text

Making sense of language Syntax Rules for transforming symbols.

Slide 26

Slide 26 text

Making sense of language Syntax Rules for transforming symbols. “To form the past tense, add an ED to the end of the infinitive form of the verb.”

Slide 27

Slide 27 text

Making sense of language Syntax Rules for transforming symbols. “To form the past tense, add an ED to the end of the infinitive form of the verb.” Computers are good at manipulating symbols according to rules.

Slide 28

Slide 28 text

Making sense of language Syntax Rules for transforming symbols. “To form the past tense, add an ED to the end of the infinitive form of the verb.” Computers are good at manipulating symbols according to rules. Semantics

Slide 29

Slide 29 text

Making sense of language Syntax Rules for transforming symbols. “To form the past tense, add an ED to the end of the infinitive form of the verb.” Computers are good at manipulating symbols according to rules. Semantics The meaning of the words we use.

Slide 30

Slide 30 text

Making sense of language Syntax Rules for transforming symbols. “To form the past tense, add an ED to the end of the infinitive form of the verb.” Computers are good at manipulating symbols according to rules. Semantics The meaning of the words we use. “Hund” means “perro” in English.

Slide 31

Slide 31 text

Making sense of language Syntax Rules for transforming symbols. “To form the past tense, add an ED to the end of the infinitive form of the verb.” Computers are good at manipulating symbols according to rules. Semantics The meaning of the words we use. “Hund” means “perro” in English. Can computers grasp meanings?