摘要
Abstract
This paper sums up the fundamental features of intelligence through the common features stated by various definitions of "intelligence": Intelligence is the ability of achieving systematic goals (functions) of brain and nerve system through selecting
and artificial intelligence or machine intelligence is an imitation of life intelligence or a replication of features and functions. Based on the definition mentioned above
this paper discusses and summarizes the development routes of ideas on computable intelligence
including Godel's "universal recursive function"
the computation activities of "selection"
recursive function and Turing machine
mathematical expression of computable intelligence
core nature of computable intelligence
and computability and strong artificial intelligence. At the end of this paper is the conclusion drawn by the authors.
关键词
Keywords
intelligencestrong artificial intelligenceTuring machinecomputabilityrecursive function
references
A. M. Turing Computing Machinery and Intelligence [C]. Mechanical Intelligence. Collected Works of A. M. Turing. North-Holland, 1992.A. M. Turing Intelligent Machinery. Mechanical Intelligence [M]. Collected Works of A. M.Turing. North-Holland, 1992.Alan Turing. On Computable Numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, 42(1936 -- 1937): 230, 231, 262.Alonzo Church. An Unsolvable Problem of Elementary Number Theory [J]. American Journal of Mathematics, 1936, 58, (2)．Edna E. Reiter, Clayton Matthew Johnson: Limits of Computation, An Introduction to the Undicidable and Interctable. CRC Press, 2012.Kurt Godel. On Formally Undecidable Propositions of Principia Mathematica and Related System I. From Frege to Godel, Harvard University Press, pp. 592 - 617．Pentti O Haikonen. Consciousness and Robot Sentience. (One of Serials on Machine Consciousness), World Scientific Publishing Co. Pte. Ltd. 2012. Rechard Gregory．Seeing intelligence /Jean Khalfa edited．What is Intelligence? [M]. The Press Syndicate of the University of Cambridge, 1994． Robert I. Soare. Computability and Recursion, Bulletin of Symbolic Logic /Volume 2 /Issue 03/September, 1996.Robin Gandy. The Confluence of Ideas in 1936. The Universal Turing Machine/A Half-Century Survey, Springer - verlag [M]. Wien New York, 1994, 1995．Shane Legg, Marcus Hutter. Universal Intelligence: A Definition of Machine Intelligence [J]．Mind & Machines, 2007, (17).Stephen C. Kleene. Turing’s Analysis of Computability, and Major Applications of It, The Universal Turing Machine/A Half - Century Survey, Springer - verlag, Wien New York,1994, 1995:15 - 49.Stuart Russell, Peter Norvig, 人工智能———一种现代方法 [M]. 第二版. 北京: 人民邮电出版社, 2009．Susan G Sterrett．Too many instincts: contrasting philosophical views on intelligence in human and non-human [J]. Journal of Experimental & Theoretical Artificial Intelligence, 2002,14(1).Thoralf Skolem. The foundation of elementary arithmetic established by means of the recursion mode of thought, without the use of apparent variables ranging over infinite domains./From Frege to Godel // A Source Book in Mathematical Logic, 1879~1931. Havard University Press, 1977: 302 - 333．哥德尔. 论《数学原理》及其相关系统的形式不可判定命题(I) 张寅生译. 张寅生. 证明方法与理论[M]. 北京: 国防工业出版社, 2015．塞尔. 心灵的再发现[M]. 北京: 中国人民大学出版社, 2005．维特根斯坦. 哲学研究[M]. 北京: 商务印书馆, 1994．希尔伯特. 数学问题[M]. 李文林, 袁向东编译． 大连: 大连理工大学出版社,2009．张寅生. 计算理论解析[M]. 北京: 清华大学出版社,国防工业出版社,2016．
Related Articles
Related Author
Related Institution
- 技术支持由北京北大方正电子有限公司提供 京ICP备18027609号-1
京公网安备11010802024621 - 本系统建议在Chrome、 IE9+ 以上版本浏览器阅读本站内容，360浏览器请切换至极速模式
- Cookies帮助我们提供服务并提供个性化体验。使用本网站，即表示您同意我们使用Cookies