From newshub.ccs.yorku.ca!torn!cs.utexas.edu!sun-barr!ames!network.ucsd.edu!ogicse!qiclab!nosun!techbook!szabo Tue Jul 28 09:41:55 EDT 1992
Article 6505 of comp.ai.philosophy:
Xref: newshub.ccs.yorku.ca rec.arts.sf.science:2830 comp.ai.philosophy:6505
Path: newshub.ccs.yorku.ca!torn!cs.utexas.edu!sun-barr!ames!network.ucsd.edu!ogicse!qiclab!nosun!techbook!szabo
>From: szabo@techbook.com (Nick Szabo)
Newsgroups: rec.arts.sf.science,comp.ai.philosophy
Subject: Re: How do computers fare on scholastic achievement tests?
Message-ID: <1992Jul22.204427.7681@techbook.com>
Date: 22 Jul 92 20:44:27 GMT
Article-I.D.: techbook.1992Jul22.204427.7681
References: <NICKH.92Jul14141610@VOILA.VENARI.CS.CMU.EDU> <1992Jul16.093057.8880@techbook.com> <NICKH.92Jul17110340@VOILA.VENARI.CS.CMU.EDU>
Organization: TECHbooks --- Public Access UNIX --- (503) 644-8135
Lines: 22

In article <NICKH.92Jul17110340@VOILA.VENARI.CS.CMU.EDU> 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 submit that software that discusses the Turing test would be
fairly straightfoward.  A computer scientist or an English
grammar expert might be able to bust it, but most laymen would
be fooled.  On the other hand, I challenge any computer to a
contest on the SAT test.  I suggest that no computer can score
better than 500 on the verbal and 700 on the math (and even that
would take massive amounts of real-world knowledge programmming), unless 
they have a crib sheet programmed in.


-- 
szabo@techbook.COM  Public Access User --- Not affiliated with TECHbooks
Public Access UNIX and Internet at (503) 644-8135 (1200/2400, N81) 


