Computing Machines Can't Be Intelligent (...and Turing Said So)

被引:0
作者
Peter Kugel
机构
[1] Boston College,Computer Science Department
来源
Minds and Machines | 2002年 / 12卷
关键词
abstract machines; Artificial Intelligence; Cognitive Science; hypercomputation; intelligence; limiting computability; models of mind; Putnam-Gold machines; trial-and-error machines;
D O I
暂无
中图分类号
学科分类号
摘要
According to the conventional wisdom, Turing (1950) said that computing machines can be intelligent. I don't believe it. I think that what Turing really said was that computing machines –- computers limited to computing –- can only fake intelligence. If we want computers to become genuinelyintelligent, we will have to give them enough “initiative” (Turing, 1948, p. 21) to do more than compute. In this paper, I want to try to develop this idea. I want to explain how giving computers more ``initiative'' can allow them to do more than compute. And I want to say why I believe (and believe that Turing believed) that they will have to go beyond computation before they can become genuinely intelligent.
引用
收藏
页码:563 / 579
页数:16
相关论文
共 14 条
[1]  
Chomsky N.(1956)Three Models for the Description of Language IRE Transactions on Information Theory IT2 113-124
[2]  
Chomsky N.(1957)Review of Skinner Language 35 26-58
[3]  
Copeland B.J.(1999)‘A Lecture and Two Radio Broadcasts on Machine Intelligence by Alan Turing’ Machine Intelligence 15 445-476
[4]  
Copeland B.J.(2000)The Turing Test Minds and Machines 10 519-539
[5]  
Gödel K.(1931)Ñber Formal Unentscheidbare Sätze Der Principia Mathematica Und Verwandter System I Montaschefte für Mathematik und Physik 38 173-198
[6]  
Gold E.M.(1965)Limiting Recursion Journal of Symbolic Logic 30 28-48
[7]  
Kugel P.(1977)Induction Pure and Simple Information and Control 35 276-336
[8]  
Kugel P.(1986)Thinking May Be More Than Computing Cognition 22 137-198
[9]  
Lucas J.R.(1961)Minds, Machines and Gödel] Philosophy 36 112-127
[10]  
Putnam H.(1965)Trial and Error Predicates and the Solution of a Problem of Mostowski Journal of Symbolic Logic 20 49-57