From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!cs.utexas.edu!asuvax!ukma!darwin.sura.net!europa.asd.contel.com!uunet!mcsun!uknet!edcastle!aisb!jeff Tue Jan 28 12:16:48 EST 1992
Article 3079 of comp.ai.philosophy:
Xref: newshub.ccs.yorku.ca comp.ai.philosophy:3079 sci.philosophy.tech:1957
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!cs.utexas.edu!asuvax!ukma!darwin.sura.net!europa.asd.contel.com!uunet!mcsun!uknet!edcastle!aisb!jeff
>From: jeff@aiai.ed.ac.uk (Jeff Dalton)
Newsgroups: comp.ai.philosophy,sci.philosophy.tech
Subject: Re: Table-lookup Chinese speaker
Message-ID: <1992Jan23.221339.24355@aisb.ed.ac.uk>
Date: 23 Jan 92 22:13:39 GMT
References: <1992Jan22.161342.17781@cs.yale.edu> <1992Jan22.200714.20798@bronze.ucs.indiana.edu> <1992Jan22.204734.20123@cs.yale.edu>
Sender: news@aisb.ed.ac.uk (Network News Administrator)
Organization: AIAI, University of Edinburgh, Scotland
Lines: 21

In article <1992Jan22.204734.20123@cs.yale.edu> mcdermott-drew@CS.YALE.EDU (Drew McDermott) writes:
>Now suppose you find a typewriter behaving this way.  Four hypotheses
>occur to you (in increasing order of probability):
>
>   1. It's a miraculous-coincidence system
>   2. It's a humongous-table system
>   3. AI has succeeded
>   4. There's a person on the other end
>
>Surely 1 and 2 are not serious contenders.  Hence although they are
>technically counterexamples to Behavioral Strong AI ("if it behaves as
>if it understands, then it does"), they are not really hypotheses that
>anyone would entertain.

If we're inclined towards (3), all we should say is that AI has
suceeded in producing the behavior.  After all, there might be
different kinds of computer programs, some of which understand
and some of which don't, even if we don't go so far as table
lookup.

-- jd


