From newshub.ccs.yorku.ca!torn!utcsri!rpi!usc!wupost!waikato.ac.nz!aukuni.ac.nz!ecmtwhk Tue Jul 28 09:41:46 EDT 1992
Article 6490 of comp.ai.philosophy:
Xref: newshub.ccs.yorku.ca rec.arts.sf.science:2808 comp.ai.philosophy:6490
Path: newshub.ccs.yorku.ca!torn!utcsri!rpi!usc!wupost!waikato.ac.nz!aukuni.ac.nz!ecmtwhk
Newsgroups: rec.arts.sf.science,comp.ai.philosophy
Subject: Re: How do computers fare on scholastic achievement tests?
Message-ID: <1992Jul21.020206.17021@ccu1.aukuni.ac.nz>
>From: ecmtwhk@ccu1.aukuni.ac.nz (Thomas Koenig)
Date: Tue, 21 Jul 1992 02:02:06 GMT
References: <NICKH.92Jul17110340@VOILA.VENARI.CS.CMU.EDU>
Organization: University of Auckland, New Zealand.
Lines: 17

nickh@CS.CMU.EDU (Nick Haines) writes:

>But on the other hand SATs (maybe someone should explain what those
>are to the non-American readers of this group) and all other
>`standard' IQ tests seem much easier to pass than a rigorous Turing
>test. If a machine gets a score of 200 on a MENSA test but still can't
>carry on a conversation with me about (hmmm) the usefulness of the
>Turing test, I don't think it should be considered as of high
>intelligence.

Using the Turing test as something to talk about during a Turing test
is dangerous; more than 90% of the people I know (some of which are
very intelligent) just would plain not be interested in the subject :-)
-- 
Thomas Koenig, ecmtwhk@ccu1.aukuni.ac.nz, ib09@rz.uni-karlsruhe.de
The joy of engineering is to find a straight line on a double logarithmic
diagram.


