Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!uunet!dlogics!dsa
From: dsa@dlogics.COM (David Angulo)
Newsgroups: comp.ai
Subject: Re: Hayes vs. Searle
Summary: Book cannot be printed
Message-ID: <586@dlogics.COM>
Date: 7 Jun 90 18:38:34 GMT
References: <16875@phoenix.Princeton.EDU> <2629@skye.ed.ac.uk> <2687@skye.ed.ac.uk>
Organization: Datalogics Inc., Chicago
Lines: 23

In article <2687@skye.ed.ac.uk>, jeff@aiai.ed.ac.uk (Jeff Dalton) writes:
> In article <16960@phoenix.Princeton.EDU> eliot@phoenix.Princeton.EDU (Eliot Handelman) writes:
> 
> ;How's this for intuitive appeal: no such "book" as the one Searle presupposes
> ;can exist. If this were true, then the argument is based on an impossible
> ;premise, hence there's no argument.
> 
> Not bad, but a program could be printed, and there's the book.
> If you think Searle couldn't work fast enough, imagine that he
> has 1000 helpers.


No, a program couldn't be printed (if by program you mean a list of
questions and their answers) because such a book or program is always
incomplete.  To prove this, all you have to do is ask in English all of
the possible addition problems.  This is infinite so the book cannot list
all of the questions nor can it list all of the answers.

-- 
David S. Angulo                  (312) 266-3134
Datalogics                       Internet: dsa@dlogics.com
441 W. Huron                     UUCP: ..!uunet!dlogics!dsa
Chicago, Il. 60610               FAX: (312) 266-4473