🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: comp.ai
Article #8650

Re: Late thoughts on T Test, rooms, and functions

#8650
From: Fred Gilham
Date: Mon, 08 Jan 1990 19:00
79 lines
3947 bytes
dhw@itivax.iti.org (David H. West) writes:
----------
Searle's position seems to me to be the result of adopting an
indefensible view of understanding;  our everyday model of
understanding asserts that it is 
1) boolean-valued (you either have it or you don't on a given topic); 
2) atomic (it is magically available to introspection, but has no
   components); and
3) veridical (you're infallible about what you claim to understand).    

Additionally, Searle implicitly assumes understanding to be 

4) static (he wouldn't learn Chinese by following the rules).

None of these assertions withstands much examination.
----------

I am not a cognitive psychologist, so I am on somewhat uncertain
ground here, but I don't feel the above points are necessary to the
argument about understanding.

Boolean valued:  We often say ``I partially understand what you are
saying.''  Nobody finds anything strange about this.  I know the
experience I have when I say this, and I know how it differs from when
I say, ``Yes, I understand what you mean.''

Atomic:  Why must Searle's argument depend on understanding not having
any components?  Why can't memory, or logic, or whimsey, play some
role in what we mean when we say ``I understand''?

Veridical:  Searle's argument does not depend on the statement ``I
understand'' being veridical, merely on the statement ``I don't
understand'' being veridical.  I don't see any problem with this.

Static:  The Chinese language is not even relevant to what Searle is
doing by following the rules.  Take the following example:

RULE:  If you see the number 7211111932971141013212111111763 for the
first time, subtract 7211111925626367813001600101617 from it and
return the result.  If you see it again, add
7332115963839891340469952196998399898370 to it and return the result.

I am not telling you what this is all about (yet).  In principle, any
rule must be of a form something like this, though more complicated,
yet applying only computable operations.  Why should you associate it
with language?  You are doing arithmetic.  From the outside, the
system looks like it is doing language understanding.  But Searle can
follow the rules without being told why he is doing them.  He could,
for all he knows, be computing rocket trajectories or playing chess.

The example rule consists of taking the ascii representations (in
decimal) for ``How are you?'' and, the first time one sees it,
transforming it to ``I'm fine.''  The second time it gets transformed
to ``I said I'm fine!''

kpfleger@phoenix.Princeton.EDU (Karl Robert Pfleger) writes:
----------
The strong AI position is actually a little more general (as I
understand it) because 2 can do 3, but might also be able to do things
which 3 can't.

----------

This is impossible.  In principle, any algorithmic procedure can be
done by hand, and as such, is succeptible to (a possibly proper subset
of) human understanding.
----------
He continues:

"he would know that he is still not doing 3." WHAT?!?!
----------

Taking my example above, I am saying that someone could be doing the
calculations I gave, yet if you asked him, ``Did you understand what
the person said?'' he could honestly answer something like ``No, I
didn't; I didn't even know I was having a conversation.''

-Fred Gilham    gilham@csl.sri.com
Technical Details
Message-ID: <GILHAM.90Jan8110056@cassius.csl.sri.com>
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!clyde.concordia.ca!uunet!snorkelwacker!apple!hercules!gilham
References: <2762@bingvaxu.cc.binghamton.edu> <4753@itivax.iti.org>

Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!clyde.concordia.ca!uunet!snorkelwacker!apple!hercules!gilham
From: gilham@csl.sri.com (Fred Gilham)
Newsgroups: comp.ai
Subject: Re: Late thoughts on T Test, rooms, and functions
Message-ID: <GILHAM.90Jan8110056@cassius.csl.sri.com>
Date: 8 Jan 90 19:00:56 GMT
References: <2762@bingvaxu.cc.binghamton.edu> <4753@itivax.iti.org>
Sender: usenet@csl.sri.com
Organization: Computer Science Lab, SRI International, Menlo Park, CA.
Lines: 79
In-reply-to: dhw@itivax.iti.org's message of 8 Jan 90 06:13:08 GMT