arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1704.08111cs.AI
收藏

人工智能的波普式证伪--莱特希尔辩护

A Popperian Falsification of Artificial Intelligence -- Lighthill Defended

Stanford University(斯坦福大学)

Steven Meyer

摘要:

被称为人工智能(AI)的计算领域被英国数学物理学家詹姆斯·莱特希尔(James Lighthill)在1972年对AI的证伪所证明。Lighthill的论点如何继续适用于当前的AI进行解释。有人认为,人工智能应该使用波普尔的科学方法,即科学家有责任试图证伪理论,如果理论被证伪,则替换或修改它们。本文介绍了Popperian方法,并讨论了保罗护士的方法,细胞生物学,也涉及到机制和行为的问题的应用。它表明如何莱特希尔的证伪论点,特别是组合爆炸继续适用于现代人工智能。反对人工智能假设的各种怀疑论,主要是物理学家,特别是反对希尔伯特的哲学纲领,该纲领将知识和真理定义为可证明的形式句子。约翰冯诺依曼的论点,从自然复杂性对神经网络和进化算法进行了讨论。接下来讨论国际象棋,以展示现代国际象棋专家对计算机国际象棋程序的反应。它表明,目前国际象棋大师可以击败任何国际象棋程序使用卡斯珀罗夫的论点,从他的1997年深蓝比赛和后果。游戏的“去”和气候模型进行了讨论,以显示计算机应用组合爆炸可能不适用。文章最后提出了以Peter Naur的数据学来研究计算的观点。

英文摘要:

The area of computation called artificial intelligence (AI) is falsified by describing a previous 1972 falsification of AI by British mathematical physicist James Lighthill. How Lighthill's arguments continue to apply to current AI is explained. It is argued that AI should use the Popperian scientific method in which it is the duty of scientists to attempt to falsify theories and if theories are falsified to replace or modify them. The paper describes the Popperian method and discusses Paul Nurse's application of the method to cell biology that also involves questions of mechanism and behavior. It is shown how Lighthill's falsifying arguments especially combinatorial explosion continue to apply to modern AI. Various skeptical arguments against the assumptions of AI mostly by physicists especially against Hilbert's philosophical programme that defined knowledge and truth as provable formal sentences. John von Neumann's arguments from natural complexity against neural networks and evolutionary algorithms are discussed. Next the game of chess is discussed to show how modern chess experts have reacted to computer chess programs. It is shown that currently chess masters can defeat any chess program using Kasperov's arguments from his 1997 Deep Blue match and aftermath. The game of 'go' and climate models are discussed to show computer applications where combinatorial explosion may not apply. The paper concludes by advocating studying computation as Peter Naur's Dataology.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑