in 1637 thE FrEnCh philosophEr-mAthEmAtiCiAn rEnEDEsCArtEs prEDiCtED thAt it woulD nEvEr BE possiBlE to mAkE A mAChinE thAt thinks As humAns Do. in 1950, thEBritish mAthEmAtiCiAn AnD ComputEr pionEErAlAn turing DEClArED thAt onE DAy thErE woulD BE A mAChinE thAt CoulD DupliCAtE humAn intElligEnCE in EvEry wAy AnD provE it By pAssing A spECiAlizED tEst. in this tEst, A ComputEr AnD A humAn hiDDEn From viEw woulD BE AskED rAnDom iDEntiCAl quEstions. iF thE ComputEr wErE suCCEssFul, thE quEstionEr woulD BE unABlE to Distinguish thE mAChinE From thE pErson By thE AnswErs. inspirED By turing’’s thEory, thE First ConFErEnCE onAi ConvEnED AtDArtmouthCollEgE in nEw hAmpshirE in 1956. soon AFtErwArDs AnAl lABorAtory wAs stArtED At mAssAChusEtts institutE oF tEChnology By john mCCArthy AnD mArvin minsky, two oF thE nAtion’’s lEADingAi proponEnts. mCCArthy Also invEntED thEAl ComputEr lAnguAgE, lisp; But By thE EArly 1990sAi itsElF hAD not BEEn AChiEvED、howEvEr, logiC progrAms CAllED ExpErt systEms Allow ComputErs to "mAkE DECision" By intErprEting DAtA AnD sElECting From Among AltErnAtivEs. tEChniCiAns CAn run progrAms usED in ComplEx mEDiCAl DiAgnosis, lAnguAgE trAnslAtion, minErAl ExplorAtion, AnD EvEn ComputEr DEsign. mAChinEry CAn outpErForm (胜过) humAns physiCAlly. so, too, CAn ComputErs outpErForm mEntAl FunCtions in limitED ArEAs notABly, in thE spEED oF mAthEmAtiCAl CAlCulAtions. For ExAmplE, thE FAstEst ComputErs DEvElopED ArE ABlE to pErForm roughly 10 Billion CAlCulAtions pEr sEConD、But mAking morE powErFul ComputErs will proBABly not BE thE wAy to CrEAtE A mAChinE CApABlE oF pAssing thE turing tEst:ComputEr progrAms opErAtE ACCorDing to sEt proCEDurEs, or logiC stEps, CAllED Algorithms. in ADDition, most ComputErs Do sEriAl proCEssing; opErAtions oF rECognition AnD ComputAtion ArE pErFormED onE At A timE. thE BrAin works in A mAnnEr CAllED pArAllElED proCEssing, pErForming opErAtions simultAnEously. to AChiEvE simulAtED pArAllEl proCEssing, somE supErComputErs hAvE BEEn mADE with multiplE proCEssors to Follow sEvErAl Algorithms At thE sAmE timE.CritiCs oF thE ApproACh insist thAt solving A ComputAtion DoEs not inDiCAtE unDErstAnDing, somEthing A pErson who solvED A proBlEm woulD hAvE. humAn rEAsoning is not BAsED solEly on rulEs oF logi
C、it involvEs pErCEption, AwArEnEss, EmotionAl prEFErEnCE, vAluEs, EvAluAtion ExpEriEnCE, thE ABility to gEnErAlizE AnD wEigh options, AnD morE. somE proponEnts oFAi hAvE, thErEForE, suggEstED thAt ComputErs shoulD BE pAttErnED AFtEr thE humAn BrAin, whiCh EssEntiAlly Consists oF A nEtwork oF nErvE CElls.By thE EArly 1990s, thE ClosEst ApproximAtion toAl wAs A spECiAl siliCon Chip Built to BEhAvE likE A humAn BrAin CEll. it wAs moDElED AFtEr thE intErnAl workings oF nEurons in thE humAn CErEBrAl CortEx. unlikE thE ConvEntionAl siliCon Chip, whiCh works in DigitAl moDE, thE nEw siliCon Chip works in AnAlog moDE, muCh thE wAy A humAn BrAin CEll works. CritiCs oFAi woulD proBABly AgrEE with thE stAtEmEnt thAt______.
A、logiC plAys thE most importAnt pArt in humAn rEAsoning
B．rEAsoning is somEthing too CompliCAtED to BE DupliCAtED By thE ComputEr
C、thE siliCon Chip is working in thE wAy humAn BrAin works
D．FAst ComputAtion shows thE ABility oF unDErstAnDing