LESSONS FROM A RESTRICTED TURING TEST

被引:40
作者
SHIEBER, SM
机构
[1] Harvard University, Cambridge, MA
关键词
D O I
10.1145/175208.175217
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
[No abstract available]
引用
收藏
页码:70 / 78
页数:9
相关论文
共 28 条
[1]  
ARBIB MA, 1974, COMMUN ACM, V17, P543
[2]   PSYCHOLOGISM AND BEHAVIORISM [J].
BLOCK, N .
PHILOSOPHICAL REVIEW, 1981, 90 (01) :5-43
[3]  
BLOCK N, 1990, INTRO COGNITIVE SCI, V3, P147
[4]   MODELING A PARANOID MIND [J].
COLBY, KM .
BEHAVIORAL AND BRAIN SCIENCES, 1981, 4 (04) :515-534
[5]   TURING-LIKE INDISTINGUISHABILITY TESTS FOR VALIDATION OF A COMPUTER SIMULATION OF PARANOID PROCESSES [J].
COLBY, KM ;
HILF, FD ;
WEBER, S ;
KRAEMER, HC .
ARTIFICIAL INTELLIGENCE, 1972, 3 (02) :199-221
[6]  
DENNETT D, 1985, WE KNOW, P121
[7]  
DREYFUS H, 1965, ALCHEMY ARTIFICIAL I, P3244
[8]  
Dreyfus Hubert, 1979, WHAT COMPUTERS CANT
[9]  
Epstein Robert, 1992, AI MAG, V13, P81
[10]  
FODOR J, 1968, PSYCHOL EXPLANATION, P126