<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="zh-Hans-CN">
	<id>https://wiki.swarma.org/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Pumpkin%E5%8D%97%E7%93%9C</id>
	<title>集智百科 - 复杂系统|人工智能|复杂科学|复杂网络|自组织 - 用户贡献 [zh-cn]</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.swarma.org/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Pumpkin%E5%8D%97%E7%93%9C"/>
	<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php/%E7%89%B9%E6%AE%8A:%E7%94%A8%E6%88%B7%E8%B4%A1%E7%8C%AE/Pumpkin%E5%8D%97%E7%93%9C"/>
	<updated>2026-11-03T01:00:56Z</updated>
	<subtitle>用户贡献</subtitle>
	<generator>MediaWiki 1.35.0</generator>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD&amp;diff=19672</id>
		<title>人工智能</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD&amp;diff=19672"/>
		<updated>2020-12-04T14:57:49Z</updated>

		<summary type="html">&lt;p&gt;Pumpkin南瓜：/* 小说 In fiction */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
此词条已由Thingamabob初步翻译。&lt;br /&gt;
&lt;br /&gt;
 本词条的“方法”之前所有部分已有[[用户:Paradoxist-Paradoxer|Paradoxist@Paradoxer]]审校。翻译老哥tql！&lt;br /&gt;
 本词条的“方法”、“工具”、“伦理”部分已有[[用户:Qige96|Ricky]]审校。为本词条的翻译点赞！&lt;br /&gt;
&lt;br /&gt;
! -- 定义 -- &lt;br /&gt;
&lt;br /&gt;
In [[computer science]], '''artificial intelligence''' ('''AI'''), sometimes called '''machine intelligence''', is [[intelligence]] demonstrated by [[machine]]s, in contrast to the '''natural intelligence'''&amp;lt;!--boldface per WP:R#PLA--&amp;gt; displayed by [[human intelligence|humans]] and [[animal cognition|animals]]. Leading AI textbooks define the field as the study of &amp;quot;[[intelligent agent]]s&amp;quot;: any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals.&amp;lt;ref name=&amp;quot;Definition of AI&amp;quot;/&amp;gt; Colloquially, the term &amp;quot;artificial intelligence&amp;quot; is often used to describe machines (or computers) that mimic &amp;quot;cognitive&amp;quot; functions that humans associate with the [[human mind]], such as &amp;quot;learning&amp;quot; and &amp;quot;problem solving&amp;quot;.{{sfn|Russell|Norvig|2009|p=2}}&lt;br /&gt;
&lt;br /&gt;
In computer science, artificial intelligence (AI), sometimes called machine intelligence, is intelligence demonstrated by machines, in contrast to the natural intelligence&amp;lt;!--boldface per WP:R#PLA--&amp;gt; displayed by humans and animals. Leading AI textbooks define the field as the study of &amp;quot;intelligent agents&amp;quot;: any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals. Colloquially, the term &amp;quot;artificial intelligence&amp;quot; is often used to describe machines (or computers) that mimic &amp;quot;cognitive&amp;quot; functions that humans associate with the human mind, such as &amp;quot;learning&amp;quot; and &amp;quot;problem solving&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color=#ff8000&amp;gt;人工智能 Artificial Intelligence,AI&amp;lt;/font&amp;gt;'''，在计算机科学中亦称'''&amp;lt;font color=#ff8000&amp;gt;机器智能 Machine Intelligence&amp;lt;/font&amp;gt;'''。与人和其他动物表现出的'''&amp;lt;font color=#ff8000&amp;gt;自然智能 Nature Intelligence&amp;lt;/font&amp;gt;'''相反，AI指由人制造出来的机器所表现出来的智能。前沿AI的教科书把AI定义为对“智能体”的研究：智能体指任何感知周围环境并采取行动以最大化其成功实现目标的机会的机器。通俗来说，“AI”就是机器模仿人类与人类大脑相关的“认知”功能：例如“学习”和“解决问题”&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
As machines become increasingly capable, tasks considered to require &amp;quot;intelligence&amp;quot; are often removed from the definition of AI, a phenomenon known as the [[AI effect]].&amp;lt;ref&amp;gt;{{Harvnb|McCorduck|2004|p=204}}&amp;lt;/ref&amp;gt; A quip in Tesler's Theorem says &amp;quot;AI is whatever hasn't been done yet.&amp;quot;&amp;lt;ref&amp;gt;{{Cite web|url=http://people.cs.georgetown.edu/~maloof/cosc270.f17/cosc270-intro-handout.pdf|title=Artificial Intelligence: An Introduction, p. 37|last=Maloof|first=Mark|date=|website=georgetown.edu|access-date=}}&amp;lt;/ref&amp;gt; For instance, [[optical character recognition]] is frequently excluded from things considered to be AI,&amp;lt;ref&amp;gt;{{cite web|url=https://hackernoon.com/how-ai-is-getting-groundbreaking-changes-in-talent-management-and-hr-tech-d24ty3zzd|title= How AI Is Getting Groundbreaking Changes In Talent Management And HR Tech|publisher=Hackernoon}}&amp;lt;/ref&amp;gt; having become a routine technology.&amp;lt;ref&amp;gt;{{cite magazine |last=Schank |first=Roger C.  |title=Where's the AI |magazine=AI magazine |volume=12 |issue=4 |year=1991|p=38}}&amp;lt;/ref&amp;gt; Modern machine capabilities generally classified as AI include successfully [[natural language understanding|understanding human speech]],{{sfn|Russell|Norvig|2009}} competing at the highest level in [[strategic game]] systems (such as [[chess]] and [[Go (game)|Go]]),&amp;lt;ref name=&amp;quot;bbc-alphago&amp;quot;/&amp;gt; [[autonomous car|autonomously operating cars]], intelligent routing in [[content delivery network]]s, and [[military simulations]]&amp;lt;ref&amp;gt;{{Cite web|url=https://www.ai.mil/docs/Understanding%20AI%20Technology.pdf|title=Department of Defense Joint AI Center - Understanding AI Technology|last=Allen|first=Gregory|date=April 2020|website=AI.mil - The official site of the Department of Defense Joint Artificial Intelligence Center|url-status=live|archive-url=|archive-date=|access-date=25 April 2020}}&amp;lt;/ref&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color=#00ff00&amp;gt;以下搬运存在尾端缺失！&amp;lt;/font&amp;gt;'''&lt;br /&gt;
'''&amp;lt;font color=#ff0000&amp;gt;As machines become increasingly capable, tasks considered to require &amp;quot;intelligence&amp;quot; are often removed from the definition of AI, a phenomenon known as the AI effect. A quip in Tesler's Theorem says &amp;quot;AI is whatever hasn't been done yet.&amp;quot; For instance, optical character recognition is frequently excluded from things considered to be AI, having become a routine technology. Modern machine capabilities generally classified as AI include successfully understanding human speech, competing at the highest level in strategic game systems (such as chess and Go),&amp;lt;/font&amp;gt;'''&lt;br /&gt;
&lt;br /&gt;
AI的范围也有争议：随着机器的能力越来越大，很多被认为需要“智能”的任务被一个个从AI范畴中除名。这就是所谓的AI效应。'''&amp;lt;font color=#f32cd32&amp;gt;泰斯勒定理&amp;lt;/font&amp;gt;'''巧妙地把AI描述为“AI是任何还没有实现的东西。”所以比如光学字符识别就往往不再被认为属于AI行列，而已经成为了一种常规技术。被认为是AI的现代机器功能包括顺利理解人类口语，在策略型游戏中完成高水平的竞赛（例如国际象棋和围棋）,自动驾驶汽车，内容分发网络和军事模拟的智能规划。&lt;br /&gt;
&lt;br /&gt;
  --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）1. tasks considered to require &amp;quot;intelligence&amp;quot; are often removed from the definition of AI,很多被认为需要“智能”的任务不再被认为是AI  一句为意译  ；2.Tesler's Theorem（暂译为特斯勒定理）未找到确切翻译；&lt;br /&gt;
'''&amp;lt;font color=#0000ff&amp;gt;已解决！&amp;lt;/font&amp;gt;'''&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- SUMMARIZING HISTORY --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- SUMMARIZING HISTORY --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——总结历史——&lt;br /&gt;
&lt;br /&gt;
Artificial intelligence was founded as an academic discipline in 1955, and in the years since has experienced several waves of optimism,&amp;lt;ref name=&amp;quot;Optimism of early AI&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;AI in the 80s&amp;quot;/&amp;gt; followed by disappointment and the loss of funding (known as an &amp;quot;[[AI winter]]&amp;quot;),&amp;lt;ref name=&amp;quot;First AI winter&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Second AI winter&amp;quot;/&amp;gt; followed by new approaches, success and renewed funding.&amp;lt;ref name=&amp;quot;AI in the 80s&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;AI in 2000s&amp;quot;/&amp;gt; For most of its history, AI research has been divided into sub-fields that often fail to communicate with each other.&amp;lt;ref name=&amp;quot;Fragmentation of AI&amp;quot;/&amp;gt; These sub-fields are based on technical considerations, such as particular goals (e.g. &amp;quot;[[robotics]]&amp;quot; or &amp;quot;[[machine learning]]&amp;quot;),&amp;lt;ref name=&amp;quot;Problems of AI&amp;quot;/&amp;gt; the use of particular tools (&amp;quot;[[logic]]&amp;quot; or [[artificial neural network]]s), or deep philosophical differences.&amp;lt;ref name=&amp;quot;Biological intelligence vs. intelligence in general&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Neats vs. scruffies&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Symbolic vs. sub-symbolic&amp;quot;/&amp;gt; Sub-fields have also been based on social factors (particular institutions or the work of particular researchers).&amp;lt;ref name=&amp;quot;Fragmentation of AI&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Artificial intelligence was founded as an academic discipline in 1955, and in the years since has experienced several waves of optimism, followed by disappointment and the loss of funding (known as an &amp;quot;AI winter&amp;quot;), followed by new approaches, success and renewed funding. For most of its history, AI research has been divided into sub-fields that often fail to communicate with each other. These sub-fields are based on technical considerations, such as particular goals (e.g. &amp;quot;robotics&amp;quot; or &amp;quot;machine learning&amp;quot;), the use of particular tools (&amp;quot;logic&amp;quot; or artificial neural networks), or deep philosophical differences. Sub-fields have also been based on social factors (particular institutions or the work of particular researchers).&lt;br /&gt;
&lt;br /&gt;
1955年AI作为一门学科被建立起来，后来经历过几段乐观时期与紧随而来的亏损以及缺乏资金的困境（也就是“AI寒冬”），每次又找到了新的出路，取得了新的成果和新的投资。对于大多数描述AI的历史，AI研究被划分为互不关联的子领域。人们通常把技术考量作为这些子领域的划分依据，比如特殊目标（例如“机器人学”或者“机器学习”），特殊工具的使用（“逻辑”或者人工神经网络），或者在哲学层面深层次的区别。子领域的划分也与社会因素有关（比如某些特定机构或者特定研究者所做的工作）。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- SUMMARIZING PROBLEMS, APPROACHES, TOOLS --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- SUMMARIZING PROBLEMS, APPROACHES, TOOLS --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——总结问题、方法、工具——&lt;br /&gt;
&lt;br /&gt;
The traditional problems (or goals) of AI research include [[automated reasoning|reasoning]], [[knowledge representation]], [[Automated planning and scheduling|planning]], [[machine learning|learning]], [[natural language processing]], [[machine perception|perception]] and the ability to move and manipulate objects.&amp;lt;ref name=&amp;quot;Problems of AI&amp;quot;/&amp;gt; [[artificial general intelligence|General intelligence]] is among the field's long-term goals.&amp;lt;ref name=&amp;quot;General intelligence&amp;quot;/&amp;gt; Approaches include [[#Statistical|statistical methods]], [[#Sub-symbolic|computational intelligence]], and [[#Symbolic|traditional symbolic AI]]. Many tools are used in AI, including versions of [[#Search and optimization|search and mathematical optimization]], [[artificial neural network]]s, and [[#Probabilistic methods for uncertain reasoning|methods based on statistics, probability and economics]]. The AI field draws upon [[computer science]], [[Information engineering (field)|information engineering]], [[mathematics]], [[psychology]], [[linguistics]], [[philosophy]], and many other fields.&lt;br /&gt;
&lt;br /&gt;
The traditional problems (or goals) of AI research include reasoning, knowledge representation, planning, learning, natural language processing, perception and the ability to move and manipulate objects. General intelligence is among the field's long-term goals. Approaches include statistical methods, computational intelligence, and traditional symbolic AI. Many tools are used in AI, including versions of search and mathematical optimization, artificial neural networks, and methods based on statistics, probability and economics. The AI field draws upon computer science, information engineering, mathematics, psychology, linguistics, philosophy, and many other fields.&lt;br /&gt;
&lt;br /&gt;
AI研究的传统问题或者说目标包括'''&amp;lt;font color=#ff8000&amp;gt;自动推理 Automated Reasoning&amp;lt;/font&amp;gt; '''，'''&amp;lt;font color=#ff8000&amp;gt;知识表示 Knowledge Representation&amp;lt;/font&amp;gt;'''，'''&amp;lt;font color=#ff8000&amp;gt;自动规划 Automated Planning and Scheduling&amp;lt;/font&amp;gt;'''，'''&amp;lt;font color=#ff8000&amp;gt;学习 Learning&amp;lt;/font&amp;gt;'''，'''&amp;lt;font color=#ff8000&amp;gt;自然语言处理 Natural Language Processing&amp;lt;/font&amp;gt;'''，感知以及移动和熟练操控物体的能力。实现通用AI目前仍然是该领域的长远目标。比较流行的研究方法包括统计方法，计算智能和传统AI所用的符号计算。目前有大量的工具应用于AI，其中包括搜索和数学优化、人工神经网络以及基于统计学、概率论和经济学的算法。AI领域涉及计算机科学，信息工程，数学，心理学，语言学，哲学及其他学科。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- SUMMARISING FICTION/SPECULATION, PHILOSOPHY, HISTORY --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- SUMMARISING FICTION/SPECULATION, PHILOSOPHY, HISTORY --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——总结小说 / 推测，哲学，历史——&lt;br /&gt;
&lt;br /&gt;
The field was founded on the assumption that [[human intelligence]] &amp;quot;can be so precisely described that a machine can be made to simulate it&amp;quot;.&amp;lt;ref&amp;gt;See the [[Dartmouth Workshop|Dartmouth proposal]], under [[#Philosophy|Philosophy]], below.&amp;lt;/ref&amp;gt; This raises philosophical arguments about the nature of the [[mind]] and the ethics of creating artificial beings endowed with human-like intelligence. These issues have been explored by [[History of AI#AI in myth, fiction and speculation|myth]], [[artificial intelligence in fiction|fiction]] and [[philosophy of AI|philosophy]] since [[ancient history|antiquity]].&amp;lt;ref name=&amp;quot;McCorduck's thesis&amp;quot;/&amp;gt; Some people also consider AI to be [[existential risk|a danger to humanity]] if it progresses unabated.&amp;lt;ref&amp;gt;{{cite web|url=https://betanews.com/2016/10/21/artificial-intelligence-stephen-hawking/|title=Stephen Hawking believes AI could be mankind's last accomplishment|date=21 October 2016|website=BetaNews|url-status=live|archiveurl=https://web.archive.org/web/20170828183930/https://betanews.com/2016/10/21/artificial-intelligence-stephen-hawking/|archivedate=28 August 2017|df=dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;pmid31835078&amp;quot;&amp;gt;{{cite journal |vauthors=Lombardo P, Boehm I, Nairz K |title=RadioComics – Santa Claus and the future of radiology |journal=Eur J Radiol |volume=122 |issue=1 |pages=108771 |year=2020 |pmid=31835078 |doi=10.1016/j.ejrad.2019.108771|doi-access=free }}&amp;lt;/ref&amp;gt; Others believe that AI, unlike previous technological revolutions, will create a [[Technological unemployment#21st century|risk of mass unemployment]].&amp;lt;ref name=&amp;quot;guardian jobs debate&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The field was founded on the assumption that human intelligence &amp;quot;can be so precisely described that a machine can be made to simulate it&amp;quot;. This raises philosophical arguments about the nature of the mind and the ethics of creating artificial beings endowed with human-like intelligence. These issues have been explored by myth, fiction and philosophy since antiquity. Others believe that AI, unlike previous technological revolutions, will create a risk of mass unemployment.&lt;br /&gt;
&lt;br /&gt;
这一领域是建立在人类智能“可以被精确描述从而使机器可以模拟”的观点上的。这一观点引出了关于思维的本质和创造具有类人智能AI的伦理方面的哲学争论，于是自古以来就有一些神话、小说以及哲学对此类问题展开过探讨。一些人认为AI的发展不会威胁人类生存；但另一些人认为AI与以前的技术革命不同，它将带来大规模失业的风险。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- SUMMARIZING APPLICATIONS, STATE OF THE ART --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- SUMMARIZING APPLICATIONS, STATE OF THE ART --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——总结应用，最新进展——&lt;br /&gt;
&lt;br /&gt;
In the twenty-first century, AI techniques have experienced a resurgence following concurrent advances in [[Computer performance|computer power]], large amounts of [[big data|data]], and theoretical understanding; and AI techniques have become an essential part of the [[technology industry]], helping to solve many challenging problems in computer science, [[software engineering]] and [[operations research]].&amp;lt;ref name=&amp;quot;AI widely used&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;AI in 2000s&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In the twenty-first century, AI techniques have experienced a resurgence following concurrent advances in computer power, large amounts of data, and theoretical understanding; and AI techniques have become an essential part of the technology industry, helping to solve many challenging problems in computer science, software engineering and operations research.&lt;br /&gt;
&lt;br /&gt;
在二十一世纪，随着计算机能力、大量数据和理论认识的同步发展，人工智能技术经历了一次复兴; 人工智能技术已成为技术工业的重要组成部分，帮助解决了计算机科学、软件工程和运筹学中的许多具有挑战性的问题。&lt;br /&gt;
&lt;br /&gt;
{{toclimit|3}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== 历史 History ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- THIS IS A SOCIAL HISTORY. TECHNICAL HISTORY IS COVERED IN THE &amp;quot;APPROACHES&amp;quot; AND &amp;quot;TOOLS&amp;quot; SECTIONS. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- THIS IS A SOCIAL HISTORY. TECHNICAL HISTORY IS COVERED IN THE &amp;quot;APPROACHES&amp;quot; AND &amp;quot;TOOLS&amp;quot; SECTIONS. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这是一部社会史。“方法”和“工具”部分介绍了技术历史。--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{{Main|History of artificial intelligence|Timeline of artificial intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Didrachm Phaistos obverse CdM.jpg|thumb|Silver [[didrachma]] from [[Crete]] depicting [[Talos]], an ancient mythical [[automaton]] with artificial intelligence]银[来自克里特岛的描绘塔罗斯的狄拉克马，一种古代神话中的具有人工智能的自动机]]&lt;br /&gt;
&lt;br /&gt;
Silver [[didrachma from Crete depicting Talos, an ancient mythical automaton with artificial intelligence]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- PRE-20TH CENTURY. MAYBE TO BE KEPT SHORT. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- PRE-20TH CENTURY. MAYBE TO BE KEPT SHORT. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! -- 20世纪前。也许是为了保持简短。--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Thought-capable [[artificial being]]s appeared as [[storytelling device]]s in antiquity,&amp;lt;ref name=&amp;quot;AI in myth&amp;quot;/&amp;gt; and have been common in fiction, as in [[Mary Shelley]]'s ''[[Frankenstein]]'' or [[Karel Čapek]]'s ''[[R.U.R. (Rossum's Universal Robots)]]''.&amp;lt;!-- PLEASE DON'T ADD MORE EXAMPLES. THIS IS ENOUGH. SEE SECTION AT BOTTOM OF ARTICLE ON SPECULATION.--&amp;gt;&amp;lt;ref name=&amp;quot;AI in early science fiction&amp;quot;/&amp;gt; These characters and their fates raised many of the same issues now discussed in the [[ethics of artificial intelligence]].&amp;lt;ref name=&amp;quot;McCorduck's thesis&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Thought-capable artificial beings appeared as storytelling devices in antiquity, and have been common in fiction, as in Mary Shelley's Frankenstein or Karel Čapek's R.U.R. (Rossum's Universal Robots).&amp;lt;!-- PLEASE DON'T ADD MORE EXAMPLES. THIS IS ENOUGH. SEE SECTION AT BOTTOM OF ARTICLE ON SPECULATION.--&amp;gt; These characters and their fates raised many of the same issues now discussed in the ethics of artificial intelligence.&lt;br /&gt;
&lt;br /&gt;
具有思维能力的人造生物在古代以故事讲述者的方式出现，在小说中也很常见。比如玛丽 · 雪莱的《弗兰肯斯坦》和卡雷尔 · 阿佩克的《罗素姆的万能机器人》(Rossum's Universal Robots，R.U.R.) ——小说中的角色和他们的命运向人们提出了许多现在在人工智能伦理学中讨论的同样的问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- MAJOR INTELLECTUAL PRECURSORS: LOGIC, THEORY OF COMPUTATION, CYBERNETICS, INFORMATION THEORY, EARLY NEURAL NETS --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- MAJOR INTELLECTUAL PRECURSORS: LOGIC, THEORY OF COMPUTATION, CYBERNETICS, INFORMATION THEORY, EARLY NEURAL NETS --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——主要智能前体: 逻辑学、计算理论、控制论、信息论、早期神经网络&lt;br /&gt;
&lt;br /&gt;
The study of mechanical or [[formal reasoning|&amp;quot;formal&amp;quot; reasoning]] began with [[philosopher]]s and mathematicians in antiquity. The study of mathematical logic led directly to [[Alan Turing]]'s [[theory of computation]], which suggested that a machine, by shuffling symbols as simple as &amp;quot;0&amp;quot; and &amp;quot;1&amp;quot;, could simulate any conceivable act of mathematical deduction. This insight, that digital computers can simulate any process of formal reasoning, is known as the [[Church–Turing thesis]].&amp;lt;ref name=&amp;quot;Formal reasoning&amp;quot;/&amp;gt; Along with concurrent discoveries in [[Neuroscience|neurobiology]], [[information theory]] and [[cybernetic]]s, this led researchers to consider the possibility of building an electronic brain. Turing proposed changing the question from whether a machine was intelligent, to &amp;quot;whether or not it is possible for machinery to show intelligent behaviour&amp;quot;.&amp;lt;ref&amp;gt;{{Citation | last = Turing | first = Alan | authorlink=Alan Turing | year=1948 | chapter=Machine Intelligence | title = The Essential Turing: The ideas that gave birth to the computer age | editor=Copeland, B. Jack | isbn = 978-0-19-825080-7 | publisher = Oxford University Press | location = Oxford | page = 412 }}&amp;lt;/ref&amp;gt; The first work that is now generally recognized as AI was [[Warren McCullouch|McCullouch]] and [[Walter Pitts|Pitts]]' 1943 formal design for [[Turing-complete]] &amp;quot;artificial neurons&amp;quot;.{{sfn|Russell|Norvig|2009|p=16}}&lt;br /&gt;
&lt;br /&gt;
The study of mechanical or &amp;quot;formal&amp;quot; reasoning began with philosophers and mathematicians in antiquity. The study of mathematical logic led directly to Alan Turing's theory of computation, which suggested that a machine, by shuffling symbols as simple as &amp;quot;0&amp;quot; and &amp;quot;1&amp;quot;, could simulate any conceivable act of mathematical deduction. This insight, that digital computers can simulate any process of formal reasoning, is known as the Church–Turing thesis. The first work that is now generally recognized as AI was McCullouch and Pitts' 1943 formal design for Turing-complete &amp;quot;artificial neurons&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
机械化或者说“形式化”推理的研究始于古代的哲学家和数学家。这些数理逻辑的研究直接催生了图灵的计算理论，即机器可以通过移动如“0”和“1”的简单的符号，就能模拟任何通过数学推演可以想到的过程，这一观点被称为'''&amp;lt;font color=#ff8000&amp;gt;邱奇-图灵论题 Church–Turing Thesis&amp;lt;/font&amp;gt;'''。图灵提出“如果人类无法区分机器和人类的回应，那么机器可以被认为是“智能的”。目前人们公认的最早的AI工作是由麦卡洛和皮茨在1943年正式设计的图灵完备“人工神经元”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
  --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）图灵提出“如果人类无法区分机器和人类的回应，那么机器可以被认为是“智能的” 一句为从原版wiki上补充的&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- THE &amp;quot;GOLDEN YEARS&amp;quot; 1956-1974 --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- THE &amp;quot;GOLDEN YEARS&amp;quot; 1956-1974 --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! -- “黄金年代”1956 -- 1974 --&lt;br /&gt;
&lt;br /&gt;
The field of AI research was born at [[Dartmouth workshop|a workshop]] at [[Dartmouth College]] in 1956,&amp;lt;ref name=&amp;quot;Dartmouth conference&amp;quot;/&amp;gt; where the term &amp;quot;Artificial Intelligence&amp;quot; was coined by [[John McCarthy (computer scientist)|John McCarthy]] to distinguish the field from cybernetics and escape the influence of the cyberneticist [[Norbert Wiener]].&amp;lt;ref&amp;gt;{{cite journal |last=McCarthy |first=John |authorlink=John McCarthy (computer scientist) |title=Review of ''The Question of Artificial Intelligence'' |journal=Annals of the History of Computing |volume=10 |number=3 |year=1988 |pages=224–229}}, collected in {{cite book |last=McCarthy |first=John |authorlink=John McCarthy (computer scientist) |title=Defending AI Research: A Collection of Essays and Reviews |publisher=CSLI |year=1996 |chapter=10. Review of ''The Question of Artificial Intelligence''}}, p. 73, &amp;quot;[O]ne of the reasons for inventing the term &amp;quot;artificial intelligence&amp;quot; was to escape association with &amp;quot;cybernetics&amp;quot;. Its concentration on analog feedback seemed misguided, and I wished to avoid having either to accept Norbert (not Robert) Wiener as a guru or having to argue with him.&amp;quot;&amp;lt;/ref&amp;gt; Attendees [[Allen Newell]] ([[Carnegie Mellon University|CMU]]), [[Herbert A. Simon|Herbert Simon]] (CMU), John McCarthy ([[Massachusetts Institute of Technology|MIT]]), [[Marvin Minsky]] (MIT) and [[Arthur Samuel]] ([[IBM]]) became the founders and leaders of AI research.&amp;lt;ref name=&amp;quot;Hegemony of the Dartmouth conference attendees&amp;quot;/&amp;gt; They and their students produced programs that the press described as &amp;quot;astonishing&amp;quot;:{{sfn|Russell|Norvig|2003|p=18|quote=it was astonishing whenever a computer did anything kind of smartish}} computers were learning [[draughts|checkers]] strategies (c. 1954)&amp;lt;ref&amp;gt;Schaeffer J. (2009) Didn't Samuel Solve That Game?. In: One Jump Ahead. Springer, Boston, MA&amp;lt;/ref&amp;gt; (and by 1959 were reportedly playing better than the average human),&amp;lt;ref&amp;gt;{{cite journal|last1=Samuel|first1=A. L.|title=Some Studies in Machine Learning Using the Game of Checkers|journal=IBM Journal of Research and Development|date=July 1959|volume=3|issue=3|pages=210–229|doi=10.1147/rd.33.0210|citeseerx=10.1.1.368.2254}}&amp;lt;/ref&amp;gt; solving word problems in algebra, proving [[Theorem|logical theorems]] ([[Logic Theorist]], first run c. 1956) and speaking English.&amp;lt;ref name=&amp;quot;Golden years of AI&amp;quot;/&amp;gt; By the middle of the 1960s, research in the U.S. was heavily funded by the [[DARPA|Department of Defense]]&amp;lt;ref name=&amp;quot;AI funding in the 60s&amp;quot;/&amp;gt; and laboratories had been established around the world.&amp;lt;ref name=&amp;quot;AI in England&amp;quot;/&amp;gt; AI's founders were optimistic about the future: [[Herbert A. Simon|Herbert Simon]] predicted, &amp;quot;machines will be capable, within twenty years, of doing any work a man can do&amp;quot;. [[Marvin Minsky]] agreed, writing, &amp;quot;within a generation&amp;amp;nbsp;... the problem of creating 'artificial intelligence' will substantially be solved&amp;quot;.&amp;lt;ref name=&amp;quot;Optimism of early AI&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The field of AI research was born at a workshop at Dartmouth College in 1956, Attendees Allen Newell (CMU), Herbert Simon (CMU), John McCarthy (MIT), Marvin Minsky (MIT) and Arthur Samuel (IBM) became the founders and leaders of AI research. (and by 1959 were reportedly playing better than the average human), solving word problems in algebra, proving logical theorems (Logic Theorist, first run c. 1956) and speaking English. By the middle of the 1960s, research in the U.S. was heavily funded by the Department of Defense and laboratories had been established around the world. AI's founders were optimistic about the future: Herbert Simon predicted, &amp;quot;machines will be capable, within twenty years, of doing any work a man can do&amp;quot;. Marvin Minsky agreed, writing, &amp;quot;within a generation&amp;amp;nbsp;... the problem of creating 'artificial intelligence' will substantially be solved&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
AI研究于1956年起源于在达特茅斯学院举办的一个研讨会，与会者艾伦·纽厄尔(CMU)，赫伯特·西蒙(CMU)，约翰·麦卡锡(MIT)，马文•明斯基(MIT)和阿瑟·塞缪尔(IBM)成为了AI研究的创始人和领导者。他们和他们的学生做了一个被新闻表述为“叹为观止”的计算机学习策略(以及在1959年就被报道达到人类的平均水平之上) ，解决代数应用题，证明逻辑理论'''&amp;lt;font color=#32cd32&amp;gt;（逻辑理论家）&amp;lt;/font&amp;gt;'''以及说英语。到20世纪60年代中期，美国国防高级研究计划局斥重资支持研究，世界各地纷纷建立研究室。AI的创始人对未来充满乐观: 赫伯特 · 西蒙预言，“二十年内，机器将能完成人能做到的一切工作。”。马文•明斯基对此表示同意，他写道: “在一代人的时间里... ... 创造‘AI’的问题将得到实质性的解决。”&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
  --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）不太明白first run c. 1956的含义&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- FIRST AI WINTER --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- FIRST AI WINTER --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! 第一个人工智能的冬天&lt;br /&gt;
&lt;br /&gt;
They failed to recognize the difficulty of some of the remaining tasks. Progress slowed and in 1974, in response to the criticism of [[Sir James Lighthill]]{{sfn|Lighthill|1973}} and ongoing pressure from the US Congress to fund more productive projects, both the U.S. and British governments cut off exploratory research in AI. The next few years would later be called an &amp;quot;[[AI winter]]&amp;quot;,&amp;lt;ref name=&amp;quot;First AI winter&amp;quot;/&amp;gt; a period when obtaining funding for AI projects was difficult.&lt;br /&gt;
&lt;br /&gt;
They failed to recognize the difficulty of some of the remaining tasks. Progress slowed and in 1974, in response to the criticism of Sir James Lighthill and ongoing pressure from the US Congress to fund more productive projects, both the U.S. and British governments cut off exploratory research in AI. The next few years would later be called an &amp;quot;AI winter&amp;quot;, a period when obtaining funding for AI projects was difficult.&lt;br /&gt;
&lt;br /&gt;
他们没有意识到现存任务的一些困难。研究进程放缓，在1974年，由于詹姆斯·莱特希尔的指责以及美国国会需要分拨基金给其他有成效的项目，美国和英国政府都削减了探索性AI研究项目。接下来的几年被称为“AI寒冬”，在这一时期AI研究很难得到经费。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- BOOM OF THE 1980s, SECOND AI WINTER --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- BOOM OF THE 1980s, SECOND AI WINTER --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! 20世纪80年代的繁荣，第二个人工智能的冬天&lt;br /&gt;
&lt;br /&gt;
In the early 1980s, AI research was revived by the commercial success of [[expert system]]s,&amp;lt;ref name=&amp;quot;Expert systems&amp;quot;/&amp;gt; a form of AI program that simulated the knowledge and analytical skills of human experts. By 1985, the market for AI had reached over a billion dollars. At the same time, Japan's [[fifth generation computer]] project inspired the U.S and British governments to restore funding for [[academic research]].&amp;lt;ref name=&amp;quot;AI in the 80s&amp;quot;/&amp;gt; However, beginning with the collapse of the [[Lisp Machine]] market in 1987, AI once again fell into disrepute, and a second, longer-lasting hiatus began.&amp;lt;ref name=&amp;quot;Second AI winter&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In the early 1980s, AI research was revived by the commercial success of expert systems, a form of AI program that simulated the knowledge and analytical skills of human experts. By 1985, the market for AI had reached over a billion dollars. At the same time, Japan's fifth generation computer project inspired the U.S and British governments to restore funding for academic research. However, beginning with the collapse of the Lisp Machine market in 1987, AI once again fell into disrepute, and a second, longer-lasting hiatus began.&lt;br /&gt;
&lt;br /&gt;
在20世纪80年代初期，由于专家系统在商业上取得的成功，AI研究迎来了复兴，专家系统是一种能够模拟人类专家的知识和分析能力的程序。到1985年，AI市场超过了10亿美元。与此同时，日本的第五代计算机项目促使了美国和英国政府恢复对学术研究的资助。然而，随着1987年 Lisp 机器市场的崩溃，AI再一次遭遇低谷，并陷入了第二次持续更长时间的停滞。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The development of [[metal–oxide–semiconductor]] (MOS) [[very-large-scale integration]] (VLSI), in the form of [[complementary MOS]] (CMOS) [[transistor]] technology, enabled the development of practical [[artificial neural network]] (ANN) technology in the 1980s. A landmark publication in the field was the 1989 book ''Analog VLSI Implementation of Neural Systems'' by Carver A. Mead and Mohammed Ismail.&amp;lt;ref name=&amp;quot;Mead&amp;quot;&amp;gt;{{cite book|url=http://fennetic.net/irc/Christopher%20R.%20Carroll%20Carver%20Mead%20Mohammed%20Ismail%20Analog%20VLSI%20Implementation%20of%20Neural%20Systems.pdf|title=Analog VLSI Implementation of Neural Systems|date=8 May 1989|publisher=[[Kluwer Academic Publishers]]|isbn=978-1-4613-1639-8|last1=Mead|first1=Carver A.|last2=Ismail|first2=Mohammed|series=The Kluwer International Series in Engineering and Computer Science|volume=80|location=Norwell, MA|doi=10.1007/978-1-4613-1639-8}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The development of metal–oxide–semiconductor (MOS) very-large-scale integration (VLSI), in the form of complementary MOS (CMOS) transistor technology, enabled the development of practical artificial neural network (ANN) technology in the 1980s. A landmark publication in the field was the 1989 book Analog VLSI Implementation of Neural Systems by Carver A. Mead and Mohammed Ismail.&lt;br /&gt;
&lt;br /&gt;
20世纪80年代，'''&amp;lt;font color=#ff8000&amp;gt;互补金属氧化物半导体；Complementary Metal Oxide Semiconductor，CMOS&amp;lt;/font&amp;gt;'''技术的出现带来了'''&amp;lt;font color=#ff8000&amp;gt;金属氧化物半导体；Metal Oxide Semiconductor，MOS&amp;lt;/font&amp;gt;''''''&amp;lt;font color=#ff8000&amp;gt;超大规模集成电路；Very Large Scale Integration，VLSI&amp;lt;/font&amp;gt;'''的发展，使实用的'''&amp;lt;font color=#ff8000&amp;gt;人工神经网络；Artificial Neural Network，ANN&amp;lt;/font&amp;gt;''' 技术得以发展。这一领域里程碑式的出版物是1989年出版的《模拟 VLSI 神经系统的实现》， 作者是卡弗 · a · 米德和穆罕默德 · 伊斯梅尔。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- FORMAL METHODS RISING IN THE 90s --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- FORMAL METHODS RISING IN THE 90s --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——形式方法兴起于90年代&lt;br /&gt;
&lt;br /&gt;
In the late 1990s and early 21st century, AI began to be used for logistics, [[data mining]], [[medical diagnosis]] and other areas.&amp;lt;ref name=&amp;quot;AI widely used&amp;quot;/&amp;gt; The success was due to increasing computational power (see [[Moore's law]] and [[transistor count]]), greater emphasis on solving specific problems, new ties between AI and other fields (such as [[statistics]], [[economics]] and [[mathematical optimization|mathematics]]), and a commitment by researchers to mathematical methods and scientific standards.&amp;lt;ref name=&amp;quot;Formal methods in AI&amp;quot;/&amp;gt; [[IBM Deep Blue|Deep Blue]] became the first computer chess-playing system to beat a reigning world chess champion, [[Garry Kasparov]], on 11 May 1997.{{sfn|McCorduck|2004|pp=480–483}}&lt;br /&gt;
&lt;br /&gt;
In the late 1990s and early 21st century, AI began to be used for logistics, data mining, medical diagnosis and other areas. The success was due to increasing computational power (see Moore's law and transistor count), greater emphasis on solving specific problems, new ties between AI and other fields (such as statistics, economics and mathematics), and a commitment by researchers to mathematical methods and scientific standards. Deep Blue became the first computer chess-playing system to beat a reigning world chess champion, Garry Kasparov, on 11 May 1997.&lt;br /&gt;
&lt;br /&gt;
在20世纪90年代末和21世纪初，人工智能开始被用于物流、数据挖掘、医疗诊断和其他领域。这种成功归功于计算能力的提高(见摩尔定律和晶体管数量)、对解决特定问题的更大重视、人工智能与其它领域(如统计学、经济学和数学)之间的新联系，以及研究人员对数学方法和科学标准的承诺。1997年5月11日，深蓝成为第一个击败国际象棋卫冕冠军加里·卡斯帕罗夫的计算机国际象棋系统。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--DEEP LEARNING, BIG DATA &amp;amp; MACHINE LEARNING IN THE 2010s --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--DEEP LEARNING, BIG DATA &amp;amp; MACHINE LEARNING IN THE 2010s --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! 2010年代的深度学习、大数据和机器学习&lt;br /&gt;
&lt;br /&gt;
In 2011, a ''[[Jeopardy!]]'' [[quiz show]] exhibition match, [[IBM]]'s [[question answering system]], [[Watson (artificial intelligence software)|Watson]], defeated the two greatest ''Jeopardy!'' champions, [[Brad Rutter]] and [[Ken Jennings]], by a significant margin.{{sfn|Markoff|2011}} [[Moore's law|Faster computers]], algorithmic improvements, and access to [[big data|large amounts of data]] enabled advances in [[machine learning]] and perception; data-hungry [[deep learning]] methods started to dominate accuracy benchmarks [[Deep learning#Deep learning revolution|around 2012]].&amp;lt;ref&amp;gt;{{cite web|title=Ask the AI experts: What's driving today's progress in AI?|url=https://www.mckinsey.com/business-functions/mckinsey-analytics/our-insights/ask-the-ai-experts-whats-driving-todays-progress-in-ai|website=McKinsey &amp;amp; Company|accessdate=13 April 2018|language=en}}&amp;lt;/ref&amp;gt; The [[Kinect]], which provides a 3D body–motion interface for the [[Xbox 360]] and the [[Xbox One]], uses algorithms that emerged from lengthy AI research&amp;lt;ref&amp;gt;{{cite web|url=http://www.i-programmer.info/news/105-artificial-intelligence/2176-kinects-ai-breakthrough-explained.html|title=Kinect's AI breakthrough explained|author=Administrator|work=i-programmer.info|url-status=live|archiveurl=https://web.archive.org/web/20160201031242/http://www.i-programmer.info/news/105-artificial-intelligence/2176-kinects-ai-breakthrough-explained.html|archivedate=1 February 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; as do [[intelligent personal assistant]]s in [[smartphone]]s.&amp;lt;ref&amp;gt;{{cite web|url=http://readwrite.com/2013/01/15/virtual-personal-assistants-the-future-of-your-smartphone-infographic|title=Virtual Personal Assistants &amp;amp; The Future Of Your Smartphone [Infographic]|date=15 January 2013|author=Rowinski, Dan|work=ReadWrite|url-status=live|archiveurl=https://web.archive.org/web/20151222083034/http://readwrite.com/2013/01/15/virtual-personal-assistants-the-future-of-your-smartphone-infographic|archivedate=22 December 2015|df=dmy-all}}&amp;lt;/ref&amp;gt; In March 2016, [[AlphaGo]] won 4 out of 5 games of [[Go (game)|Go]] in a match with Go champion [[Lee Sedol]], becoming the first [[Computer Go|computer Go-playing system]] to beat a professional Go player without [[Go handicaps|handicaps]].&amp;lt;ref name=&amp;quot;bbc-alphago&amp;quot;&amp;gt;{{cite web|url=https://deepmind.com/alpha-go.html|title=AlphaGo – Google DeepMind|url-status=live|archiveurl=https://web.archive.org/web/20160310191926/https://www.deepmind.com/alpha-go.html|archivedate=10 March 2016|df=dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Artificial intelligence: Google's AlphaGo beats Go master Lee Se-dol|url=https://www.bbc.com/news/technology-35785875|accessdate=1 October 2016|work=BBC News|date=12 March 2016|url-status=live|archiveurl=https://web.archive.org/web/20160826103910/http://www.bbc.com/news/technology-35785875|archivedate=26 August 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; In the 2017 [[Future of Go Summit]], [[AlphaGo]] won a [[AlphaGo versus Ke Jie|three-game match]] with [[Ke Jie]],&amp;lt;ref&amp;gt;{{cite journal|url=https://www.wired.com/2017/05/win-china-alphagos-designers-explore-new-ai/|title=After Win in China, AlphaGo's Designers Explore New AI|journal=Wired|date=27 May 2017|url-status=live|archiveurl=https://web.archive.org/web/20170602234726/https://www.wired.com/2017/05/win-china-alphagos-designers-explore-new-ai/|archivedate=2 June 2017|df=dmy-all|last1=Metz|first1=Cade}}&amp;lt;/ref&amp;gt; who at the time continuously held the world No. 1 ranking for two years.&amp;lt;ref&amp;gt;{{cite web|url=http://www.goratings.org/|title=World's Go Player Ratings|date=May 2017|url-status=live|archiveurl=https://web.archive.org/web/20170401123616/https://www.goratings.org/|archivedate=1 April 2017|df=dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite web|title=柯洁迎19岁生日 雄踞人类世界排名第一已两年|url=http://sports.sina.com.cn/go/2016-08-02/doc-ifxunyya3020238.shtml|language=Chinese|date=May 2017|url-status=live|archiveurl=https://web.archive.org/web/20170811222849/http://sports.sina.com.cn/go/2016-08-02/doc-ifxunyya3020238.shtml|archivedate=11 August 2017|df=dmy-all}}&amp;lt;/ref&amp;gt; This marked the completion of a significant milestone in the development of Artificial Intelligence as Go is a relatively complex game, more so than Chess.&lt;br /&gt;
&lt;br /&gt;
In 2011, a Jeopardy! quiz show exhibition match, IBM's question answering system, Watson, defeated the two greatest Jeopardy! champions, Brad Rutter and Ken Jennings, by a significant margin. Faster computers, algorithmic improvements, and access to large amounts of data enabled advances in machine learning and perception; data-hungry deep learning methods started to dominate accuracy benchmarks around 2012. The Kinect, which provides a 3D body–motion interface for the Xbox 360 and the Xbox One, uses algorithms that emerged from lengthy AI research as do intelligent personal assistants in smartphones. In March 2016, AlphaGo won 4 out of 5 games of Go in a match with Go champion Lee Sedol, becoming the first computer Go-playing system to beat a professional Go player without handicaps. In the 2017 Future of Go Summit, AlphaGo won a three-game match with Ke Jie, who at the time continuously held the world No. 1 ranking for two years. This marked the completion of a significant milestone in the development of Artificial Intelligence as Go is a relatively complex game, more so than Chess.&lt;br /&gt;
&lt;br /&gt;
2011年，IBM的问答系统沃森参加《危险边缘》节目，以明显的优势打败了两名最强的人类冠军布拉德·拉特和肯·詹宁斯。更快的计算，算法的改进，以及大量数据的获取，使得机器学习和感知能力得到提高； 2012年前后，'''&amp;lt;font color=#ff8000&amp;gt;数据饥渴&amp;lt;/font&amp;gt;'''深度学习方法实现的精确度已经成为基准。Xbox 360和 Xbox One 的外设Kinect提供了3D人体运动交互功能，同智能手机上的智能助手一样，它使用的算法归功于漫长的AI研究； 2016年3月，AlphaGo与围棋冠军李世石的比赛中五局四胜，成为第一个击败无残疾围棋职业选手的计算机围棋系统；在2017年围棋未来峰会上，AlphaGo在三番棋的对决当中赢得了蝉联两届世界冠军的柯洁。这标志着AI发展的一个重要里程碑的完成，因为围棋是一种比国际象棋更复杂的游戏。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to [[Bloomberg News|Bloomberg's]] Jack Clark, 2015 was a landmark year for artificial intelligence, with the number of software projects that use AI [[Google]] increased from a &amp;quot;sporadic usage&amp;quot; in 2012 to more than 2,700 projects. Clark also presents factual data indicating the improvements of AI since 2012 supported by lower error rates in image processing tasks.&amp;lt;ref name=&amp;quot;:0&amp;quot;&amp;gt;{{cite web&lt;br /&gt;
&lt;br /&gt;
According to Bloomberg's Jack Clark, 2015 was a landmark year for artificial intelligence, with the number of software projects that use AI Google increased from a &amp;quot;sporadic usage&amp;quot; in 2012 to more than 2,700 projects. Clark also presents factual data indicating the improvements of AI since 2012 supported by lower error rates in image processing tasks.&amp;lt;ref name=&amp;quot;:0&amp;quot;&amp;gt;{{cite web&lt;br /&gt;
&lt;br /&gt;
彭博社的杰克·克拉克认为2015年是AI的里程碑年，使用谷歌AI的软件项目从几个到2015年超过了2700个。克拉克还给出了说明2012年以来AI在进步的真实数据，这些数据显示了AI在图像处理任务中的错误率越来越低。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |url         = https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
 |url         = https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
Https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
 |title       = Why 2015 Was a Breakthrough Year in Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
 |title       = Why 2015 Was a Breakthrough Year in Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
为什么2015年是人工智能的突破之年&lt;br /&gt;
&lt;br /&gt;
 |last        = Clark&lt;br /&gt;
&lt;br /&gt;
 |last        = Clark&lt;br /&gt;
&lt;br /&gt;
最后的克拉克&lt;br /&gt;
&lt;br /&gt;
 |first       = Jack&lt;br /&gt;
&lt;br /&gt;
 |first       = Jack&lt;br /&gt;
&lt;br /&gt;
先是杰克&lt;br /&gt;
&lt;br /&gt;
 |website     = Bloomberg News&lt;br /&gt;
&lt;br /&gt;
 |website     = Bloomberg News&lt;br /&gt;
&lt;br /&gt;
彭博新闻网&lt;br /&gt;
&lt;br /&gt;
 |date        = 8 December 2015&lt;br /&gt;
&lt;br /&gt;
 |date        = 8 December 2015&lt;br /&gt;
&lt;br /&gt;
2015年12月8日&lt;br /&gt;
&lt;br /&gt;
 |access-date = 23 November 2016&lt;br /&gt;
&lt;br /&gt;
 |access-date = 23 November 2016&lt;br /&gt;
&lt;br /&gt;
| 2016年11月23日&lt;br /&gt;
&lt;br /&gt;
 |quote       = After a half-decade of quiet breakthroughs in artificial intelligence, 2015 has been a landmark year. Computers are smarter and learning faster than ever.&lt;br /&gt;
&lt;br /&gt;
 |quote       = After a half-decade of quiet breakthroughs in artificial intelligence, 2015 has been a landmark year. Computers are smarter and learning faster than ever.&lt;br /&gt;
&lt;br /&gt;
经过5年人工智能领域的悄然突破，2015年成为了具有里程碑意义的一年。计算机比以往更聪明，学习速度更快。&lt;br /&gt;
&lt;br /&gt;
 |url-status     = live&lt;br /&gt;
&lt;br /&gt;
 |url-status     = live&lt;br /&gt;
&lt;br /&gt;
状态直播&lt;br /&gt;
&lt;br /&gt;
 |archiveurl  = https://web.archive.org/web/20161123053855/https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
 |archiveurl  = https://web.archive.org/web/20161123053855/https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20161123053855/https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
 |archivedate = 23 November 2016&lt;br /&gt;
&lt;br /&gt;
 |archivedate = 23 November 2016&lt;br /&gt;
&lt;br /&gt;
2016年11月23日&lt;br /&gt;
&lt;br /&gt;
 |df          = dmy-all&lt;br /&gt;
&lt;br /&gt;
 |df          = dmy-all&lt;br /&gt;
&lt;br /&gt;
我不会放过你的&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;/ref&amp;gt; He attributes this to an increase in affordable [[Artificial neural network|neural networks]], due to a rise in cloud computing infrastructure and to an increase in research tools and datasets.&amp;lt;ref name=&amp;quot;AI in 2000s&amp;quot;/&amp;gt; Other cited examples include Microsoft's development of a Skype system that can automatically translate from one language to another and Facebook's system that can describe images to blind people.&amp;lt;ref name=&amp;quot;:0&amp;quot;/&amp;gt; In a 2017 survey, one in five companies reported they had &amp;quot;incorporated AI in some offerings or processes&amp;quot;.&amp;lt;ref&amp;gt;{{cite web|title=Reshaping Business With Artificial Intelligence|url=https://sloanreview.mit.edu/projects/reshaping-business-with-artificial-intelligence/|website=MIT Sloan Management Review|accessdate=2 May 2018|language=en}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite web|last1=Lorica|first1=Ben|title=The state of AI adoption|url=https://www.oreilly.com/ideas/the-state-of-ai-adoption|website=O'Reilly Media|accessdate=2 May 2018|language=en|date=18 December 2017}}&amp;lt;/ref&amp;gt; Around 2016, [[China]] greatly accelerated its government funding; given its large supply of data and its rapidly increasing research output, some observers believe it may be on track to becoming an &amp;quot;AI superpower&amp;quot;.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.cnas.org/publications/reports/understanding-chinas-ai-strategy|title=Understanding China's AI Strategy|last=Allen|first=Gregory|date=February 6, 2019|website=Center for a New American Security|access-date=}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news |title=Review {{!}} How two AI superpowers – the U.S. and China – battle for supremacy in the field |url=https://www.washingtonpost.com/outlook/in-the-race-for-supremacy-in-artificial-intelligence-its-us-innovation-vs-chinese-ambition/2018/11/02/013e0030-b08c-11e8-aed9-001309990777_story.html |accessdate=4 November 2018 |work=Washington Post |date=2 November 2018 |language=en}}&amp;lt;/ref&amp;gt; However, it has been acknowledged that reports regarding artificial intelligence have tended to be exaggerated.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.theregister.co.uk/2019/02/22/artificial_intelligence_you_know_it_isnt_real_yeah/|title=Artificial Intelligence: You know it isn't real, yeah?|first=Alistair Dabbs 22 Feb 2019|last=at 10:11|website=www.theregister.co.uk}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=https://joshworth.com/stop-calling-in-artificial-intelligence/|title=Stop Calling it Artificial Intelligence}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=https://www.gbgplc.com/inside/ai/|title=AI isn't taking over the world – it doesn't exist yet|website=GBG Global website}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;/ref&amp;gt; He attributes this to an increase in affordable neural networks, due to a rise in cloud computing infrastructure and to an increase in research tools and datasets. Around 2016, China greatly accelerated its government funding; given its large supply of data and its rapidly increasing research output, some observers believe it may be on track to becoming an &amp;quot;AI superpower&amp;quot;. However, it has been acknowledged that reports regarding artificial intelligence have tended to be exaggerated.&lt;br /&gt;
&lt;br /&gt;
他把这归因于廉价的神经网络的增加，而神经网络的发展又是因为云计算基础设施以及研究工具和数据集的增加。还有微软的Skype系统可以将一门语言自动翻译成另一门，脸书系统可以把图片描述给盲人听。2016年前后，中国加大了政府资助。在此之后的大量数据供应和研究产出的快速增长让一些观察者认为，中国可能正走上成为“AI超级大国”之路。然而，有关AI的报告被承认了有夸大之嫌。2017年的一个调查中，五分之一的公司报道“他们在一些项目中用到了AI”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== 定义 Definitions ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Computer science defines AI research as the study of &amp;quot;[[intelligent agent]]s&amp;quot;: any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals.&amp;lt;ref name=&amp;quot;Definition of AI&amp;quot;/&amp;gt; A more elaborate definition characterizes AI as &amp;quot;a system's ability to correctly interpret external data, to learn from such data, and to use those learnings to achieve specific goals and tasks through flexible adaptation.&amp;quot;&amp;lt;ref&amp;gt;{{Cite journal|title=Siri, Siri, in my hand: Who's the fairest in the land? On the interpretations, illustrations, and implications of artificial intelligence|first1=Andreas|last1=Kaplan|first2=Michael|last2=Haenlein|date=1 January 2019|journal=Business Horizons|volume=62|issue=1|pages=15–25|doi=10.1016/j.bushor.2018.08.004}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computer science defines AI research as the study of &amp;quot;intelligent agents&amp;quot;: any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals.&lt;br /&gt;
&lt;br /&gt;
计算机科学将对AI的研究定义为对“智能体”的研究。智能体是任何感知周围环境并采取行动以最大化其成功实现目标的机会的设备。对AI更精确的定义是“一个可以正确理解并学习输入数据，并用学习结果通过灵活调整，实现具体目标或任务的系统”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== 基本知识 Basics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This section is for explaining, to non-specialists, core concepts that are helpful for understanding AI; feel free to greatly expand or even draw out into its own &amp;quot;Introduction to AI&amp;quot; article, similar to [[Introduction to Quantum Mechanics]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This section is for explaining, to non-specialists, core concepts that are helpful for understanding AI; feel free to greatly expand or even draw out into its own &amp;quot;Introduction to AI&amp;quot; article, similar to Introduction to Quantum Mechanics --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这部分是为了向非专业人士解释有助于理解人工智能的核心概念，你可以随意扩展甚至引用到它自己的“人工智能导论”文章中，类似于量子力学导论——&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A typical AI analyzes its environment and takes actions that maximize its chance of success.&amp;lt;ref name=&amp;quot;Definition of AI&amp;quot;/&amp;gt; An AI's intended [[utility function|utility function (or goal)]] can be simple (&amp;quot;1 if the AI wins a game of [[Go (game)|Go]], 0 otherwise&amp;quot;) or complex (&amp;quot;Do mathematically similar actions to the ones succeeded in the past&amp;quot;). Goals can be explicitly defined or induced. If the AI is programmed for &amp;quot;[[reinforcement learning]]&amp;quot;, goals can be implicitly induced by rewarding some types of behavior or punishing others.{{efn|The act of doling out rewards can itself be formalized or automated into a &amp;quot;[[reward function]]&amp;quot;.}} Alternatively, an evolutionary system can induce goals by using a &amp;quot;[[fitness function]]&amp;quot; to mutate and preferentially replicate high-scoring AI systems, similar to how animals evolved to innately desire certain goals such as finding food.{{sfn|Domingos|2015|loc=Chapter 5}} Some AI systems, such as nearest-neighbor, instead of reason by analogy, these systems are not generally given goals, except to the degree that goals are implicit in their training data.{{sfn|Domingos|2015|loc=Chapter 7}} Such systems can still be benchmarked if the non-goal system is framed as a system whose &amp;quot;goal&amp;quot; is to successfully accomplish its narrow classification task.&amp;lt;ref&amp;gt;Lindenbaum, M., Markovitch, S., &amp;amp; Rusakov, D. (2004). Selective sampling for nearest neighbor classifiers. Machine learning, 54(2), 125–152.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A typical AI analyzes its environment and takes actions that maximize its chance of success.&lt;br /&gt;
&lt;br /&gt;
一般的AI会分析其环境，并采取行动最大限度地提高其成功的机会。AI的预期效用函数（或者说目标）可以很简单（比如如果赢了围棋就是1，否则为0），也可以很复杂（做一些从数学层面上与过去的成功案例相似的行为）。目标可以被明确定义或诱导。如果AI被设定为“'''&amp;lt;font color=#ff8000&amp;gt;强化学习 Reinforcement Learning &amp;lt;/font&amp;gt;'''”，那么目标就可以通过奖励某些行为或惩罚其他行为来间接诱导出来。再比如进化系统可以通过“适应功能”产生突变或者优先发展得分高的AI系统来导出目标，这与动物进化出寻找食物的本能类似。一些诸如最近邻插值的AI系统，不是通过类比来推理的。这些系统通常没有给定目标，除非目标隐含在它们的训练数据中。如果将非目标系统框定为一个以成功完成其小范围分类任务为目标的系统，那么这些系统仍然可以作为基准。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
AI often revolves around the use of [[algorithms]]. An algorithm is a set of unambiguous instructions that a mechanical computer can execute.{{efn|Terminology varies; see [[algorithm characterizations]].}} A complex algorithm is often built on top of other, simpler, algorithms. A simple example of an algorithm is the following (optimal for first player) recipe for play at [[tic-tac-toe]]:{{sfn|Domingos|2015|loc=Chapter 1}}&lt;br /&gt;
&lt;br /&gt;
AI often revolves around the use of algorithms. An algorithm is a set of unambiguous instructions that a mechanical computer can execute. A complex algorithm is often built on top of other, simpler, algorithms. A simple example of an algorithm is the following (optimal for first player) recipe for play at tic-tac-toe:&lt;br /&gt;
&lt;br /&gt;
AI离不开算法的使用。算法是机械计算机可以执行的一组明确的指令。复杂的算法通常是建立在其他更简单的算法之上的。一个算法的简单例子是下面的井字游戏指令(对于第一个玩家来说是最有利的) :&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
# If someone has a &amp;quot;threat&amp;quot; (that is, two in a row), take the remaining square. Otherwise,&lt;br /&gt;
&lt;br /&gt;
 If someone has a &amp;quot;threat&amp;quot; (that is, two in a row), take the remaining square. Otherwise,&lt;br /&gt;
如果某人产生了一个“威胁”(也就是说有两个棋子连续了) ，把下一步棋下在两个棋外剩下的方上块。否则,&lt;br /&gt;
&lt;br /&gt;
# if a move &amp;quot;forks&amp;quot; to create two threats at once, play that move. Otherwise,&lt;br /&gt;
&lt;br /&gt;
 if a move &amp;quot;forks&amp;quot; to create two threats at once, play that move. Otherwise,&lt;br /&gt;
&lt;br /&gt;
如果某一步棋可以制造“叉子”棋阵同时制造两个威胁，那就下那一步。否则,&lt;br /&gt;
&lt;br /&gt;
# take the center square if it is free. Otherwise,&lt;br /&gt;
&lt;br /&gt;
 take the center square if it is free. Otherwise,&lt;br /&gt;
&lt;br /&gt;
如果中心的格子还是空的话，就走中间的格子。否则,&lt;br /&gt;
&lt;br /&gt;
# if your opponent has played in a corner, take the opposite corner. Otherwise,&lt;br /&gt;
&lt;br /&gt;
 if your opponent has played in a corner, take the opposite corner. Otherwise,&lt;br /&gt;
&lt;br /&gt;
如果你的对手在一个角落里布子，那就走另一个角落。否则,&lt;br /&gt;
&lt;br /&gt;
# take an empty corner if one exists. Otherwise,&lt;br /&gt;
&lt;br /&gt;
 take an empty corner if one exists. Otherwise,&lt;br /&gt;
&lt;br /&gt;
如果有空角落，就下在空角落上。否则,&lt;br /&gt;
&lt;br /&gt;
# take any empty square.&lt;br /&gt;
&lt;br /&gt;
 take any empty square.&lt;br /&gt;
&lt;br /&gt;
随便找个空格子。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Many AI algorithms are capable of learning from data; they can enhance themselves by learning new [[heuristic (computer science)|heuristics]] (strategies, or &amp;quot;rules of thumb&amp;quot;, that have worked well in the past), or can themselves write other algorithms. Some of the &amp;quot;learners&amp;quot; described below, including Bayesian networks, decision trees, and nearest-neighbor, could theoretically, (given infinite data, time, and memory) learn to approximate any [[function (mathematics)|function]], including which combination of mathematical functions would best describe the world{{citation needed|date=June 2019}}. These learners could therefore, derive all possible knowledge, by considering every possible hypothesis and matching them against the data. In practice, it is almost never possible to consider every possibility, because of the phenomenon of &amp;quot;[[combinatorial explosion]]&amp;quot;, where the amount of time needed to solve a problem grows exponentially. Much of AI research involves figuring out how to identify and avoid considering broad range of possibilities that are unlikely to be beneficial.&amp;lt;ref name=&amp;quot;Intractability&amp;quot;/&amp;gt;{{sfn|Domingos|2015|loc=Chapter 2, Chapter 3}} For example, when viewing a map and looking for the shortest driving route from [[Denver]] to [[New York City|New York]] in the East, one can in most cases skip looking at any path through [[San Francisco]] or other areas far to the West; thus, an AI wielding a pathfinding algorithm like [[A* search algorithm|A*]] can avoid the combinatorial explosion that would ensue if every possible route had to be ponderously considered in turn.&amp;lt;ref&amp;gt;{{cite journal&lt;br /&gt;
&lt;br /&gt;
Many AI algorithms are capable of learning from data; they can enhance themselves by learning new heuristics (strategies, or &amp;quot;rules of thumb&amp;quot;, that have worked well in the past), or can themselves write other algorithms. Some of the &amp;quot;learners&amp;quot; described below, including Bayesian networks, decision trees, and nearest-neighbor, could theoretically, (given infinite data, time, and memory) learn to approximate any function, including which combination of mathematical functions would best describe the world. These learners could therefore, derive all possible knowledge, by considering every possible hypothesis and matching them against the data. In practice, it is almost never possible to consider every possibility, because of the phenomenon of &amp;quot;combinatorial explosion&amp;quot;, where the amount of time needed to solve a problem grows exponentially. Much of AI research involves figuring out how to identify and avoid considering broad range of possibilities that are unlikely to be beneficial. For example, when viewing a map and looking for the shortest driving route from Denver to New York in the East, one can in most cases skip looking at any path through San Francisco or other areas far to the West; thus, an AI wielding a pathfinding algorithm like A* can avoid the combinatorial explosion that would ensue if every possible route had to be ponderously considered in turn.&amp;lt;ref&amp;gt;{{cite journal&lt;br /&gt;
&lt;br /&gt;
许多AI算法可以从数据中学习；他们可以通过学习新的启发(过去起作用的策略，或“经验法则”) 或者自己编写其他算法来强化自己。下面的一些“学习者”，包括'''&amp;lt;font color=#ff8000&amp;gt;贝叶斯网络 Bayesian Networks&amp;lt;/font&amp;gt;'''、'''&amp;lt;font color=#ff8000&amp;gt;决策树 Decision Trees&amp;lt;/font&amp;gt;'''和'''&amp;lt;font color=#ff8000&amp;gt;最近邻 Nearest-neighbor&amp;lt;/font&amp;gt;'''，在理论上(给定无限的数据、时间和记忆)可以学习近似任何函数，包括数学函数如何组合可以最好地描述世界。因此，这些学习者可以通过考虑每一种可能的假设，并将它们与数据进行匹配，从而获得所有可能的知识。实际上考虑所有的可能性几乎是不可能，因为很可能会导致“'''&amp;lt;font color=#ff8000&amp;gt;组合爆炸 Combinatorial Explosion&amp;lt;/font&amp;gt;'''”，即解决一个问题所需的时间呈指数级增长。很多AI研究都在探索如何识别和避免考虑广泛且无益的可能性。例如,当看地图寻找从东边丹佛到纽约的最短行驶路线时,大部分人都不会去看通过西边的旧金山或其他地理位置的路径;因此，一个使用像A*这样的寻路算法的AI可以避免每条可能的路径都必须依次考虑以造成组合爆炸的情况。&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
The earliest (and easiest to understand) approach to AI was symbolism (such as formal logic): &amp;quot;If an otherwise healthy adult has a fever, then they may have [[influenza]]&amp;quot;. A second, more general, approach is [[Bayesian inference]]: &amp;quot;If the current patient has a fever, adjust the probability they have influenza in such-and-such way&amp;quot;. The third major approach, extremely popular in routine business AI applications, are analogizers such as [[Support vector machine|SVM]] and [[K-nearest neighbor algorithm|nearest-neighbor]]: &amp;quot;After examining the records of known past patients whose temperature, symptoms, age, and other factors mostly match the current patient, X% of those patients turned out to have influenza&amp;quot;. A fourth approach is harder to intuitively understand, but is inspired by how the brain's machinery works: the [[artificial neural network]] approach uses artificial &amp;quot;[[neurons]]&amp;quot; that can learn by comparing itself to the desired output and altering the strengths of the connections between its internal neurons to &amp;quot;reinforce&amp;quot; connections that seemed to be useful. These four main approaches can overlap with each other and with evolutionary systems; for example, neural nets can learn to make inferences, to generalize, and to make analogies. Some systems implicitly or explicitly use multiple of these approaches, alongside many other AI and non-AI algorithms; the best approach is often different depending on the problem.{{sfn|Domingos|2015|loc=Chapter 2, Chapter 4, Chapter 6}}&amp;lt;!-- The influenza example is expanded from Domingos chapter 6; feel free to put in a better example if you have one --&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Can neural network computers learn from experience, and if so, could they ever become what we would call 'smart'?|url=https://www.scientificamerican.com/article/can-neural-network-comput/|accessdate=24 March 2018|work=Scientific American|date=2018|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The earliest (and easiest to understand) approach to AI was symbolism (such as formal logic): &amp;quot;If an otherwise healthy adult has a fever, then they may have influenza&amp;quot;. A second, more general, approach is Bayesian inference: &amp;quot;If the current patient has a fever, adjust the probability they have influenza in such-and-such way&amp;quot;. The third major approach, extremely popular in routine business AI applications, are analogizers such as SVM and nearest-neighbor: &amp;quot;After examining the records of known past patients whose temperature, symptoms, age, and other factors mostly match the current patient, X% of those patients turned out to have influenza&amp;quot;. A fourth approach is harder to intuitively understand, but is inspired by how the brain's machinery works: the artificial neural network approach uses artificial &amp;quot;neurons&amp;quot; that can learn by comparing itself to the desired output and altering the strengths of the connections between its internal neurons to &amp;quot;reinforce&amp;quot; connections that seemed to be useful. These four main approaches can overlap with each other and with evolutionary systems; for example, neural nets can learn to make inferences, to generalize, and to make analogies. Some systems implicitly or explicitly use multiple of these approaches, alongside many other AI and non-AI algorithms; the best approach is often different depending on the problem.&amp;lt;!-- The influenza example is expanded from Domingos chapter 6; feel free to put in a better example if you have one --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
AI最早的(也是最容易理解的)研究方法是'''&amp;lt;font color=#ff8000&amp;gt;符号主义 Symbolism &amp;lt;/font&amp;gt;'''(比如形式逻辑):“如果一个原本健康的成年人发烧了，那么他们可能患上了流感。”第二种更普遍的方法是贝叶斯推断: “如果这个患者发烧了，会考虑多个方面判断他们感染流感的可能性”。第三个主要的方法：类比，在日常商业AI应用中非常常见，例如'''&amp;lt;font color=#ff8000&amp;gt;支持向量机 Support Vector Machine, SVM&amp;lt;/font&amp;gt;'''和'''&amp;lt;font color=#ff8000&amp;gt;最近邻 Nearest-neighbor &amp;lt;/font&amp;gt;''': “在考量了过去体温、症状、年龄和其他因素与现在的病人匹配的病人的记录，这些病人中x%患有流感”。第四种方法相较来说更难以直观理解，它受到大脑工作机制的启发: 人工神经网络方法使用人工“神经元” ，这种神经元可以通过将自身与期望的输出进行比较，并改变内部神经元之间的连接强度，以“强化”似乎有用的连接，从而进行学习。这四种主要的方法可以有交叉，也可以与进化系统交叉; 例如，神经网络可以学习做推论、概括和进行类比。一些系统隐式或显式地使用这些方法中的多个，以及许多其他AI和非AI算法; 根据问题不同往往最佳解决方案也不同.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Learning algorithms work on the basis that strategies, algorithms, and inferences that worked well in the past are likely to continue working well in the future. These inferences can be obvious, such as &amp;quot;since the sun rose every morning for the last 10,000 days, it will probably rise tomorrow morning as well&amp;quot;. They can be nuanced, such as &amp;quot;X% of [[Family (biology)|families]] have geographically separate species with color variants, so there is a Y% chance that undiscovered [[black swan theory|black swans]] exist&amp;quot;. Learners also work on the basis of &amp;quot;[[Occam's razor#Probability theory and statistics|Occam's razor]]&amp;quot;: The simplest theory that explains the data is the likeliest. Therefore, according to Occam's razor principle, a learner must be designed such that it prefers simpler theories to complex theories, except in cases where the complex theory is proven substantially better.&lt;br /&gt;
&lt;br /&gt;
Learning algorithms work on the basis that strategies, algorithms, and inferences that worked well in the past are likely to continue working well in the future. These inferences can be obvious, such as &amp;quot;since the sun rose every morning for the last 10,000 days, it will probably rise tomorrow morning as well&amp;quot;. They can be nuanced, such as &amp;quot;X% of families have geographically separate species with color variants, so there is a Y% chance that undiscovered black swans exist&amp;quot;. Learners also work on the basis of &amp;quot;Occam's razor&amp;quot;: The simplest theory that explains the data is the likeliest. Therefore, according to Occam's razor principle, a learner must be designed such that it prefers simpler theories to complex theories, except in cases where the complex theory is proven substantially better.&lt;br /&gt;
&lt;br /&gt;
学习算法的工作基础是策略、算法和推论，如果这些基础在之前运行良好，那么在未来可能能继续很好地运作。这些推论是显而易见的，例如“在过去的10000天里，太阳每天早上都升起，明天早上也可能升起”。他们可能会有细微差别，比如“ x% 的科有颜色变异且地理隔离的物种，所以有 y% 的可能性未被发现的黑天鹅是存在的”。学习者也在“'''&amp;lt;font color=#ff8000&amp;gt;奥卡姆剃刀 Occam's Razor&amp;lt;/font&amp;gt;'''”的基础上学习: 最简单的可以解释数据的理论是最有可能的。因此，根据奥卡姆剃刀原则，一个学习者必须被设计成更倾向于简单的理论而不是复杂的理论，除非复杂的理论被证明实质上更好。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Overfitted Data.png|thumb|The blue line could be an example of [[overfitting]] a linear function due to random noise.]蓝线是[[由于随机噪声过拟合线性函数]的一个例子。]&lt;br /&gt;
]&lt;br /&gt;
&lt;br /&gt;
The blue line could be an example of [[overfitting a linear function due to random noise.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Settling on a bad, overly complex theory gerrymandered to fit all the past training data is known as [[overfitting]]. Many systems attempt to reduce overfitting by rewarding a theory in accordance with how well it fits the data, but penalizing the theory in accordance with how complex the theory is.{{sfn|Domingos|2015|loc=Chapter 6, Chapter 7}} Besides classic overfitting, learners can also disappoint by &amp;quot;learning the wrong lesson&amp;quot;. A toy example is that an image classifier trained only on pictures of brown horses and black cats might conclude that all brown patches are likely to be horses.{{sfn|Domingos|2015|p=286}} A real-world example is that, unlike humans, current image classifiers don't determine the spatial relationship between components of the picture; instead, they learn abstract patterns of pixels that humans are oblivious to, but that linearly correlate with images of certain types of real objects. Faintly superimposing such a pattern on a legitimate image results in an &amp;quot;adversarial&amp;quot; image that the system misclassifies.{{efn|Adversarial vulnerabilities can also result in nonlinear systems, or from non-pattern perturbations. Some systems are so brittle that changing a single adversarial pixel predictably induces misclassification.}}&amp;lt;ref&amp;gt;{{cite news|title=Single pixel change fools AI programs|url=https://www.bbc.com/news/technology-41845878|accessdate=12 March 2018|work=BBC News|date=3 November 2017}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=AI Has a Hallucination Problem That's Proving Tough to Fix|url=https://www.wired.com/story/ai-has-a-hallucination-problem-thats-proving-tough-to-fix/|accessdate=12 March 2018|work=WIRED|date=2018}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite arxiv|eprint=1412.6572|last1=Goodfellow|first1=Ian J.|last2=Shlens|first2=Jonathon|last3=Szegedy|first3=Christian|title=Explaining and Harnessing Adversarial Examples|class=stat.ML|year=2014}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Settling on a bad, overly complex theory gerrymandered to fit all the past training data is known as overfitting. Many systems attempt to reduce overfitting by rewarding a theory in accordance with how well it fits the data, but penalizing the theory in accordance with how complex the theory is. Besides classic overfitting, learners can also disappoint by &amp;quot;learning the wrong lesson&amp;quot;. A toy example is that an image classifier trained only on pictures of brown horses and black cats might conclude that all brown patches are likely to be horses. A real-world example is that, unlike humans, current image classifiers don't determine the spatial relationship between components of the picture; instead, they learn abstract patterns of pixels that humans are oblivious to, but that linearly correlate with images of certain types of real objects. Faintly superimposing such a pattern on a legitimate image results in an &amp;quot;adversarial&amp;quot; image that the system misclassifies.&lt;br /&gt;
&lt;br /&gt;
用一个错误且过于复杂的理论拟合过去所有的训练数据，这被称为'''&amp;lt;font color=#ff8000&amp;gt;过拟合 Overfitting&amp;lt;/font&amp;gt;'''。许多系统试图通过依据理论拟合数据的程度奖励和复杂程度惩罚来减少过拟合。除了常见的过拟合外，学习者也会因为“走错方向”而失望。一个简单的例子是，一个图像分类器训练时只用棕马和黑猫的图片，那么它就很可能得出所有的棕色斑块都是马的结论。一个现实世界的例子是，目前的图像分类器并与人类不同，他们不厘清图像各部分间的空间关系; 相反，它们学习人类察觉不到的抽象，但与某类真实物体图像线性相关的像素图案。将这种图案稍微叠加在原本正确的图像上，就会导致系统将图像错误分类。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Détection de personne - exemple 3.jpg|thumb|A self-driving car system may use a neural network to determine which parts of the picture seem to match previous training images of pedestrians, and then model those areas as slow-moving but somewhat unpredictable rectangular prisms that must be avoided.自动驾驶汽车系统可以使用神经网络来确定图像的哪些部分与先前训练数据里的行人图像匹配，然后将这些区域建模为移动缓慢但有点不可预测，且必须避让的矩形棱柱。&amp;lt;ref&amp;gt;{{cite book|last1=Matti|first1=D.|last2=Ekenel|first2=H. K.|last3=Thiran|first3=J. P.|title=Combining LiDAR space clustering and convolutional neural networks for pedestrian detection|journal=2017 14th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS)|date=2017|pages=1–6|doi=10.1109/AVSS.2017.8078512|isbn=978-1-5386-2939-0|arxiv=1710.06160}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|last1=Ferguson|first1=Sarah|last2=Luders|first2=Brandon|last3=Grande|first3=Robert C.|last4=How|first4=Jonathan P.|title=Real-Time Predictive Modeling and Robust Avoidance of Pedestrians with Uncertain, Changing Intentions|journal=Algorithmic Foundations of Robotics XI|volume=107|date=2015|pages=161–177|doi=10.1007/978-3-319-16595-0_10|publisher=Springer, Cham|language=en|series=Springer Tracts in Advanced Robotics|isbn=978-3-319-16594-3|arxiv=1405.5581}}&amp;lt;/ref&amp;gt;]]&lt;br /&gt;
&lt;br /&gt;
A self-driving car system may use a neural network to determine which parts of the picture seem to match previous training images of pedestrians, and then model those areas as slow-moving but somewhat unpredictable rectangular prisms that must be avoided.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Compared with humans, existing AI lacks several features of human &amp;quot;[[commonsense reasoning]]&amp;quot;; most notably, humans have powerful mechanisms for reasoning about &amp;quot;[[naïve physics]]&amp;quot; such as space, time, and physical interactions. This enables even young children to easily make inferences like &amp;quot;If I roll this pen off a table, it will fall on the floor&amp;quot;. Humans also have a powerful mechanism of &amp;quot;[[folk psychology]]&amp;quot; that helps them to interpret natural-language sentences such as &amp;quot;The city councilmen refused the demonstrators a permit because they advocated violence&amp;quot;. (A generic AI has difficulty discerning whether the ones alleged to be advocating violence are the councilmen or the demonstrators.)&amp;lt;ref&amp;gt;{{cite news|title=Cultivating Common Sense {{!}} DiscoverMagazine.com|url=http://discovermagazine.com/2017/april-2017/cultivating-common-sense|accessdate=24 March 2018|work=Discover Magazine|date=2017}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Davis|first1=Ernest|last2=Marcus|first2=Gary|title=Commonsense reasoning and commonsense knowledge in artificial intelligence|journal=Communications of the ACM|date=24 August 2015|volume=58|issue=9|pages=92–103|doi=10.1145/2701413|url=https://cacm.acm.org/magazines/2015/9/191169-commonsense-reasoning-and-commonsense-knowledge-in-artificial-intelligence/}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Winograd|first1=Terry|title=Understanding natural language|journal=Cognitive Psychology|date=January 1972|volume=3|issue=1|pages=1–191|doi=10.1016/0010-0285(72)90002-3}}&amp;lt;/ref&amp;gt; This lack of &amp;quot;common knowledge&amp;quot; means that AI often makes different mistakes than humans make, in ways that can seem incomprehensible. For example, existing self-driving cars cannot reason about the location nor the intentions of pedestrians in the exact way that humans do, and instead must use non-human modes of reasoning to avoid accidents.&amp;lt;ref&amp;gt;{{cite news|title=Don't worry: Autonomous cars aren't coming tomorrow (or next year)|url=http://autoweek.com/article/technology/fully-autonomous-vehicles-are-more-decade-down-road|accessdate=24 March 2018|work=Autoweek|date=2016}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|last1=Knight|first1=Will|title=Boston may be famous for bad drivers, but it's the testing ground for a smarter self-driving car|url=https://www.technologyreview.com/s/608871/finally-a-driverless-car-with-some-common-sense/|accessdate=27 March 2018|work=MIT Technology Review|date=2017|language=en}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Prakken|first1=Henry|title=On the problem of making autonomous vehicles conform to traffic law|journal=Artificial Intelligence and Law|date=31 August 2017|volume=25|issue=3|pages=341–363|doi=10.1007/s10506-017-9210-0|doi-access=free}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Compared with humans, existing AI lacks several features of human &amp;quot;commonsense reasoning&amp;quot;; most notably, humans have powerful mechanisms for reasoning about &amp;quot;naïve physics&amp;quot; such as space, time, and physical interactions. This enables even young children to easily make inferences like &amp;quot;If I roll this pen off a table, it will fall on the floor&amp;quot;. Humans also have a powerful mechanism of &amp;quot;folk psychology&amp;quot; that helps them to interpret natural-language sentences such as &amp;quot;The city councilmen refused the demonstrators a permit because they advocated violence&amp;quot;. (A generic AI has difficulty discerning whether the ones alleged to be advocating violence are the councilmen or the demonstrators.) This lack of &amp;quot;common knowledge&amp;quot; means that AI often makes different mistakes than humans make, in ways that can seem incomprehensible. For example, existing self-driving cars cannot reason about the location nor the intentions of pedestrians in the exact way that humans do, and instead must use non-human modes of reasoning to avoid accidents.&lt;br /&gt;
&lt;br /&gt;
与人类相比，现有的AI缺少人类“常识推理”的几个特征; 最值得注意的是，人类拥有强大的对如空间、时间和物理相互作用等“自然物理”推理机制。这使得即使是小孩子也能够轻易地做出推论，比如“如果我把这支笔从桌子上滚下来，它就会掉到地板上”。人类还有一种强大的“人群心理”机制，帮助他们理解诸如“市议员因为示威者鼓吹暴力而拒绝给予许可”的自然语言，但一般的AI难以辨别被指控鼓吹暴力的人是议员还是示威者。这种“常识”的缺乏意味着AI经常会犯一些与人类不同的错误，这些错误看起来是难以理解的。例如，现在的自动驾驶汽车不能像人类那样准确推理方位和行人的意图，而只能使用非人类的推理模式来避免事故。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== 挑战 Challenges ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- This is linked to in the introduction to the article and to the &amp;quot;AI research&amp;quot; section --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- This is linked to in the introduction to the article and to the &amp;quot;AI research&amp;quot; section --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这跟文章的导言和“人工智能研究”部分有关——&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The cognitive capabilities of current architectures are very limited, using only a simplified version of what intelligence is really capable of. For instance, the human mind has come up with ways to reason beyond measure and logical explanations to different occurrences in life. What would have been otherwise straightforward, an equivalently difficult problem may be challenging to solve computationally as opposed to using the human mind. This gives rise to two classes of models: structuralist and functionalist. The structural models aim to loosely mimic the basic intelligence operations of the mind such as reasoning and logic. The functional model refers to the correlating data to its computed counterpart.&amp;lt;ref&amp;gt;{{Cite journal|last=Lieto|first=Antonio|date=May 2018|title=The knowledge level in cognitive architectures: Current limitations and possible developments|journal=Cognitive Systems Research|volume=48|pages=39–55|doi=10.1016/j.cogsys.2017.05.001|hdl=2318/1665207|hdl-access=free}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The cognitive capabilities of current architectures are very limited, using only a simplified version of what intelligence is really capable of. For instance, the human mind has come up with ways to reason beyond measure and logical explanations to different occurrences in life. What would have been otherwise straightforward, an equivalently difficult problem may be challenging to solve computationally as opposed to using the human mind. This gives rise to two classes of models: structuralist and functionalist. The structural models aim to loosely mimic the basic intelligence operations of the mind such as reasoning and logic. The functional model refers to the correlating data to its computed counterpart.&lt;br /&gt;
&lt;br /&gt;
当前架构的认知能力非常有限，只做到了智能真正能够做到的事情的冰山一角。例如，人类的大脑已经想出了各种方法来推理生活中难以度量且不太合逻辑的事件。原本直截了当且困难程度相差不大的问题，与使用人类思维相比，对于计算机可能是具有挑战性的。这就产生了两类模型: '''&amp;lt;font color=#ff8000&amp;gt;结构主义 Structuralist&amp;lt;/font&amp;gt;'''和'''&amp;lt;font color=#ff8000&amp;gt;功能主义 Functionalist&amp;lt;/font&amp;gt;'''。结构模型旨在大致模拟大脑的基本认知功能，如推理和逻辑；功能模型是指与其计算的数据相关联的数据。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The overall research goal of artificial intelligence is to create technology that allows computers and machines to function in an intelligent manner. The general problem of simulating (or creating) intelligence has been broken down into sub-problems. These consist of particular traits or capabilities that researchers expect an intelligent system to display. The traits described below have received the most attention.&amp;lt;ref name=&amp;quot;Problems of AI&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The overall research goal of artificial intelligence is to create technology that allows computers and machines to function in an intelligent manner. The general problem of simulating (or creating) intelligence has been broken down into sub-problems. These consist of particular traits or capabilities that researchers expect an intelligent system to display. The traits described below have received the most attention.&lt;br /&gt;
&lt;br /&gt;
AI的总体研究目标是创造能够使计算机和机器以智能方式运行的技术。模拟(或创造)智能的一般问题已被分解为若干子问题。这些问题中涉及到的特征或能力是研究人员期望智能系统展示的。受到了最多的关注的是下面描述的几个特征。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== 推理，解决问题 Reasoning, problem solving ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&amp;lt;!-- SOLVED PROBLEMS --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&amp;lt;!-- SOLVED PROBLEMS --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这在介绍中有关——解决问题——&lt;br /&gt;
&lt;br /&gt;
Early researchers developed algorithms that imitated step-by-step reasoning that humans use when they solve puzzles or make logical deductions.&amp;lt;ref name=&amp;quot;Reasoning&amp;quot;/&amp;gt; By the late 1980s and 1990s, AI research had developed methods for dealing with [[uncertainty|uncertain]] or incomplete information, employing concepts from [[probability]] and [[economics]].&amp;lt;ref name=&amp;quot;Uncertain reasoning&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Early researchers developed algorithms that imitated step-by-step reasoning that humans use when they solve puzzles or make logical deductions. By the late 1980s and 1990s, AI research had developed methods for dealing with uncertain or incomplete information, employing concepts from probability and economics.&lt;br /&gt;
&lt;br /&gt;
早期的研究人员开发了一种算法，这种算法模仿了人类在解决谜题或进行逻辑推理时所使用的循序渐进的推理。到20世纪80年代末和90年代，AI研究使用概率论和经济学的理论开发出了处理不确定或不完全信息的方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These algorithms proved to be insufficient for solving large reasoning problems because they experienced a &amp;quot;combinatorial explosion&amp;quot;: they became exponentially slower as the problems grew larger.&amp;lt;ref name=&amp;quot;Intractability&amp;quot;/&amp;gt; In fact, even humans rarely use the step-by-step deduction that early AI research was able to model. They solve most of their problems using fast, intuitive judgments.&amp;lt;ref name=&amp;quot;Psychological evidence of sub-symbolic reasoning&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
These algorithms proved to be insufficient for solving large reasoning problems because they experienced a &amp;quot;combinatorial explosion&amp;quot;: they became exponentially slower as the problems grew larger. In fact, even humans rarely use the step-by-step deduction that early AI research was able to model. They solve most of their problems using fast, intuitive judgments.&lt;br /&gt;
&lt;br /&gt;
这些算法被证明不足以解决大型推理问题，因为它们经历了一个“组合爆炸” : 随着问题规模变得越来越大，它们的处理效率呈指数级下降。事实上，即使是人类也很少使用早期AI研究建模的逐步推理。人们通过快速、直觉的判断来解决大多数问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== 知识表示 Knowledge representation ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这个链接在介绍中——&lt;br /&gt;
&lt;br /&gt;
[[File:GFO taxonomy tree.png|right|thumb|An ontology represents knowledge as a set of concepts within a domain and the relationships between those concepts.本体将知识表示为领域中的一组概念以及这些概念之间的关系。]]&lt;br /&gt;
&lt;br /&gt;
An ontology represents knowledge as a set of concepts within a domain and the relationships between those concepts.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Knowledge representation|Commonsense knowledge}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Knowledge representation]]&amp;lt;ref name=&amp;quot;Knowledge representation&amp;quot;/&amp;gt; and [[knowledge engineering]]&amp;lt;ref name=&amp;quot;Knowledge engineering&amp;quot;/&amp;gt; are central to classical AI research. Some &amp;quot;expert systems&amp;quot; attempt to gather together explicit knowledge possessed by experts in some narrow domain. In addition, some projects attempt to gather the &amp;quot;commonsense knowledge&amp;quot; known to the average person into a database containing extensive knowledge about the world. Among the things a comprehensive commonsense knowledge base would contain are: objects, properties, categories and relations between objects;&amp;lt;ref name=&amp;quot;Representing categories and relations&amp;quot;/&amp;gt; situations, events, states and time;&amp;lt;ref name=&amp;quot;Representing time&amp;quot;/&amp;gt; causes and effects;&amp;lt;ref name=&amp;quot;Representing causation&amp;quot;/&amp;gt; knowledge about knowledge (what we know about what other people know);&amp;lt;ref name=&amp;quot;Representing knowledge about knowledge&amp;quot;/&amp;gt; and many other, less well researched domains. A representation of &amp;quot;what exists&amp;quot; is an [[ontology (computer science)|ontology]]: the set of objects, relations, concepts, and properties formally described so that software agents can interpret them. The [[semantics]] of these are captured as [[description logic]] concepts, roles, and individuals, and typically implemented as classes, properties, and individuals in the [[Web Ontology Language]].&amp;lt;ref&amp;gt;{{cite book |last=Sikos |first=Leslie F. |date=June 2017 |title=Description Logics in Multimedia Reasoning |url=https://www.springer.com/us/book/9783319540658 |location=Cham |publisher=Springer |isbn=978-3-319-54066-5 |doi=10.1007/978-3-319-54066-5 |url-status=live |archiveurl=https://web.archive.org/web/20170829120912/https://www.springer.com/us/book/9783319540658 |archivedate=29 August 2017 |df=dmy-all }}&amp;lt;/ref&amp;gt; The most general ontologies are called [[upper ontology|upper ontologies]], which attempt to provide a foundation for all other knowledge&amp;lt;ref name=&amp;quot;Ontology&amp;quot;/&amp;gt; by acting as mediators between [[Domain ontology|domain ontologies]] that cover specific knowledge about a particular knowledge domain (field of interest or area of concern). Such formal knowledge representations can be used in content-based indexing and retrieval,&amp;lt;ref&amp;gt;{{cite journal|last1=Smoliar|first1=Stephen W.|last2=Zhang|first2=HongJiang|title=Content based video indexing and retrieval|journal=IEEE Multimedia|date=1994|volume=1|issue=2|pages=62–72|doi=10.1109/93.311653}}&amp;lt;/ref&amp;gt; scene interpretation,&amp;lt;ref&amp;gt;{{cite journal|last1=Neumann|first1=Bernd|last2=Möller|first2=Ralf|title=On scene interpretation with description logics|journal=Image and Vision Computing|date=January 2008|volume=26|issue=1|pages=82–101|doi=10.1016/j.imavis.2007.08.013}}&amp;lt;/ref&amp;gt; clinical decision support,&amp;lt;ref&amp;gt;{{cite journal|last1=Kuperman|first1=G. J.|last2=Reichley|first2=R. M.|last3=Bailey|first3=T. C.|title=Using Commercial Knowledge Bases for Clinical Decision Support: Opportunities, Hurdles, and Recommendations|journal=Journal of the American Medical Informatics Association|date=1 July 2006|volume=13|issue=4|pages=369–371|doi=10.1197/jamia.M2055|pmid=16622160|pmc=1513681}}&amp;lt;/ref&amp;gt; knowledge discovery (mining &amp;quot;interesting&amp;quot; and actionable inferences from large databases),&amp;lt;ref&amp;gt;{{cite journal|last1=MCGARRY|first1=KEN|title=A survey of interestingness measures for knowledge discovery|journal=The Knowledge Engineering Review|date=1 December 2005|volume=20|issue=1|page=39|doi=10.1017/S0269888905000408|url=https://semanticscholar.org/paper/baf7f99e1b567868a6dc6238cc5906881242da01}}&amp;lt;/ref&amp;gt; and other areas.&amp;lt;ref&amp;gt;{{cite conference |url= |title=Automatic annotation and semantic retrieval of video sequences using multimedia ontologies |last1=Bertini |first1=M |last2=Del Bimbo |first2=A |last3=Torniai |first3=C |date=2006 |publisher=ACM |book-title=MM '06 Proceedings of the 14th ACM international conference on Multimedia |pages=679–682 |location=Santa Barbara |conference=14th ACM international conference on Multimedia}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Knowledge representation The most general ontologies are called upper ontologies, which attempt to provide a foundation for all other knowledge scene interpretation, clinical decision support, knowledge discovery (mining &amp;quot;interesting&amp;quot; and actionable inferences from large databases), and other areas.&lt;br /&gt;
&lt;br /&gt;
传统的AI研究的重点是'''&amp;lt;font color=#ff8000&amp;gt;知识表示 Knowledge Representation&amp;lt;/font&amp;gt;'''和'''&amp;lt;font color=#ff8000&amp;gt;知识工程 Knowledge Engineering&amp;lt;/font&amp;gt;'''。有些“专家系统”试图将某一小领域的专家所拥有的知识收集起来。此外，一些项目试图将普通人的“常识”收集到一个包含对世界的认知的知识的大数据库中。这些常识包括：情景、事件、状态和时间;原因和结果;关于知识的知识(我们知道别人知道什么);和许多其他研究较少的领域。“存在的东西”的表示是本体，本体是被正式描述的对象、关系、概念和属性的集合，这样的形式可以让软件智能体能够理解它。本体的语义描述了逻辑概念、角色和个体，通常在Web本体语言中以类、属性和个体的形式实现。最常见的本体称为'''&amp;lt;font color=#ff8000&amp;gt;上本体 Upper Ontology&amp;lt;/font&amp;gt;''',它试图为所有其他知识提供一个基础，它充当涵盖有关特定知识领域(兴趣领域或关注领域)的特定知识的领域本体之间的中介。这种形式化的知识表示可以用于基于内容的索引和检索，场景解释，临床决策，知识发现(从大型数据库中挖掘“有趣的”和可操作的推论)等领域。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Among the most difficult problems in knowledge representation are:&lt;br /&gt;
&lt;br /&gt;
Among the most difficult problems in knowledge representation are:&lt;br /&gt;
&lt;br /&gt;
知识表示中最困难的问题是:&lt;br /&gt;
&lt;br /&gt;
;[[Default reasoning]] and the [[qualification problem]]: Many of the things people know take the form of &amp;quot;working assumptions&amp;quot;. For example, if a bird comes up in conversation, people typically picture an animal that is fist-sized, sings, and flies. None of these things are true about all birds. [[John McCarthy (computer scientist)|John McCarthy]] identified this problem in 1969&amp;lt;ref name=&amp;quot;Qualification problem&amp;quot;/&amp;gt; as the qualification problem: for any commonsense rule that AI researchers care to represent, there tend to be a huge number of exceptions. Almost nothing is simply true or false in the way that abstract logic requires. AI research has explored a number of solutions to this problem.&amp;lt;ref name=&amp;quot;Default reasoning and non-monotonic logic&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Default reasoning and the qualification problem: Many of the things people know take the form of &amp;quot;working assumptions&amp;quot;. For example, if a bird comes up in conversation, people typically picture an animal that is fist-sized, sings, and flies. None of these things are true about all birds. John McCarthy identified this problem in 1969 as the qualification problem: for any commonsense rule that AI researchers care to represent, there tend to be a huge number of exceptions. Almost nothing is simply true or false in the way that abstract logic requires. AI research has explored a number of solutions to this problem.&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color=#ff8000&amp;gt;缺省推理 Default Reasoning&amp;lt;/font&amp;gt;''' 和'''&amp;lt;font color=#ff8000&amp;gt; 限定性问题 Qualification Problem&amp;lt;/font&amp;gt;''': 人们对事物的认知常常基于一个可行的假设。提到鸟，人们通常会想象一只拳头大小、会唱歌、会飞的动物，但并不是所有鸟类都有这样的特性。1969年约翰 · 麦卡锡将其归咎于限定性问题: 对于AI研究人员所关心的任何常识性规则来说，大量的例外往往存在。几乎没有什么在抽象逻辑角度是完全真或完全假。AI研究探索了许多解决这个问题的方法。&lt;br /&gt;
&lt;br /&gt;
;Breadth of commonsense knowledge: The number of atomic facts that the average person knows is very large. Research projects that attempt to build a complete knowledge base of [[commonsense knowledge]] (e.g., [[Cyc]]) require enormous amounts of laborious [[ontology engineering|ontological engineering]]—they must be built, by hand, one complicated concept at a time.&amp;lt;ref name=&amp;quot;Breadth of commonsense knowledge&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Breadth of commonsense knowledge: The number of atomic facts that the average person knows is very large. Research projects that attempt to build a complete knowledge base of commonsense knowledge (e.g., Cyc) require enormous amounts of laborious ontological engineering—they must be built, by hand, one complicated concept at a time.&lt;br /&gt;
&lt;br /&gt;
常识的广度: 常人掌握的“元常识”的数量是非常大的。一个像Cyc一样的完整的常识库若能建成，其需要大量劳动密集的本体工程ーー这些复杂的常识概念必须由人工一个一个地构建。&lt;br /&gt;
&lt;br /&gt;
   --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）。想要建立一个像Cyc一样的完整的常识库  一句为省译&lt;br /&gt;
&lt;br /&gt;
;Subsymbolic form of some commonsense knowledge: Much of what people know is not represented as &amp;quot;facts&amp;quot; or &amp;quot;statements&amp;quot; that they could express verbally. For example, a chess master will avoid a particular chess position because it &amp;quot;feels too exposed&amp;quot;{{sfn|Dreyfus|Dreyfus|1986}} or an art critic can take one look at a statue and realize that it is a fake.{{sfn|Gladwell|2005}} These are non-conscious and sub-symbolic intuitions or tendencies in the human brain.&amp;lt;ref name=&amp;quot;Intuition&amp;quot;/&amp;gt; Knowledge like this informs, supports and provides a context for symbolic, conscious knowledge. As with the related problem of sub-symbolic reasoning, it is hoped that [[situated artificial intelligence|situated AI]], [[computational intelligence]], or [[#Statistical|statistical AI]] will provide ways to represent this kind of knowledge.&amp;lt;ref name=&amp;quot;Intuition&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Subsymbolic form of some commonsense knowledge: Much of what people know is not represented as &amp;quot;facts&amp;quot; or &amp;quot;statements&amp;quot; that they could express verbally. For example, a chess master will avoid a particular chess position because it &amp;quot;feels too exposed&amp;quot; or an art critic can take one look at a statue and realize that it is a fake. These are non-conscious and sub-symbolic intuitions or tendencies in the human brain. Knowledge like this informs, supports and provides a context for symbolic, conscious knowledge. As with the related problem of sub-symbolic reasoning, it is hoped that situated AI, computational intelligence, or statistical AI will provide ways to represent this kind of knowledge.&lt;br /&gt;
&lt;br /&gt;
常识的'''&amp;lt;font color=#ff8000&amp;gt;亚符号 Subsymbolic&amp;lt;/font&amp;gt;''' 形式: 人们所知道的许多东西必不能用可以口头表达的“事实”或“陈述”描述。例如，一个国际象棋大师会避免下某个位置，因为觉得这步棋“感觉上太激进”；或者一个艺术评论家可以看一眼雕像，就知道它是假的。这些是人类大脑中无意识和亚符号的直觉。这种知识为符号化的、有意识的知识提供信息和语境。与亚符号推理的相关问题一样，我们希望情境AI、计算智能或统计AI能够表示这类知识。&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]） 这种知识为符号化的、有意识的知识提供信息和语境 一句为省译&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== 规划 Planning ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这个链接在介绍中——&lt;br /&gt;
&lt;br /&gt;
[[File:Hierarchical-control-system.svg|thumb| A [[hierarchical control system]] is a form of [[control system]] in which a set of devices and governing software is arranged in a hierarchy分层控制系统是控制系统的一种形式，在这种控制系统中，一组设备和控制软件被放在一个层次结构中.]]&lt;br /&gt;
&lt;br /&gt;
 A [[hierarchical control system is a form of control system in which a set of devices and governing software is arranged in a hierarchy.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Automated planning and scheduling}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Intelligent agents must be able to set goals and achieve them.&amp;lt;ref name=&amp;quot;Planning&amp;quot;/&amp;gt; They need a way to visualize the future—a representation of the state of the world and be able to make predictions about how their actions will change it—and be able to make choices that maximize the [[utility]] (or &amp;quot;value&amp;quot;) of available choices.&amp;lt;ref name=&amp;quot;Information value theory&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Intelligent agents must be able to set goals and achieve them. They need a way to visualize the future—a representation of the state of the world and be able to make predictions about how their actions will change it—and be able to make choices that maximize the utility (or &amp;quot;value&amp;quot;) of available choices.&lt;br /&gt;
&lt;br /&gt;
智能体必须能够设定并实现目标。他们需要能够有设想未来的办法——这是一种对其所处环境状况的表述，并能够预测他们的行动将如何改变环境——依此能够选择使效用（或者“价值”）最大化的选项。&lt;br /&gt;
&lt;br /&gt;
  --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]） 并能够预测他们的行动将如何改变环境——依此能够选择使效用（或者“价值”）最大化的选项 一句为省译&lt;br /&gt;
&lt;br /&gt;
In classical planning problems, the agent can assume that it is the only system acting in the world, allowing the agent to be certain of the consequences of its actions.&amp;lt;ref name=&amp;quot;Classical planning&amp;quot;/&amp;gt; However, if the agent is not the only actor, then it requires that the agent can reason under uncertainty. This calls for an agent that can not only assess its environment and make predictions but also evaluate its predictions and adapt based on its assessment.&amp;lt;ref name=&amp;quot;Non-deterministic planning&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In classical planning problems, the agent can assume that it is the only system acting in the world, allowing the agent to be certain of the consequences of its actions. However, if the agent is not the only actor, then it requires that the agent can reason under uncertainty. This calls for an agent that can not only assess its environment and make predictions but also evaluate its predictions and adapt based on its assessment.&lt;br /&gt;
&lt;br /&gt;
在经典的规划问题中，智能体可以假设它是世界上唯一运行着的系统，以便于智能体确定其做出某个行为带来的后果。然而，如果智能体不是唯一的参与者，这就要求智能体能够在不确定的情况下进行推理。这需要一智能体不仅能够评估其环境和作出预测，而且还评估其预测和根据其预测做出调整。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Multi-agent planning]] uses the [[cooperation]] and competition of many agents to achieve a given goal. [[Emergent behavior]] such as this is used by [[evolutionary algorithms]] and [[swarm intelligence]].&amp;lt;ref name=&amp;quot;Multi-agent planning&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Multi-agent planning uses the cooperation and competition of many agents to achieve a given goal. Emergent behavior such as this is used by evolutionary algorithms and swarm intelligence.&lt;br /&gt;
多智能体规划利用多个智能体之间的协作和竞争来达到目标。进化算法和群体智能会用到类似这样的涌现行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===学习 Learning ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这个链接在介绍中——&lt;br /&gt;
&lt;br /&gt;
{{Main|Machine learning}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Machine learning (ML), a fundamental concept of AI research since the field's inception,&amp;lt;ref&amp;gt;[[Alan Turing]] discussed the centrality of learning as early as 1950, in his classic paper &amp;quot;[[Computing Machinery and Intelligence]]&amp;quot;.{{Harv|Turing|1950}} In 1956, at the original Dartmouth AI summer conference, [[Ray Solomonoff]] wrote a report on unsupervised probabilistic machine learning: &amp;quot;An Inductive Inference Machine&amp;quot;.{{Harv|Solomonoff|1956}}&amp;lt;/ref&amp;gt; is the study of computer algorithms that improve automatically through experience.&amp;lt;ref&amp;gt;This is a form of [[Tom M. Mitchell|Tom Mitchell]]'s widely quoted definition of machine learning: &amp;quot;A computer program is set to learn from an experience ''E'' with respect to some task ''T'' and some performance measure ''P'' if its performance on ''T'' as measured by ''P'' improves with experience ''E''.&amp;quot;&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Machine learning&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Machine learning (ML), a fundamental concept of AI research since the field's inception, is the study of computer algorithms that improve automatically through experience.&lt;br /&gt;
&lt;br /&gt;
机器学习'''&amp;lt;font color=#ff8000&amp;gt; Machine Learning,ML&amp;lt;/font&amp;gt;'''是自AI诞生以来就有的一个基本概念，它研究如何通过经验自动改进计算机算法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Unsupervised learning]] is the ability to find patterns in a stream of input, without requiring a human to label the inputs first. [[Supervised learning]] includes both [[statistical classification|classification]] and numerical [[Regression analysis|regression]], which requires a human to label the input data first. Classification is used to determine what category something belongs in, and occurs after a program sees a number of examples of things from several categories. Regression is the attempt to produce a function that describes the relationship between inputs and outputs and predicts how the outputs should change as the inputs change.&amp;lt;ref name=&amp;quot;Machine learning&amp;quot;/&amp;gt; Both classifiers and regression learners can be viewed as &amp;quot;function approximators&amp;quot; trying to learn an unknown (possibly implicit) function; for example, a spam classifier can be viewed as learning a function that maps from the text of an email to one of two categories, &amp;quot;spam&amp;quot; or &amp;quot;not spam&amp;quot;. [[Computational learning theory]] can assess learners by [[computational complexity]], by [[sample complexity]] (how much data is required), or by other notions of [[optimization theory|optimization]].&amp;lt;ref&amp;gt;{{cite journal|last1=Jordan|first1=M. I.|last2=Mitchell|first2=T. M.|title=Machine learning: Trends, perspectives, and prospects|journal=Science|date=16 July 2015|volume=349|issue=6245|pages=255–260|doi=10.1126/science.aaa8415|pmid=26185243|bibcode=2015Sci...349..255J}}&amp;lt;/ref&amp;gt; In [[reinforcement learning]]&amp;lt;ref name=&amp;quot;Reinforcement learning&amp;quot;/&amp;gt; the agent is rewarded for good responses and punished for bad ones. The agent uses this sequence of rewards and punishments to form a strategy for operating in its problem space.&lt;br /&gt;
&lt;br /&gt;
Unsupervised learning is the ability to find patterns in a stream of input, without requiring a human to label the inputs first. Supervised learning includes both classification and numerical regression, which requires a human to label the input data first. Classification is used to determine what category something belongs in, and occurs after a program sees a number of examples of things from several categories. Regression is the attempt to produce a function that describes the relationship between inputs and outputs and predicts how the outputs should change as the inputs change. In reinforcement learning the agent is rewarded for good responses and punished for bad ones. The agent uses this sequence of rewards and punishments to form a strategy for operating in its problem space.&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color=#ff8000&amp;gt;无监督学习 Unsupervised Learning&amp;lt;/font&amp;gt;'''可以从数据流中发现某种模式，而不需要人类提前标注数据。'''&amp;lt;font color=#ff8000&amp;gt;有监督学习 Supervised Learning&amp;lt;/font&amp;gt;'''包括分类和回归，这需要人类首先标注数据。分类被用于确定某物属于哪个类别，这需要把大量来自多个类别的例子投入程序；回归用来产生一个描述输入和输出之间的关系的函数，并预测输出会如何随着输入的变化而变化。在强化学习中，智能体会因为好的回应而受到奖励，因为坏的回应而受到惩罚；智能体通过一系列的奖励和惩罚形成了一个在其问题空间中可施行的策略。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===自然语言处理 Natural language processing ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这个链接在介绍中——&lt;br /&gt;
&lt;br /&gt;
[[File:ParseTree.svg|thumb| A [[parse tree]] represents the [[syntax|syntactic]] structure of a sentence according to some [[formal grammar]].]一个[[根据某种形式语法，解析树表示一个句子的句法结构]]&lt;br /&gt;
&lt;br /&gt;
 A [[parse tree represents the syntactic structure of a sentence according to some formal grammar.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Natural language processing}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Natural language processing]]&amp;lt;ref name=&amp;quot;Natural language processing&amp;quot;/&amp;gt; (NLP) gives machines the ability to read and [[natural language understanding|understand]] human language. A sufficiently powerful natural language processing system would enable [[natural-language user interface]]s and the acquisition of knowledge directly from human-written sources, such as newswire texts. Some straightforward applications of natural language processing include [[information retrieval]], [[text mining]], [[question answering]]&amp;lt;ref&amp;gt;[https://www.academia.edu/2475776/Versatile_question_answering_systems_seeing_in_synthesis &amp;quot;Versatile question answering systems: seeing in synthesis&amp;quot;] {{webarchive|url=https://web.archive.org/web/20160201125047/http://www.academia.edu/2475776/Versatile_question_answering_systems_seeing_in_synthesis |date=1 February 2016 }}, Mittal et al., IJIIDS, 5(2), 119–142, 2011&lt;br /&gt;
&lt;br /&gt;
Natural language processing (NLP) gives machines the ability to read and understand human language. A sufficiently powerful natural language processing system would enable natural-language user interfaces and the acquisition of knowledge directly from human-written sources, such as newswire texts. Some straightforward applications of NLP include information retrieval, text mining, question answering&amp;lt;ref&amp;gt;[https://www.academia.edu/2475776/Versatile_question_answering_systems_seeing_in_synthesis &amp;quot;Versatile question answering systems: seeing in synthesis&amp;quot;] , Mittal et al., IJIIDS, 5(2), 119–142, 2011&lt;br /&gt;
&lt;br /&gt;
自然语言处理(NLP)赋予机器阅读和理解人类语言的能力。一个足够强大的自然语言处理系统可以提供自然语言用户界面，并能直接从如新闻专线文本的人类文字中获取知识。一些简单的自然语言处理的应用包括信息检索、文本挖掘、问答和机器翻译。目前许多方法使用词的共现频率来构建文本的句法表示。用“关键词定位”策略进行搜索很常见且可扩展，但很粗糙;搜索“狗”可能只匹配与含“狗”字的文档，而漏掉与“犬”匹配的文档。“词汇相关性”策略使用如“事故”这样的词出现的频次，评估文本想表达的情感。现代统计NLP方法可以结合所有这些策略以及其他策略，在以页或段落为单位的处理上获得还能让人接受的准确度，但仍然缺乏对单独的句子进行分类所需的语义理解。除了编码语义常识常见的困难外，现有的语义NLP有时可扩展性太差，无法应用到在商业中。而“叙述性”NLP除了达到语义NLP的功能之外，还想最终能做到充分理解常识推理。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt; and [[machine translation]].&amp;lt;ref name=&amp;quot;Applications of natural language processing&amp;quot;/&amp;gt; Many current approaches use word co-occurrence frequencies to construct syntactic representations of text. &amp;quot;Keyword spotting&amp;quot; strategies for search are popular and scalable but dumb; a search query for &amp;quot;dog&amp;quot; might only match documents with the literal word &amp;quot;dog&amp;quot; and miss a document with the word &amp;quot;poodle&amp;quot;. &amp;quot;Lexical affinity&amp;quot; strategies use the occurrence of words such as &amp;quot;accident&amp;quot; to [[sentiment analysis|assess the sentiment]] of a document. Modern statistical NLP approaches can combine all these strategies as well as others, and often achieve acceptable accuracy at the page or paragraph level, but continue to lack the semantic understanding required to classify isolated sentences well. Besides the usual difficulties with encoding semantic commonsense knowledge, existing semantic NLP sometimes scales too poorly to be viable in business applications. Beyond semantic NLP, the ultimate goal of &amp;quot;narrative&amp;quot; NLP is to embody a full understanding of commonsense reasoning.&amp;lt;ref&amp;gt;{{cite journal|last1=Cambria|first1=Erik|last2=White|first2=Bebo|title=Jumping NLP Curves: A Review of Natural Language Processing Research [Review Article]|journal=IEEE Computational Intelligence Magazine|date=May 2014|volume=9|issue=2|pages=48–57|doi=10.1109/MCI.2014.2307227}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt; and machine translation.&lt;br /&gt;
&lt;br /&gt;
/ ref 和机器翻译。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===知觉 Perception ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这个链接在介绍中——&lt;br /&gt;
&lt;br /&gt;
{{Main|Machine perception|Computer vision|Speech recognition}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Ääretuvastuse näide.png|thumb|[[Feature detection (computer vision)|Feature detection]] (pictured: [[edge detection]]) helps AI compose informative abstract structures out of raw data.Feature detection (pictured: edge detection) helps AI compose informative abstract structures out of raw data.]]]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[图片: 边缘检测特征提取]帮助AI从原始数据中合成有信息量的抽象结构&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Machine perception]]&amp;lt;ref name=&amp;quot;Machine perception&amp;quot;/&amp;gt; is the ability to use input from sensors (such as cameras (visible spectrum or infrared), microphones, wireless signals, and active [[lidar]], sonar, radar, and [[tactile sensor]]s) to deduce aspects of the world. Applications include [[speech recognition]],&amp;lt;ref name=&amp;quot;Speech recognition&amp;quot;/&amp;gt; [[facial recognition system|facial recognition]], and [[object recognition]].&amp;lt;ref name=&amp;quot;Object recognition&amp;quot;/&amp;gt; [[Computer vision]] is the ability to analyze visual input. Such input is usually ambiguous; a giant, fifty-meter-tall pedestrian far away may produce exactly the same pixels as a nearby normal-sized pedestrian, requiring the AI to judge the relative likelihood and reasonableness of different interpretations, for example by using its &amp;quot;object model&amp;quot; to assess that fifty-meter pedestrians do not exist.&amp;lt;ref name=&amp;quot;Computer vision&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Machine perception is the ability to use input from sensors (such as cameras (visible spectrum or infrared), microphones, wireless signals, and active lidar, sonar, radar, and tactile sensors) to deduce aspects of the world. Applications include speech recognition, facial recognition, and object recognition. Computer vision is the ability to analyze visual input. Such input is usually ambiguous; a giant, fifty-meter-tall pedestrian far away may produce exactly the same pixels as a nearby normal-sized pedestrian, requiring the AI to judge the relative likelihood and reasonableness of different interpretations, for example by using its &amp;quot;object model&amp;quot; to assess that fifty-meter pedestrians do not exist.&lt;br /&gt;
&lt;br /&gt;
机器感知是利用传感器(如可见光或红外线摄像头、麦克风、无线信号、激光雷达、声纳、雷达和触觉传感器)的输入来推断世界的不同角度的能力。应用包括语音识别、面部识别和物体识别。计算机视觉是分析可视化输入的能力。这种输入通常是模糊的; 一个在远处50米高的巨人可能会与近处正常大小的行人占据完全相同的像素，这就要求AI判断不同解释的相对可能性和合理性，例如使用”物体模型”来判断50米高的巨人其实是不存在的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== 运动和操作 Motion and manipulation ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这个链接在介绍中——&lt;br /&gt;
&lt;br /&gt;
{{Main|Robotics}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
AI is heavily used in [[robotics]].&amp;lt;ref name=&amp;quot;Robotics&amp;quot;/&amp;gt; Advanced [[robotic arm]]s and other [[industrial robot]]s, widely used in modern factories, can learn from experience how to move efficiently despite the presence of friction and gear slippage.&amp;lt;ref name=&amp;quot;Configuration space&amp;quot;/&amp;gt; A modern mobile robot, when given a small, static, and visible environment, can easily determine its location and [[robotic mapping|map]] its environment; however, dynamic environments, such as (in [[endoscopy]]) the interior of a patient's breathing body, pose a greater challenge. [[Motion planning]] is the process of breaking down a movement task into &amp;quot;primitives&amp;quot; such as individual joint movements. Such movement often involves compliant motion, a process where movement requires maintaining physical contact with an object.{{sfn|Tecuci|2012}}&amp;lt;ref name=&amp;quot;Robotic mapping&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Cadena|first1=Cesar|last2=Carlone|first2=Luca|last3=Carrillo|first3=Henry|last4=Latif|first4=Yasir|last5=Scaramuzza|first5=Davide|last6=Neira|first6=Jose|last7=Reid|first7=Ian|last8=Leonard|first8=John J.|title=Past, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age|journal=IEEE Transactions on Robotics|date=December 2016|volume=32|issue=6|pages=1309–1332|doi=10.1109/TRO.2016.2624754|arxiv=1606.05830|bibcode=2016arXiv160605830C}}&amp;lt;/ref&amp;gt; [[Moravec's paradox]] generalizes that low-level sensorimotor skills that humans take for granted are, counterintuitively, difficult to program into a robot; the paradox is named after [[Hans Moravec]], who stated in 1988 that &amp;quot;it is comparatively easy to make computers exhibit adult level performance on intelligence tests or playing checkers, and difficult or impossible to give them the skills of a one-year-old when it comes to perception and mobility&amp;quot;.&amp;lt;ref&amp;gt;{{Cite book| first = Hans | last = Moravec | year = 1988 | title = Mind Children | publisher = Harvard University Press | author-link =Hans Moravec| p=15}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|last1=Chan|first1=Szu Ping|title=This is what will happen when robots take over the world|url=https://www.telegraph.co.uk/finance/economics/11994694/Heres-what-will-happen-when-robots-take-over-the-world.html|accessdate=23 April 2018|date=15 November 2015}}&amp;lt;/ref&amp;gt; This is attributed to the fact that, unlike checkers, physical dexterity has been a direct target of [[natural selection]] for millions of years.&amp;lt;ref name=&amp;quot;The Economist&amp;quot;&amp;gt;{{cite news|title=IKEA furniture and the limits of AI|url=https://www.economist.com/news/leaders/21740735-humans-have-had-good-run-most-recent-breakthrough-robotics-it-clear|accessdate=24 April 2018|work=The Economist|date=2018|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
AI is heavily used in robotics. Moravec's paradox generalizes that low-level sensorimotor skills that humans take for granted are, counterintuitively, difficult to program into a robot; the paradox is named after Hans Moravec, who stated in 1988 that &amp;quot;it is comparatively easy to make computers exhibit adult level performance on intelligence tests or playing checkers, and difficult or impossible to give them the skills of a one-year-old when it comes to perception and mobility&amp;quot;. This is attributed to the fact that, unlike checkers, physical dexterity has been a direct target of natural selection for millions of years.&lt;br /&gt;
&lt;br /&gt;
AI在机器人学中应用广泛。在现代工厂中广泛使用的高级机械臂和其他工业机器人，可以从经验中学习如何在存在摩擦和齿轮滑移的情况下有效地移动。当处在一个静态且可见的小环境中时，现代移动机器人可以很容易地确定自己的位置并绘制环境地图；然而如果是动态环境，比如用内窥镜检查病人呼吸的身体的内部，难度就会更高。运动规划是将一个运动任务分解为如单个的关节运动这样的“基本任务”的过程。这种运动通常包括顺应运动，在这个过程中需要与物体保持物理接触。'''&amp;lt;font color=#ff8000&amp;gt;莫拉维克悖论 Moravec's Paradox&amp;lt;/font&amp;gt;''' 概括了人类理所当然认为低水平的感知运动技能很难在编程给机器人的事实，这个悖论是以汉斯 · 莫拉维克的名字命名的，他在1988年表示: “让计算机在智力测试或下跳棋中展现出成人水平的表现相对容易，但要让计算机拥有一岁小孩的感知和移动能力却很难，甚至不可能。”这是因为，身体灵巧性在数百万年的自然选择中一直作为一个直接的目标以增强人类的生存能力；而与此相比，跳棋技能则很奢侈，“擅长跳棋”的基因并不被生存导向的自然选择所偏好与富集。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）这是因为，与跳棋不同，身体灵巧性一直在数百万年的自然选择后才形成的。一句为意译&lt;br /&gt;
 --[[用户:Paradoxist-Paradoxer|Paradoxist@Paradoxer]]（[[用户讨论:Paradoxist-Paradoxer|讨论]]）应强调自然选择的目标是如何的——修改为如上更佳。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== 社会智能 Social intelligence ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这个链接在介绍中——&lt;br /&gt;
&lt;br /&gt;
{{Main|Affective computing}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Kismet robot at MIT Museum.jpg|thumb|[[Kismet (robot)|Kismet]], a robot with rudimentary social skills{{sfn|''Kismet''}}Kismet，一个具有基本社交技能的机器人]]]]&lt;br /&gt;
&lt;br /&gt;
Kismet, a robot with rudimentary social skills]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Moravec's paradox can be extended to many forms of social intelligence.&amp;lt;ref&amp;gt;{{cite magazine |last1=Thompson|first1=Derek|title=What Jobs Will the Robots Take?|url=https://www.theatlantic.com/business/archive/2014/01/what-jobs-will-the-robots-take/283239/|accessdate=24 April 2018|magazine=The Atlantic|date=2018}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Scassellati|first1=Brian|title=Theory of mind for a humanoid robot|journal=Autonomous Robots|volume=12|issue=1|year=2002|pages=13–24|doi=10.1023/A:1013298507114}}&amp;lt;/ref&amp;gt; Distributed multi-agent coordination of autonomous vehicles remains a difficult problem.&amp;lt;ref&amp;gt;{{cite journal|last1=Cao|first1=Yongcan|last2=Yu|first2=Wenwu|last3=Ren|first3=Wei|last4=Chen|first4=Guanrong|title=An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination|journal=IEEE Transactions on Industrial Informatics|date=February 2013|volume=9|issue=1|pages=427–438|doi=10.1109/TII.2012.2219061|arxiv=1207.3231}}&amp;lt;/ref&amp;gt; [[Affective computing]] is an interdisciplinary umbrella that comprises systems which recognize, interpret, process, or simulate human [[Affect (psychology)|affects]].{{sfn|Thro|1993}}{{sfn|Edelson|1991}}{{sfn|Tao|Tan|2005}} Moderate successes related to affective computing include textual [[sentiment analysis]] and, more recently, multimodal affect analysis (see [[multimodal sentiment analysis]]), wherein AI classifies the affects displayed by a videotaped subject.&amp;lt;ref&amp;gt;{{cite journal|last1=Poria|first1=Soujanya|last2=Cambria|first2=Erik|last3=Bajpai|first3=Rajiv|last4=Hussain|first4=Amir|title=A review of affective computing: From unimodal analysis to multimodal fusion|journal=Information Fusion|date=September 2017|volume=37|pages=98–125|doi=10.1016/j.inffus.2017.02.003|hdl=1893/25490|hdl-access=free}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Moravec's paradox can be extended to many forms of social intelligence. Distributed multi-agent coordination of autonomous vehicles remains a difficult problem. Affective computing is an interdisciplinary umbrella that comprises systems which recognize, interpret, process, or simulate human affects. Moderate successes related to affective computing include textual sentiment analysis and, more recently, multimodal affect analysis (see multimodal sentiment analysis), wherein AI classifies the affects displayed by a videotaped subject.&lt;br /&gt;
&lt;br /&gt;
莫拉维克悖论可以扩展到社会智能的许多形式。自动驾驶汽车分布式多智能体协调一直是一个难题。情感计算是一个跨学科交叉领域，包括了识别、解释、处理、模拟人的情感的系统。与情感计算相关的一些还算成功的领域有文本情感分析，以及最近的'''&amp;lt;font color=#ff8000&amp;gt;多模态情感分析 Multimodal Affect Analysis&amp;lt;/font&amp;gt;''' ，多模态情感分析中AI可以做到将录像中被试表现出的情感进行分类。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In the long run, social skills and an understanding of human emotion and [[game theory]] would be valuable to a social agent. Being able to predict the actions of others by understanding their motives and emotional states would allow an agent to make better decisions. Some computer systems mimic human emotion and expressions to appear more sensitive to the emotional dynamics of human interaction, or to otherwise facilitate [[human–computer interaction]].&amp;lt;ref name=&amp;quot;Emotion and affective computing&amp;quot;/&amp;gt; Similarly, some [[virtual assistant]]s are programmed to speak conversationally or even to banter humorously; this tends to give naïve users an unrealistic conception of how intelligent existing computer agents actually are.&amp;lt;ref&amp;gt;{{cite magazine|last1=Waddell|first1=Kaveh|title=Chatbots Have Entered the Uncanny Valley|url=https://www.theatlantic.com/technology/archive/2017/04/uncanny-valley-digital-assistants/523806/|accessdate=24 April 2018|magazine=The Atlantic|date=2018}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In the long run, social skills and an understanding of human emotion and game theory would be valuable to a social agent. Being able to predict the actions of others by understanding their motives and emotional states would allow an agent to make better decisions. Some computer systems mimic human emotion and expressions to appear more sensitive to the emotional dynamics of human interaction, or to otherwise facilitate human–computer interaction.&lt;br /&gt;
&lt;br /&gt;
从长远来看，社交技巧以及对人类情感和博弈论的理解对社会智能体的价值很高。能够通过理解他人的动机和情绪状态来预测他人的行为，会让智能体做出更好的决策。有些计算机系统模仿人类的情感和表情，有利于对人类交互的情感动力学更敏感，或利于促进人机交互。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== 通用智能 General intelligence ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这个链接在介绍中——&lt;br /&gt;
&lt;br /&gt;
{{Main|Artificial general intelligence|AI-complete}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Historically, projects such as the Cyc knowledge base (1984–) and the massive Japanese [[Fifth generation computer|Fifth Generation Computer Systems]] initiative (1982–1992) attempted to cover the breadth of human cognition. These early projects failed to escape the limitations of non-quantitative symbolic logic models and, in retrospect, greatly underestimated the difficulty of cross-domain AI. Nowadays, the vast majority of current AI researchers work instead on tractable &amp;quot;narrow AI&amp;quot; applications (such as medical diagnosis or automobile navigation).&amp;lt;ref name=&amp;quot;contemporary agi&amp;quot;&amp;gt;{{cite book|last1=Pennachin|first1=C.|last2=Goertzel|first2=B.|title=Contemporary Approaches to Artificial General Intelligence|journal=Artificial General Intelligence. Cognitive Technologies|date=2007|doi=10.1007/978-3-540-68677-4_1|publisher=Springer|location=Berlin, Heidelberg|series=Cognitive Technologies|isbn=978-3-540-23733-4}}&amp;lt;/ref&amp;gt; Many researchers predict that such &amp;quot;narrow AI&amp;quot; work in different individual domains will eventually be incorporated into a machine with [[artificial general intelligence]] (AGI), combining most of the narrow skills mentioned in this article and at some point even exceeding human ability in most or all these areas.&amp;lt;ref name=&amp;quot;General intelligence&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Roberts&amp;quot;&amp;gt;{{cite magazine|last1=Roberts|first1=Jacob|title=Thinking Machines: The Search for Artificial Intelligence|magazine=Distillations|date=2016|volume=2|issue=2|pages=14–23|url=https://www.sciencehistory.org/distillations/magazine/thinking-machines-the-search-for-artificial-intelligence|accessdate=20 March 2018|archive-url=https://web.archive.org/web/20180819152455/https://www.sciencehistory.org/distillations/magazine/thinking-machines-the-search-for-artificial-intelligence|archive-date=19 August 2018|url-status=dead}}&amp;lt;/ref&amp;gt; Many advances have general, cross-domain significance. One high-profile example is that [[DeepMind]] in the 2010s developed a &amp;quot;generalized artificial intelligence&amp;quot; that could learn many diverse [[Atari 2600|Atari]] games on its own, and later developed a variant of the system which succeeds at [[Catastrophic interference#The Sequential Learning Problem: McCloskey and Cohen (1989)|sequential learning]].&amp;lt;ref&amp;gt;{{cite news|title=The superhero of artificial intelligence: can this genius keep it in check?|url=https://www.theguardian.com/technology/2016/feb/16/demis-hassabis-artificial-intelligence-deepmind-alphago|accessdate=26 April 2018|work=the Guardian|date=16 February 2016|language=en}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Mnih|first1=Volodymyr|last2=Kavukcuoglu|first2=Koray|last3=Silver|first3=David|last4=Rusu|first4=Andrei A.|last5=Veness|first5=Joel|last6=Bellemare|first6=Marc G.|last7=Graves|first7=Alex|last8=Riedmiller|first8=Martin|last9=Fidjeland|first9=Andreas K.|last10=Ostrovski|first10=Georg|last11=Petersen|first11=Stig|last12=Beattie|first12=Charles|last13=Sadik|first13=Amir|last14=Antonoglou|first14=Ioannis|last15=King|first15=Helen|last16=Kumaran|first16=Dharshan|last17=Wierstra|first17=Daan|last18=Legg|first18=Shane|last19=Hassabis|first19=Demis|title=Human-level control through deep reinforcement learning|journal=Nature|date=26 February 2015|volume=518|issue=7540|pages=529–533|doi=10.1038/nature14236|pmid=25719670|bibcode=2015Natur.518..529M}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|last1=Sample|first1=Ian|title=Google's DeepMind makes AI program that can learn like a human|url=https://www.theguardian.com/global/2017/mar/14/googles-deepmind-makes-ai-program-that-can-learn-like-a-human|accessdate=26 April 2018|work=the Guardian|date=14 March 2017|language=en}}&amp;lt;/ref&amp;gt; Besides [[transfer learning]],&amp;lt;ref&amp;gt;{{cite news|title=From not working to neural networking|url=https://www.economist.com/news/special-report/21700756-artificial-intelligence-boom-based-old-idea-modern-twist-not|accessdate=26 April 2018|work=The Economist|date=2016|language=en}}&amp;lt;/ref&amp;gt; hypothetical AGI breakthroughs could include the development of reflective architectures that can engage in decision-theoretic metareasoning, and figuring out how to &amp;quot;slurp up&amp;quot; a comprehensive knowledge base from the entire unstructured [[World Wide Web|Web]].{{sfn|Russell|Norvig|2009|chapter=27. AI: The Present and Future}} Some argue that some kind of (currently-undiscovered) conceptually straightforward, but mathematically difficult, &amp;quot;Master Algorithm&amp;quot; could lead to AGI.{{sfn|Domingos|2015|chapter=9. The Pieces of the Puzzle Fall into Place}} Finally, a few &amp;quot;emergent&amp;quot; approaches look to simulating human intelligence extremely closely, and believe that [[anthropomorphism|anthropomorphic]] features like an [[artificial brain]] or simulated [[developmental robotics|child development]] may someday reach a critical point where general intelligence emerges.&amp;lt;ref name=&amp;quot;Brain simulation&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Goertzel|first1=Ben|last2=Lian|first2=Ruiting|last3=Arel|first3=Itamar|last4=de Garis|first4=Hugo|last5=Chen|first5=Shuo|title=A world survey of artificial brain projects, Part II: Biologically inspired cognitive architectures|journal=Neurocomputing|date=December 2010|volume=74|issue=1–3|pages=30–49|doi=10.1016/j.neucom.2010.08.012}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Historically, projects such as the Cyc knowledge base (1984–) and the massive Japanese Fifth Generation Computer Systems initiative (1982–1992) attempted to cover the breadth of human cognition. These early projects failed to escape the limitations of non-quantitative symbolic logic models and, in retrospect, greatly underestimated the difficulty of cross-domain AI. Nowadays, the vast majority of current AI researchers work instead on tractable &amp;quot;narrow AI&amp;quot; applications (such as medical diagnosis or automobile navigation). Many researchers predict that such &amp;quot;narrow AI&amp;quot; work in different individual domains will eventually be incorporated into a machine with artificial general intelligence (AGI), combining most of the narrow skills mentioned in this article and at some point even exceeding human ability in most or all these areas. Many advances have general, cross-domain significance. One high-profile example is that DeepMind in the 2010s developed a &amp;quot;generalized artificial intelligence&amp;quot; that could learn many diverse Atari games on its own, and later developed a variant of the system which succeeds at sequential learning. Besides transfer learning, hypothetical AGI breakthroughs could include the development of reflective architectures that can engage in decision-theoretic metareasoning, and figuring out how to &amp;quot;slurp up&amp;quot; a comprehensive knowledge base from the entire unstructured Web. Some argue that some kind of (currently-undiscovered) conceptually straightforward, but mathematically difficult, &amp;quot;Master Algorithm&amp;quot; could lead to AGI. Finally, a few &amp;quot;emergent&amp;quot; approaches look to simulating human intelligence extremely closely, and believe that anthropomorphic features like an artificial brain or simulated child development may someday reach a critical point where general intelligence emerges.&lt;br /&gt;
&lt;br /&gt;
历史上，诸如 Cyc 知识库(1984 -)和大规模的日本第五代计算机系统倡议(1982-1992)等项目试图涵盖人类的所有认知。这些早期的项目未能逃脱非定量符号逻辑模型的限制，现在回过头看，这些项目大大低估了实现跨领域AI的难度。当下绝大多数AI研究人员主要研究易于处理的“狭义AI”应用(如医疗诊断或汽车导航)。许多研究人员预测，不同领域的“狭义AI”工作最终将被整合到一台具有人工通用智能(AGI)的机器中，结合上文提到的大多数狭义功能，甚至在某种程度上在大多数或所有这些领域都超过人类。许多进展具有普遍的、跨领域的意义。一个著名的例子是，21世纪一零年代，DeepMind开发了一种“'''&amp;lt;font color=#ff8000&amp;gt;通用人工智能 Generalized Artificial Intelligence&amp;lt;/font&amp;gt;'''” ，它可以自己学习许多不同的 Atari 游戏，后来又开发了这种系统的升级版，在序贯学习方面取得了成功。除了迁移学习，未来AGI 的突破可能包括开发能够进行决策理论元推理的反射架构，以及从整个非结构化的网页中整合一个全面的知识库。一些人认为，某种(目前尚未发现的)概念简单，但在数学上困难的“终极算法”可以产生AGI。最后，一些“涌现”的方法着眼于尽可能地模拟人类智能，并相信如人工大脑或模拟儿童发展等拟人方案，有一天会达到一个临界点，通用智能在此涌现。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Many of the problems in this article may also require general intelligence, if machines are to solve the problems as well as people do. For example, even specific straightforward tasks, like [[machine translation]], require that a machine read and write in both languages ([[#Natural language processing|NLP]]), follow the author's argument ([[#Deduction, reasoning, problem solving|reason]]), know what is being talked about ([[#Knowledge representation|knowledge]]), and faithfully reproduce the author's original intent ([[#Social intelligence|social intelligence]]). A problem like machine translation is considered &amp;quot;[[AI-complete]]&amp;quot;, because all of these problems need to be solved simultaneously in order to reach human-level machine performance.&lt;br /&gt;
&lt;br /&gt;
Many of the problems in this article may also require general intelligence, if machines are to solve the problems as well as people do. For example, even specific straightforward tasks, like machine translation, require that a machine read and write in both languages (NLP), follow the author's argument (reason), know what is being talked about (knowledge), and faithfully reproduce the author's original intent (social intelligence). A problem like machine translation is considered &amp;quot;AI-complete&amp;quot;, because all of these problems need to be solved simultaneously in order to reach human-level machine performance.&lt;br /&gt;
&lt;br /&gt;
如果机器要像人一样解决问题，那么本文中的许多问题也可能需要通用智能。例如，即使是特定的如机器翻译的直接任务，也要求机器用两种语言进行读写(NLP) ，符合作者的观点(推理) ，知道谈论的内容(知识) ，并忠实地再现作者的原始意图(社会智能)。像机器翻译这样的问题被认为是“AI完备”的，因为需要同时解决所有这些问题，机器性能才能达到人类水平。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== 方法 ==&lt;br /&gt;
&lt;br /&gt;
There is no established unifying theory or [[paradigm]] that guides AI research. Researchers disagree about many issues.&amp;lt;ref&amp;gt;[[Nils Nilsson (researcher)|Nils Nilsson]] writes: &amp;quot;Simply put, there is wide disagreement in the field about what AI is all about&amp;quot; {{Harv|Nilsson|1983|p=10}}.&amp;lt;/ref&amp;gt; A few of the most long standing questions that have remained unanswered are these: should artificial intelligence simulate natural intelligence by studying [[psychology]] or [[Neuroscience|neurobiology]]? Or is [[human biology]] as irrelevant to AI research as bird biology is to [[aeronautical engineering]]?&amp;lt;ref name=&amp;quot;Biological intelligence vs. intelligence in general&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
There is no established unifying theory or paradigm that guides AI research. Researchers disagree about many issues. A few of the most long standing questions that have remained unanswered are these: should artificial intelligence simulate natural intelligence by studying psychology or neurobiology? Or is human biology as irrelevant to AI research as bird biology is to aeronautical engineering?&lt;br /&gt;
&lt;br /&gt;
目前还没有统一的理论或范式来指导AI的研究。研究人员在许多问题上存在分歧。&amp;lt;ref&amp;gt;[[Nils Nilsson (researcher)|Nils Nilsson]] writes: &amp;quot;Simply put, there is wide disagreement in the field about what AI is all about&amp;quot; {{Harv|Nilsson|1983|p=10}}.&amp;lt;/ref&amp;gt;一些长期悬而未决的问题是: AI是否应该通过研究心理学或神经生物学来模拟天然智能？人类生物学和AI研究的关系和鸟类生物学和航空工程学的关系一样吗？&lt;br /&gt;
&lt;br /&gt;
Can intelligent behavior be described using simple, elegant principles (such as [[logic]] or [[optimization (mathematics)|optimization]])? Or does it necessarily require solving a large number of completely unrelated problems?&amp;lt;ref name=&amp;quot;Neats vs. scruffies&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Can intelligent behavior be described using simple, elegant principles (such as logic or optimization)? Or does it necessarily require solving a large number of completely unrelated problems?&lt;br /&gt;
&lt;br /&gt;
智能行为可以用简单、优雅的原则(如逻辑或优化)来描述吗？还是需要去解决大量完全不相关的问题？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===控制论与大脑模拟 ===&lt;br /&gt;
&lt;br /&gt;
{{Main|Cybernetics|Computational neuroscience}}&lt;br /&gt;
&lt;br /&gt;
In the 1940s and 1950s, a number of researchers explored the connection between [[neurobiology]], [[information theory]], and [[cybernetics]]. Some of them built machines that used electronic networks to exhibit rudimentary intelligence, such as [[W. Grey Walter]]'s [[turtle (robot)|turtles]] and the [[Johns Hopkins Beast]]. Many of these researchers gathered for meetings of the Teleological Society at [[Princeton University]] and the [[Ratio Club]] in England.&amp;lt;ref name=&amp;quot;AI's immediate precursors&amp;quot;/&amp;gt; By 1960, this approach was largely abandoned, although elements of it would be revived in the 1980s.&lt;br /&gt;
&lt;br /&gt;
In the 1940s and 1950s, a number of researchers explored the connection between neurobiology, information theory, and cybernetics. Some of them built machines that used electronic networks to exhibit rudimentary intelligence, such as W. Grey Walter's turtles and the Johns Hopkins Beast. Many of these researchers gathered for meetings of the Teleological Society at Princeton University and the Ratio Club in England. By 1960, this approach was largely abandoned, although elements of it would be revived in the 1980s.&lt;br /&gt;
&lt;br /&gt;
在20世纪四五十年代，许多研究人员探索了神经生物学、信息论和控制论之间的联系。他们中的一些人利用电子网络制造机器来表现基本的智能，比如 '''W·格雷·沃尔特 W. Grey Walter'''的乌龟和'''约翰·霍普金斯 Johns Hopkins'''的野兽。这些研究人员中的许多人参加了在普林斯顿大学的'''目的论学社'''和英格兰的'''比率俱乐部'''举办的集会。到了1960年，这种方法基本上被放弃了，直到二十世纪八十年代一些部分又被重新使用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===符号化方法===&lt;br /&gt;
&lt;br /&gt;
{{Main|Symbolic AI}}&lt;br /&gt;
&lt;br /&gt;
When access to digital computers became possible in the mid-1950s, AI research began to explore the possibility that human intelligence could be reduced to symbol manipulation. The research was centered in three institutions: [[Carnegie Mellon University]], [[Stanford]] and [[MIT]], and as described below, each one developed its own style of research. [[John Haugeland]] named these symbolic approaches to AI &amp;quot;good old fashioned AI&amp;quot; or &amp;quot;[[GOFAI]]&amp;quot;.&amp;lt;ref name=&amp;quot;GOFAI&amp;quot;/&amp;gt; During the 1960s, symbolic approaches had achieved great success at simulating high-level &amp;quot;thinking&amp;quot; in small demonstration programs. Approaches based on [[cybernetics]] or [[artificial neural network]]s were abandoned or pushed into the background.&amp;lt;ref&amp;gt;The most dramatic case of sub-symbolic AI being pushed into the background was the devastating critique of [[perceptron]]s by [[Marvin Minsky]] and [[Seymour Papert]] in 1969. See [[History of AI]], [[AI winter]], or [[Frank Rosenblatt]].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
When access to digital computers became possible in the mid-1950s, AI research began to explore the possibility that human intelligence could be reduced to symbol manipulation. The research was centered in three institutions: Carnegie Mellon University, Stanford and MIT, and as described below, each one developed its own style of research. John Haugeland named these symbolic approaches to AI &amp;quot;good old fashioned AI&amp;quot; or &amp;quot;GOFAI&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
20世纪50年代中期，当数字计算机成为可能时，AI研究开始探索把人类智能化归为符号操纵的可能性。这项研究集中在3个机构: 卡内基梅隆大学，斯坦福和麻省理工学院，正如下面所描述的，每个机构都有自己的研究风格。约翰 · 豪格兰德将这些具有象征意义的AI方法命名为“好的老式人工智能 Good Old Fashioned AI”或“ GOFAI”&amp;lt;ref name=&amp;quot;GOFAI&amp;quot;/&amp;gt;。20世纪60年代的时候，符号化方法在模拟高层次“思考”的小型程序中取得了巨大的成就。而基于[[控制论]]和[[人工神经网络]]的方法则被抛弃，或者只作为背景出现。&amp;lt;ref&amp;gt;The most dramatic case of sub-symbolic AI being pushed into the background was the devastating critique of [[perceptron]]s by [[Marvin Minsky]] and [[Seymour Papert]] in 1969. See [[History of AI]], [[AI winter]], or [[Frank Rosenblatt]].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Researchers in the 1960s and the 1970s were convinced that symbolic approaches would eventually succeed in creating a machine with [[artificial general intelligence]] and considered this the goal of their field.&lt;br /&gt;
&lt;br /&gt;
Researchers in the 1960s and the 1970s were convinced that symbolic approaches would eventually succeed in creating a machine with artificial general intelligence and considered this the goal of their field.&lt;br /&gt;
&lt;br /&gt;
20世纪六七十年代的研究人员相信，符号方法最终会成功地创造出一台具有[[通用人工智能]]的机器，并以此作为他们研究领域的目标。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====模拟认知的方法====&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Economist [[Herbert A. Simon|Herbert Simon]] and [[Allen Newell]] studied human problem-solving skills and attempted to formalize them, and their work laid the foundations of the field of artificial intelligence, as well as [[cognitive science]], [[operations research]] and [[management science]]. Their research team used the results of [[psychology|psychological]] experiments to develop programs that simulated the techniques that people used to solve problems. This tradition, centered at [[Carnegie Mellon University]] would eventually culminate in the development of the [[Soar (cognitive architecture)|Soar]] architecture in the middle 1980s.&amp;lt;ref name=&amp;quot;AI at CMU in the 60s&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Soar&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Economist Herbert Simon and Allen Newell studied human problem-solving skills and attempted to formalize them, and their work laid the foundations of the field of artificial intelligence, as well as cognitive science, operations research and management science. Their research team used the results of psychological experiments to develop programs that simulated the techniques that people used to solve problems. This tradition, centered at Carnegie Mellon University would eventually culminate in the development of the Soar architecture in the middle 1980s.&lt;br /&gt;
&lt;br /&gt;
经济学家[[赫伯特·西蒙]]和[[艾伦·纽厄尔]]研究了人类解决问题的技能，并试图将其形式化。他们的工作为AI、认知科学、运筹学和管理科学奠定了基础。他们的研究团队利用心理学实验的结果来开发程序，模拟人们用来解决问题的方法。以卡内基梅隆大学为中心，这种研究传统最终在20世纪80年代中期的SOAR架构开发过程中达到顶峰。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==== 基于逻辑的方法 ====&lt;br /&gt;
&lt;br /&gt;
Unlike Simon and Newell, [[John McCarthy (computer scientist)|John McCarthy]] felt that machines did not need to simulate human thought, but should instead try to find the essence of abstract reasoning and problem-solving, regardless whether people used the same algorithms.&amp;lt;ref name=&amp;quot;Biological intelligence vs. intelligence in general&amp;quot;/&amp;gt; His laboratory at [[Stanford University|Stanford]] ([[Stanford Artificial Intelligence Laboratory|SAIL]]) focused on using formal [[logic]] to solve a wide variety of problems, including [[knowledge representation]], [[automated planning and scheduling|planning]] and [[machine learning|learning]].&amp;lt;ref name=&amp;quot;AI at Stanford in the 60s&amp;quot;/&amp;gt; Logic was also the focus of the work at the [[University of Edinburgh]] and elsewhere in Europe which led to the development of the programming language [[Prolog]] and the science of [[logic programming]].&amp;lt;ref name=&amp;quot;AI at Edinburgh and France in the 60s&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Unlike Simon and Newell, John McCarthy felt that machines did not need to simulate human thought, but should instead try to find the essence of abstract reasoning and problem-solving, regardless whether people used the same algorithms. His laboratory at Stanford (SAIL) focused on using formal logic to solve a wide variety of problems, including knowledge representation, planning and learning. Logic was also the focus of the work at the University of Edinburgh and elsewhere in Europe which led to the development of the programming language Prolog and the science of logic programming.&lt;br /&gt;
&lt;br /&gt;
与西蒙和纽厄尔不同，约翰·麦卡锡认为机器不需要模拟人类的思维，而是应该尝试寻找抽象推理和解决问题的本质，不管人们是否使用相同的算法。&amp;lt;ref name=&amp;quot;Biological intelligence vs. intelligence in general&amp;quot;/&amp;gt; 他在斯坦福大学的实验室(SAIL)致力于使用形式逻辑来解决各种各样的问题，包括知识表示、规划和学习。逻辑也是爱丁堡大学和欧洲其他地方工作的重点，这促进了编程语言 Prolog 和逻辑编程科学的发展。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====反逻辑的或“邋遢”的方法====&lt;br /&gt;
&lt;br /&gt;
Researchers at [[MIT]] (such as [[Marvin Minsky]] and [[Seymour Papert]])&amp;lt;ref name=&amp;quot;AI at MIT in the 60s&amp;quot;/&amp;gt; found that solving difficult problems in [[computer vision|vision]] and [[natural language processing]] required ad-hoc solutions—they argued that there was no simple and general principle (like [[logic]]) that would capture all the aspects of intelligent behavior. [[Roger Schank]] described their &amp;quot;anti-logic&amp;quot; approaches as &amp;quot;[[Neats vs. scruffies|scruffy]]&amp;quot; (as opposed to the &amp;quot;[[neats vs. scruffies|neat]]&amp;quot; paradigms at [[Carnegie Mellon University|CMU]] and Stanford).&amp;lt;ref name=&amp;quot;Neats vs. scruffies&amp;quot;/&amp;gt; [[Commonsense knowledge bases]] (such as [[Doug Lenat]]'s [[Cyc]]) are an example of &amp;quot;scruffy&amp;quot; AI, since they must be built by hand, one complicated concept at a time.&amp;lt;ref name=&amp;quot;Cyc&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Researchers at MIT (such as Marvin Minsky and Seymour Papert) found that solving difficult problems in vision and natural language processing required ad-hoc solutions—they argued that there was no simple and general principle (like logic) that would capture all the aspects of intelligent behavior. Roger Schank described their &amp;quot;anti-logic&amp;quot; approaches as &amp;quot;scruffy&amp;quot; (as opposed to the &amp;quot;neat&amp;quot; paradigms at CMU and Stanford). Commonsense knowledge bases (such as Doug Lenat's Cyc) are an example of &amp;quot;scruffy&amp;quot; AI, since they must be built by hand, one complicated concept at a time.&lt;br /&gt;
&lt;br /&gt;
麻省理工学院(MIT)的研究人员马文•明斯基和西摩•派珀特等发现&amp;lt;ref name=&amp;quot;AI at MIT in the 60s&amp;quot;/&amp;gt;，视觉和自然语言处理中的难题需要特定的解决方案——他们认为，没有简单而普遍的原则(如逻辑)可以涵盖智能行为。罗杰•尚克将他们的“反逻辑”方法形容为“邋遢的”(相对于卡内基梅隆大学和斯坦福大学的“整洁”范式)。常识库(如常识知识库的 Cyc)是“邋遢”AI的一个例子，因为它们必须人工一个一个地构建复杂概念。&lt;br /&gt;
&lt;br /&gt;
====基于知识的方法====&lt;br /&gt;
&lt;br /&gt;
When computers with large memories became available around 1970, researchers from all three traditions began to build [[knowledge representation|knowledge]] into AI applications.&amp;lt;ref name=&amp;quot;Knowledge revolution&amp;quot;/&amp;gt; This &amp;quot;knowledge revolution&amp;quot; led to the development and deployment of [[expert system]]s (introduced by [[Edward Feigenbaum]]), the first truly successful form of AI software.&amp;lt;ref name=&amp;quot;Expert systems&amp;quot;/&amp;gt; A key component of the system architecture for all expert systems is the knowledge base, which stores facts and rules that illustrate AI.&amp;lt;ref&amp;gt;{{Cite journal |last=Frederick |first=Hayes-Roth |last2=William |first2=Murray |last3=Leonard |first3=Adelman |title=Expert systems|journal=AccessScience |language=en |doi=10.1036/1097-8542.248550}}&amp;lt;/ref&amp;gt; The knowledge revolution was also driven by the realization that enormous amounts of knowledge would be required by many simple AI applications.&lt;br /&gt;
&lt;br /&gt;
When computers with large memories became available around 1970, researchers from all three traditions began to build knowledge into AI applications. The knowledge revolution was also driven by the realization that enormous amounts of knowledge would be required by many simple AI applications.&lt;br /&gt;
&lt;br /&gt;
1970年左右，当拥有大容量存储器的计算机出现时，来自这三个研究方向的研究人员开始将知识应用于AI领域&amp;lt;ref name=&amp;quot;Knowledge revolution&amp;quot;/&amp;gt; 。这一轮“知识革命”的一大成果是开发和部署专家系统，第一个真正成功的AI软件&amp;lt;ref name=&amp;quot;Expert systems&amp;quot;/&amp;gt;。所有专家系统的一个关键部件是存储着事实和规则的知识库&amp;lt;ref&amp;gt;{{Cite journal |last=Frederick |first=Hayes-Roth |last2=William |first2=Murray |last3=Leonard |first3=Adelman |title=Expert systems|journal=AccessScience |language=en |doi=10.1036/1097-8542.248550}}&amp;lt;/ref&amp;gt;。推动知识革命的另一个原因是人们认识到，许多简单的AI应用程序也需要大量的知识。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===亚符号方法 ===&lt;br /&gt;
&lt;br /&gt;
By the 1980s, progress in symbolic AI seemed to stall and many believed that symbolic systems would never be able to imitate all the processes of human cognition, especially [[machine perception|perception]], [[robotics]], [[machine learning|learning]] and [[pattern recognition]]. A number of researchers began to look into &amp;quot;sub-symbolic&amp;quot; approaches to specific AI problems.&amp;lt;ref name=&amp;quot;Symbolic vs. sub-symbolic&amp;quot;/&amp;gt; Sub-symbolic methods manage to approach intelligence without specific representations of knowledge.&lt;br /&gt;
&lt;br /&gt;
By the 1980s, progress in symbolic AI seemed to stall and many believed that symbolic systems would never be able to imitate all the processes of human cognition, especially perception, robotics, learning and pattern recognition. A number of researchers began to look into &amp;quot;sub-symbolic&amp;quot; approaches to specific AI problems. Sub-symbolic methods manage to approach intelligence without specific representations of knowledge.&lt;br /&gt;
&lt;br /&gt;
到了20世纪80年代，符号AI的进步似乎停滞不前，许多人认为符号系统永远无法模仿人类认知的所有过程，尤其在感知、机器人学、学习和模式识别等方面。许多研究人员开始研究针对特定AI问题的“亚符号”方法&amp;lt;ref name=&amp;quot;Symbolic vs. sub-symbolic&amp;quot;/&amp;gt;。亚符号方法能在没有特定知识表示的情况下，做到接近智能。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====具身智慧====&lt;br /&gt;
&lt;br /&gt;
This includes [[embodied agent|embodied]], [[situated]], [[behavior-based AI|behavior-based]], and [[nouvelle AI]]. Researchers from the related field of [[robotics]], such as [[Rodney Brooks]], rejected symbolic AI and focused on the basic engineering problems that would allow robots to move and survive.&amp;lt;ref name=&amp;quot;Embodied AI&amp;quot;/&amp;gt; Their work revived the non-symbolic point of view of the early [[cybernetic]]s researchers of the 1950s and reintroduced the use of [[control theory]] in AI. This coincided with the development of the [[embodied mind thesis]] in the related field of [[cognitive science]]: the idea that aspects of the body (such as movement, perception and visualization) are required for higher intelligence.&lt;br /&gt;
&lt;br /&gt;
This includes embodied, situated, behavior-based, and nouvelle AI. Researchers from the related field of robotics, such as Rodney Brooks, rejected symbolic AI and focused on the basic engineering problems that would allow robots to move and survive. Their work revived the non-symbolic point of view of the early cybernetics researchers of the 1950s and reintroduced the use of control theory in AI. This coincided with the development of the embodied mind thesis in the related field of cognitive science: the idea that aspects of the body (such as movement, perception and visualization) are required for higher intelligence.&lt;br /&gt;
&lt;br /&gt;
'''具身智慧 Embodied Intelligence'''包括具体化的、情境化的、基于行为的新式 AI。来自机器人相关领域的研究人员，如罗德尼·布鲁克斯，放弃了符号化AI的方法，而专注于使机器人能够移动和生存的基本工程问题&amp;lt;ref name=&amp;quot;Embodied AI&amp;quot;/&amp;gt;。他们的工作重启了20世纪50年代早期控制论研究者的非符号观点，并将控制论重新引入到AI的应用中。这与认知科学相关领域的具身理论的发展相吻合: 认为如运动、感知和视觉等身体的各个功能是高智能所必需的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Within [[developmental robotics]], developmental learning approaches are elaborated upon to allow robots to accumulate repertoires of novel skills through autonomous self-exploration, social interaction with human teachers, and the use of guidance mechanisms (active learning, maturation, motor synergies, etc.).{{sfn|Weng|McClelland|Pentland|Sporns|2001}}{{sfn|Lungarella|Metta|Pfeifer|Sandini|2003}}{{sfn|Asada|Hosoda|Kuniyoshi|Ishiguro|2009}}{{sfn|Oudeyer|2010}}&lt;br /&gt;
&lt;br /&gt;
Within developmental robotics, developmental learning approaches are elaborated upon to allow robots to accumulate repertoires of novel skills through autonomous self-exploration, social interaction with human teachers, and the use of guidance mechanisms (active learning, maturation, motor synergies, etc.).&lt;br /&gt;
&lt;br /&gt;
在发展型机器人中，人们开发了发展型学习方法，通过自主的自我探索、与人类教师的社会互动，以及使用主动学习、成熟、协同运动等指导机制 ，使机器人积累新技能的能力。{{sfn|Weng|McClelland|Pentland|Sporns|2001}}{{sfn|Lungarella|Metta|Pfeifer|Sandini|2003}}{{sfn|Asada|Hosoda|Kuniyoshi|Ishiguro|2009}}{{sfn|Oudeyer|2010}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====计算智能与软计算 ====&lt;br /&gt;
&lt;br /&gt;
Interest in [[Artificial neural network|neural networks]] and &amp;quot;[[connectionism]]&amp;quot; was revived by [[David Rumelhart]] and others in the middle of the 1980s.&amp;lt;ref name=&amp;quot;Revival of connectionism&amp;quot;/&amp;gt; [[Artificial neural network]]s are an example of [[soft computing]]—they are solutions to problems which cannot be solved with complete logical certainty, and where an approximate solution is often sufficient. Other [[soft computing]] approaches to AI include [[fuzzy system]]s, [[Grey system theory]], [[evolutionary computation]] and many statistical tools. The application of soft computing to AI is studied collectively by the emerging discipline of [[computational intelligence]].&amp;lt;ref name=&amp;quot;Computational intelligence&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Interest in neural networks and &amp;quot;connectionism&amp;quot; was revived by David Rumelhart and others in the middle of the 1980s. Artificial neural networks are an example of soft computing—they are solutions to problems which cannot be solved with complete logical certainty, and where an approximate solution is often sufficient. Other soft computing approaches to AI include fuzzy systems, Grey system theory, evolutionary computation and many statistical tools. The application of soft computing to AI is studied collectively by the emerging discipline of computational intelligence.&lt;br /&gt;
&lt;br /&gt;
上世纪80年代中期，大卫•鲁梅尔哈特等人重新激发了人们对神经网络和“'''&amp;lt;font color=#ff8000&amp;gt;连接主义 Connectionism&amp;lt;/font&amp;gt;'''”的兴趣。人工神经网络是软计算的一个例子ーー它们解决不能完全用逻辑确定性地解决，但常常只需要近似解的问题。AI的其他软计算方法包括'''&amp;lt;font color=#ff8000&amp;gt;模糊系统 Fuzzy Systems &amp;lt;/font&amp;gt;'''、'''&amp;lt;font color=#ff8000&amp;gt;灰度系统理论 Grey System Theory&amp;lt;/font&amp;gt;'''、'''&amp;lt;font color=#ff8000&amp;gt;演化计算 Evolutionary Computation &amp;lt;/font&amp;gt;'''和许多统计工具。软计算在AI中的应用是计算智能这一新兴学科的集中研究领域。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===统计学习 ===&lt;br /&gt;
&lt;br /&gt;
Much of traditional [[Symbolic artificial intelligence|GOFAI]] got bogged down on ''ad hoc'' patches to [[symbolic computation]] that worked on their own toy models but failed to generalize to real-world results. However, around the 1990s, AI researchers adopted sophisticated mathematical tools, such as [[hidden Markov model]]s (HMM), [[information theory]], and normative Bayesian [[decision theory]] to compare or to unify competing architectures. The shared mathematical language permitted a high level of collaboration with more established fields (like [[mathematics]], economics or [[operations research]]).{{efn|While such a &amp;quot;victory of the neats&amp;quot; may be a consequence of the field becoming more mature, [[Artificial Intelligence: A Modern Approach|AIMA]] states that in practice both [[neats and scruffies|neat and scruffy]] approaches continue to be necessary in AI research.}} Compared with GOFAI, new &amp;quot;statistical learning&amp;quot; techniques such as HMM and neural networks were gaining higher levels of accuracy in many practical domains such as [[data mining]], without necessarily acquiring a semantic understanding of the datasets. The increased successes with real-world data led to increasing emphasis on comparing different approaches against shared test data to see which approach performed best in a broader context than that provided by idiosyncratic toy models; AI research was becoming more [[scientific method|scientific]]. Nowadays results of experiments are often rigorously measurable, and are sometimes (with difficulty) reproducible.&amp;lt;ref name=&amp;quot;Formal methods in AI&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|last1=Hutson|first1=Matthew|title=Artificial intelligence faces reproducibility crisis|url=http://science.sciencemag.org/content/359/6377/725|accessdate=28 April 2018|work=[[Science Magazine|Science]]|date=16 February 2018|pages=725–726|language=en|doi=10.1126/science.359.6377.725|bibcode=2018Sci...359..725H}}&amp;lt;/ref&amp;gt; Different statistical learning techniques have different limitations; for example, basic HMM cannot model the infinite possible combinations of natural language.{{sfn|Norvig|2012}} Critics note that the shift from GOFAI to statistical learning is often also a shift away from [[explainable AI]]. In AGI research, some scholars caution against over-reliance on statistical learning, and argue that continuing research into GOFAI will still be necessary to attain general intelligence.{{sfn|Langley|2011}}{{sfn|Katz|2012}}&lt;br /&gt;
&lt;br /&gt;
Much of traditional GOFAI got bogged down on ad hoc patches to symbolic computation that worked on their own toy models but failed to generalize to real-world results. However, around the 1990s, AI researchers adopted sophisticated mathematical tools, such as hidden Markov models (HMM), information theory, and normative Bayesian decision theory to compare or to unify competing architectures. The shared mathematical language permitted a high level of collaboration with more established fields (like mathematics, economics or operations research). Compared with GOFAI, new &amp;quot;statistical learning&amp;quot; techniques such as HMM and neural networks were gaining higher levels of accuracy in many practical domains such as data mining, without necessarily acquiring a semantic understanding of the datasets. The increased successes with real-world data led to increasing emphasis on comparing different approaches against shared test data to see which approach performed best in a broader context than that provided by idiosyncratic toy models; AI research was becoming more scientific. Nowadays results of experiments are often rigorously measurable, and are sometimes (with difficulty) reproducible. Different statistical learning techniques have different limitations; for example, basic HMM cannot model the infinite possible combinations of natural language. Critics note that the shift from GOFAI to statistical learning is often also a shift away from explainable AI. In AGI research, some scholars caution against over-reliance on statistical learning, and argue that continuing research into GOFAI will still be necessary to attain general intelligence.&lt;br /&gt;
&lt;br /&gt;
许多传统的 GOFAI 在实验模型中行之有效，但不能推广到现实世界，陷入了需要不断给符号计算修补漏洞的困境中。然而，在20世纪90年代前后，AI研究人员采用了复杂的数学工具，如'''&amp;lt;font color=#ff8000&amp;gt;隐马尔可夫模型 Hidden Markov Model,HMM&amp;lt;/font&amp;gt;'''、信息论和'''&amp;lt;font color=#ff8000&amp;gt;标准贝叶斯决策理论 Normative Bayesian Decision Theory&amp;lt;/font&amp;gt;'''来比较或统一各种互相竞争的架构。共通的数学语言允许其与数学、经济学或运筹学等更成熟的领域进行高层次的融合。与 GOFAI 相比，隐马尔可夫模型和神经网络等新的“统计学习”技术在数据挖掘等许多实际领域中不必理解数据集的语义，却能得到更高的精度，随着现实世界数据的日益增加，人们越来越注重用不同的方法测试相同的数据，并进行比较，看哪种方法在比特殊实验室环境更广泛的背景下表现得更好; AI研究正变得更加科学。如今，实验结果一般是严格可测的，有时可以重现（但有难度）。不同的统计学习技术有不同的局限性，例如，基本的 HMM 不能为自然语言的无限可能的组合建模。评论者们指出，从 GOFAI 到统计学习的转变也经常是可解释AI的转变。在 [[通用人工智能]] 的研究中，一些学者警告不要过度依赖统计学习，并认为继续研究 GOFAI 仍然是实现通用智能的必要条件。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== 集成各种方法 ===&lt;br /&gt;
&lt;br /&gt;
;Intelligent agent paradigm: An [[intelligent agent]] is a system that perceives its environment and takes actions that maximize its chances of success. The simplest intelligent agents are programs that solve specific problems. More complicated agents include human beings and organizations of human beings (such as [[firm]]s). The paradigm allows researchers to directly compare or even combine different approaches to isolated problems, by asking which agent is best at maximizing a given &amp;quot;goal function&amp;quot;. An agent that solves a specific problem can use any approach that works—some agents are symbolic and logical, some are sub-symbolic [[artificial neural network]]s and others may use new approaches. The paradigm also gives researchers a common language to communicate with other fields—such as [[decision theory]] and economics—that also use concepts of abstract agents. Building a complete agent requires researchers to address realistic problems of integration; for example, because sensory systems give uncertain information about the environment, planning systems must be able to function in the presence of uncertainty. The intelligent agent paradigm became widely accepted during the 1990s.&amp;lt;ref name=&amp;quot;Intelligent agents&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Intelligent agent paradigm: An intelligent agent is a system that perceives its environment and takes actions that maximize its chances of success. The simplest intelligent agents are programs that solve specific problems. More complicated agents include human beings and organizations of human beings (such as firms). The paradigm allows researchers to directly compare or even combine different approaches to isolated problems, by asking which agent is best at maximizing a given &amp;quot;goal function&amp;quot;. An agent that solves a specific problem can use any approach that works—some agents are symbolic and logical, some are sub-symbolic artificial neural networks and others may use new approaches. The paradigm also gives researchers a common language to communicate with other fields—such as decision theory and economics—that also use concepts of abstract agents. Building a complete agent requires researchers to address realistic problems of integration; for example, because sensory systems give uncertain information about the environment, planning systems must be able to function in the presence of uncertainty. The intelligent agent paradigm became widely accepted during the 1990s.&lt;br /&gt;
&lt;br /&gt;
;智能主体范式: 智能主体是一个感知其环境并采取行动，最大限度地提高其成功机会的系统。最简单的智能主体是解决特定问题的程序。更复杂的智能主体包括人类和人类组织(如公司)。这种范式使得研究人员能通过观察哪一个智能主体能最大化给定的“目标函数”，直接比较甚至结合不同的方法来解决孤立的问题。解决特定问题的智能主体可以使用任何有效的方法——可以是是符号化和逻辑化的，也可以是亚符号化的人工神经网络，还可以是新的方法。这种范式还为研究人员提供了一种与其他领域(如决策理论和经济学)进行交流的共同语言，因为这些领域也使用了抽象智能主体的概念。建立一个完整的智能主体需要研究人员解决现实的整合协调问题; 例如，由于传感系统提供关于环境的信息不确定，决策系统就必须在不确定性的条件下运作。智能体范式在20世纪90年代被广泛接受。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
;[[Agent architecture]]s and [[cognitive architecture]]s:Researchers have designed systems to build intelligent systems out of interacting [[intelligent agent]]s in a [[multi-agent system]].&amp;lt;ref name=&amp;quot;Agent architectures&amp;quot;/&amp;gt; A [[hierarchical control system]] provides a bridge between sub-symbolic AI at its lowest, reactive levels and traditional symbolic AI at its highest levels, where relaxed time constraints permit planning and world modeling.&amp;lt;ref name=&amp;quot;Hierarchical control system&amp;quot;/&amp;gt; Some cognitive architectures are custom-built to solve a narrow problem; others, such as [[Soar (cognitive architecture)|Soar]], are designed to mimic human cognition and to provide insight into general intelligence. Modern extensions of Soar are [[hybrid intelligent system]]s that include both symbolic and sub-symbolic components.&amp;lt;ref&amp;gt;{{cite journal|last1=Laird|first1=John|title=Extending the Soar cognitive architecture|journal=Frontiers in Artificial Intelligence and Applications|date=2008|volume=171|page=224|citeseerx=10.1.1.77.2473}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Lieto|first1=Antonio|last2=Lebiere|first2=Christian|last3=Oltramari|first3=Alessandro|title=The knowledge level in cognitive architectures: Current limitations and possibile developments|journal=Cognitive Systems Research|date=May 2018|volume=48|pages=39–55|doi=10.1016/j.cogsys.2017.05.001|hdl=2318/1665207|hdl-access=free}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Lieto|first1=Antonio|last2=Bhatt|first2=Mehul|last3=Oltramari|first3=Alessandro|last4=Vernon|first4=David|title=The role of cognitive architectures in general artificial intelligence|journal=Cognitive Systems Research|date=May 2018|volume=48|pages=1–3|doi=10.1016/j.cogsys.2017.08.003|hdl=2318/1665249|hdl-access=free}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Agent architectures and cognitive architectures:Researchers have designed systems to build intelligent systems out of interacting intelligent agents in a multi-agent system.&lt;br /&gt;
&lt;br /&gt;
;智能主体体系结构和认知体系结构: 研究人员已经设计了一些在多智能体系统中利用相互作用的智能体构建智能系统的系统&amp;lt;ref name=&amp;quot;Agent architectures&amp;quot;/&amp;gt;。分层控制系统为亚符号AI、反应层和符号AI提供了一座桥梁，亚符号AI在底层、反应层和符号AI在顶层&amp;lt;ref name=&amp;quot;Hierarchical control system&amp;quot;/&amp;gt;。&lt;br /&gt;
一些认知架构是人为构造用来解决特定问题的；其他比如SOAR，是用来模仿人类的认知，向通用智能更进一步。现在SOAR的扩展是含有符号和亚符号部分的混合智能系统。&amp;lt;ref&amp;gt;{{cite journal|last1=Laird|first1=John|title=Extending the Soar cognitive architecture|journal=Frontiers in Artificial Intelligence and Applications|date=2008|volume=171|page=224|citeseerx=10.1.1.77.2473}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Lieto|first1=Antonio|last2=Lebiere|first2=Christian|last3=Oltramari|first3=Alessandro|title=The knowledge level in cognitive architectures: Current limitations and possibile developments|journal=Cognitive Systems Research|date=May 2018|volume=48|pages=39–55|doi=10.1016/j.cogsys.2017.05.001|hdl=2318/1665207|hdl-access=free}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Lieto|first1=Antonio|last2=Bhatt|first2=Mehul|last3=Oltramari|first3=Alessandro|last4=Vernon|first4=David|title=The role of cognitive architectures in general artificial intelligence|journal=Cognitive Systems Research|date=May 2018|volume=48|pages=1–3|doi=10.1016/j.cogsys.2017.08.003|hdl=2318/1665249|hdl-access=free}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==工具 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
AI has developed many tools to solve the most difficult problems in [[computer science]]. A few of the most general of these methods are discussed below.&lt;br /&gt;
&lt;br /&gt;
AI has developed many tools to solve the most difficult problems in computer science. A few of the most general of these methods are discussed below.&lt;br /&gt;
&lt;br /&gt;
AI领域已经开发出许多工具来解决计算机科学中最困难的问题。下面将讨论其中一些最常用的方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===搜索和优化===&lt;br /&gt;
&lt;br /&gt;
{{Main|Search algorithm|Mathematical optimization|Evolutionary computation}}&lt;br /&gt;
&lt;br /&gt;
Many problems in AI can be solved in theory by intelligently searching through many possible solutions:&amp;lt;ref name=&amp;quot;Search&amp;quot;/&amp;gt; [[#Deduction, reasoning, problem solving|Reasoning]] can be reduced to performing a search. For example, logical proof can be viewed as searching for a path that leads from [[premise]]s to [[Logical consequence|conclusions]], where each step is the application of an [[inference rule]].&amp;lt;ref name=&amp;quot;Logic as search&amp;quot;/&amp;gt; [[Automated planning and scheduling|Planning]] algorithms search through trees of goals and subgoals, attempting to find a path to a target goal, a process called [[means-ends analysis]].&amp;lt;ref name=&amp;quot;Planning as search&amp;quot;/&amp;gt; [[Robotics]] algorithms for moving limbs and grasping objects use [[local search (optimization)|local searches]] in [[Configuration space (physics)|configuration space]].&amp;lt;ref name=&amp;quot;Configuration space&amp;quot;/&amp;gt; Many [[machine learning|learning]] algorithms use search algorithms based on [[optimization (mathematics)|optimization]].&lt;br /&gt;
&lt;br /&gt;
Many problems in AI can be solved in theory by intelligently searching through many possible solutions: Reasoning can be reduced to performing a search. For example, logical proof can be viewed as searching for a path that leads from premises to conclusions, where each step is the application of an inference rule. Planning algorithms search through trees of goals and subgoals, attempting to find a path to a target goal, a process called means-ends analysis. Robotics algorithms for moving limbs and grasping objects use local searches in configuration space. Many learning algorithms use search algorithms based on optimization.&lt;br /&gt;
&lt;br /&gt;
AI中的许多问题可以通过智能地搜索许多可能的解决方案而在理论上得到解决&amp;lt;ref name=&amp;quot;Search&amp;quot;/&amp;gt;: 推理可以简化为执行一次搜索。例如，逻辑证明可以看作是寻找一条从前提到结论的路径，其中每一步都用到了推理规则。规划算法通过搜索目标和子目标的树，试图找到一条通往目标的路径，这个过程称为“目的-手段”分析。机器人学中移动肢体和抓取物体的算法使用的是位形空间的局部搜索。许多学习算法也使用到了基于优化的搜索算法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Simple exhaustive searches&amp;lt;ref name=&amp;quot;Uninformed search&amp;quot;/&amp;gt; are rarely sufficient for most real-world problems: the [[search algorithm|search space]] (the number of places to search) quickly grows to [[Astronomically large|astronomical numbers]]. The result is a search that is [[Computation time|too slow]] or never completes. The solution, for many problems, is to use &amp;quot;[[heuristics]]&amp;quot; or &amp;quot;rules of thumb&amp;quot; that prioritize choices in favor of those that are more likely to reach a goal and to do so in a shorter number of steps. In some search methodologies heuristics can also serve to entirely eliminate some choices that are unlikely to lead to a goal (called &amp;quot;[[pruning (algorithm)|pruning]] the [[search tree]]&amp;quot;). [[Heuristics]] supply the program with a &amp;quot;best guess&amp;quot; for the path on which the solution lies.&amp;lt;ref name=&amp;quot;Informed search&amp;quot;/&amp;gt; Heuristics limit the search for solutions into a smaller sample size.{{sfn|Tecuci|2012}}&lt;br /&gt;
&lt;br /&gt;
Simple exhaustive searches are rarely sufficient for most real-world problems: the search space (the number of places to search) quickly grows to astronomical numbers. The result is a search that is too slow or never completes. The solution, for many problems, is to use &amp;quot;heuristics&amp;quot; or &amp;quot;rules of thumb&amp;quot; that prioritize choices in favor of those that are more likely to reach a goal and to do so in a shorter number of steps. In some search methodologies heuristics can also serve to entirely eliminate some choices that are unlikely to lead to a goal (called &amp;quot;pruning the search tree&amp;quot;). Heuristics supply the program with a &amp;quot;best guess&amp;quot; for the path on which the solution lies. Heuristics limit the search for solutions into a smaller sample size.&lt;br /&gt;
&lt;br /&gt;
对于大多数真实世界的问题，简单的穷举搜索&amp;lt;ref name=&amp;quot;Uninformed search&amp;quot;/&amp;gt;很难满足要求: 搜索空间(要搜索的位置数)很快就会增加到天文数字。结果就是搜索速度太慢或者永远不能完成。对于许多问题，解决方法是使用“'''&amp;lt;font color=#ff8000&amp;gt;启发式 Heuristics&amp;lt;/font&amp;gt;''' ”或“'''&amp;lt;font color=#ff8000&amp;gt;经验法则 Rules of Thumb&amp;lt;/font&amp;gt;''' ” ，优先考虑那些更有可能达到目标的选择，并且在较短的步骤内完成。在一些搜索方法中，启发式方法还可以完全移去一些不可能通向目标的选择(称为“修剪搜索树”)。启发式为程序提供了解决方案所在路径的“最佳猜测”。启发式把搜索限制在了更小的样本规模里。。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A very different kind of search came to prominence in the 1990s, based on the mathematical theory of [[optimization (mathematics)|optimization]]. For many problems, it is possible to begin the search with some form of a guess and then refine the guess incrementally until no more refinements can be made. These algorithms can be visualized as blind [[hill climbing]]: we begin the search at a random point on the landscape, and then, by jumps or steps, we keep moving our guess uphill, until we reach the top. Other optimization algorithms are [[simulated annealing]], [[beam search]] and [[random optimization]].&amp;lt;ref name=&amp;quot;Optimization search&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A very different kind of search came to prominence in the 1990s, based on the mathematical theory of optimization. For many problems, it is possible to begin the search with some form of a guess and then refine the guess incrementally until no more refinements can be made. These algorithms can be visualized as blind hill climbing: we begin the search at a random point on the landscape, and then, by jumps or steps, we keep moving our guess uphill, until we reach the top. Other optimization algorithms are simulated annealing, beam search and random optimization.&lt;br /&gt;
&lt;br /&gt;
在20世纪90年代，一种非常不同的基于数学最优化理论的搜索引起了人们的注意。对于许多问题，可以从某种形式的猜测开始搜索，然后逐步细化猜测，直到无法进行更多的细化。这些算法可以喻为盲目地爬山: 我们从地形上的一个随机点开始搜索，然后，通过跳跃或登爬，我们把猜测点继续向山上移动，直到我们到达山顶。其他的优化算法有 '''&amp;lt;font color=#ff8000&amp;gt;模拟退火算法&amp;lt;/font&amp;gt;''' 、'''&amp;lt;font color=#ff8000&amp;gt;定向搜索&amp;lt;/font&amp;gt;''' 和'''&amp;lt;font color=#ff8000&amp;gt;随机优化&amp;lt;/font&amp;gt;''' 。&amp;lt;ref name=&amp;quot;Optimization search&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:ParticleSwarmArrowsAnimation.gif|thumb|A [[particle swarm optimization|particle swarm]] seeking the [[global minimum]][粒子群搜索全局最小]]]&lt;br /&gt;
&lt;br /&gt;
particle swarm seeking the global minimum]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Evolutionary computation]] uses a form of optimization search. For example, they may begin with a population of organisms (the guesses) and then allow them to mutate and recombine, [[artificial selection|selecting]] only the fittest to survive each generation (refining the guesses). Classic [[evolutionary algorithms]] include [[genetic algorithms]], [[gene expression programming]], and [[genetic programming]].&amp;lt;ref name=&amp;quot;Genetic programming&amp;quot;/&amp;gt; Alternatively, distributed search processes can coordinate via [[swarm intelligence]] algorithms. Two popular swarm algorithms used in search are [[particle swarm optimization]] (inspired by bird [[flocking (behavior)|flocking]]) and [[ant colony optimization]] (inspired by [[ant trail]]s).&amp;lt;ref name=&amp;quot;Society based learning&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author1=Daniel Merkle|author2=Martin Middendorf|editor1-last=Burke|editor1-first=Edmund K.|editor2-last=Kendall|editor2-first=Graham|title=Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques|date=2013|publisher=Springer Science &amp;amp; Business Media|isbn=978-1-4614-6940-7|language=en|chapter=Swarm Intelligence}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Evolutionary computation uses a form of optimization search. For example, they may begin with a population of organisms (the guesses) and then allow them to mutate and recombine, selecting only the fittest to survive each generation (refining the guesses). Classic evolutionary algorithms include genetic algorithms, gene expression programming, and genetic programming.&lt;br /&gt;
&lt;br /&gt;
[[演化计算]]用到了优化搜索的形式。例如，他们可能从一群有机体(猜测)开始，然后让它们变异和重组，选择适者继续生存 (改进猜测)。经典的演化算法包括遗传算法、基因表达编程和遗传编程。&amp;lt;ref name=&amp;quot;Genetic programming&amp;quot;/&amp;gt; Alternatively, distributed search processes can coordinate via [[swarm intelligence]] algorithms. Two popular swarm algorithms used in search are [[particle swarm optimization]] (inspired by bird [[flocking (behavior)|flocking]]) and [[ant colony optimization]] (inspired by [[ant trail]]s).&amp;lt;ref name=&amp;quot;Society based learning&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author1=Daniel Merkle|author2=Martin Middendorf|editor1-last=Burke|editor1-first=Edmund K.|editor2-last=Kendall|editor2-first=Graham|title=Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques|date=2013|publisher=Springer Science &amp;amp; Business Media|isbn=978-1-4614-6940-7|language=en|chapter=Swarm Intelligence}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===逻辑===&lt;br /&gt;
&lt;br /&gt;
{{Main|Logic programming|Automated reasoning}}&lt;br /&gt;
&lt;br /&gt;
[[Logic]]&amp;lt;ref name=&amp;quot;Logic&amp;quot;/&amp;gt; is used for knowledge representation and problem solving, but it can be applied to other problems as well. For example, the [[satplan]] algorithm uses logic for [[automated planning and scheduling|planning]]&amp;lt;ref name=&amp;quot;Satplan&amp;quot;/&amp;gt; and [[inductive logic programming]] is a method for [[machine learning|learning]].&amp;lt;ref name=&amp;quot;Symbolic learning techniques&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Logic is used for knowledge representation and problem solving, but it can be applied to other problems as well. For example, the satplan algorithm uses logic for planning and inductive logic programming is a method for learning.&lt;br /&gt;
&lt;br /&gt;
逻辑&amp;lt;ref name=&amp;quot;Logic&amp;quot;/&amp;gt;被用来表示知识和解决问题，还可以应用到其他问题上。例如，satplan 算法就使用逻辑进行规划&amp;lt;ref name=&amp;quot;Satplan&amp;quot;/&amp;gt;。另外，归纳逻辑编程是一种学习方法。&lt;br /&gt;
&lt;br /&gt;
Several different forms of logic are used in AI research. [[Propositional logic]]&amp;lt;ref name=&amp;quot;Propositional logic&amp;quot;/&amp;gt; involves [[truth function]]s such as &amp;quot;or&amp;quot; and &amp;quot;not&amp;quot;. [[First-order logic]]&amp;lt;ref name=&amp;quot;First-order logic&amp;quot;/&amp;gt; adds [[quantifier (logic)|quantifiers]] and [[predicate (mathematical logic)|predicates]], and can express facts about objects, their properties, and their relations with each other. [[Fuzzy set theory]] assigns a &amp;quot;degree of truth&amp;quot; (between 0 and 1) to vague statements such as &amp;quot;Alice is old&amp;quot; (or rich, or tall, or hungry) that are too linguistically imprecise to be completely true or false. [[Fuzzy logic]] is successfully used in [[control system]]s to allow experts to contribute vague rules such as &amp;quot;if you are close to the destination station and moving fast, increase the train's brake pressure&amp;quot;; these vague rules can then be numerically refined within the system. Fuzzy logic fails to scale well in knowledge bases; many AI researchers question the validity of chaining fuzzy-logic inferences.{{efn|&amp;quot;There exist many different types of uncertainty, vagueness, and ignorance... [We] independently confirm the inadequacy of systems for reasoning about uncertainty that propagates numerical factors according to only to which connectives appear in assertions.&amp;quot;&amp;lt;ref&amp;gt;{{cite journal|last1=Elkan|first1=Charles|title=The paradoxical success of fuzzy logic|journal=IEEE Expert|date=1994|volume=9|issue=4|pages=3–49|doi=10.1109/64.336150|citeseerx=10.1.1.100.8402}}&amp;lt;/ref&amp;gt;}}&amp;lt;ref name=&amp;quot;Fuzzy logic&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=What is 'fuzzy logic'? Are there computers that are inherently fuzzy and do not apply the usual binary logic?|url=https://www.scientificamerican.com/article/what-is-fuzzy-logic-are-t/|accessdate=5 May 2018|work=Scientific American|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Several different forms of logic are used in AI research. Propositional logic}}&lt;br /&gt;
&lt;br /&gt;
AI研究中使用了多种不同形式的逻辑。命题逻辑&amp;lt;ref name=&amp;quot;Propositional logic&amp;quot;/&amp;gt;包含诸如“或”和“否”这样的真值函数。一阶逻辑&amp;lt;ref name=&amp;quot;First-order logic&amp;quot;/&amp;gt;增加了量词和谓词，可以表达关于对象、对象属性和对象之间的关系。模糊集合论给诸如“爱丽丝老了”(或是富有的、高的、饥饿的)这样模糊的表述赋予了一个“真实程度”(介于0到1之间)，这些表述在语言上很模糊，不能完全判定为正确或错误。模糊逻辑在控制系统中得到了成功应用，使专家能够制定模糊规则，比如“如果你正以较快的速度接近终点站，那么就增加列车的制动压力”;这些模糊的规则可以在系统内用数值细化。但是，模糊逻辑无助于扩展知识库，许多AI研究者质疑把模糊逻辑和推理结合起来的有效性。{{efn|&amp;quot;There exist many different types of uncertainty, vagueness, and ignorance... [We] independently confirm the inadequacy of systems for reasoning about uncertainty that propagates numerical factors according to only to which connectives appear in assertions.&amp;quot;&amp;lt;ref&amp;gt;{{cite journal|last1=Elkan|first1=Charles|title=The paradoxical success of fuzzy logic|journal=IEEE Expert|date=1994|volume=9|issue=4|pages=3–49|doi=10.1109/64.336150|citeseerx=10.1.1.100.8402}}&amp;lt;/ref&amp;gt;}}&amp;lt;ref name=&amp;quot;Fuzzy logic&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=What is 'fuzzy logic'? Are there computers that are inherently fuzzy and do not apply the usual binary logic?|url=https://www.scientificamerican.com/article/what-is-fuzzy-logic-are-t/|accessdate=5 May 2018|work=Scientific American|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Default logic]]s, [[non-monotonic logic]]s and [[circumscription (logic)|circumscription]]&amp;lt;ref name=&amp;quot;Default reasoning and non-monotonic logic&amp;quot;/&amp;gt; are forms of logic designed to help with default reasoning and the [[qualification problem]]. Several extensions of logic have been designed to handle specific domains of [[knowledge representation|knowledge]], such as: [[description logic]]s;&amp;lt;ref name=&amp;quot;Representing categories and relations&amp;quot;/&amp;gt; [[situation calculus]], [[event calculus]] and [[fluent calculus]] (for representing events and time);&amp;lt;ref name=&amp;quot;Representing time&amp;quot;/&amp;gt; [[Causality#Causal calculus|causal calculus]];&amp;lt;ref name=&amp;quot;Representing causation&amp;quot;/&amp;gt; [[Belief revision|belief calculus (belief revision)]];&amp;lt;ref&amp;gt;&amp;quot;The Belief Calculus and Uncertain Reasoning&amp;quot;, Yen-Teh Hsia&amp;lt;/ref&amp;gt; and [[modal logic]]s.&amp;lt;ref name=&amp;quot;Representing knowledge about knowledge&amp;quot;/&amp;gt; Logics to model contradictory or inconsistent statements arising in multi-agent systems have also been designed, such as [[paraconsistent logic]]s.&lt;br /&gt;
&lt;br /&gt;
Default logics, non-monotonic logics and circumscription and modal logics. Logics to model contradictory or inconsistent statements arising in multi-agent systems have also been designed, such as paraconsistent logics.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color=#ff8000&amp;gt;缺省逻辑 Default Logics&amp;lt;/font&amp;gt;'''、'''&amp;lt;font color=#ff8000&amp;gt;非单调逻辑 Non-monotonic Logics&amp;lt;/font&amp;gt;'''、'''&amp;lt;font color=#ff8000&amp;gt;限制逻辑 Circumscription&amp;lt;/font&amp;gt;'''和'''&amp;lt;font color=#ff8000&amp;gt;模态逻辑 Modal Logics&amp;lt;/font&amp;gt;'''&amp;lt;ref name=&amp;quot;Default reasoning and non-monotonic logic&amp;quot;/&amp;gt;，都用逻辑形式来解决缺省推理和限定问题。一些逻辑扩展被用于处理特定的知识领域，例如:'''&amp;lt;font color=#ff8000&amp;gt;描述逻辑 Description Logics&amp;lt;/font&amp;gt;'''&amp;lt;ref name=&amp;quot;Representing categories and relations&amp;quot;/&amp;gt; 、情景演算、事件演算、'''&amp;lt;font color=#ff8000&amp;gt;流态演算 Fluent Calculus&amp;lt;/font&amp;gt;'''（用于表示事件和时间）&amp;lt;ref name=&amp;quot;Representing time&amp;quot;/&amp;gt;、因果演算&amp;lt;ref name=&amp;quot;Representing causation&amp;quot;/&amp;gt;、信念演算(信念修正)&amp;lt;ref&amp;gt;&amp;quot;The Belief Calculus and Uncertain Reasoning&amp;quot;, Yen-Teh Hsia&amp;lt;/ref&amp;gt;、和模态逻辑&amp;lt;ref name=&amp;quot;Representing knowledge about knowledge&amp;quot;/&amp;gt;。人们也设计了对多主体系统中出现的矛盾或不一致陈述进行建模的逻辑，如次协调逻辑。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===不确定推理的概率方法===&lt;br /&gt;
&lt;br /&gt;
{{Main|Bayesian network|Hidden Markov model|Kalman filter|Particle filter|Decision theory|Utility theory}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:EM Clustering of Old Faithful data.gif|right|frame|[[Expectation-maximization]] clustering of [[Old Faithful]] eruption data starts from a random guess but then successfully converges on an accurate clustering of the two physically distinct modes of eruption.[[期望-最大化老实泉喷发数据的聚类从一个随机的猜测开始，然后成功地收敛到两个物理上截然不同的喷发模式的精确聚类]]]]&lt;br /&gt;
&lt;br /&gt;
[[Expectation-maximization clustering of Old Faithful eruption data starts from a random guess but then successfully converges on an accurate clustering of the two physically distinct modes of eruption.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Many problems in AI (in reasoning, planning, learning, perception, and robotics) require the agent to operate with incomplete or uncertain information. AI researchers have devised a number of powerful tools to solve these problems using methods from [[probability]] theory and economics.&amp;lt;ref name=&amp;quot;Stochastic methods for uncertain reasoning&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Many problems in AI (in reasoning, planning, learning, perception, and robotics) require the agent to operate with incomplete or uncertain information. AI researchers have devised a number of powerful tools to solve these problems using methods from probability theory and economics.&lt;br /&gt;
&lt;br /&gt;
AI中的许多问题(在推理、规划、学习、感知和机器人技术方面)要求主体在信息不完整或不确定的情况下进行操作。AI研究人员从概率论和经济学的角度设计了许多强大的工具来解决这些问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Bayesian network]]s&amp;lt;ref name=&amp;quot;Bayesian networks&amp;quot;/&amp;gt; are a very general tool that can be used for various problems: reasoning (using the [[Bayesian inference]] algorithm),&amp;lt;ref name=&amp;quot;Bayesian inference&amp;quot;/&amp;gt; [[Machine learning|learning]] (using the [[expectation-maximization algorithm]]),{{efn|Expectation-maximization, one of the most popular algorithms in machine learning, allows clustering in the presence of unknown [[latent variables]]{{sfn|Domingos|2015|p=210}}}}&amp;lt;ref name=&amp;quot;Bayesian learning&amp;quot;/&amp;gt; [[Automated planning and scheduling|planning]] (using [[decision network]]s)&amp;lt;ref name=&amp;quot;Bayesian decision networks&amp;quot;/&amp;gt; and [[machine perception|perception]] (using [[dynamic Bayesian network]]s).&amp;lt;ref name=&amp;quot;Stochastic temporal models&amp;quot;/&amp;gt; Probabilistic algorithms can also be used for filtering, prediction, smoothing and finding explanations for streams of data, helping [[machine perception|perception]] systems to analyze processes that occur over time (e.g., [[hidden Markov model]]s or [[Kalman filter]]s).&amp;lt;ref name=&amp;quot;Stochastic temporal models&amp;quot;/&amp;gt; Compared with symbolic logic, formal Bayesian inference is computationally expensive. For inference to be tractable, most observations must be [[conditionally independent]] of one another. Complicated graphs with diamonds or other &amp;quot;loops&amp;quot; (undirected [[cycle (graph theory)|cycles]]) can require a sophisticated method such as [[Markov chain Monte Carlo]], which spreads an ensemble of [[random walk]]ers throughout the Bayesian network and attempts to converge to an assessment of the conditional probabilities. Bayesian networks are used on [[Xbox Live]] to rate and match players; wins and losses are &amp;quot;evidence&amp;quot; of how good a player is{{citation needed|date=July 2019}}. [[Google AdSense|AdSense]] uses a Bayesian network with over 300 million edges to learn which ads to serve.{{sfn|Domingos|2015|loc=chapter 6}}&lt;br /&gt;
&lt;br /&gt;
Bayesian networks are a very general tool that can be used for various problems: reasoning (using the Bayesian inference algorithm), learning (using the expectation-maximization algorithm),}} planning (using decision networks) and perception (using dynamic Bayesian networks). Probabilistic algorithms can also be used for filtering, prediction, smoothing and finding explanations for streams of data, helping perception systems to analyze processes that occur over time (e.g., hidden Markov models or Kalman filters). Compared with symbolic logic, formal Bayesian inference is computationally expensive. For inference to be tractable, most observations must be conditionally independent of one another. Complicated graphs with diamonds or other &amp;quot;loops&amp;quot; (undirected cycles) can require a sophisticated method such as Markov chain Monte Carlo, which spreads an ensemble of random walkers throughout the Bayesian network and attempts to converge to an assessment of the conditional probabilities. Bayesian networks are used on Xbox Live to rate and match players; wins and losses are &amp;quot;evidence&amp;quot; of how good a player is. AdSense uses a Bayesian network with over 300 million edges to learn which ads to serve.&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color=#ff8000&amp;gt;[[贝叶斯网络]] Bayesian Networks &amp;lt;/font&amp;gt;''' 是一个非常通用的工具，可用于各种问题: 推理(使用贝叶斯推断算法) ，学习(使用期望最大化算法) ，规划(使用决策网络)和感知(使用动态贝叶斯网络)。概率算法也可以用于滤波、预测、平滑和解释数据流，帮助传感系统分析随时间发生的过程(例如，隐马尔可夫模型或'''&amp;lt;font color=#ff8000&amp;gt;卡尔曼滤波器 Kalman Filters&amp;lt;/font&amp;gt;''')。与符号逻辑相比，形式化的贝叶斯推断逻辑运算量很大。为了使推理易于处理，大多数观察值必须彼此条件独立。含有菱形或其他“圈”(无向循环)的复杂图形可能需要比如马尔科夫-蒙特卡罗图的复杂方法，这种方法将一组随机行走遍布整个贝叶斯网络，并试图收敛到对条件概率的评估。贝叶斯网络在 Xbox Live 上被用来评估和匹配玩家：胜率是证明一个玩家有多有优秀的“证据”。AdSense使用一个有超过3亿条边的贝叶斯网络来学习如何推送广告的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A key concept from the science of economics is &amp;quot;[[utility]]&amp;quot;: a measure of how valuable something is to an intelligent agent. Precise mathematical tools have been developed that analyze how an agent can make choices and plan, using [[decision theory]], [[decision analysis]],&amp;lt;ref name=&amp;quot;Decisions theory and analysis&amp;quot;/&amp;gt; and [[applied information economics|information value theory]].&amp;lt;ref name=&amp;quot;Information value theory&amp;quot;/&amp;gt; These tools include models such as [[Markov decision process]]es,&amp;lt;ref name=&amp;quot;Markov decision process&amp;quot;/&amp;gt; dynamic [[decision network]]s,&amp;lt;ref name=&amp;quot;Stochastic temporal models&amp;quot;/&amp;gt; [[game theory]] and [[mechanism design]].&amp;lt;ref name=&amp;quot;Game theory and mechanism design&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A key concept from the science of economics is &amp;quot;utility&amp;quot;: a measure of how valuable something is to an intelligent agent. Precise mathematical tools have been developed that analyze how an agent can make choices and plan, using decision theory, decision analysis, and information value theory. These tools include models such as Markov decision processes, dynamic decision networks, game theory and mechanism design.&lt;br /&gt;
&lt;br /&gt;
经济学中的一个关键概念是“效用” :这是一种衡量某物对于一个智能主体的价值的方法。人们运用决策理论、决策分析和信息价值理论开发出了精确的数学工具来分析智能主体应该如何选择和计划。这些工具包括马尔可夫决策过程、动态决策网络、博弈论和机制设计等模型。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===分类器与统计学习方法===&lt;br /&gt;
&lt;br /&gt;
{{Main|Classifier (mathematics)|Statistical classification|Machine learning}}&lt;br /&gt;
&lt;br /&gt;
The simplest AI applications can be divided into two types: classifiers (&amp;quot;if shiny then diamond&amp;quot;) and controllers (&amp;quot;if shiny then pick up&amp;quot;). Controllers do, however, also classify conditions before inferring actions, and therefore classification forms a central part of many AI systems. [[Classifier (mathematics)|Classifiers]] are functions that use [[pattern matching]] to determine a closest match. They can be tuned according to examples, making them very attractive for use in AI. These examples are known as observations or patterns. In supervised learning, each pattern belongs to a certain predefined class. A class can be seen as a decision that has to be made. All the observations combined with their class labels are known as a data set. When a new observation is received, that observation is classified based on previous experience.&amp;lt;ref name=&amp;quot;Classifiers&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The simplest AI applications can be divided into two types: classifiers (&amp;quot;if shiny then diamond&amp;quot;) and controllers (&amp;quot;if shiny then pick up&amp;quot;). Controllers do, however, also classify conditions before inferring actions, and therefore classification forms a central part of many AI systems. Classifiers are functions that use pattern matching to determine a closest match. They can be tuned according to examples, making them very attractive for use in AI. These examples are known as observations or patterns. In supervised learning, each pattern belongs to a certain predefined class. A class can be seen as a decision that has to be made. All the observations combined with their class labels are known as a data set. When a new observation is received, that observation is classified based on previous experience.&lt;br /&gt;
&lt;br /&gt;
最简单的AI应用程序可以分为两类: '''&amp;lt;font color=#ff8000&amp;gt;分类器 Classifiers&amp;lt;/font&amp;gt;''' (“若闪光，则为钻石”)和'''&amp;lt;font color=#ff8000&amp;gt;控制器 Controllers&amp;lt;/font&amp;gt;''' (“若闪光，则捡起来”)。然而，控制器在推断前也对条件进行分类，因此分类构成了许多AI系统的核心部分。分类器一组是使用匹配模式来判断最接近的匹配的函数。它们可以根据样例进行性能调优，使它们在AI应用中更有效。这些样例被称为“观察”或“模式”。在监督学习中，每个模式都属于某个预定义的类别。可以把一个类看作是一个必须做出的决定。所有的样例和它们的对应的类别标签被称为数据集。当接收一个新样例时，它会被分类器根据以前的经验进行分类。&lt;br /&gt;
&lt;br /&gt;
  --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]） 分类器(“ if shiny then diamond”)和控制器(“ if shiny then pick up”) 一句不能准确翻译&lt;br /&gt;
&lt;br /&gt;
  --[[用户:Qige96|Ricky]]（[[用户讨论:Qige96|讨论]]）已解决。这里主要是突出分类器的工作是下判断，而控制器的工作是做动作。&lt;br /&gt;
&lt;br /&gt;
A classifier can be trained in various ways; there are many statistical and [[machine learning]] approaches. The [[decision tree learning|decision tree]]&amp;lt;ref name=&amp;quot;Decision tree&amp;quot;/&amp;gt; is perhaps the most widely used machine learning algorithm.{{sfn|Domingos|2015|p=88}} Other widely used classifiers are the [[Artificial neural network|neural network]],&amp;lt;ref name=&amp;quot;Neural networks&amp;quot;/&amp;gt; [[Gaussian mixture model]],&amp;lt;ref name=&amp;quot;Gaussian mixture model&amp;quot;/&amp;gt; and the extremely popular [[naive Bayes classifier]].{{efn|Naive Bayes is reportedly the &amp;quot;most widely used learner&amp;quot; at Google, due in part to its scalability.{{sfn|Domingos|2015|p=152}}}}&amp;lt;ref name=&amp;quot;Naive Bayes classifier&amp;quot;/&amp;gt; Classifier performance depends greatly on the characteristics of the data to be classified, such as the dataset size, distribution of samples across classes, the dimensionality, and the level of noise. Model-based classifiers perform well if the assumed model is an extremely good fit for the actual data. Otherwise, if no matching model is available, and if accuracy (rather than speed or scalability) is the sole concern, conventional wisdom is that discriminative classifiers (especially SVM) tend to be more accurate than model-based classifiers such as &amp;quot;naive Bayes&amp;quot; on most practical data sets.&amp;lt;ref name=&amp;quot;Classifier performance&amp;quot;/&amp;gt;{{sfn|Russell|Norvig|2009|loc=18.12: Learning from Examples: Summary}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
分类器可以通过多种方式进行训练;，比如许多统计学和机器学习方法。决策树可能是应用最广泛的机器学习算法。其他使用广泛的分类器还有神经网络、&amp;lt;ref name=&amp;quot;Neural networks&amp;quot;/&amp;gt;K最近邻算法{{efn|The most widely used analogical AI until the mid-1990s{{sfn|Domingos|2015|p=187}}}}&amp;lt;ref name=&amp;quot;K-nearest neighbor algorithm&amp;quot;/&amp;gt;、核方法（比如支持向量机）{{efn|SVM displaced k-nearest neighbor in the 1990s{{sfn|Domingos|2015|p=188}}}}&amp;lt;ref name=&amp;quot;Kernel methods&amp;quot;/&amp;gt;、'''&amp;lt;font color=#ff8000&amp;gt; 高斯混合模型 Gaussian Mixture Mode&amp;lt;/font&amp;gt;'''&amp;lt;ref name=&amp;quot;Gaussian mixture model&amp;quot;/&amp;gt;，以及非常流行的'''&amp;lt;font color=#ff8000&amp;gt;朴素贝叶斯分类器 Naive Bayes Classifier&amp;lt;/font&amp;gt;'''&amp;lt;ref name=&amp;quot;Naive Bayes classifier&amp;quot;/&amp;gt;。分类器的分类效果在很大程度上取决于待分类数据的特征，如数据集的大小、样本跨类别的分布、维数和噪声水平。如果假设的模型很符合实际数据，则基于这种模型的分类器就能给出很好的结果。否则，传统观点认为如果没有匹配模型可用，而且只关心准确性(而不是速度或可扩展性) ，在大多数实际数据集上鉴别分类器(尤其是支持向量机)往往比基于模型的分类器(如“朴素贝叶斯”)更准确。&amp;lt;ref name=&amp;quot;Classifier performance&amp;quot;/&amp;gt;{{sfn|Russell|Norvig|2009|loc=18.12: Learning from Examples: Summary}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===人工神经网络 ===&lt;br /&gt;
&lt;br /&gt;
{{Main|Artificial neural network|Connectionism}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Artificial neural network.svg|thumb|A neural network is an interconnected group of nodes, akin to the vast network of [[neuron]]s in the [[human brain]].神经网络是一组相互连接的节点，类似于人脑中庞大的神经元网络。]]&lt;br /&gt;
&lt;br /&gt;
A neural network is an interconnected group of nodes, akin to the vast network of [[neurons in the human brain.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Neural networks were inspired by the architecture of neurons in the human brain. A simple &amp;quot;neuron&amp;quot; ''N'' accepts input from other neurons, each of which, when activated (or &amp;quot;fired&amp;quot;), cast a weighted &amp;quot;vote&amp;quot; for or against whether neuron ''N'' should itself activate. Learning requires an algorithm to adjust these weights based on the training data; one simple algorithm (dubbed &amp;quot;[[Hebbian learning|fire together, wire together]]&amp;quot;) is to increase the weight between two connected neurons when the activation of one triggers the successful activation of another. The neural network forms &amp;quot;concepts&amp;quot; that are distributed among a subnetwork of shared{{efn|Each individual neuron is likely to participate in more than one concept.}} neurons that tend to fire together; a concept meaning &amp;quot;leg&amp;quot; might be coupled with a subnetwork meaning &amp;quot;foot&amp;quot; that includes the sound for &amp;quot;foot&amp;quot;. Neurons have a continuous spectrum of activation; in addition, neurons can process inputs in a nonlinear way rather than weighing straightforward votes. Modern neural networks can learn both continuous functions and, surprisingly, digital logical operations. Neural networks' early successes included predicting the stock market and (in 1995) a mostly self-driving car.{{efn|Steering for the 1995 &amp;quot;[[History of autonomous cars#1990s|No Hands Across America]]&amp;quot; required &amp;quot;only a few human assists&amp;quot;.}}{{sfn|Domingos|2015|loc=Chapter 4}} In the 2010s, advances in neural networks using deep learning thrust AI into widespread public consciousness and contributed to an enormous upshift in corporate AI spending; for example, AI-related [[mergers and acquisitions|M&amp;amp;A]] in 2017 was over 25 times as large as in 2015.&amp;lt;ref&amp;gt;{{cite news|title=Why Deep Learning Is Suddenly Changing Your Life|url=http://fortune.com/ai-artificial-intelligence-deep-machine-learning/|accessdate=12 March 2018|work=Fortune|date=2016}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Google leads in the race to dominate artificial intelligence|url=https://www.economist.com/news/business/21732125-tech-giants-are-investing-billions-transformative-technology-google-leads-race|accessdate=12 March 2018|work=The Economist|date=2017|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Neural networks were inspired by the architecture of neurons in the human brain. A simple &amp;quot;neuron&amp;quot; N accepts input from other neurons, each of which, when activated (or &amp;quot;fired&amp;quot;), cast a weighted &amp;quot;vote&amp;quot; for or against whether neuron N should itself activate. Learning requires an algorithm to adjust these weights based on the training data; one simple algorithm (dubbed &amp;quot;fire together, wire together&amp;quot;) is to increase the weight between two connected neurons when the activation of one triggers the successful activation of another. The neural network forms &amp;quot;concepts&amp;quot; that are distributed among a subnetwork of shared neurons that tend to fire together; a concept meaning &amp;quot;leg&amp;quot; might be coupled with a subnetwork meaning &amp;quot;foot&amp;quot; that includes the sound for &amp;quot;foot&amp;quot;. Neurons have a continuous spectrum of activation; in addition, neurons can process inputs in a nonlinear way rather than weighing straightforward votes. Modern neural networks can learn both continuous functions and, surprisingly, digital logical operations. Neural networks' early successes included predicting the stock market and (in 1995) a mostly self-driving car. In the 2010s, advances in neural networks using deep learning thrust AI into widespread public consciousness and contributed to an enormous upshift in corporate AI spending; for example, AI-related M&amp;amp;A in 2017 was over 25 times as large as in 2015.&lt;br /&gt;
&lt;br /&gt;
神经网络的诞生受到人脑神经元结构的启发。一个简单的“神经元”''N'' 接受来自其他神经元的输入，每个神经元在被激活(或者说“放电”)时，都会对''N''是否应该被激活按一定的权重赋上值。学习的过程需要一个根据训练数据调整这些权重的算法：一个被称为“相互放电，彼此联系”简单的算法在一个神经元激活触发另一个神经元的激活时增加两个连接神经元之间的权重。神经网络中形成一种分布在一个共享的神经元子网络中的“概念”，这些神经元往往一起放电。“腿”的概念可能和“脚”概念的子网络相结合，后者包括”脚”的发音。神经元有一个连续的激活频谱; 此外，神经元还可以用非线性的方式处理输入，而不是简单地加权求和。现代神经网络可以学习连续函数甚至的数字逻辑运算。神经网络早期的成功包括预测股票市场和自动驾驶汽车(1995年)。{{efn|Steering for the 1995 &amp;quot;[[History of autonomous cars#1990s|No Hands Across America]]&amp;quot; required &amp;quot;only a few human assists&amp;quot;.}}2010年代，神经网络使用深度学习取得巨大进步，也因此将AI推向了公众视野里，并促使企业对AI投资急速增加; 例如2017年与AI相关的并购交易规模是2015年的25倍多。&amp;lt;ref&amp;gt;{{cite news|title=Why Deep Learning Is Suddenly Changing Your Life|url=http://fortune.com/ai-artificial-intelligence-deep-machine-learning/|accessdate=12 March 2018|work=Fortune|date=2016}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Google leads in the race to dominate artificial intelligence|url=https://www.economist.com/news/business/21732125-tech-giants-are-investing-billions-transformative-technology-google-leads-race|accessdate=12 March 2018|work=The Economist|date=2017|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The study of non-learning [[artificial neural network]]s&amp;lt;ref name=&amp;quot;Neural networks&amp;quot;/&amp;gt; began in the decade before the field of AI research was founded, in the work of [[Walter Pitts]] and [[Warren McCullouch]]. [[Frank Rosenblatt]] invented the [[perceptron]], a learning network with a single layer, similar to the old concept of [[linear regression]]. Early pioneers also include [[Alexey Grigorevich Ivakhnenko]], [[Teuvo Kohonen]], [[Stephen Grossberg]], [[Kunihiko Fukushima]], [[Christoph von der Malsburg]], David Willshaw, [[Shun-Ichi Amari]], [[Bernard Widrow]], [[John Hopfield]], [[Eduardo R. Caianiello]], and others{{citation needed|date=July 2019}}.&lt;br /&gt;
&lt;br /&gt;
The study of non-learning artificial neural networks began in the decade before the field of AI research was founded, in the work of Walter Pitts and Warren McCullouch. Frank Rosenblatt invented the perceptron, a learning network with a single layer, similar to the old concept of linear regression. Early pioneers also include Alexey Grigorevich Ivakhnenko, Teuvo Kohonen, Stephen Grossberg, Kunihiko Fukushima, Christoph von der Malsburg, David Willshaw, Shun-Ichi Amari, Bernard Widrow, John Hopfield, Eduardo R. Caianiello, and others.&lt;br /&gt;
&lt;br /&gt;
沃尔特·皮茨和沃伦·麦克卢奇共同完成的非学习型人工神经网络&amp;lt;ref name=&amp;quot;Neural networks&amp;quot;/&amp;gt;的研究比AI研究领域成立早十年。他们发明了'''&amp;lt;font color=#ff8000&amp;gt;感知机 Perceptron&amp;lt;/font&amp;gt;'''，这是一个单层的学习网络，类似于线性回归的概念。早期的先驱者还包括 Alexey Grigorevich Ivakhnenko，Teuvo Kohonen，Stephen Grossberg，Kunihiko Fukushima，Christoph von der Malsburg，David Willshaw，Shun-Ichi Amari，Bernard Widrow，John Hopfield，Eduardo r. Caianiello 等人。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The main categories of networks are acyclic or [[feedforward neural network]]s (where the signal passes in only one direction) and [[recurrent neural network]]s (which allow feedback and short-term memories of previous input events). Among the most popular feedforward networks are [[perceptron]]s, [[multi-layer perceptron]]s and [[radial basis network]]s.&amp;lt;ref name=&amp;quot;Feedforward neural networks&amp;quot;/&amp;gt; Neural networks can be applied to the problem of [[intelligent control]] (for robotics) or [[machine learning|learning]], using such techniques as [[Hebbian learning]] (&amp;quot;fire together, wire together&amp;quot;), [[GMDH]] or [[competitive learning]].&amp;lt;ref name=&amp;quot;Learning in neural networks&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The main categories of networks are acyclic or feedforward neural networks (where the signal passes in only one direction) and recurrent neural networks (which allow feedback and short-term memories of previous input events). Among the most popular feedforward networks are perceptrons, multi-layer perceptrons and radial basis networks. Neural networks can be applied to the problem of intelligent control (for robotics) or learning, using such techniques as Hebbian learning (&amp;quot;fire together, wire together&amp;quot;), GMDH or competitive learning.&lt;br /&gt;
&lt;br /&gt;
网络主要分为'''&amp;lt;font color=#ff8000&amp;gt; 非循环或前馈神经网络 Acyclic or Feedforward Neural Networks&amp;lt;/font&amp;gt;'''(信号只向一个方向传递)和'''&amp;lt;font color=#ff8000&amp;gt;循环神经网络 Recurrent Neural Network&amp;lt;/font&amp;gt;''' (允许反馈和对以前的输入事件进行短期记忆)。其中最常用的前馈网络.&amp;lt;ref name=&amp;quot;Feedforward neural networks&amp;quot;/&amp;gt;有感知机、'''&amp;lt;font color=#ff8000多层感知机 Multi-layer Perceptrons&amp;gt;&amp;lt;/font&amp;gt;''' 和'''&amp;lt;font color=#ff8000&amp;gt; 径向基网络 Radial Basis Networks&amp;lt;/font&amp;gt;'''。使用'''&amp;lt;font color=#ff8000&amp;gt;赫布型学习 Hebbian Learning &amp;lt;/font&amp;gt;''' (“相互放电，共同链接”) ，GMDH 或竞争学习等技术的神经网络可以被应用于智能控制(机器人)或学习问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Today, neural networks are often trained by the [[backpropagation]] algorithm, which had been around since 1970 as the reverse mode of [[automatic differentiation]] published by [[Seppo Linnainmaa]],&amp;lt;ref name=&amp;quot;lin1970&amp;quot;&amp;gt;[[Seppo Linnainmaa]] (1970). The representation of the cumulative rounding error of an algorithm as a Taylor expansion of the local rounding errors. Master's Thesis (in Finnish), Univ. Helsinki, 6–7.&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;grie2012&amp;quot;&amp;gt;Griewank, Andreas (2012). Who Invented the Reverse Mode of Differentiation?. Optimization Stories, Documenta Matematica, Extra Volume ISMP (2012), 389–400.&amp;lt;/ref&amp;gt; and was introduced to neural networks by [[Paul Werbos]].&amp;lt;ref name=&amp;quot;WERBOS1974&amp;quot;&amp;gt;[[Paul Werbos]], &amp;quot;Beyond Regression: New Tools for Prediction and Analysis in the Behavioral Sciences&amp;quot;, ''PhD thesis, Harvard University'', 1974.&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;werbos1982&amp;quot;&amp;gt;[[Paul Werbos]] (1982). Applications of advances in nonlinear sensitivity analysis. In System modeling and optimization (pp. 762–770). Springer Berlin Heidelberg. [http://werbos.com/Neural/SensitivityIFIPSeptember1981.pdf Online] {{webarchive|url=https://web.archive.org/web/20160414055503/http://werbos.com/Neural/SensitivityIFIPSeptember1981.pdf |date=14 April 2016 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Backpropagation&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Today, neural networks are often trained by the backpropagation algorithm, which had been around since 1970 as the reverse mode of automatic differentiation published by Seppo Linnainmaa, and was introduced to neural networks by Paul Werbos.&lt;br /&gt;
&lt;br /&gt;
当下神经网络常用'''&amp;lt;font color=#ff8000&amp;gt;反向传播算法&amp;lt;/font&amp;gt;''' 来训练，1970年反向传播算法出现，被认为是 Seppo Linnainmaa提出的自动微分的反向模式出现&amp;lt;ref name=&amp;quot;lin1970&amp;quot;&amp;gt;[[Seppo Linnainmaa]] (1970). The representation of the cumulative rounding error of an algorithm as a Taylor expansion of the local rounding errors. Master's Thesis (in Finnish), Univ. Helsinki, 6–7.&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;grie2012&amp;quot;&amp;gt;Griewank, Andreas (2012). Who Invented the Reverse Mode of Differentiation?. Optimization Stories, Documenta Matematica, Extra Volume ISMP (2012), 389–400.&amp;lt;/ref&amp;gt;，被保罗·韦伯引入神经网络。&amp;lt;ref name=&amp;quot;WERBOS1974&amp;quot;&amp;gt;[[Paul Werbos]], &amp;quot;Beyond Regression: New Tools for Prediction and Analysis in the Behavioral Sciences&amp;quot;, ''PhD thesis, Harvard University'', 1974.&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;werbos1982&amp;quot;&amp;gt;[[Paul Werbos]] (1982). Applications of advances in nonlinear sensitivity analysis. In System modeling and optimization (pp. 762–770). Springer Berlin Heidelberg. [http://werbos.com/Neural/SensitivityIFIPSeptember1981.pdf Online] {{webarchive|url=https://web.archive.org/web/20160414055503/http://werbos.com/Neural/SensitivityIFIPSeptember1981.pdf |date=14 April 2016 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Backpropagation&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Hierarchical temporal memory]] is an approach that models some of the structural and algorithmic properties of the [[neocortex]].&amp;lt;ref name=&amp;quot;Hierarchical temporal memory&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Hierarchical temporal memory is an approach that models some of the structural and algorithmic properties of the neocortex.&lt;br /&gt;
&lt;br /&gt;
层次化暂时性记忆是一种模拟大脑新皮层结构和算法特性的方法。&amp;lt;ref name=&amp;quot;Hierarchical temporal memory&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
To summarize, most neural networks use some form of [[gradient descent]] on a hand-created neural topology. However, some research groups, such as [[Uber]], argue that simple [[neuroevolution]] to mutate new neural network topologies and weights may be competitive with sophisticated gradient descent approaches{{citation needed|date=July 2019}}. One advantage of neuroevolution is that it may be less prone to get caught in &amp;quot;dead ends&amp;quot;.&amp;lt;ref&amp;gt;{{cite news|title=Artificial intelligence can 'evolve' to solve problems|url=http://www.sciencemag.org/news/2018/01/artificial-intelligence-can-evolve-solve-problems|accessdate=7 February 2018|work=Science {{!}} AAAS|date=10 January 2018|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
To summarize, most neural networks use some form of gradient descent on a hand-created neural topology. However, some research groups, such as Uber, argue that simple neuroevolution to mutate new neural network topologies and weights may be competitive with sophisticated gradient descent approaches. One advantage of neuroevolution is that it may be less prone to get caught in &amp;quot;dead ends&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
总之，大多数神经网络都会在人工神经拓扑结构上使用某种形式的'''&amp;lt;font color=#ff8000&amp;gt;梯度下降法 Gradient Descent&amp;lt;/font&amp;gt;'''。然而，一些研究组，比如 Uber的，认为通过简单的神经进化改变新神经网络拓扑结构和神经元间的权重可能比复杂的梯度下降法更适用{{citation needed|date=July 2019}}。神经进化的一个优势是，它不容易陷入“死胡同”。&amp;lt;ref&amp;gt;{{cite news|title=Artificial intelligence can 'evolve' to solve problems|url=http://www.sciencemag.org/news/2018/01/artificial-intelligence-can-evolve-solve-problems|accessdate=7 February 2018|work=Science {{!}} AAAS|date=10 January 2018|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====深层前馈神经网络====&lt;br /&gt;
&lt;br /&gt;
{{Main|Deep learning}}&lt;br /&gt;
&lt;br /&gt;
[[Deep learning]] is any [[artificial neural network]] that can learn a long chain of causal links{{dubious|date=July 2019}}. For example, a feedforward network with six hidden layers can learn a seven-link causal chain (six hidden layers + output layer) and has a [[deep learning#Credit assignment|&amp;quot;credit assignment path&amp;quot;]] (CAP) depth of seven{{citation needed|date=July 2019}}. Many deep learning systems need to be able to learn chains ten or more causal links in length.&amp;lt;ref name=&amp;quot;schmidhuber2015&amp;quot;/&amp;gt; Deep learning has transformed many important subfields of artificial intelligence{{why|date=July 2019}}, including [[computer vision]], [[speech recognition]], [[natural language processing]] and others.&amp;lt;ref name=&amp;quot;goodfellow2016&amp;quot;&amp;gt;Ian Goodfellow, Yoshua Bengio, and Aaron Courville (2016). Deep Learning. MIT Press. [http://www.deeplearningbook.org Online] {{webarchive|url=https://web.archive.org/web/20160416111010/http://www.deeplearningbook.org/ |date=16 April 2016 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;HintonDengYu2012&amp;quot;&amp;gt;{{cite journal | last1 = Hinton | first1 = G. | last2 = Deng | first2 = L. | last3 = Yu | first3 = D. | last4 = Dahl | first4 = G. | last5 = Mohamed | first5 = A. | last6 = Jaitly | first6 = N. | last7 = Senior | first7 = A. | last8 = Vanhoucke | first8 = V. | last9 = Nguyen | first9 = P. | last10 = Sainath | first10 = T. | last11 = Kingsbury | first11 = B. | year = 2012 | title = Deep Neural Networks for Acoustic Modeling in Speech Recognition – The shared views of four research groups | url = | journal = IEEE Signal Processing Magazine | volume = 29 | issue = 6| pages = 82–97 | doi=10.1109/msp.2012.2205597}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;schmidhuber2015&amp;quot;&amp;gt;{{cite journal |last=Schmidhuber |first=J. |year=2015 |title=Deep Learning in Neural Networks: An Overview |journal=Neural Networks |volume=61 |pages=85–117 |arxiv=1404.7828 |doi=10.1016/j.neunet.2014.09.003|pmid=25462637 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Deep learning is any artificial neural network that can learn a long chain of causal links. For example, a feedforward network with six hidden layers can learn a seven-link causal chain (six hidden layers + output layer) and has a &amp;quot;credit assignment path&amp;quot; (CAP) depth of seven. Many deep learning systems need to be able to learn chains ten or more causal links in length.&lt;br /&gt;
&lt;br /&gt;
深度学习是任何可以学习长因果链的人工神经网络。例如，一个具有六个隐藏层的前馈网络可以学习有七个链接的因果链(六个隐藏层 + 一个输出层) ，并且具深度为7的“'''&amp;lt;font color=#ff8000&amp;gt;信用分配路径 Credit Assignment Path，CAP&amp;lt;/font&amp;gt;''' ”。许多深度学习系统需要学习长度在十及以上的因果链。&amp;lt;ref name=&amp;quot;goodfellow2016&amp;quot;&amp;gt;Ian Goodfellow, Yoshua Bengio, and Aaron Courville (2016). Deep Learning. MIT Press. [http://www.deeplearningbook.org Online] {{webarchive|url=https://web.archive.org/web/20160416111010/http://www.deeplearningbook.org/ |date=16 April 2016 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;HintonDengYu2012&amp;quot;&amp;gt;{{cite journal | last1 = Hinton | first1 = G. | last2 = Deng | first2 = L. | last3 = Yu | first3 = D. | last4 = Dahl | first4 = G. | last5 = Mohamed | first5 = A. | last6 = Jaitly | first6 = N. | last7 = Senior | first7 = A. | last8 = Vanhoucke | first8 = V. | last9 = Nguyen | first9 = P. | last10 = Sainath | first10 = T. | last11 = Kingsbury | first11 = B. | year = 2012 | title = Deep Neural Networks for Acoustic Modeling in Speech Recognition – The shared views of four research groups | url = | journal = IEEE Signal Processing Magazine | volume = 29 | issue = 6| pages = 82–97 | doi=10.1109/msp.2012.2205597}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;schmidhuber2015&amp;quot;&amp;gt;{{cite journal |last=Schmidhuber |first=J. |year=2015 |title=Deep Learning in Neural Networks: An Overview |journal=Neural Networks |volume=61 |pages=85–117 |arxiv=1404.7828 |doi=10.1016/j.neunet.2014.09.003|pmid=25462637 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）Credit Assignment Path未找到标准翻译&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Qige96|Ricky]]（[[用户讨论:Qige96|讨论]]）中文的翻译一般来说就是“信用分配路径”，但其实这里的credit指的是贡献、声誉等。整个CAP要解决的是整条链路种每个神经元对最终结果的贡献是多少。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to one overview,&amp;lt;ref name=&amp;quot;scholarpedia&amp;quot;&amp;gt;{{cite journal | last1 = Schmidhuber | first1 = Jürgen | authorlink = Jürgen Schmidhuber | year = 2015 | title = Deep Learning | journal = Scholarpedia | volume = 10 | issue = 11 | page = 32832 | doi = 10.4249/scholarpedia.32832 | df = dmy-all | bibcode = 2015SchpJ..1032832S | doi-access = free }}&amp;lt;/ref&amp;gt; the expression &amp;quot;Deep Learning&amp;quot; was introduced to the [[machine learning]] community by [[Rina Dechter]] in 1986&amp;lt;ref name=&amp;quot;dechter1986&amp;quot;&amp;gt;[[Rina Dechter]] (1986). Learning while searching in constraint-satisfaction problems. University of California, Computer Science Department, Cognitive Systems Laboratory.[https://www.researchgate.net/publication/221605378_Learning_While_Searching_in_Constraint-Satisfaction-Problems Online] {{webarchive|url=https://web.archive.org/web/20160419054654/https://www.researchgate.net/publication/221605378_Learning_While_Searching_in_Constraint-Satisfaction-Problems |date=19 April 2016 }}&amp;lt;/ref&amp;gt; and gained traction after Igor Aizenberg and colleagues introduced it to [[artificial neural network]]s in 2000.&lt;br /&gt;
&lt;br /&gt;
According to one overview, the expression &amp;quot;Deep Learning&amp;quot; was introduced to the machine learning community by Rina Dechter in 1986 and gained traction after Igor Aizenberg and colleagues introduced it to artificial neural networks in 2000.&amp;lt;ref name=&amp;quot;aizenberg2000&amp;quot;&amp;gt;Igor Aizenberg, Naum N. Aizenberg, Joos P.L. Vandewalle (2000). Multi-Valued and Universal Binary Neurons: Theory, Learning and Applications. Springer Science &amp;amp; Business Media.&amp;lt;/ref&amp;gt; The first functional Deep Learning networks were published by [[Alexey Grigorevich Ivakhnenko]] and V. G. Lapa in 1965.&amp;lt;ref&amp;gt;{{Cite book|title=Cybernetic Predicting Devices|last=Ivakhnenko|first=Alexey|publisher=Naukova Dumka|year=1965|isbn=|location=Kiev|pages=}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
根据一篇综述&amp;lt;ref name=&amp;quot;scholarpedia&amp;quot;&amp;gt;{{cite journal | last1 = Schmidhuber | first1 = Jürgen | authorlink = Jürgen Schmidhuber | year = 2015 | title = Deep Learning | journal = Scholarpedia | volume = 10 | issue = 11 | page = 32832 | doi = 10.4249/scholarpedia.32832 | df = dmy-all | bibcode = 2015SchpJ..1032832S | doi-access = free }}&amp;lt;/ref&amp;gt;，“深度学习”这种表述是在1986年&amp;lt;ref name=&amp;quot;dechter1986&amp;quot;&amp;gt;[[Rina Dechter]] (1986). Learning while searching in constraint-satisfaction problems. University of California, Computer Science Department, Cognitive Systems Laboratory.[https://www.researchgate.net/publication/221605378_Learning_While_Searching_in_Constraint-Satisfaction-Problems Online] {{webarchive|url=https://web.archive.org/web/20160419054654/https://www.researchgate.net/publication/221605378_Learning_While_Searching_in_Constraint-Satisfaction-Problems |date=19 April 2016 }}&amp;lt;/ref&amp;gt;被里纳·德克特引入到机器学习领域的，并在2000年伊克尔·艾森贝格和他的同事将其引入人工神经网络后获得了关注。&amp;lt;ref name=&amp;quot;aizenberg2000&amp;quot;&amp;gt;Igor Aizenberg, Naum N. Aizenberg, Joos P.L. Vandewalle (2000). Multi-Valued and Universal Binary Neurons: Theory, Learning and Applications. Springer Science &amp;amp; Business Media.&amp;lt;/ref&amp;gt; The first functional Deep Learning networks were published by [[Alexey Grigorevich Ivakhnenko]] and V. G. Lapa in 1965.&amp;lt;ref&amp;gt;{{Cite book|title=Cybernetic Predicting Devices|last=Ivakhnenko|first=Alexey|publisher=Naukova Dumka|year=1965|isbn=|location=Kiev|pages=}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These networks are trained one layer at a time. Ivakhnenko's 1971 paper&amp;lt;ref name=&amp;quot;ivak1971&amp;quot;&amp;gt;{{Cite journal |doi = 10.1109/TSMC.1971.4308320|title = Polynomial Theory of Complex Systems|journal = IEEE Transactions on Systems, Man, and Cybernetics|issue = 4|pages = 364–378|year = 1971|last1 = Ivakhnenko|first1 = A. G.|url = https://semanticscholar.org/paper/b7efb6b6f7e9ffa017e970a098665f76d4dfeca2}}&amp;lt;/ref&amp;gt; describes the learning of a deep feedforward multilayer perceptron with eight layers, already much deeper than many later networks. In 2006, a publication by [[Geoffrey Hinton]] and Ruslan Salakhutdinov introduced another way of pre-training many-layered [[feedforward neural network]]s (FNNs) one layer at a time, treating each layer in turn as an [[unsupervised learning|unsupervised]] [[restricted Boltzmann machine]], then using [[supervised learning|supervised]] [[backpropagation]] for fine-tuning.{{sfn|Hinton|2007}} Similar to shallow artificial neural networks, deep neural networks can model complex non-linear relationships. Over the last few years, advances in both machine learning algorithms and computer hardware have led to more efficient methods for training deep neural networks that contain many layers of non-linear hidden units and a very large output layer.&amp;lt;ref&amp;gt;{{cite web|last1=Research|first1=AI|title=Deep Neural Networks for Acoustic Modeling in Speech Recognition|url=http://airesearch.com/ai-research-papers/deep-neural-networks-for-acoustic-modeling-in-speech-recognition/|website=airesearch.com|accessdate=23 October 2015|date=23 October 2015}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The first functional Deep Learning networks were published by Alexey Grigorevich Ivakhnenko and V. G. Lapa in 1965. These networks are trained one layer at a time. Ivakhnenko's 1971 paper describes the learning of a deep feedforward multilayer perceptron with eight layers, already much deeper than many later networks. In 2006, a publication by Geoffrey Hinton and Ruslan Salakhutdinov introduced another way of pre-training many-layered feedforward neural networks (FNNs) one layer at a time, treating each layer in turn as an unsupervised restricted Boltzmann machine, then using supervised backpropagation for fine-tuning. Similar to shallow artificial neural networks, deep neural networks can model complex non-linear relationships. Over the last few years, advances in both machine learning algorithms and computer hardware have led to more efficient methods for training deep neural networks that contain many layers of non-linear hidden units and a very large output layer.&lt;br /&gt;
&lt;br /&gt;
第一个可以用的深度学习网络是由A. G.伊瓦赫年科和V.G.拉帕 在1965年发表的。这些网络每次只训练一层。1971年伊瓦赫年科的论文描述了一个8层的深度前馈多层感知机网络的学习过程，这个网络已经比许多后来的网络要深得多了&amp;lt;ref name=&amp;quot;ivak1971&amp;quot;&amp;gt;{{Cite journal |doi = 10.1109/TSMC.1971.4308320|title = Polynomial Theory of Complex Systems|journal = IEEE Transactions on Systems, Man, and Cybernetics|issue = 4|pages = 364–378|year = 1971|last1 = Ivakhnenko|first1 = A. G.|url = https://semanticscholar.org/paper/b7efb6b6f7e9ffa017e970a098665f76d4dfeca2}}&amp;lt;/ref&amp;gt;。2006年，杰弗里•辛顿和特迪诺夫的文章介绍了另一种预训练'''&amp;lt;font color=#ff8000&amp;gt;多层前馈神经网络 Many-layered Feedforward Neural Networks, FNNs&amp;lt;/font&amp;gt;''' 的方法，一次训练一层，将每一层都视为无监督的[[受限玻尔兹曼机]]，然后使用监督式反向传播进行微调。与浅层人工神经网络类似，深层神经网络可以模拟复杂的非线性关系。在过去的几年里，机器学习算法和计算机硬件的进步催生了更有效的方法，训练包含许多层非线性隐藏单元和一个非常大的输出层的深层神经网络。&amp;lt;ref&amp;gt;{{cite web|last1=Research|first1=AI|title=Deep Neural Networks for Acoustic Modeling in Speech Recognition|url=http://airesearch.com/ai-research-papers/deep-neural-networks-for-acoustic-modeling-in-speech-recognition/|website=airesearch.com|accessdate=23 October 2015|date=23 October 2015}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Deep learning often uses [[convolutional neural network]]s (CNNs), whose origins can be traced back to the [[Neocognitron]] introduced by [[Kunihiko Fukushima]] in 1980.&amp;lt;ref name=&amp;quot;FUKU1980&amp;quot;&amp;gt;{{cite journal | last1 = Fukushima | first1 = K. | year = 1980 | title = Neocognitron: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position | url = | journal = Biological Cybernetics | volume = 36 | issue = 4| pages = 193–202 | doi=10.1007/bf00344251 | pmid=7370364}}&amp;lt;/ref&amp;gt; In 1989, [[Yann LeCun]] and colleagues applied [[backpropagation]] to such an architecture. In the early 2000s, in an industrial application, CNNs already processed an estimated 10% to 20% of all the checks written in the US.&amp;lt;ref name=&amp;quot;lecun2016slides&amp;quot;&amp;gt;[[Yann LeCun]] (2016). Slides on Deep Learning [https://indico.cern.ch/event/510372/ Online] {{webarchive|url=https://web.archive.org/web/20160423021403/https://indico.cern.ch/event/510372/ |date=23 April 2016 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Deep learning often uses convolutional neural networks (CNNs), whose origins can be traced back to the Neocognitron introduced by Kunihiko Fukushima in 1980. In 1989, Yann LeCun and colleagues applied backpropagation to such an architecture. In the early 2000s, in an industrial application, CNNs already processed an estimated 10% to 20% of all the checks written in the US.&lt;br /&gt;
&lt;br /&gt;
深度学习通常使用'&amp;lt;font color=#ff8000&amp;gt;卷积神经网络 ConvolutionalNeural Networks CNNs&amp;lt;/font&amp;gt;''' ，其起源可以追溯到1980年由福岛邦彦引进的新认知机。1989年扬·勒丘恩(Yann LeCun)和他的同事将反向传播算法应用于这样的架构。在21世纪初，在一项工业应用中，CNNs已经处理了美国大约10% 到20%的签发支票。&lt;br /&gt;
&lt;br /&gt;
Since 2011, fast implementations of CNNs on GPUs have won many visual pattern recognition competitions.&amp;lt;ref name=&amp;quot;schmidhuber2015&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Since 2011, fast implementations of CNNs on GPUs have won many visual pattern recognition competitions.&lt;br /&gt;
&lt;br /&gt;
自2011年以来，在 GPUs上快速实现的 CNN 赢得了许多视觉模式识别比赛。&amp;lt;ref name=&amp;quot;schmidhuber2015&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
CNNs with 12 convolutional layers were used in conjunction with [[reinforcement learning]] by Deepmind's &amp;quot;[[AlphaGo]] Lee&amp;quot;, the program that beat a top [[Go (game)|Go]] champion in 2016.&amp;lt;ref name=&amp;quot;Nature2017&amp;quot;&amp;gt;{{cite journal |first1=David |last1=Silver|author-link1=David Silver (programmer)|first2= Julian|last2= Schrittwieser|first3= Karen|last3= Simonyan|first4= Ioannis|last4= Antonoglou|first5= Aja|last5= Huang|author-link5=Aja Huang|first6=Arthur|last6= Guez|first7= Thomas|last7= Hubert|first8= Lucas|last8= Baker|first9= Matthew|last9= Lai|first10= Adrian|last10= Bolton|first11= Yutian|last11= Chen|author-link11=Chen Yutian|first12= Timothy|last12= Lillicrap|first13=Hui|last13= Fan|author-link13=Fan Hui|first14= Laurent|last14= Sifre|first15= George van den|last15= Driessche|first16= Thore|last16= Graepel|first17= Demis|last17= Hassabis |author-link17=Demis Hassabis|title=Mastering the game of Go without human knowledge|journal=[[Nature (journal)|Nature]]|issn= 0028-0836|pages=354–359|volume =550|issue =7676|doi =10.1038/nature24270|pmid=29052630|date=19 October 2017|quote=AlphaGo Lee... 12 convolutional layers|bibcode=2017Natur.550..354S|url=http://discovery.ucl.ac.uk/10045895/1/agz_unformatted_nature.pdf}}{{closed access}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
CNNs with 12 convolutional layers were used in conjunction with reinforcement learning by Deepmind's &amp;quot;AlphaGo Lee&amp;quot;, the program that beat a top Go champion in 2016.&lt;br /&gt;
&lt;br /&gt;
2016年Deepmind 的“AlphaGo Lee”使用了有12个卷积层的 CNNs 和强化学习，击败了一个顶级围棋冠军。&amp;lt;ref name=&amp;quot;Nature2017&amp;quot;&amp;gt;{{cite journal |first1=David |last1=Silver|author-link1=David Silver (programmer)|first2= Julian|last2= Schrittwieser|first3= Karen|last3= Simonyan|first4= Ioannis|last4= Antonoglou|first5= Aja|last5= Huang|author-link5=Aja Huang|first6=Arthur|last6= Guez|first7= Thomas|last7= Hubert|first8= Lucas|last8= Baker|first9= Matthew|last9= Lai|first10= Adrian|last10= Bolton|first11= Yutian|last11= Chen|author-link11=Chen Yutian|first12= Timothy|last12= Lillicrap|first13=Hui|last13= Fan|author-link13=Fan Hui|first14= Laurent|last14= Sifre|first15= George van den|last15= Driessche|first16= Thore|last16= Graepel|first17= Demis|last17= Hassabis |author-link17=Demis Hassabis|title=Mastering the game of Go without human knowledge|journal=[[Nature (journal)|Nature]]|issn= 0028-0836|pages=354–359|volume =550|issue =7676|doi =10.1038/nature24270|pmid=29052630|date=19 October 2017|quote=AlphaGo Lee... 12 convolutional layers|bibcode=2017Natur.550..354S|url=http://discovery.ucl.ac.uk/10045895/1/agz_unformatted_nature.pdf}}{{closed access}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====深层循环（递归）神经网络 ====&lt;br /&gt;
&lt;br /&gt;
{{Main|Recurrent neural networks}}&lt;br /&gt;
&lt;br /&gt;
Early on, deep learning was also applied to sequence learning with [[recurrent neural network]]s (RNNs)&amp;lt;ref name=&amp;quot;Recurrent neural networks&amp;quot;/&amp;gt; which are in theory Turing complete&amp;lt;ref&amp;gt;{{cite journal|last1=Hyötyniemi|first1=Heikki|title=Turing machines are recurrent neural networks|journal=Proceedings of STeP '96/Publications of the Finnish Artificial Intelligence Society|pages=13–24|date=1996}}&amp;lt;/ref&amp;gt; and can run arbitrary programs to process arbitrary sequences of inputs. The depth of an RNN is unlimited and depends on the length of its input sequence; thus, an RNN is an example of deep learning.&amp;lt;ref name=&amp;quot;schmidhuber2015&amp;quot;/&amp;gt; RNNs can be trained by [[gradient descent]]&amp;lt;ref&amp;gt;P. J. Werbos. Generalization of backpropagation with application to a recurrent gas market model&amp;quot; ''Neural Networks'' 1, 1988.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;A. J. Robinson and F. Fallside. The utility driven dynamic error propagation network. Technical Report CUED/F-INFENG/TR.1, Cambridge University Engineering Department, 1987.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;R. J. Williams and D. Zipser. Gradient-based learning algorithms for recurrent networks and their computational complexity. In Back-propagation: Theory, Architectures and Applications. Hillsdale, NJ: Erlbaum, 1994.&amp;lt;/ref&amp;gt; but suffer from the [[vanishing gradient problem]].&amp;lt;ref name=&amp;quot;goodfellow2016&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;hochreiter1991&amp;quot;&amp;gt;[[Sepp Hochreiter]] (1991), [http://people.idsia.ch/~juergen/SeppHochreiter1991ThesisAdvisorSchmidhuber.pdf Untersuchungen zu dynamischen neuronalen Netzen] {{webarchive|url=https://web.archive.org/web/20150306075401/http://people.idsia.ch/~juergen/SeppHochreiter1991ThesisAdvisorSchmidhuber.pdf |date=6 March 2015 }}, Diploma thesis. Institut f. Informatik, Technische Univ. Munich. Advisor: J. Schmidhuber.&amp;lt;/ref&amp;gt; In 1992, it was shown that unsupervised pre-training of a stack of [[recurrent neural network]]s can speed up subsequent supervised learning of deep sequential problems.&amp;lt;ref name=&amp;quot;SCHMID1992&amp;quot;&amp;gt;{{cite journal | last1 = Schmidhuber | first1 = J. | year = 1992 | title = Learning complex, extended sequences using the principle of history compression | url = | journal = Neural Computation | volume = 4 | issue = 2| pages = 234–242 | doi=10.1162/neco.1992.4.2.234| citeseerx = 10.1.1.49.3934}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Early on, deep learning was also applied to sequence learning with recurrent neural networks (RNNs)&amp;lt;ref name=&amp;quot;Recurrent neural networks&amp;quot;/&amp;gt;  and can run arbitrary programs to process arbitrary sequences of inputs. The depth of an RNN is unlimited and depends on the length of its input sequence; thus, an RNN is an example of deep learning. but suffer from the vanishing gradient problem. In 1992, it was shown that unsupervised pre-training of a stack of recurrent neural networks can speed up subsequent supervised learning of deep sequential problems.&lt;br /&gt;
&lt;br /&gt;
早期，深度学习也被用于'''&amp;lt;font color=#ff8000&amp;gt;循环神经网络 Recurrent Neural Networks,RNNs&amp;lt;/font&amp;gt;''' 的序列学习&amp;lt;ref&amp;gt;{{cite journal|last1=Hyötyniemi|first1=Heikki|title=Turing machines are recurrent neural networks|journal=Proceedings of STeP '96/Publications of the Finnish Artificial Intelligence Society|pages=13–24|date=1996}}&amp;lt;/ref&amp;gt;，可以运行任意程序来处理任意的输入序列。一个循环神经网络的深度是无限制的，取决于其输入序列的长度; 因此，循环神经网络是一个深度学习的例子&amp;lt;ref name=&amp;quot;schmidhuber2015&amp;quot;/&amp;gt;，但却存在梯度消失问题。1992年的一项研究表明无监督的预训练循环神经网络可以加速后续的深度序列问题的监督式学习。]&amp;lt;ref&amp;gt;P. J. Werbos. Generalization of backpropagation with application to a recurrent gas market model&amp;quot; ''Neural Networks'' 1, 1988.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;A. J. Robinson and F. Fallside. The utility driven dynamic error propagation network. Technical Report CUED/F-INFENG/TR.1, Cambridge University Engineering Department, 1987.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;R. J. Williams and D. Zipser. Gradient-based learning algorithms for recurrent networks and their computational complexity. In Back-propagation: Theory, Architectures and Applications. Hillsdale, NJ: Erlbaum, 1994.&amp;lt;/ref&amp;gt; but suffer from the [[vanishing gradient problem]].&amp;lt;ref name=&amp;quot;goodfellow2016&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;hochreiter1991&amp;quot;&amp;gt;[[Sepp Hochreiter]] (1991), [http://people.idsia.ch/~juergen/SeppHochreiter1991ThesisAdvisorSchmidhuber.pdf Untersuchungen zu dynamischen neuronalen Netzen] {{webarchive|url=https://web.archive.org/web/20150306075401/http://people.idsia.ch/~juergen/SeppHochreiter1991ThesisAdvisorSchmidhuber.pdf |date=6 March 2015 }}, Diploma thesis. Institut f. Informatik, Technische Univ. Munich. Advisor: J. Schmidhuber.&amp;lt;/ref&amp;gt; In 1992, it was shown that unsupervised pre-training of a stack of [[recurrent neural network]]s can speed up subsequent supervised learning of deep sequential problems.&amp;lt;ref name=&amp;quot;SCHMID1992&amp;quot;&amp;gt;{{cite journal | last1 = Schmidhuber | first1 = J. | year = 1992 | title = Learning complex, extended sequences using the principle of history compression | url = | journal = Neural Computation | volume = 4 | issue = 2| pages = 234–242 | doi=10.1162/neco.1992.4.2.234| citeseerx = 10.1.1.49.3934}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Numerous researchers now use variants of a deep learning recurrent NN called the [[long short-term memory]] (LSTM) network published by Hochreiter &amp;amp; Schmidhuber in 1997.&amp;lt;ref name=lstm&amp;gt;[[Sepp Hochreiter|Hochreiter, Sepp]]; and [[Jürgen Schmidhuber|Schmidhuber, Jürgen]]; ''Long Short-Term Memory'', Neural Computation, 9(8):1735–1780, 1997&amp;lt;/ref&amp;gt; LSTM is often trained by [[Connectionist temporal classification|Connectionist Temporal Classification]] (CTC).&amp;lt;ref name=&amp;quot;graves2006&amp;quot;&amp;gt;Alex Graves, Santiago Fernandez, Faustino Gomez, and [[Jürgen Schmidhuber]] (2006). Connectionist temporal classification: Labelling unsegmented sequence data with recurrent neural nets. Proceedings of ICML'06, pp. 369–376.&amp;lt;/ref&amp;gt; At Google, Microsoft and Baidu this approach has revolutionized [[speech recognition]].&amp;lt;ref name=&amp;quot;hannun2014&amp;quot;&amp;gt;{{cite arXiv&lt;br /&gt;
&lt;br /&gt;
Numerous researchers now use variants of a deep learning recurrent NN called the long short-term memory (LSTM) network published by Hochreiter &amp;amp; Schmidhuber in 1997. LSTM is often trained by Connectionist Temporal Classification (CTC). At Google, Microsoft and Baidu this approach has revolutionized speech recognition.&amp;lt;ref name=&amp;quot;hannun2014&amp;quot;&amp;gt;{{cite arXiv&lt;br /&gt;
&lt;br /&gt;
许多研究人员现在使用着一种被称为 '''&amp;lt;font color=#ff8000&amp;gt;长短期记忆 Long Short-term Memory, LSTM &amp;lt;/font&amp;gt;'''的网络——一种深度学习循环神经网络的变体，由霍克赖特和施米德胡贝在1997年提出。人们通常使用'''&amp;lt;font color=#ff8000&amp;gt;连接时序分类 Connectionist Temporal Classification, CTC&amp;lt;/font&amp;gt;'''训练LSTM&amp;lt;ref name=&amp;quot;graves2006&amp;quot;&amp;gt;Alex Graves, Santiago Fernandez, Faustino Gomez, and [[Jürgen Schmidhuber]] (2006). Connectionist temporal classification: Labelling unsegmented sequence data with recurrent neural nets. Proceedings of ICML'06, pp. 369–376.&amp;lt;/ref&amp;gt;。谷歌，微软和百度用CTC彻底改变了语音识别。例如,2015年谷歌的语音识别性能大幅提升了49%,现在数十亿智能手机用户都可以通过谷歌声音使用这项技术。谷歌也使用LSTM来改进机器翻译，例如2015年，通过训练的LSTM，谷歌的语音识别性能大幅提升了49%，现在通过谷歌语音可以被数十亿的智能手机用户使用。谷歌还使用LSTM来改进机器翻译、语言建模和多语言语言处理。LSTM与CNNs一起使用改进了自动图像字幕的功能等众多应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===评估进度===&lt;br /&gt;
&lt;br /&gt;
{{Further|Progress in artificial intelligence|Competitions and prizes in artificial intelligence}}&lt;br /&gt;
&lt;br /&gt;
AI, like electricity or the steam engine, is a general purpose technology. There is no consensus on how to characterize which tasks AI tends to excel at.&amp;lt;ref&amp;gt;{{cite news|last1=Brynjolfsson|first1=Erik|last2=Mitchell|first2=Tom|title=What can machine learning do? Workforce implications|url=http://science.sciencemag.org/content/358/6370/1530|accessdate=7 May 2018|work=Science|date=22 December 2017|pages=1530–1534|language=en|doi=10.1126/science.aap8062|bibcode=2017Sci...358.1530B}}&amp;lt;/ref&amp;gt; While projects such as [[AlphaZero]] have succeeded in generating their own knowledge from scratch, many other machine learning projects require large training datasets.&amp;lt;ref&amp;gt;{{cite news|last1=Sample|first1=Ian|title='It's able to create knowledge itself': Google unveils AI that learns on its own|url=https://www.theguardian.com/science/2017/oct/18/its-able-to-create-knowledge-itself-google-unveils-ai-learns-all-on-its-own|accessdate=7 May 2018|work=the Guardian|date=18 October 2017|language=en}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=The AI revolution in science|url=http://www.sciencemag.org/news/2017/07/ai-revolution-science|accessdate=7 May 2018|work=Science {{!}} AAAS|date=5 July 2017|language=en}}&amp;lt;/ref&amp;gt; Researcher [[Andrew Ng]] has suggested, as a &amp;quot;highly imperfect rule of thumb&amp;quot;, that &amp;quot;almost anything a typical human can do with less than one second of mental thought, we can probably now or in the near future automate using AI.&amp;quot;&amp;lt;ref&amp;gt;{{cite news|title=Will your job still exist in 10 years when the robots arrive?|url=http://www.scmp.com/tech/innovation/article/2098164/robots-are-coming-here-are-some-jobs-wont-exist-10-years|accessdate=7 May 2018|work=[[South China Morning Post]]|date=2017|language=en}}&amp;lt;/ref&amp;gt; [[Moravec's paradox]] suggests that AI lags humans at many tasks that the human brain has specifically evolved to perform well.&amp;lt;ref name=&amp;quot;The Economist&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
AI, like electricity or the steam engine, is a general purpose technology. There is no consensus on how to characterize which tasks AI tends to excel at. While projects such as AlphaZero have succeeded in generating their own knowledge from scratch, many other machine learning projects require large training datasets. Researcher Andrew Ng has suggested, as a &amp;quot;highly imperfect rule of thumb&amp;quot;, that &amp;quot;almost anything a typical human can do with less than one second of mental thought, we can probably now or in the near future automate using AI.&amp;quot; Moravec's paradox suggests that AI lags humans at many tasks that the human brain has specifically evolved to perform well.&lt;br /&gt;
&lt;br /&gt;
AI和电或蒸汽机一样，是一种通用技术。AI 擅长什么样的任务，这个问题尚未达成共识&amp;lt;ref&amp;gt;{{cite news|last1=Brynjolfsson|first1=Erik|last2=Mitchell|first2=Tom|title=What can machine learning do? Workforce implications|url=http://science.sciencemag.org/content/358/6370/1530|accessdate=7 May 2018|work=Science|date=22 December 2017|pages=1530–1534|language=en|doi=10.1126/science.aap8062|bibcode=2017Sci...358.1530B}}&amp;lt;/ref&amp;gt;。虽然像 AlphaZero 这样的项目已经能做到从零开始产生知识，但是许多其他的机器学习项目仍需要大量的训练数据集&amp;lt;ref&amp;gt;{{cite news|last1=Sample|first1=Ian|title='It's able to create knowledge itself': Google unveils AI that learns on its own|url=https://www.theguardian.com/science/2017/oct/18/its-able-to-create-knowledge-itself-google-unveils-ai-learns-all-on-its-own|accessdate=7 May 2018|work=the Guardian|date=18 October 2017|language=en}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=The AI revolution in science|url=http://www.sciencemag.org/news/2017/07/ai-revolution-science|accessdate=7 May 2018|work=Science {{!}} AAAS|date=5 July 2017|language=en}}&amp;lt;/ref&amp;gt;。研究人员吴恩达认为，作为一个“极不完美的经验法则”，“几乎任何普通人只需要不到一秒钟的思考就能做到的事情，我们现在或者在不久的将来都可以使用AI做到。”莫拉维克悖论表明，AI在执行许多人类大脑专门进化出来的、能够很好完成的任务时表现不如人类。&amp;lt;ref&amp;gt;{{cite news|title=Will your job still exist in 10 years when the robots arrive?|url=http://www.scmp.com/tech/innovation/article/2098164/robots-are-coming-here-are-some-jobs-wont-exist-10-years|accessdate=7 May 2018|work=[[South China Morning Post]]|date=2017|language=en}}&amp;lt;/ref&amp;gt; [[Moravec's paradox]] suggests that AI lags humans at many tasks that the human brain has specifically evolved to perform well.&amp;lt;ref name=&amp;quot;The Economist&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Games provide a well-publicized benchmark for assessing rates of progress. [[AlphaGo]] around 2016 brought the era of classical board-game benchmarks to a close. Games of imperfect knowledge provide new challenges to AI in the area of [[game theory]].&amp;lt;ref&amp;gt;{{cite news|last1=Borowiec|first1=Tracey Lien, Steven|title=AlphaGo beats human Go champ in milestone for artificial intelligence|url=https://www.latimes.com/world/asia/la-fg-korea-alphago-20160312-story.html|accessdate=7 May 2018|work=latimes.com|date=2016}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|last1=Brown|first1=Noam|last2=Sandholm|first2=Tuomas|title=Superhuman AI for heads-up no-limit poker: Libratus beats top professionals|url=http://science.sciencemag.org/content/359/6374/418|accessdate=7 May 2018|work=Science|date=26 January 2018|pages=418–424|language=en|doi=10.1126/science.aao1733}}&amp;lt;/ref&amp;gt; [[Esports|E-sports]] such as [[StarCraft]] continue to provide additional public benchmarks.&amp;lt;ref&amp;gt;{{cite journal|last1=Ontanon|first1=Santiago|last2=Synnaeve|first2=Gabriel|last3=Uriarte|first3=Alberto|last4=Richoux|first4=Florian|last5=Churchill|first5=David|last6=Preuss|first6=Mike|title=A Survey of Real-Time Strategy Game AI Research and Competition in StarCraft|journal=IEEE Transactions on Computational Intelligence and AI in Games|date=December 2013|volume=5|issue=4|pages=293–311|doi=10.1109/TCIAIG.2013.2286295|citeseerx=10.1.1.406.2524}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Facebook Quietly Enters StarCraft War for AI Bots, and Loses|url=https://www.wired.com/story/facebook-quietly-enters-starcraft-war-for-ai-bots-and-loses/|accessdate=7 May 2018|work=WIRED|date=2017}}&amp;lt;/ref&amp;gt; There are many competitions and prizes, such as the [[ImageNet|Imagenet Challenge]], to promote research in artificial intelligence. The most common areas of competition include general machine intelligence, conversational behavior, data-mining, [[autonomous car|robotic cars]], and robot soccer as well as conventional games.&amp;lt;ref&amp;gt;{{Cite web|url=http://image-net.org/challenges/LSVRC/2017/|title=ILSVRC2017|website=image-net.org|language=en|access-date=2018-11-06}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Games provide a well-publicized benchmark for assessing rates of progress. AlphaGo around 2016 brought the era of classical board-game benchmarks to a close. Games of imperfect knowledge provide new challenges to AI in the area of game theory. E-sports such as StarCraft continue to provide additional public benchmarks. There are many competitions and prizes, such as the Imagenet Challenge, to promote research in artificial intelligence. The most common areas of competition include general machine intelligence, conversational behavior, data-mining, robotic cars, and robot soccer as well as conventional games.&lt;br /&gt;
&lt;br /&gt;
游戏是评估进步率用的一个广泛认可的基准。2016年前后，AlphaGo 为传统棋类基准的时代的拉下终幕。不过，不完全知识的游戏给AI在博弈论领域提出了新的挑战。星际争霸等电子竞技现在仍然是一项的公众基准。现在出现了设立了有许多如 Imagenet 挑战赛的比赛和奖项以促进AI研究。最常见的比赛内容包括通用机器智能、对话行为、数据挖掘、机器人汽车、机器人足球以及传统游戏。 &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;imitation game&amp;quot; (an interpretation of the 1950 [[Turing test]] that assesses whether a computer can imitate a human) is nowadays considered too exploitable to be a meaningful benchmark.&amp;lt;ref&amp;gt;{{cite journal|last1=Schoenick|first1=Carissa|last2=Clark|first2=Peter|last3=Tafjord|first3=Oyvind|last4=Turney|first4=Peter|last5=Etzioni|first5=Oren|title=Moving beyond the Turing Test with the Allen AI Science Challenge|journal=Communications of the ACM|date=23 August 2017|volume=60|issue=9|pages=60–64|doi=10.1145/3122814|arxiv=1604.04315}}&amp;lt;/ref&amp;gt; A derivative of the Turing test is the Completely Automated Public Turing test to tell Computers and Humans Apart ([[CAPTCHA]]). As the name implies, this helps to determine that a user is an actual person and not a computer posing as a human. In contrast to the standard Turing test, CAPTCHA is administered by a machine and targeted to a human as opposed to being administered by a human and targeted to a machine. A computer asks a user to complete a simple test then generates a grade for that test. Computers are unable to solve the problem, so correct solutions are deemed to be the result of a person taking the test. A common type of CAPTCHA is the test that requires the typing of distorted letters, numbers or symbols that appear in an image undecipherable by a computer.{{sfn|O'Brien|Marakas|2011}}&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;imitation game&amp;quot; (an interpretation of the 1950 Turing test that assesses whether a computer can imitate a human) is nowadays considered too exploitable to be a meaningful benchmark. A derivative of the Turing test is the Completely Automated Public Turing test to tell Computers and Humans Apart (CAPTCHA). As the name implies, this helps to determine that a user is an actual person and not a computer posing as a human. In contrast to the standard Turing test, CAPTCHA is administered by a machine and targeted to a human as opposed to being administered by a human and targeted to a machine. A computer asks a user to complete a simple test then generates a grade for that test. Computers are unable to solve the problem, so correct solutions are deemed to be the result of a person taking the test. A common type of CAPTCHA is the test that requires the typing of distorted letters, numbers or symbols that appear in an image undecipherable by a computer.&lt;br /&gt;
&lt;br /&gt;
“模仿游戏”(对1950年图灵测试的一种解释，用来评估计算机是否可以模仿人类)如今被认为过于灵活，所以不能成为有一项意义的基准。图灵测试衍生出了'''&amp;lt;font color=#ff8000&amp;gt;验证码 Completely Automated Public Turing test to tell Computers and Humans Apart,CAPTCHA&amp;lt;/font&amp;gt;'''(即全自动区分计算机和人类的图灵测试)，顾名思义，这有助于确定用户是一个真实的人，而不是一台伪装成人的计算机。与标准的图灵测试不同，CAPTCHA 是由机器控制，面向人测试，而不是由人控制的，面向机器测试的。计算机要求用户完成一个简单的测试，然后给测试评出一个等级。计算机无法解决这个问题，所以一般认为只有人参加测试才能得出正确答案。验证码的一个常见类型是要求输入一幅计算机无法破译的图中扭曲的字母，数字或符号测试。 &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Proposed &amp;quot;universal intelligence&amp;quot; tests aim to compare how well machines, humans, and even non-human animals perform on problem sets that are generic as possible. At an extreme, the test suite can contain every possible problem, weighted by [[Kolmogorov complexity]]; unfortunately, these problem sets tend to be dominated by impoverished pattern-matching exercises where a tuned AI can easily exceed human performance levels.&amp;lt;ref name=&amp;quot;Mathematical definitions of intelligence&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Hernández-Orallo|first1=José|last2=Dowe|first2=David L.|last3=Hernández-Lloreda|first3=M.Victoria|title=Universal psychometrics: Measuring cognitive abilities in the machine kingdom|journal=Cognitive Systems Research|date=March 2014|volume=27|pages=50–74|doi=10.1016/j.cogsys.2013.06.001|hdl=10251/50244|hdl-access=free}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Proposed &amp;quot;universal intelligence&amp;quot; tests aim to compare how well machines, humans, and even non-human animals perform on problem sets that are generic as possible. At an extreme, the test suite can contain every possible problem, weighted by Kolmogorov complexity; unfortunately, these problem sets tend to be dominated by impoverished pattern-matching exercises where a tuned AI can easily exceed human performance levels.&lt;br /&gt;
&lt;br /&gt;
“通用智能”测试旨在比较机器、人类甚至非人类动物在尽可能通用的问题集上的表现。在极端情况下，测试集可以包含所有可能出现的问题，再通过柯尔莫哥洛夫复杂度赋予权重；可是这些问题集里大多数问题都是不怎么难的模式匹配练习，在这些练习中，优化过的AI可以轻易地超过人类。&amp;lt;ref name=&amp;quot;Mathematical definitions of intelligence&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Hernández-Orallo|first1=José|last2=Dowe|first2=David L.|last3=Hernández-Lloreda|first3=M.Victoria|title=Universal psychometrics: Measuring cognitive abilities in the machine kingdom|journal=Cognitive Systems Research|date=March 2014|volume=27|pages=50–74|doi=10.1016/j.cogsys.2013.06.001|hdl=10251/50244|hdl-access=free}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== 应用 Applications{{anchor|Goals}} ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Automated online assistant.png|thumb|An [[automated online assistant]] providing customer service on a web page – one of many very primitive applications of artificial intelligence]AI的初级应用之一：提供客户服务的网页自动化助理] ]&lt;br /&gt;
&lt;br /&gt;
An [[automated online assistant providing customer service on a web page – one of many very primitive applications of artificial intelligence]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Applications of artificial intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
AI is relevant to any intellectual task.{{sfn|Russell|Norvig|2009|p=1}} Modern artificial intelligence techniques are pervasive&amp;lt;ref name=&amp;quot;:1&amp;quot;&amp;gt;{{Cite book|last=|first=|url=https://ec.europa.eu/info/sites/info/files/commission-white-paper-artificial-intelligence-feb2020_en.pdf|title=White Paper: On Artificial Intelligence - A European approach to excellence and trust|publisher=European Commission|year=2020|isbn=|location=Brussels|pages=1}}&amp;lt;/ref&amp;gt; and are too numerous to list here. Frequently, when a technique reaches mainstream use, it is no longer considered artificial intelligence; this phenomenon is described as the [[AI effect]].{{sfn|''CNN''|2006}}&lt;br /&gt;
&lt;br /&gt;
AI is relevant to any intellectual task. Modern artificial intelligence techniques are pervasive and are too numerous to list here. Frequently, when a technique reaches mainstream use, it is no longer considered artificial intelligence; this phenomenon is described as the AI effect.&lt;br /&gt;
&lt;br /&gt;
AI与任何智力任务都息息相关。现代AI技术无处不在，数量众多，无法在此列举。通常，当一种技术变成主流应用时，它就不再被认为是AI; 这种现象被称为AI效应。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
High-profile examples of AI include autonomous vehicles (such as [[Unmanned aerial vehicle|drones]] and [[self-driving cars]]), medical diagnosis, creating art (such as poetry), proving mathematical theorems, playing games (such as Chess or Go), search engines (such as [[Google search]]), online assistants (such as [[Siri]]), image recognition in photographs, spam filtering, predicting flight delays,&amp;lt;ref&amp;gt;[https://ishti.org/2018/11/19/using-artificial-intelligence-to-predict-flight-delays/ Using AI to predict flight delays], Ishti.org.&amp;lt;/ref&amp;gt; prediction of judicial decisions,&amp;lt;ref name=&amp;quot;ecthr2016&amp;quot;&amp;gt;{{cite journal |author1=N. Aletras |author2=D. Tsarapatsanis |author3=D. Preotiuc-Pietro |author4=V. Lampos |title=Predicting judicial decisions of the European Court of Human Rights: a Natural Language Processing perspective |journal=PeerJ Computer Science |volume=2 |pages=e93 |year=2016 |df=dmy-all |doi=10.7717/peerj-cs.93 |doi-access=free }}&amp;lt;/ref&amp;gt; targeting online advertisements, {{sfn|Russell|Norvig|2009|p=1}}&amp;lt;ref&amp;gt;{{cite news|title=The Economist Explains: Why firms are piling into artificial intelligence|url=https://www.economist.com/blogs/economist-explains/2016/04/economist-explains|accessdate=19 May 2016|work=[[The Economist]]|date=31 March 2016|url-status=live|archiveurl=https://web.archive.org/web/20160508010311/http://www.economist.com/blogs/economist-explains/2016/04/economist-explains|archivedate=8 May 2016|df=dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|url=https://www.nytimes.com/2016/02/29/technology/the-promise-of-artificial-intelligence-unfolds-in-small-steps.html|title=The Promise of Artificial Intelligence Unfolds in Small Steps|last=Lohr|first=Steve|work=[[The New York Times]]|date=28 February 2016|accessdate=29 February 2016|url-status=live|archiveurl=https://web.archive.org/web/20160229171843/http://www.nytimes.com/2016/02/29/technology/the-promise-of-artificial-intelligence-unfolds-in-small-steps.html|archivedate=29 February 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; and [[energy storage]]&amp;lt;ref&amp;gt;{{Cite web|url=https://www.cnbc.com/2019/06/14/the-business-using-ai-to-change-how-we-think-about-energy-storage.html|title=A Californian business is using A.I. to change the way we think about energy storage|last=Frangoul|first=Anmar|date=2019-06-14|website=CNBC|language=en|access-date=2019-11-05}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
High-profile examples of AI include autonomous vehicles (such as drones and self-driving cars), medical diagnosis, creating art (such as poetry), proving mathematical theorems, playing games (such as Chess or Go), search engines (such as Google search), online assistants (such as Siri), image recognition in photographs, spam filtering, predicting flight delays, prediction of judicial decisions, targeting online advertisements,  and energy storage&lt;br /&gt;
&lt;br /&gt;
大众常见的AI包括自动驾驶(如无人机和自动驾驶汽车)、医疗诊断、艺术创作(如诗歌)、证明数学定理、玩游戏(如国际象棋或围棋)、搜索引擎(如谷歌搜索)、在线助手(如 Siri)、图像识别、垃圾邮件过滤、航班延误预测、司法判决预测、投放在线广告和能源储存。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
With social media sites overtaking TV as a source for news for young people and news organizations increasingly reliant on social media platforms for generating distribution,&amp;lt;ref&amp;gt;{{cite web|url=https://www.bbc.co.uk/news/uk-36528256|title=Social media 'outstrips TV' as news source for young people|date=15 June 2016|author=Wakefield, Jane|work=BBC News|url-status=live|archiveurl=https://web.archive.org/web/20160624000744/http://www.bbc.co.uk/news/uk-36528256|archivedate=24 June 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; major publishers now use artificial intelligence (AI) technology to post stories more effectively and generate higher volumes of traffic.&amp;lt;ref&amp;gt;{{cite web|url=https://www.bbc.co.uk/news/business-36837824|title=So you think you chose to read this article?|date=22 July 2016|author=Smith, Mark|work=BBC News|url-status=live|archiveurl=https://web.archive.org/web/20160725205007/http://www.bbc.co.uk/news/business-36837824|archivedate=25 July 2016|df=dmy-all}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
With social media sites overtaking TV as a source for news for young people and news organizations increasingly reliant on social media platforms for generating distribution, major publishers now use artificial intelligence (AI) technology to post stories more effectively and generate higher volumes of traffic.&lt;br /&gt;
&lt;br /&gt;
随着社交媒体网站取代电视成为年轻人获取新闻的来源，以及新闻机构越来越依赖社交媒体平台来发布新闻，大型出版商现在使用AI技术发布新闻，这样做效率更高且能带来更多的流量。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
AI can also produce [[Deepfake]]s, a content-altering technology. ZDNet reports, &amp;quot;It presents something that did not actually occur,&amp;quot; Though 88% of Americans believe Deepfakes can cause more harm than good, only 47% of them believe they can be targeted. The boom of election year also opens public discourse to threats of videos of falsified politician media.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.zdnet.com/article/half-of-americans-do-not-believe-deepfake-news-could-target-them-online/|title=Half of Americans do not believe deepfake news could target them online|last=Brown|first=Eileen|website=ZDNet|language=en|access-date=2019-12-03}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
AI can also produce Deepfakes, a content-altering technology. ZDNet reports, &amp;quot;It presents something that did not actually occur,&amp;quot; Though 88% of Americans believe Deepfakes can cause more harm than good, only 47% of them believe they can be targeted. The boom of election year also opens public discourse to threats of videos of falsified politician media.&lt;br /&gt;
&lt;br /&gt;
AI还可以用来换脸 ，这是一种改变内容的技术。至顶网报道说，“它展示出一些并没有真正发生的事情。”尽管88% 的美国人认为换脸弊大于利，但只有47%的人认为自己会成为换脸对象。选举年的盛况也让公众开始讨论起虚假政治视频的害处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===医疗 Healthcare ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Artificial intelligence in healthcare}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Laproscopic Surgery Robot.jpg|thumb| A patient-side surgical arm of [[Da Vinci Surgical System]]]]AI in healthcare is often used for classification, whether to automate initial evaluation of a CT scan or EKG or to identify high-risk patients for population health. The breadth of applications is rapidly increasing.在医疗保健中， AI通常被用于分类，它既可以自动对 CT 扫描或心电图EKG进行初步评估，又可以在人口健康调查中识别高风险患者。AI的应用范围正在迅速扩大。&lt;br /&gt;
&lt;br /&gt;
 A patient-side surgical arm of [[Da Vinci Surgical System]]AI in healthcare is often used for classification, whether to automate initial evaluation of a CT scan or EKG or to identify high-risk patients for population health. The breadth of applications is rapidly increasing.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As an example, AI is being applied to the high-cost problem of dosage issues—where findings suggested that AI could save $16 billion. In 2016, a groundbreaking study in California found that a mathematical formula developed with the help of AI correctly determined the accurate dose of immunosuppressant drugs to give to organ patients.&amp;lt;ref&amp;gt;{{Cite news|url=https://hbr.org/2018/05/10-promising-ai-applications-in-health-care|title=10 Promising AI Applications in Health Care|date=2018-05-10|work=Harvard Business Review|access-date=2018-08-28|archive-url=https://web.archive.org/web/20181215015645/https://hbr.org/2018/05/10-promising-ai-applications-in-health-care|archive-date=15 December 2018|url-status=dead}}&amp;lt;/ref&amp;gt; [[File:X-ray of a hand with automatic bone age calculation.jpg|thumb|[[Projectional radiography|X-ray]] of a hand, with automatic calculation of [[bone age]] by computer software，一只手的X光射线图，自动计算了骨龄]]&lt;br /&gt;
&lt;br /&gt;
As an example, AI is being applied to the high-cost problem of dosage issues—where findings suggested that AI could save $16 billion. In 2016, a groundbreaking study in California found that a mathematical formula developed with the help of AI correctly determined the accurate dose of immunosuppressant drugs to give to organ patients. X-ray of a hand, with automatic calculation of bone age by computer software]]&lt;br /&gt;
&lt;br /&gt;
例如研究结果表明，AI在高成本的剂量问题上可以节省160亿美元。2016年，加利福尼亚州的一项开创性研究发现，在AI的辅助下得到的一个数学公式给出了器官患者免疫抑制药的准确剂量。&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]） 例如研究结果表明，AI在高成本的剂量问题上可以节省160亿美元。 为省译&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Artificial intelligence is assisting doctors. According to Bloomberg Technology, Microsoft has developed AI to help doctors find the right treatments for cancer.&amp;lt;ref&amp;gt;{{cite news | author=Dina Bass | title=Microsoft Develops AI to Help Cancer Doctors Find the Right Treatments | url=https://www.bloomberg.com/news/articles/2016-09-20/microsoft-develops-ai-to-help-cancer-doctors-find-the-right-treatments | date=20 September 2016 | publisher=Bloomberg | url-status=live | archiveurl=https://web.archive.org/web/20170511103625/https://www.bloomberg.com/news/articles/2016-09-20/microsoft-develops-ai-to-help-cancer-doctors-find-the-right-treatments | archivedate=11 May 2017 | df=dmy-all | newspaper=Bloomberg.com }}&amp;lt;/ref&amp;gt; There is a great amount of research and drugs developed relating to cancer. In detail, there are more than 800 medicines and vaccines to treat cancer. This negatively affects the doctors, because there are too many options to choose from, making it more difficult to choose the right drugs for the patients. Microsoft is working on a project to develop a machine called &amp;quot;Hanover&amp;quot;{{citation needed|date=July 2019}}. Its goal is to memorize all the papers necessary to cancer and help predict which combinations of drugs will be most effective for each patient. One project that is being worked on at the moment is fighting [[acute myeloid leukemia|myeloid leukemia]], a fatal cancer where the treatment has not improved in decades. Another study was reported to have found that artificial intelligence was as good as trained doctors in identifying skin cancers.&amp;lt;ref&amp;gt;{{Cite news|url=https://www.bbc.co.uk/news/health-38717928|title=Artificial intelligence 'as good as cancer doctors'|last=Gallagher|first=James|date=26 January 2017|work=BBC News|language=en-GB|access-date=26 January 2017|url-status=live|archiveurl=https://web.archive.org/web/20170126133849/http://www.bbc.co.uk/news/health-38717928|archivedate=26 January 2017|df=dmy-all}}&amp;lt;/ref&amp;gt; Another study is using artificial intelligence to try to monitor multiple high-risk patients, and this is done by asking each patient numerous questions based on data acquired from live doctor to patient interactions.&amp;lt;ref&amp;gt;{{Citation|title=Remote monitoring of high-risk patients using artificial intelligence|date=18 Oct 1994|url=https://www.google.com/patents/US5357427|editor-last=Langen|editor2-last=Katz|editor3-last=Dempsey|editor-first=Pauline A.|editor2-first=Jeffrey S.|editor3-first=Gayle|issue=US5357427 A|accessdate=27 February 2017|url-status=live|archiveurl=https://web.archive.org/web/20170228090520/https://www.google.com/patents/US5357427|archivedate=28 February 2017|df=dmy-all}}&amp;lt;/ref&amp;gt; One study was done with transfer learning, the machine performed a diagnosis similarly to a well-trained ophthalmologist, and could generate a decision within 30 seconds on whether or not the patient should be referred for treatment, with more than 95% accuracy.&amp;lt;ref&amp;gt;{{Cite journal|url=https://www.cell.com/action/captchaChallenge?redirectUri=%2Fcell%2Fpdf%2FS0092-8674%2818%2930154-5.pdf|title=Identifying Medical Diagnoses and Treatable Diseases by Image-Based Deep Learning|last=Kermany|first=D|last2=Goldbaum|first2=M|journal=Cell|access-date=2018-12-18|last3=Zhang|first3=Kang|volume=172|issue=5|pages=1122–1131.e9|pmid=29474911|year=2018|doi=10.1016/j.cell.2018.02.010}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Artificial intelligence is assisting doctors. According to Bloomberg Technology, Microsoft has developed AI to help doctors find the right treatments for cancer. There is a great amount of research and drugs developed relating to cancer. In detail, there are more than 800 medicines and vaccines to treat cancer. This negatively affects the doctors, because there are too many options to choose from, making it more difficult to choose the right drugs for the patients. Microsoft is working on a project to develop a machine called &amp;quot;Hanover&amp;quot;. Its goal is to memorize all the papers necessary to cancer and help predict which combinations of drugs will be most effective for each patient. One project that is being worked on at the moment is fighting myeloid leukemia, a fatal cancer where the treatment has not improved in decades. Another study was reported to have found that artificial intelligence was as good as trained doctors in identifying skin cancers. Another study is using artificial intelligence to try to monitor multiple high-risk patients, and this is done by asking each patient numerous questions based on data acquired from live doctor to patient interactions. One study was done with transfer learning, the machine performed a diagnosis similarly to a well-trained ophthalmologist, and could generate a decision within 30 seconds on whether or not the patient should be referred for treatment, with more than 95% accuracy.&lt;br /&gt;
&lt;br /&gt;
AI还能协助医生。据彭博科技报道，微软已经开发出帮助医生找到正确的癌症治疗方法的AI。如今有大量的研究和药物开发与癌症有关，准确来说有800多种可以治疗癌症的药物和疫苗。这对医生来说并不是一件好事，因为选项太多，使得为病人选择合适的药物变得更难。微软正在开发一种名为“汉诺威”的机器。它的目标是记住所有与癌症有关的论文，并帮助预测哪些药物的组合对病人最有效。目前正在进行的一个项目是抗击髓系白血病，这是一种致命的癌症，几十年来治疗水平一直没有提高。据报道，另一项研究发现，AI在识别皮肤癌方面与训练有素的医生一样优秀。另一项研究是使用AI通过询问每个高风险患者多个问题监测他们，这些问题是基于从医生与患者的互动中获得的数据产生的。其中一项研究是通过转移学习完成的，机器进行的诊断类似于训练有素的眼科医生，可以在30秒内做出是否应该转诊治疗的决定，准确率超过95% 。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to [[CNN]], a recent study by surgeons at the Children's National Medical Center in Washington successfully demonstrated surgery with an autonomous robot. The team supervised the robot while it performed soft-tissue surgery, stitching together a pig's bowel during open surgery, and doing so better than a human surgeon, the team claimed.&amp;lt;ref&amp;gt;{{cite news|author=Senthilingam, Meera|title=Are Autonomous Robots Your next Surgeons?|work=CNN|publisher=Cable News Network|date=12 May 2016|accessdate=4 December 2016|url=http://www.cnn.com/2016/05/12/health/robot-surgeon-bowel-operation/|url-status=live|archiveurl=https://web.archive.org/web/20161203154119/http://www.cnn.com/2016/05/12/health/robot-surgeon-bowel-operation|archivedate=3 December 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; IBM has created its own artificial intelligence computer, the [[IBM Watson]], which has beaten human intelligence (at some levels). Watson has struggled to achieve success and adoption in healthcare.&amp;lt;ref&amp;gt;{{Cite web|url=https://spectrum.ieee.org/biomedical/diagnostics/how-ibm-watson-overpromised-and-underdelivered-on-ai-health-care|title=Full Page Reload|website=IEEE Spectrum: Technology, Engineering, and Science News|language=en|access-date=2019-09-03}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
According to CNN, a recent study by surgeons at the Children's National Medical Center in Washington successfully demonstrated surgery with an autonomous robot. The team supervised the robot while it performed soft-tissue surgery, stitching together a pig's bowel during open surgery, and doing so better than a human surgeon, the team claimed. IBM has created its own artificial intelligence computer, the IBM Watson, which has beaten human intelligence (at some levels). Watson has struggled to achieve success and adoption in healthcare.&lt;br /&gt;
&lt;br /&gt;
据 CNN 报道，华盛顿国家儿童医疗中心的外科医生最近的一项研究成功演示了一台自主机器人手术。研究组观看了机器人做软组织手术、在开放手术中缝合猪肠的整个过程，并认为比人类外科医生做得更好。IBM已经创造了自己的AI计算机——IBM 沃森，它在某种程度上已经超越了人类智能。沃森一直在努力实现医疗保健领域的应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===汽车 Automotive ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|driverless cars}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Advancements in AI have contributed to the growth of the automotive industry through the creation and evolution of self-driving vehicles. {{as of|2016}}, there are over 30 companies utilizing AI into the creation of [[self-driving car]]s. A few companies involved with AI include [[Tesla Motors|Tesla]], [[Google]], and [[Apple Inc.|Apple]].&amp;lt;ref&amp;gt;&amp;quot;33 Corporations Working On Autonomous Vehicles&amp;quot;. CB Insights. N.p., 11 August 2016. 12 November 2016.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Advancements in AI have contributed to the growth of the automotive industry through the creation and evolution of self-driving vehicles. , there are over 30 companies utilizing AI into the creation of self-driving cars. A few companies involved with AI include Tesla, Google, and Apple.&lt;br /&gt;
&lt;br /&gt;
在AI领域自动驾驶汽车的创造和发展促进了汽车行业的发展。目前有超过30家公司利用AI开发自动驾驶汽车，包括特斯拉、谷歌和苹果等 。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Many components contribute to the functioning of self-driving cars. These vehicles incorporate systems such as braking, lane changing, collision prevention, navigation and mapping. Together, these systems, as well as high-performance computers, are integrated into one complex vehicle.&amp;lt;ref&amp;gt;West, Darrell M. &amp;quot;Moving forward: Self-driving vehicles in China, Europe, Japan, Korea, and the United States&amp;quot;. Center for Technology Innovation at Brookings. N.p., September 2016. 12 November 2016.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Many components contribute to the functioning of self-driving cars. These vehicles incorporate systems such as braking, lane changing, collision prevention, navigation and mapping. Together, these systems, as well as high-performance computers, are integrated into one complex vehicle.&lt;br /&gt;
&lt;br /&gt;
自动驾驶汽车的功能的实现需要很多组件。这些车辆集成了诸如刹车、换车道、防撞、导航和测绘等系统。这些系统以及高性能计算机被装配到一辆复杂的车中。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Recent developments in autonomous automobiles have made the innovation of self-driving trucks possible, though they are still in the testing phase. The UK government has passed legislation to begin testing of self-driving truck platoons in 2018.&amp;lt;ref&amp;gt;{{cite journal|last1=Burgess|first1=Matt|title=The UK is about to Start Testing Self-Driving Truck Platoons|url=https://www.wired.co.uk/article/uk-trial-self-driving-trucks-platoons-roads|journal=Wired UK|accessdate=20 September 2017|url-status=live|archiveurl=https://web.archive.org/web/20170922055917/http://www.wired.co.uk/article/uk-trial-self-driving-trucks-platoons-roads|archivedate=22 September 2017|df=dmy-all|date=2017-08-24}}&amp;lt;/ref&amp;gt; Self-driving truck platoons are a fleet of self-driving trucks following the lead of one non-self-driving truck, so the truck platoons aren't entirely autonomous yet. Meanwhile, the Daimler, a German automobile corporation, is testing the Freightliner Inspiration which is a semi-autonomous truck that will only be used on the highway.&amp;lt;ref&amp;gt;{{cite journal|last1=Davies|first1=Alex|title=World's First Self-Driving Semi-Truck Hits the Road|url=https://www.wired.com/2015/05/worlds-first-self-driving-semi-truck-hits-road/|journal=WIRED|accessdate=20 September 2017|url-status=live|archiveurl=https://web.archive.org/web/20171028222802/https://www.wired.com/2015/05/worlds-first-self-driving-semi-truck-hits-road/|archivedate=28 October 2017|df=dmy-all|date=2015-05-05}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Recent developments in autonomous automobiles have made the innovation of self-driving trucks possible, though they are still in the testing phase. The UK government has passed legislation to begin testing of self-driving truck platoons in 2018. Self-driving truck platoons are a fleet of self-driving trucks following the lead of one non-self-driving truck, so the truck platoons aren't entirely autonomous yet. Meanwhile, the Daimler, a German automobile corporation, is testing the Freightliner Inspiration which is a semi-autonomous truck that will only be used on the highway.&lt;br /&gt;
&lt;br /&gt;
自动驾驶汽车的最新发展使自动驾驶卡车的创新成为可能，尽管它们仍处于测试阶段。英国政府已通过立法，将于2018年开始测试自动驾驶卡车列队行驶。自动驾驶卡车列队是指一排自动驾驶卡车跟随一辆非自动驾驶卡车，所以卡车排还不是完全自动的。与此同时，德国汽车公司戴姆勒正在测试Freightliner Inspiration，这是一种只在高速公路上行驶的半自动卡车。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
One main factor that influences the ability for a driver-less automobile to function is mapping. In general, the vehicle would be pre-programmed with a map of the area being driven. This map would include data on the approximations of street light and curb heights in order for the vehicle to be aware of its surroundings. However, Google has been working on an algorithm with the purpose of eliminating the need for pre-programmed maps and instead, creating a device that would be able to adjust to a variety of new surroundings.&amp;lt;ref&amp;gt;McFarland, Matt. &amp;quot;Google's artificial intelligence breakthrough may have a huge impact on self-driving cars and much more&amp;quot;. ''The Washington Post'' 25 February 2015. Infotrac Newsstand. 24 October 2016&amp;lt;/ref&amp;gt; Some self-driving cars are not equipped with steering wheels or brake pedals, so there has also been research focused on creating an algorithm that is capable of maintaining a safe environment for the passengers in the vehicle through awareness of speed and driving conditions.&amp;lt;ref&amp;gt;&amp;quot;Programming safety into self-driving cars&amp;quot;. National Science Foundation. N.p., 2 February 2015. 24 October 2016.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
One main factor that influences the ability for a driver-less automobile to function is mapping. In general, the vehicle would be pre-programmed with a map of the area being driven. This map would include data on the approximations of street light and curb heights in order for the vehicle to be aware of its surroundings. However, Google has been working on an algorithm with the purpose of eliminating the need for pre-programmed maps and instead, creating a device that would be able to adjust to a variety of new surroundings. Some self-driving cars are not equipped with steering wheels or brake pedals, so there has also been research focused on creating an algorithm that is capable of maintaining a safe environment for the passengers in the vehicle through awareness of speed and driving conditions.&lt;br /&gt;
&lt;br /&gt;
影响无人驾驶汽车性能的一个主要因素是地图。一般来说，车辆将预先编程行驶区域的地图。这张地图将包括街灯和路缘高度的近似数据，让车辆能够感知周围环境。然而谷歌一直在研究一种不需要预编程地图的算法，创造一种能够适应各种新环境的设备。一些自动驾驶汽车没有配备方向盘或刹车踏板，因此也有研究致力于创建感知速度和驾驶条件的算法，为车内乘客提供一个安全的环境。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another factor that is influencing the ability of a driver-less automobile is the safety of the passenger. To make a driver-less automobile, engineers must program it to handle high-risk situations. These situations could include a head-on collision with pedestrians. The car's main goal should be to make a decision that would avoid hitting the pedestrians and saving the passengers in the car. But there is a possibility the car would need to make a decision that would put someone in danger. In other words, the car would need to decide to save the pedestrians or the passengers.&amp;lt;ref&amp;gt;ArXiv, E. T. (26 October 2015). Why Self-Driving Cars Must Be Programmed to Kill. Retrieved 17 November 2017, from https://www.technologyreview.com/s/542626/why-self-driving-cars-must-be-programmed-to-kill/{{Dead link|date=October 2019 |bot=InternetArchiveBot |fix-attempted=yes }}&amp;lt;/ref&amp;gt; The programming of the car in these situations is crucial to a successful driver-less automobile.&lt;br /&gt;
&lt;br /&gt;
Another factor that is influencing the ability of a driver-less automobile is the safety of the passenger. To make a driver-less automobile, engineers must program it to handle high-risk situations. These situations could include a head-on collision with pedestrians. The car's main goal should be to make a decision that would avoid hitting the pedestrians and saving the passengers in the car. But there is a possibility the car would need to make a decision that would put someone in danger. In other words, the car would need to decide to save the pedestrians or the passengers. The programming of the car in these situations is crucial to a successful driver-less automobile.&lt;br /&gt;
&lt;br /&gt;
衡量无人驾驶汽车能力的另一个因素是乘客的安全。工程师们必须对无人驾驶汽车进行编程，使其能够处理比如与行人正面相撞的高风险的情况。这辆车的主要目标应该是做出一个避免撞到行人，保护车内的乘客的决定。但是有时汽车有可能也会将某人置于危险之中。也就是，汽车需要决定是拯救行人还是乘客。汽车在这些情况下的编程对于一辆成功的无人驾驶汽车是至关重要的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===金融和经济 Finance and economics ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Financial institution]]s have long used [[artificial neural network]] systems to detect charges or claims outside of the norm, flagging these for human investigation. The use of AI in [[banking]] can be traced back to 1987 when [[Security Pacific National Bank]] in US set-up a Fraud Prevention Task force to counter the unauthorized use of debit cards.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.latimes.com/archives/la-xpm-1990-01-17-fi-233-story.html|title=Impact of Artificial Intelligence on Banking|last=Christy|first=Charles A.|website=latimes.com|access-date=2019-09-10|date=17 January 1990}}&amp;lt;/ref&amp;gt; Programs like Kasisto and Moneystream are using AI in financial services.&lt;br /&gt;
&lt;br /&gt;
Financial institutions have long used artificial neural network systems to detect charges or claims outside of the norm, flagging these for human investigation. The use of AI in banking can be traced back to 1987 when Security Pacific National Bank in US set-up a Fraud Prevention Task force to counter the unauthorized use of debit cards. Programs like Kasisto and Moneystream are using AI in financial services.&lt;br /&gt;
&lt;br /&gt;
长期以来，金融机构一直使用人工神经网络系统来检测超出常规的费用或索赔，并将其标记起来等待人工调查。AI在银行业的应用可以追溯到1987年，当时美国国家安全太平洋银行成立了一个防防诈特别小组，以打击未经授权使用借记卡的行为。金融服务领域的如Kasisto 和 Moneystream等程序正在使用AI技术。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Banks use artificial intelligence systems today to organize operations, maintain book-keeping, invest in stocks, and manage properties. AI can react to changes overnight or when business is not taking place.&amp;lt;ref name=&amp;quot;Eleanor&amp;quot;&amp;gt;{{cite web|url=https://www.icas.com/ca-today-news/how-accountancy-and-finance-are-using-artificial-intelligence|title=Accounting, automation and AI|first=Eleanor|last=O'Neill|website=icas.com|language=English|date=31 July 2016|access-date=18 November 2016|url-status=live|archiveurl=https://web.archive.org/web/20161118165901/https://www.icas.com/ca-today-news/how-accountancy-and-finance-are-using-artificial-intelligence|archivedate=18 November 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; In August 2001, robots beat humans in a simulated [[stock trader|financial trading]] competition.&amp;lt;ref&amp;gt;[http://news.bbc.co.uk/2/hi/business/1481339.stm Robots Beat Humans in Trading Battle.] {{webarchive|url=https://web.archive.org/web/20090909001249/http://news.bbc.co.uk/2/hi/business/1481339.stm |date=9 September 2009 }} BBC.com (8 August 2001)&amp;lt;/ref&amp;gt; AI has also reduced fraud and financial crimes by [[Statistical software|monitoring]] [[behavioral pattern]]s of users for any abnormal changes or anomalies.&amp;lt;ref name=&amp;quot;fsroundtable.org&amp;quot;&amp;gt;{{Cite news|url=http://fsroundtable.org/cto-corner-artificial-intelligence-use-in-financial-services/|title=CTO Corner: Artificial Intelligence Use in Financial Services – Financial Services Roundtable|date=2 April 2015|work=Financial Services Roundtable|language=en-US|access-date=18 November 2016|url-status=dead|archiveurl=https://web.archive.org/web/20161118165842/http://fsroundtable.org/cto-corner-artificial-intelligence-use-in-financial-services/|archivedate=18 November 2016|df=dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=https://www.sas.com/en_ae/solutions/ai.html|title=Artificial Intelligence Solutions, AI Solutions|website=www.sas.com}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=https://www.latimes.com/business/la-fi-palantir-sales-ipo-20190107-story.html|title=Palantir once mocked the idea of salespeople. Now it's hiring them|last=Chapman|first=Lizette|website=latimes.com|access-date=2019-02-28|date=7 January 2019}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Banks use artificial intelligence systems today to organize operations, maintain book-keeping, invest in stocks, and manage properties. AI can react to changes overnight or when business is not taking place. In August 2001, robots beat humans in a simulated financial trading competition. AI has also reduced fraud and financial crimes by monitoring behavioral patterns of users for any abnormal changes or anomalies.&lt;br /&gt;
&lt;br /&gt;
如今，银行使用AI系统来组织业务、记账、投资股票和管理房地产。AI可以对突然的变化和没有业务的情况做出反应。2001年8月，机器人在一场模拟金融交易竞赛中击败了人类。AI还通过监测用户的行为模式发现异常变化或异常现象，减少了欺诈和金融犯罪。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
AI is increasingly being used by [[Corporate finance|corporations]]. [[Jack Ma]] has controversially predicted that AI [[CEO]]'s are 30 years away.&amp;lt;ref&amp;gt;{{Cite web|url=https://money.cnn.com/2017/04/24/technology/alibaba-jack-ma-30-years-pain-robot-ceo/index.html|title=Jack Ma: In 30 years, the best CEO could be a robot|first=Sherisse|last=Pham|date=24 April 2017|website=CNNMoney}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=https://venturebeat.com/2016/10/22/cant-find-a-perfect-ceo-create-an-ai-one-yourself/|title=Can't find a perfect CEO? Create an AI one yourself|date=22 October 2016}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
AI is increasingly being used by corporations. Jack Ma has controversially predicted that AI CEO's are 30 years away.&lt;br /&gt;
&lt;br /&gt;
人AI正越来越多地被企业所使用。马云发表过一个有争议的预测：距离AI当上CEO还有30年的时间。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The use of AI machines in the market in applications such as online trading and decision making has changed major economic theories.&amp;lt;ref&amp;gt;{{cite book |last1=Marwala |first1= Tshilidzi| last2=Hurwitz |first2= Evan |title=Artificial Intelligence and Economic Theory: Skynet in the Market |year=2017 |publisher=[[Springer Science+Business Media|Springer]] |location=London |isbn=978-3-319-66104-9}}&amp;lt;/ref&amp;gt; For example, AI-based buying and selling platforms have changed the law of [[supply and demand]] in that it is now possible to easily estimate individualized demand and supply curves and thus individualized pricing. Furthermore, AI machines reduce [[information asymmetry]] in the market and thus making markets more efficient while reducing the volume of trades{{citation needed|date=July 2019}}. Furthermore, AI in the markets limits the consequences of behavior in the markets again making markets more efficient{{citation needed|date=July 2019}}. Other theories where AI has had impact include in [[rational choice]], [[rational expectations]], [[game theory]], [[Lewis turning point]], [[portfolio optimization]] and [[counterfactual thinking]]{{citation needed|date=July 2019}}.. In August 2019, the [[American Institute of Certified Public Accountants|AICPA]] introduced AI training course for accounting professionals.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.mileseducation.com/finance/artificial_intelligence|title=Miles Education {{!}} Future Of Finance {{!}} Blockchain Fundamentals for F&amp;amp;A Professionals Certificate|website=www.mileseducation.com|access-date=2019-09-26|archive-url=https://web.archive.org/web/20190926102133/https://www.mileseducation.com/finance/artificial_intelligence|archive-date=26 September 2019|url-status=dead}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The use of AI machines in the market in applications such as online trading and decision making has changed major economic theories. For example, AI-based buying and selling platforms have changed the law of supply and demand in that it is now possible to easily estimate individualized demand and supply curves and thus individualized pricing. Furthermore, AI machines reduce information asymmetry in the market and thus making markets more efficient while reducing the volume of trades. Furthermore, AI in the markets limits the consequences of behavior in the markets again making markets more efficient. Other theories where AI has had impact include in rational choice, rational expectations, game theory, Lewis turning point, portfolio optimization and counterfactual thinking.. In August 2019, the AICPA introduced AI training course for accounting professionals.&lt;br /&gt;
&lt;br /&gt;
AI机器在市场上如在线交易和决策的应用改变了主流经济理论。例如，基于AI的买卖平台改变了供求规律，因为现在可以通过AI很容易地估计个性化需求和供给曲线，从而实现个性化的定价。此外，AI减少了交易的信息不对称，在使市场更有效率的同时也减少了交易量。此外，AI限定了市场行为的后果，再次提高了交易效率。AI影响的其他理论包括理性选择、理性预期、博弈论、刘易斯转折点、投资组合优化和反事实思维。2019年8月，AICPA 为会计专业人员开设了 AI 培训课程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===网络安全 Cybersecurity ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{More citations needed section|date=January 2020}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The [[cybersecurity]] arena faces significant challenges in the form of large-scale hacking attacks of different types that harm organizations of all kinds and create billions of dollars in business damage. Artificial intelligence and Natural Language Processing (NLP) has begun to be used by security companies - for example, SIEM (Security Information and Event Management) solutions.  The more advanced of these solutions use AI and NLP to automatically sort the data in networks into high risk and low-risk information.  This enables security teams to focus on the attacks that have the potential to do real harm to the organization, and not become victims of attacks such as [[Denial-of-service attack|Denial of Service (DoS)]], [[Malware]] and others.&lt;br /&gt;
&lt;br /&gt;
The cybersecurity arena faces significant challenges in the form of large-scale hacking attacks of different types that harm organizations of all kinds and create billions of dollars in business damage. Artificial intelligence and Natural Language Processing (NLP) has begun to be used by security companies - for example, SIEM (Security Information and Event Management) solutions.  The more advanced of these solutions use AI and NLP to automatically sort the data in networks into high risk and low-risk information.  This enables security teams to focus on the attacks that have the potential to do real harm to the organization, and not become victims of attacks such as Denial of Service (DoS), Malware and others.&lt;br /&gt;
&lt;br /&gt;
网络安全领域面临着各种大规模黑客攻击的重大挑战，这些攻击损害到了很多组织，造成了数十亿美元的商业损失。网络安全公司已经开始使用AI和自然语言处理(NLP) ，例如，SIEM (Security Information and Event Management,安全信息和事件管理)解决方案。更高级的解决方案使用AI和自然语言处理将网络中的数据划分为高风险和低风险两类信息。这使得安全团队能够专注于对付那些有可能对组织造成真正伤害的攻击，不沦为分布式拒绝服务攻击、恶意软件和其他攻击的受害者。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===政府 Government ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Artificial intelligence in government}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Artificial intelligence in government consists of applications and regulation. Artificial intelligence paired with [[facial recognition system]]s may be used for [[mass surveillance]]. This is already the case in some parts of China.&amp;lt;ref&amp;gt;{{Cite news|url=https://www.nytimes.com/2019/05/22/world/asia/china-surveillance-xinjiang.html|title=How China Uses High-Tech Surveillance to Subdue Minorities|first1=Chris|last1=Buckley|first2=Paul|last2=Mozur|date=22 May 2019|work=The New York Times}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=http://social.techcrunch.com/2019/05/03/china-smart-city-exposed/|title=Security lapse exposed a Chinese smart city surveillance system}}&amp;lt;/ref&amp;gt; An artificial intelligence has also competed in the Tama City [[AI mayor|mayoral elections]] in 2018.&lt;br /&gt;
&lt;br /&gt;
Artificial intelligence in government consists of applications and regulation. Artificial intelligence paired with facial recognition systems may be used for mass surveillance. This is already the case in some parts of China. An artificial intelligence has also competed in the Tama City mayoral elections in 2018.&lt;br /&gt;
&lt;br /&gt;
政府AI包括应用和管理。AI与人脸识别系统相结合可用于大规模监控。在中国的一些地区已经开始使用这种技术。一个AI还参与了2018年关都地区市长选举的角逐。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In 2019, the tech city of Bengaluru in India is set to deploy AI managed traffic signal systems across the 387 traffic signals in the city. This system will involve use of cameras to ascertain traffic density and accordingly calculate the time needed to clear the traffic volume which will determine the signal duration for vehicular traffic across streets.&amp;lt;ref&amp;gt;{{Cite web|url=https://nextbigwhat.com/ai-traffic-signals-to-be-installed-in-bengaluru-soon/|title=AI traffic signals to be installed in Bengaluru soon|date=2019-09-24|website=NextBigWhat|language=en-US|access-date=2019-10-01}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In 2019, the tech city of Bengaluru in India is set to deploy AI managed traffic signal systems across the 387 traffic signals in the city. This system will involve use of cameras to ascertain traffic density and accordingly calculate the time needed to clear the traffic volume which will determine the signal duration for vehicular traffic across streets.&lt;br /&gt;
&lt;br /&gt;
2019年，印度硅谷班加罗尔将在该市的387个交通信号灯上部署AI控制的交通信号系统。这个系统将使用摄像头来确定交通密度，并据此计算清除交通量所需的时间，决定街道上的车辆交通灯的持续时间。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===与法律有关的专业 Law-related professions ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Legal informatics#Artificial intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Artificial intelligence (AI) is becoming a mainstay component of law-related professions. In some circumstances, this analytics-crunching technology is using algorithms and machine learning to do work that was previously done by entry-level lawyers.{{Citation needed|date=December 2019}}&lt;br /&gt;
&lt;br /&gt;
Artificial intelligence (AI) is becoming a mainstay component of law-related professions. In some circumstances, this analytics-crunching technology is using algorithms and machine learning to do work that was previously done by entry-level lawyers.&lt;br /&gt;
&lt;br /&gt;
AI正在成为法律相关专业的主要组成部分。有时人们通过AI分析处理技术使用算法和机器学习来完成以前由初级律师完成的工作。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[Electronic discovery|Electronic Discovery (eDiscovery)]], the industry has been focused on machine learning (predictive coding/technology assisted review), which is a subset of AI. To add to the soup of applications, Natural Language Processing (NLP) and Automated Speech Recognition (ASR) are also in vogue in the industry.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.ft.com/content/fef40df0-4a6a-11e9-bde6-79eaea5acb64|title=AI learns to read Korean, so you don't have to|last=Croft|first=Jane|date=2019-05-02|website=Financial Times|language=en-GB|access-date=2019-12-19}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In Electronic Discovery (eDiscovery), the industry has been focused on machine learning (predictive coding/technology assisted review), which is a subset of AI. To add to the soup of applications, Natural Language Processing (NLP) and Automated Speech Recognition (ASR) are also in vogue in the industry.&lt;br /&gt;
&lt;br /&gt;
电子资料档案查询(eDiscovery)产业一直侧重机器学习(预测编码 / 技术辅助评审) ，这是AI的一个子领域。自然语言处理(NLP)和自动语音识别(ASR)也正在这个行业流行起来。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===电子游戏 Video games ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Artificial intelligence (video games)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In video games, artificial intelligence is routinely used to generate dynamic purposeful behavior in [[non-player character]]s (NPCs). In addition, well-understood AI techniques are routinely used for [[pathfinding]]. Some researchers consider NPC AI in games to be a &amp;quot;solved problem&amp;quot; for most production tasks. Games with more atypical AI include the AI director of ''[[Left 4 Dead]]'' (2008) and the neuroevolutionary training of platoons in ''[[Supreme Commander 2]]'' (2010).&amp;lt;ref&amp;gt;{{cite news|url=https://www.economist.com/news/science-and-technology/21721890-games-help-them-understand-reality-why-ai-researchers-video-games|title=Why AI researchers like video games|website=The Economist|url-status=live|archiveurl=https://web.archive.org/web/20171005051028/https://www.economist.com/news/science-and-technology/21721890-games-help-them-understand-reality-why-ai-researchers-video-games|archivedate=5 October 2017|df=dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Yannakakis, G. N. (2012, May). Game AI revisited. In Proceedings of the 9th conference on Computing Frontiers (pp. 285–292). ACM.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In video games, artificial intelligence is routinely used to generate dynamic purposeful behavior in non-player characters (NPCs). In addition, well-understood AI techniques are routinely used for pathfinding. Some researchers consider NPC AI in games to be a &amp;quot;solved problem&amp;quot; for most production tasks. Games with more atypical AI include the AI director of Left 4 Dead (2008) and the neuroevolutionary training of platoons in Supreme Commander 2 (2010).&lt;br /&gt;
&lt;br /&gt;
在视频游戏中，AI通常被用来让非玩家角色( non-player characters，NPCs)中做出动态的目的性行为。此外，还常用简单的AI技术寻路。一些研究人员认为，对于大多数生产任务来说，游戏中的 NPC AI 是一个“解决了的问题”。含更多非典型 AI 的游戏有《求生之路》（Left 4 Dead,2008)中的 AI 导演和《最高指挥官2》(Supreme Commander 2,2010)中的 '''&amp;lt;font color=#32cd32&amp;gt;对排神经进化训练&amp;lt;/font&amp;gt;'''。&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]） neuroevolutionary training of platoons 未找到标准翻译&lt;br /&gt;
&lt;br /&gt;
===军事 Military ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Further|Artificial intelligence arms race|Lethal autonomous weapon|Unmanned combat aerial vehicle}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The United States and other nations are developing AI applications for a range of military functions.&amp;lt;ref name=&amp;quot;:2&amp;quot;&amp;gt;{{Cite book|last=Congressional Research Service|first=|url=https://fas.org/sgp/crs/natsec/R45178.pdf|title=Artificial Intelligence and National Security|publisher=Congressional Research Service|year=2019|isbn=|location=Washington, DC|pages=}}[[Template:PD-notice|PD-notice]]&amp;lt;/ref&amp;gt; The main military applications of Artificial Intelligence and Machine Learning are to enhance C2, Communications, Sensors, Integration and Interoperability.&amp;lt;ref name=&amp;quot;AI&amp;quot;&amp;gt;{{cite web|title=Artificial intelligence as the basis of future control networks.|url=https://www.researchgate.net/publication/334573170|last=Slyusar|first=Vadym|date=2019|work=Preprint}}&amp;lt;/ref&amp;gt; AI research is underway in the fields of intelligence collection and analysis, logistics, cyber operations, information operations, command and control, and in a variety of semiautonomous and autonomous vehicles.&amp;lt;ref name=&amp;quot;:2&amp;quot; /&amp;gt; Artificial Intelligence technologies enable coordination of sensors and effectors, threat detection and identification, marking of enemy positions, target acquisition, coordination and deconfliction of distributed Join Fires between networked combat vehicles and tanks also inside Manned and Unmanned Teams (MUM-T).&amp;lt;ref name=AI /&amp;gt; AI has been incorporated into military operations in Iraq and Syria.&amp;lt;ref name=&amp;quot;:2&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The United States and other nations are developing AI applications for a range of military functions. The main military applications of Artificial Intelligence and Machine Learning are to enhance C2, Communications, Sensors, Integration and Interoperability. AI research is underway in the fields of intelligence collection and analysis, logistics, cyber operations, information operations, command and control, and in a variety of semiautonomous and autonomous vehicles. Artificial Intelligence technologies enable coordination of sensors and effectors, threat detection and identification, marking of enemy positions, target acquisition, coordination and deconfliction of distributed Join Fires between networked combat vehicles and tanks also inside Manned and Unmanned Teams (MUM-T). AI has been incorporated into military operations in Iraq and Syria.&lt;br /&gt;
&lt;br /&gt;
美国和其他国家正在为一系列军事功能开发AI应用程序。AI和机器学习的主要军事应用是增强 C2、通信、传感器、集成和互操作性。情报收集和分析、后勤、网络操作、信息操作、指挥和控制以及各种半自动和自动车辆等领域正在进行AI研究。AI技术能够协调传感器和效应器、探测威胁和识别、标记敌人阵地、目标获取、协调和消除有人和无人小组(MUM-T)、联网作战车辆和坦克内部的分布式联合火力。伊拉克和叙利亚的军事行动采用了AI。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Worldwide annual military spending on robotics rose from US$5.1 billion in 2010 to US$7.5 billion in 2015.&amp;lt;ref&amp;gt;{{cite news|title=Getting to grips with military robotics|url=https://www.economist.com/news/special-report/21735478-autonomous-robots-and-swarms-will-change-nature-warfare-getting-grips|accessdate=7 February 2018|work=The Economist|date=25 January 2018|language=en}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite web|title=Autonomous Systems: Infographic|url=https://www.siemens.com/innovation/en/home/pictures-of-the-future/digitalization-and-software/autonomous-systems-infographic.html|website=siemens.com|accessdate=7 February 2018|language=en}}&amp;lt;/ref&amp;gt; Military drones capable of autonomous action are widely considered a useful asset.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.cnas.org/publications/reports/understanding-chinas-ai-strategy|title=Understanding China's AI Strategy|last=Allen|first=Gregory|date=February 6, 2019|website=www.cnas.org/publications/reports/understanding-chinas-ai-strategy|publisher=Center for a New American Security|archive-url=https://web.archive.org/web/20190317004017/https://www.cnas.org/publications/reports/understanding-chinas-ai-strategy|archive-date=March 17, 2019|url-status=|access-date=March 17, 2019}}&amp;lt;/ref&amp;gt; Many artificial intelligence researchers seek to distance themselves from military applications of AI.&amp;lt;ref&amp;gt;{{cite news|last1=Metz|first1=Cade|title=Pentagon Wants Silicon Valley's Help on A.I.|url=https://www.nytimes.com/2018/03/15/technology/military-artificial-intelligence.html|accessdate=19 March 2018|work=The New York Times|date=15 March 2018}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Worldwide annual military spending on robotics rose from US$5.1 billion in 2010 to US$7.5 billion in 2015. Military drones capable of autonomous action are widely considered a useful asset. Many artificial intelligence researchers seek to distance themselves from military applications of AI.&lt;br /&gt;
&lt;br /&gt;
全球每年在机器人方面的军费开支从2010年的51亿美元增加到2015年的75亿美元。人们都认为具有自主行动能力的军用无人机是价值的。许多AI研究人员试图远离AI的军事应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===服务 Hospitality ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In the hospitality industry, Artificial Intelligence based solutions are used to reduce staff load and increase efficiency&amp;lt;ref&amp;gt;{{cite web|title=Role of AI in travel and Hospitality Industry|url=https://www.infosys.com/industries/travel-hospitality/documents/ai-travel-hospitality.pdf|accessdate=14 January 2020|work=Infosys|date=2018}}&amp;lt;/ref&amp;gt; by cutting repetitive tasks frequency, trends analysis, guest interaction, and customer needs prediction.&amp;lt;ref&amp;gt;{{cite web|title=Advanced analytics in hospitality|url=https://www.mckinsey.com/business-functions/mckinsey-digital/our-insights/advanced-analytics-in-hospitality|accessdate=14 January 2020|work=McKinsey &amp;amp; Company|date=2017}}&amp;lt;/ref&amp;gt; Hotel services backed by Artificial Intelligence are represented in the form of a chatbot,&amp;lt;ref&amp;gt;{{cite web|title=Current applications of Artificial Intelligence in tourism and hospitality|url=https://www.researchgate.net/publication/333242550|accessdate=14 January 2020|work=Sinteza|date=2019}}&amp;lt;/ref&amp;gt; application, virtual voice assistant and service robots.&lt;br /&gt;
&lt;br /&gt;
In the hospitality industry, Artificial Intelligence based solutions are used to reduce staff load and increase efficiency by cutting repetitive tasks frequency, trends analysis, guest interaction, and customer needs prediction. Hotel services backed by Artificial Intelligence are represented in the form of a chatbot, application, virtual voice assistant and service robots.&lt;br /&gt;
&lt;br /&gt;
在服务业，基于AI的解决方案通过减少重复性任务的频率、分析趋势、与客户活动和预测客户需求来减少员工负担和提高效率。使用AI的酒店服务以聊天机器人、应用程序、虚拟语音助手和服务机器人的形式呈现。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===审计 Audit ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
For financial statements audit, AI makes continuous audit possible. AI tools could analyze many sets of different information immediately. The potential benefit would be the overall audit risk will be reduced, the level of assurance will be increased and the time duration of audit will be reduced.&amp;lt;ref&amp;gt;{{cite journal|last1=Chang|first1=Hsihui|last2=Kao|first2=Yi-Ching|last3=Mashruwala|first3=Raj|last4=Sorensen|first4=Susan M.|title=Technical Inefficiency, Allocative Inefficiency, and Audit Pricing|journal=Journal of Accounting, Auditing &amp;amp; Finance|volume=33|issue=4|date=10 April 2017|pages=580–600|doi=10.1177/0148558X17696760}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For financial statements audit, AI makes continuous audit possible. AI tools could analyze many sets of different information immediately. The potential benefit would be the overall audit risk will be reduced, the level of assurance will be increased and the time duration of audit will be reduced.&lt;br /&gt;
&lt;br /&gt;
在财务报表审计这方面，AI 可以做到持续审计。AI工具可以迅速分析多组不同的信息。可能的好处是减少了总体审计风险，提高审计水平，缩短审计时间。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===广告 Advertising ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
It is possible to use AI to predict or generalize the behavior of customers from their [[digital footprints]] in order to target them with personalized promotions or build customer personas automatically.&amp;lt;ref name=&amp;quot;Matz et al 2017&amp;quot;&amp;gt;Matz, S. C., et al. &amp;quot;Psychological targeting as an effective approach to digital mass persuasion.&amp;quot; Proceedings of the National Academy of Sciences (2017): 201710966.&amp;lt;/ref&amp;gt; A documented case reports that online gambling companies were using AI to improve customer targeting.&amp;lt;ref&amp;gt;{{cite web |last1=Busby |first1=Mattha |title=Revealed: how bookies use AI to keep gamblers hooked |url=https://www.theguardian.com/technology/2018/apr/30/bookies-using-ai-to-keep-gamblers-hooked-insiders-say |website=the Guardian |language=en |date=30 April 2018}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
It is possible to use AI to predict or generalize the behavior of customers from their digital footprints in order to target them with personalized promotions or build customer personas automatically. A documented case reports that online gambling companies were using AI to improve customer targeting.&lt;br /&gt;
&lt;br /&gt;
AI通过客户的数字足迹预测或归纳客户的行为，投放定制广告或者自动构建顾客角色。有记录报告称，线上赌博公司正在使用AI来改善客户定位功能。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Moreover, the application of [[Personality computing]] AI models can help reducing the cost of advertising campaigns by adding psychological targeting to more traditional sociodemographic or behavioral targeting.&amp;lt;ref name=&amp;quot;Celli et al. 2017&amp;quot;&amp;gt;Celli, Fabio, Pietro Zani Massani, and Bruno Lepri. &amp;quot;Profilio: Psychometric Profiling to Boost Social Media Advertising.&amp;quot; Proceedings of the 2017 ACM on Multimedia Conference. ACM, 2017  [https://www.researchgate.net/publication/320542489_Profilio_Psychometric_Profiling_to_Boost_Social_Media_Advertising]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Moreover, the application of Personality computing AI models can help reducing the cost of advertising campaigns by adding psychological targeting to more traditional sociodemographic or behavioral targeting.&lt;br /&gt;
&lt;br /&gt;
此外，个性计算AI模型通过结合心理定位和传统的社会人口学或行为定位方法，帮助降低广告投放的成本。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===艺术 Art ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Further|Computer art}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Artificial Intelligence has inspired numerous creative applications including its usage to produce visual art. The exhibition &amp;quot;Thinking Machines: Art and Design in the Computer Age, 1959–1989&amp;quot; at MoMA&amp;lt;ref name=&amp;quot;moma&amp;quot;&amp;gt;{{Cite web|url=https://www.moma.org/calendar/exhibitions/3863|title=Thinking Machines: Art and Design in the Computer Age, 1959–1989|website=The Museum of Modern Art|language=en|access-date=2019-07-23}}&amp;lt;/ref&amp;gt; provides a good overview of the historical applications of AI for art, architecture, and design. Recent exhibitions showcasing the usage of AI to produce art include the Google-sponsored benefit and auction at the Gray Area Foundation in San Francisco, where artists experimented with the [[DeepDream]] algorithm&amp;lt;ref name = wp1&amp;gt;[https://www.washingtonpost.com/news/innovations/wp/2016/03/10/googles-psychedelic-paint-brush-raises-the-oldest-question-in-art/ Retrieved July 29]&amp;lt;/ref&amp;gt; and the exhibition &amp;quot;Unhuman: Art in the Age of AI,&amp;quot; which took place in Los Angeles and Frankfurt in the fall of 2017.&amp;lt;ref name = sf&amp;gt;{{cite web|url=https://www.statefestival.org/program/2017/unhuman-art-in-the-age-of-ai |title=Unhuman: Art in the Age of AI – State Festival |publisher=Statefestival.org |date= |accessdate=2018-09-13}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;artsy&amp;quot;&amp;gt;{{Cite web|url=https://www.artsy.net/article/artsy-editorial-hard-painting-made-computer-human|title=It's Getting Hard to Tell If a Painting Was Made by a Computer or a Human|last=Chun|first=Rene|date=2017-09-21|website=Artsy|language=en|access-date=2019-07-23}}&amp;lt;/ref&amp;gt; In the spring of 2018, the Association of Computing Machinery dedicated a special magazine issue to the subject of computers and art highlighting the role of machine learning in the arts.&amp;lt;ref name = acm&amp;gt;[https://dl.acm.org/citation.cfm?id=3204480.3186697 Retrieved July 29]&amp;lt;/ref&amp;gt; The Austrian [[Ars Electronica]] and [[Museum of Applied Arts, Vienna]] opened exhibitions on AI in 2019.&amp;lt;ref name=&amp;quot;Ars Electronica Exhibition ''Understanding AI''&amp;quot;&amp;gt;{{Cite web|url=https://ars.electronica.art/center/en/exhibitions/ai/ |access-date=September 2019}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Museum of Applied Arts Exhibition ''Uncanny Values''&amp;quot;&amp;gt;{{Cite web|url=https://www.mak.at/en/program/exhibitions/uncanny_values |access-date=October 2019|title=MAK Wien - MAK Museum Wien}}&amp;lt;/ref&amp;gt; The Ars Electronica's 2019 festival &amp;quot;Out of the box&amp;quot; extensively thematized the role of arts for a sustainable societal transformation with AI.&amp;lt;ref name=&amp;quot;European Platform for Digital Humanism&amp;quot;&amp;gt;{{Cite web|url=https://ars.electronica.art/outofthebox/en/digital-humanism-conf/ |access-date=September 2019}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Artificial Intelligence has inspired numerous creative applications including its usage to produce visual art. The exhibition &amp;quot;Thinking Machines: Art and Design in the Computer Age, 1959–1989&amp;quot; at MoMA provides a good overview of the historical applications of AI for art, architecture, and design. Recent exhibitions showcasing the usage of AI to produce art include the Google-sponsored benefit and auction at the Gray Area Foundation in San Francisco, where artists experimented with the DeepDream algorithm and the exhibition &amp;quot;Unhuman: Art in the Age of AI,&amp;quot; which took place in Los Angeles and Frankfurt in the fall of 2017. In the spring of 2018, the Association of Computing Machinery dedicated a special magazine issue to the subject of computers and art highlighting the role of machine learning in the arts. The Austrian Ars Electronica and Museum of Applied Arts, Vienna opened exhibitions on AI in 2019. The Ars Electronica's 2019 festival &amp;quot;Out of the box&amp;quot; extensively thematized the role of arts for a sustainable societal transformation with AI.&lt;br /&gt;
&lt;br /&gt;
AI催生了许多在如视觉艺术等领域的创造性应用。在纽约现代艺术博物馆举办的“思考机器: 计算机时代的艺术与设计，1959-1989”展览概述了艺术、建筑和设计的历史中AI的应用。最近的展览展示了AI在艺术创作中的应用，包括谷歌赞助的旧金山灰色地带基金会(Gray Area Foundation)的慈善拍卖会，艺术家们在拍卖会中尝试了 DeepDream 算法，以及2017年秋天在洛杉矶和法兰克福举办的“非人类: AI时代的艺术”展览。2018年春天，计算机协会发行了一期主题为计算机和艺术的特刊，着重展示了机器学习在艺术中的作用。奥地利电子艺术博物馆和维也纳应用艺术博物馆于2019年开设了AI展览。2019年的电子艺术节 “Out of the box”将AI艺术在可持续社会转型中的作用变成了一个主题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== 哲学和伦理学 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Philosophy of artificial intelligence|Ethics of artificial intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
There are three philosophical questions related to AI:&lt;br /&gt;
&lt;br /&gt;
There are three philosophical questions related to AI:&lt;br /&gt;
&lt;br /&gt;
有三个与人工智能相关的哲学问题:&lt;br /&gt;
&lt;br /&gt;
# Is [[artificial general intelligence]] possible? Can a machine solve any problem that a human being can solve using intelligence? Or are there hard limits to what a machine can accomplish?&lt;br /&gt;
# Are intelligent machines dangerous? How can we ensure that machines behave ethically and that they are used ethically?&lt;br /&gt;
# Can a machine have a [[mind]], [[consciousness]] and [[philosophy of mind|mental states]] in exactly the same sense that human beings do? Can a machine be [[Sentience|sentient]], and thus deserve certain rights? Can a machine [[intention]]ally cause harm?&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
# 通用人工智能可能实现吗？机器能解决任何人类使用智能就能解决的问题吗？或者一台机器所能完成的事情是否有严格的界限？&lt;br /&gt;
# 智能机器危险吗？我们怎样才能确保机器的行为和使用机器的过程符合道德规范？&lt;br /&gt;
# 机器能否拥有与人类完全相同的思维、意识和精神状态？一台机器是否能拥有直觉，因此得到某些权利？机器会做出刻意伤害吗？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===人工智能的局限性===&lt;br /&gt;
&lt;br /&gt;
{{Main|Philosophy of AI|Turing test|Physical symbol systems hypothesis|Dreyfus' critique of AI|The Emperor's New Mind|AI effect}}&lt;br /&gt;
&lt;br /&gt;
Can a machine be intelligent? Can it &amp;quot;think&amp;quot;?&lt;br /&gt;
&lt;br /&gt;
Can a machine be intelligent? Can it &amp;quot;think&amp;quot;?&lt;br /&gt;
&lt;br /&gt;
机器是智能的吗？它能“思考”吗？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
;''[[Computing Machinery and Intelligence|Alan Turing's &amp;quot;polite convention&amp;quot;]]'': We need not decide if a machine can &amp;quot;think&amp;quot;; we need only decide if a machine can act as intelligently as a human being. This approach to the philosophical problems associated with artificial intelligence forms the basis of the [[Turing test]].&amp;lt;ref name=&amp;quot;Turing test&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Alan Turing's &amp;quot;polite convention&amp;quot;: We need not decide if a machine can &amp;quot;think&amp;quot;; we need only decide if a machine can act as intelligently as a human being. This approach to the philosophical problems associated with artificial intelligence forms the basis of the Turing test.&lt;br /&gt;
&lt;br /&gt;
;''阿兰 · 图灵的“礼貌惯例'': 阿兰 · 图灵的'''&amp;lt;font color=#32cd32&amp;gt;“礼貌惯例”&amp;lt;/font&amp;gt;'''  : 我们不需要决定一台机器是否可以“思考”；我们只需要决定一台机器是否可以像人一样聪明地行动。这个对AI相关哲学问题的回应成为了图灵测试的基础。&lt;br /&gt;
&lt;br /&gt;
  --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）polite convention未找到标准翻译&lt;br /&gt;
&lt;br /&gt;
;''The [[Dartmouth Workshop|Dartmouth proposal]]'': &amp;quot;Every aspect of learning or any other feature of intelligence can be so precisely described that a machine can be made to simulate it.&amp;quot; This conjecture was printed in the proposal for the Dartmouth Conference of 1956.&amp;lt;ref name=&amp;quot;Dartmouth proposal&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The Dartmouth proposal: &amp;quot;Every aspect of learning or any other feature of intelligence can be so precisely described that a machine can be made to simulate it.&amp;quot; This conjecture was printed in the proposal for the Dartmouth Conference of 1956.&lt;br /&gt;
&lt;br /&gt;
;''达特茅斯提案'':达特茅斯会议提出: “可以通过准确地描述学习的每个方面或智能的任何特征，使得一台机器模拟学习和智能。”这个猜想被写在了1956年达特茅斯学院会议的提案中。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
;''[[Physical symbol system|Newell and Simon's physical symbol system hypothesis]]'': &amp;quot;A physical symbol system has the necessary and sufficient means of general intelligent action.&amp;quot; Newell and Simon argue that intelligence consists of formal operations on symbols.&amp;lt;ref name=&amp;quot;Physical symbol system hypothesis&amp;quot;/&amp;gt; [[Hubert Dreyfus]] argued that, on the contrary, human expertise depends on unconscious instinct rather than conscious symbol manipulation and on having a &amp;quot;feel&amp;quot; for the situation rather than explicit symbolic knowledge. (See [[Dreyfus' critique of AI]].)&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Newell and Simon's physical symbol system hypothesis: &amp;quot;A physical symbol system has the necessary and sufficient means of general intelligent action.&amp;quot; Newell and Simon argue that intelligence consists of formal operations on symbols. Hubert Dreyfus argued that, on the contrary, human expertise depends on unconscious instinct rather than conscious symbol manipulation and on having a &amp;quot;feel&amp;quot; for the situation rather than explicit symbolic knowledge. (See Dreyfus' critique of AI.)&lt;br /&gt;
&lt;br /&gt;
;纽厄尔和西蒙的物理符号系统假说: 物理符号系统是通往通用智能行为的充分必要途径。纽厄尔和西蒙认为智能由符号形式的运算组成。&amp;lt;ref name=&amp;quot;Physical symbol system hypothesis&amp;quot;/&amp;gt; 休伯特·德雷福斯则相反地认为，人类的知识依赖于无意识的本能，而不是有意识的符号运算；依赖于对情境的“感觉”，而不是明确的符号知识。(参见德雷福斯对人工智能的批评。)&amp;lt;ref&amp;gt;Dreyfus criticized the [[necessary and sufficient|necessary]] condition of the [[physical symbol system]] hypothesis, which he called the &amp;quot;psychological assumption&amp;quot;: &amp;quot;The mind can be viewed as a device operating on bits of information according to formal rules.&amp;quot; {{Harv|Dreyfus|1992|p=156}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Dreyfus' critique&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
;''Gödelian arguments'': [[Gödel]] himself,&amp;lt;ref name=&amp;quot;Gödel himself&amp;quot;/&amp;gt; [[John Lucas (philosopher)|John Lucas]] (in 1961) and [[Roger Penrose]] (in a more detailed argument from 1989 onwards) made highly technical arguments that human mathematicians can consistently see the truth of their own &amp;quot;Gödel statements&amp;quot; and therefore have computational abilities beyond that of mechanical Turing machines.&amp;lt;ref name=&amp;quot;The mathematical objection&amp;quot;/&amp;gt; However, some people do not agree with the &amp;quot;Gödelian arguments&amp;quot;.&amp;lt;ref&amp;gt;{{cite web|author1=Graham Oppy|title=Gödel's Incompleteness Theorems|url=http://plato.stanford.edu/entries/goedel-incompleteness/#GdeArgAgaMec|website=[[Stanford Encyclopedia of Philosophy]]|accessdate=27 April 2016|date=20 January 2015|quote=These Gödelian anti-mechanist arguments are, however, problematic, and there is wide consensus that they fail.|author1-link=Graham Oppy}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author1=Stuart J. Russell|author2-link=Peter Norvig|author2=Peter Norvig|title=Artificial Intelligence: A Modern Approach|date=2010|publisher=[[Prentice Hall]]|location=Upper Saddle River, NJ|isbn=978-0-13-604259-4|edition=3rd|chapter=26.1.2: Philosophical Foundations/Weak AI: Can Machines Act Intelligently?/The mathematical objection|quote=even if we grant that computers have limitations on what they can prove, there is no evidence that humans are immune from those limitations.|title-link=Artificial Intelligence: A Modern Approach|author1-link=Stuart J. Russell}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Mark Colyvan. An introduction to the philosophy of mathematics. [[Cambridge University Press]], 2012. From 2.2.2, 'Philosophical significance of Gödel's incompleteness results': &amp;quot;The accepted wisdom (with which I concur) is that the Lucas-Penrose arguments fail.&amp;quot;&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
;''哥德尔的论点'':哥德尔本人&amp;lt;ref name=&amp;quot;Gödel himself&amp;quot;/&amp;gt; 、约翰·卢卡斯(在1961年)和罗杰·彭罗斯(在1989年以后的一个更详细的争论中)提出了高度技术性的观点，认为人类数学家可以看到他们自己的“'''&amp;lt;font color=#ff8000&amp;gt;哥德尔不完备定理 Gödel Satements&amp;lt;/font&amp;gt;'''”的真实性，因此计算能力超过机械图灵机&amp;lt;ref name=&amp;quot;The mathematical objection&amp;quot;/&amp;gt;。然而，也有一些人不同意“哥德尔不完备定理”。&amp;lt;ref&amp;gt;{{cite web|author1=Graham Oppy|title=Gödel's Incompleteness Theorems|url=http://plato.stanford.edu/entries/goedel-incompleteness/#GdeArgAgaMec|website=[[Stanford Encyclopedia of Philosophy]]|accessdate=27 April 2016|date=20 January 2015|quote=These Gödelian anti-mechanist arguments are, however, problematic, and there is wide consensus that they fail.|author1-link=Graham Oppy}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author1=Stuart J. Russell|author2-link=Peter Norvig|author2=Peter Norvig|title=Artificial Intelligence: A Modern Approach|date=2010|publisher=[[Prentice Hall]]|location=Upper Saddle River, NJ|isbn=978-0-13-604259-4|edition=3rd|chapter=26.1.2: Philosophical Foundations/Weak AI: Can Machines Act Intelligently?/The mathematical objection|quote=even if we grant that computers have limitations on what they can prove, there is no evidence that humans are immune from those limitations.|title-link=Artificial Intelligence: A Modern Approach|author1-link=Stuart J. Russell}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Mark Colyvan. An introduction to the philosophy of mathematics. [[Cambridge University Press]], 2012. From 2.2.2, 'Philosophical significance of Gödel's incompleteness results': &amp;quot;The accepted wisdom (with which I concur) is that the Lucas-Penrose arguments fail.&amp;quot;&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
;''The [[artificial brain]] argument'': The brain can be simulated by machines and because brains are intelligent, simulated brains must also be intelligent; thus machines can be intelligent. [[Hans Moravec]], [[Ray Kurzweil]] and others have argued that it is technologically feasible to copy the brain directly into hardware and software and that such a simulation will be essentially identical to the original.&amp;lt;ref name=&amp;quot;Brain simulation&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The artificial brain argument: The brain can be simulated by machines and because brains are intelligent, simulated brains must also be intelligent; thus machines can be intelligent. Hans Moravec, Ray Kurzweil and others have argued that it is technologically feasible to copy the brain directly into hardware and software and that such a simulation will be essentially identical to the original.&lt;br /&gt;
&lt;br /&gt;
;''人工大脑的观点'': 因为大脑可以被机器模拟，且大脑是智能的，模拟的大脑也必须是智能的；因此机器可以是智能的。汉斯·莫拉维克、雷·库兹韦尔和其他人认为，技术层面直接将大脑复制到硬件和软件上是可行的，而且这些拷贝在本质上和原来的大脑是没有区别的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
;''The [[AI effect]]'': Machines are ''already'' intelligent, but observers have failed to recognize it. When [[Deep Blue (chess computer)|Deep Blue]] beat [[Garry Kasparov]] in chess, the machine was acting intelligently. However, onlookers commonly discount the behavior of an artificial intelligence program by arguing that it is not &amp;quot;real&amp;quot; intelligence after all; thus &amp;quot;real&amp;quot; intelligence is whatever intelligent behavior people can do that machines still cannot. This is known as the AI Effect: &amp;quot;AI is whatever hasn't been done yet.&amp;quot;&amp;lt;!--&amp;lt;ref name=&amp;quot;AI Effect&amp;quot;/&amp;gt;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The AI effect: Machines are already intelligent, but observers have failed to recognize it. When Deep Blue beat Garry Kasparov in chess, the machine was acting intelligently. However, onlookers commonly discount the behavior of an artificial intelligence program by arguing that it is not &amp;quot;real&amp;quot; intelligence after all; thus &amp;quot;real&amp;quot; intelligence is whatever intelligent behavior people can do that machines still cannot. This is known as the AI Effect: &amp;quot;AI is whatever hasn't been done yet.&amp;quot;&amp;lt;!----&amp;gt;&lt;br /&gt;
&lt;br /&gt;
;''AI效应'': 机器本来就是智能的，但是观察者却没有意识到这一点。当深蓝在国际象棋比赛中击败加里 · 卡斯帕罗夫时，机器就在做出智能行为。然而，旁观者通常对AI程序的行为不屑一顾，认为它根本不是“真正的”智能; 因此，“真正的”智能就是人任何类能够做到但机器仍然做不到的智能行为。这就是众所周知的AI效应: “AI就是一切尚未完成的事情&amp;quot;。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===潜在危害===&lt;br /&gt;
&lt;br /&gt;
Widespread use of artificial intelligence could have [[unintended consequences]] that are dangerous or undesirable. Scientists from the [[Future of Life Institute]], among others, described some short-term research goals to see how AI influences the economy, the laws and ethics that are involved with AI and how to minimize AI security risks. In the long-term, the scientists have proposed to continue optimizing function while minimizing possible security risks that come along with new technologies.&amp;lt;ref&amp;gt;Russel, Stuart., Daniel Dewey, and Max Tegmark. Research Priorities for Robust and Beneficial Artificial Intelligence. AI Magazine 36:4 (2015). 8 December 2016.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Widespread use of artificial intelligence could have unintended consequences that are dangerous or undesirable. Scientists from the Future of Life Institute, among others, described some short-term research goals to see how AI influences the economy, the laws and ethics that are involved with AI and how to minimize AI security risks. In the long-term, the scientists have proposed to continue optimizing function while minimizing possible security risks that come along with new technologies.&lt;br /&gt;
&lt;br /&gt;
AI的广泛使用可能会产生危险或导致意外后果。生命未来研究所(Future of Life Institute)等机构的科学家提出了一些短期研究目标，以此了解AI如何影响经济、与AI相关的法律和道德规范，以及如何将AI的安全风险降到最低。从长远来看，科学家们建议继续优化功能，同时最小化新技术带来的可能的安全风险。&amp;lt;ref&amp;gt;Russel, Stuart., Daniel Dewey, and Max Tegmark. Research Priorities for Robust and Beneficial Artificial Intelligence. AI Magazine 36:4 (2015). 8 December 2016.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The potential negative effects of AI and automation were a major issue for [[Andrew Yang]]'s [[Andrew Yang 2020 presidential campaign|2020 presidential campaign]] in the United States.&amp;lt;ref&amp;gt;{{Cite journal|url=https://www.wired.com/story/andrew-yangs-presidential-bid-is-so-very-21st-century/|title=Andrew Yang's Presidential Bid Is So Very 21st Century|journal=Wired|first=Matt|last=Simon|date=1 April 2019|via=www.wired.com}}&amp;lt;/ref&amp;gt; Irakli Beridze, Head of the Centre for Artificial Intelligence and Robotics at UNICRI, United Nations, has expressed that &amp;quot;I think the dangerous applications for AI, from my point of view, would be criminals or large terrorist organizations using it to disrupt large processes or simply do pure harm. [Terrorists could cause harm] via digital warfare, or it could be a combination of robotics, drones, with AI and other things as well that could be really dangerous. And, of course, other risks come from things like job losses. If we have massive numbers of people losing jobs and don't find a solution, it will be extremely dangerous. Things like lethal autonomous weapons systems should be properly governed — otherwise there's massive potential of misuse.&amp;quot;&amp;lt;ref&amp;gt;{{Cite web | url=https://futurism.com/artificial-intelligence-experts-fear/amp |title = Five experts share what scares them the most about AI|date = 5 September 2018}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The potential negative effects of AI and automation were a major issue for Andrew Yang's 2020 presidential campaign in the United States. Irakli Beridze, Head of the Centre for Artificial Intelligence and Robotics at UNICRI, United Nations, has expressed that &amp;quot;I think the dangerous applications for AI, from my point of view, would be criminals or large terrorist organizations using it to disrupt large processes or simply do pure harm. [Terrorists could cause harm] via digital warfare, or it could be a combination of robotics, drones, with AI and other things as well that could be really dangerous. And, of course, other risks come from things like job losses. If we have massive numbers of people losing jobs and don't find a solution, it will be extremely dangerous. Things like lethal autonomous weapons systems should be properly governed — otherwise there's massive potential of misuse.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
AI和自动化潜在的负面影响在安德鲁·杨2020年竞选美国总统的过程中体现了出来。联合国人工智能与机器人中心主任伊拉克利·贝瑞德兹表示: ”我认为AI危害会体现在犯罪分子或大型恐怖组织利用AI破坏大型流程或通过数字战争造成损失，也可能是机器人、无人机、AI以及其他可能非常危险的东西的结合。当然，其还有失业等风险。如果大量的人失去工作，而且没有解决方案，这将是极其危险的。另外，致命的自动化武器系统之类的东西应该得到合适的控制，否则就可能会被大量滥用。”&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
====存在风险====&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Existential risk from artificial general intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Physicist [[Stephen Hawking]], [[Microsoft]] founder [[Bill Gates]], and [[SpaceX]] founder [[Elon Musk]] have expressed concerns about the possibility that AI could evolve to the point that humans could not control it, with Hawking theorizing that this could &amp;quot;[[Global catastrophic risk|spell the end of the human race]]&amp;quot;.&amp;lt;ref&amp;gt;{{cite news|last1=Rawlinson|first1=Kevin|title=Microsoft's Bill Gates insists AI is a threat|url=https://www.bbc.co.uk/news/31047780|work=BBC News|accessdate=30 January 2015|url-status=live|archiveurl=https://web.archive.org/web/20150129183607/http://www.bbc.co.uk/news/31047780|archivedate=29 January 2015|df=dmy-all|date=2015-01-29}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Holley&amp;quot;&amp;gt;{{Cite news|title = Bill Gates on dangers of artificial intelligence: 'I don't understand why some people are not concerned'|url = https://www.washingtonpost.com/news/the-switch/wp/2015/01/28/bill-gates-on-dangers-of-artificial-intelligence-dont-understand-why-some-people-are-not-concerned/|work= The Washington Post|date = 28 January 2015|access-date = 30 October 2015|issn = 0190-8286|first = Peter|last = Holley|url-status=live|archiveurl = https://web.archive.org/web/20151030054330/https://www.washingtonpost.com/news/the-switch/wp/2015/01/28/bill-gates-on-dangers-of-artificial-intelligence-dont-understand-why-some-people-are-not-concerned/|archivedate = 30 October 2015|df = dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite news|title = Elon Musk: artificial intelligence is our biggest existential threat|url = https://www.theguardian.com/technology/2014/oct/27/elon-musk-artificial-intelligence-ai-biggest-existential-threat|work= The Guardian|accessdate = 30 October 2015|first = Samuel|last = Gibbs|url-status=live|archiveurl = https://web.archive.org/web/20151030054330/http://www.theguardian.com/technology/2014/oct/27/elon-musk-artificial-intelligence-ai-biggest-existential-threat|archivedate = 30 October 2015|df = dmy-all|date = 2014-10-27}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Physicist Stephen Hawking, Microsoft founder Bill Gates, and SpaceX founder Elon Musk have expressed concerns about the possibility that AI could evolve to the point that humans could not control it, with Hawking theorizing that this could &amp;quot;spell the end of the human race&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
物理学家斯蒂芬·霍金、微软创始人比尔·盖茨和 SpaceX 公司创始人埃隆·马斯克对AI进化到人类无法控制的程度表示担忧，霍金认为这可能“会导致人类末日”。&amp;lt;ref&amp;gt;{{cite news|last1=Rawlinson|first1=Kevin|title=Microsoft's Bill Gates insists AI is a threat|url=https://www.bbc.co.uk/news/31047780|work=BBC News|accessdate=30 January 2015|url-status=live|archiveurl=https://web.archive.org/web/20150129183607/http://www.bbc.co.uk/news/31047780|archivedate=29 January 2015|df=dmy-all|date=2015-01-29}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Holley&amp;quot;&amp;gt;{{Cite news|title = Bill Gates on dangers of artificial intelligence: 'I don't understand why some people are not concerned'|url = https://www.washingtonpost.com/news/the-switch/wp/2015/01/28/bill-gates-on-dangers-of-artificial-intelligence-dont-understand-why-some-people-are-not-concerned/|work= The Washington Post|date = 28 January 2015|access-date = 30 October 2015|issn = 0190-8286|first = Peter|last = Holley|url-status=live|archiveurl = https://web.archive.org/web/20151030054330/https://www.washingtonpost.com/news/the-switch/wp/2015/01/28/bill-gates-on-dangers-of-artificial-intelligence-dont-understand-why-some-people-are-not-concerned/|archivedate = 30 October 2015|df = dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite news|title = Elon Musk: artificial intelligence is our biggest existential threat|url = https://www.theguardian.com/technology/2014/oct/27/elon-musk-artificial-intelligence-ai-biggest-existential-threat|work= The Guardian|accessdate = 30 October 2015|first = Samuel|last = Gibbs|url-status=live|archiveurl = https://web.archive.org/web/20151030054330/http://www.theguardian.com/technology/2014/oct/27/elon-musk-artificial-intelligence-ai-biggest-existential-threat|archivedate = 30 October 2015|df = dmy-all|date = 2014-10-27}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In his book ''[[Superintelligence: Paths, Dangers, Strategies|Superintelligence]]'', philosopher [[Nick Bostrom]] provides an argument that artificial intelligence will pose a threat to humankind. He argues that sufficiently intelligent AI, if it chooses actions based on achieving some goal, will exhibit [[Instrumental convergence|convergent]] behavior such as acquiring resources or protecting itself from being shut down. If this AI's goals do not fully reflect humanity's—one example is an AI told to compute as many digits of pi as possible—it might harm humanity in order to acquire more resources or prevent itself from being shut down, ultimately to better achieve its goal.  Bostrom also emphasizes the difficulty of fully conveying humanity's values to an advanced AI.  He uses the hypothetical example of giving an AI the goal to make humans smile to illustrate a misguided attempt.  If the AI in that scenario were to become superintelligent, Bostrom argues, it may resort to methods that most humans would find horrifying, such as inserting &amp;quot;electrodes into the facial muscles of humans to cause constant, beaming grins&amp;quot; because that would be an efficient way to achieve its goal of making humans smile.&amp;lt;ref&amp;gt;{{cite web|url=https://www.ted.com/talks/nick_bostrom_what_happens_when_our_computers_get_smarter_than_we_are/transcript|title=What happens when our computers get smarter than we are?|first=Nick|last=Bostrom|publisher=[[TED (conference)]]|date=2015}}&amp;lt;/ref&amp;gt;  In his book ''[[Human Compatible]]'', AI researcher [[Stuart J. Russell]] echoes some of Bostrom's concerns while also proposing [[Human Compatible#Russell's three principles|an approach]] to developing provably beneficial machines focused on uncertainty and deference to humans,&amp;lt;ref name=&amp;quot;HC&amp;quot;&amp;gt;{{cite book |last=Russell |first=Stuart |date=October 8, 2019 |title=Human Compatible: Artificial Intelligence and the Problem of Control |url= |location=United States |publisher=Viking |page= |isbn=978-0-525-55861-3 |author-link=Stuart J. Russell |oclc=1083694322|title-link=Human Compatible }}&amp;lt;/ref&amp;gt;{{rp|173}} possibly involving [[Reinforcement learning#Inverse reinforcement learning|inverse reinforcement learning]].&amp;lt;ref name=&amp;quot;HC&amp;quot;/&amp;gt;{{rp|191–193}}&lt;br /&gt;
&lt;br /&gt;
In his book Superintelligence, philosopher Nick Bostrom provides an argument that artificial intelligence will pose a threat to humankind. He argues that sufficiently intelligent AI, if it chooses actions based on achieving some goal, will exhibit convergent behavior such as acquiring resources or protecting itself from being shut down. If this AI's goals do not fully reflect humanity's—one example is an AI told to compute as many digits of pi as possible—it might harm humanity in order to acquire more resources or prevent itself from being shut down, ultimately to better achieve its goal.  Bostrom also emphasizes the difficulty of fully conveying humanity's values to an advanced AI.  He uses the hypothetical example of giving an AI the goal to make humans smile to illustrate a misguided attempt.  If the AI in that scenario were to become superintelligent, Bostrom argues, it may resort to methods that most humans would find horrifying, such as inserting &amp;quot;electrodes into the facial muscles of humans to cause constant, beaming grins&amp;quot; because that would be an efficient way to achieve its goal of making humans smile.  In his book Human Compatible, AI researcher Stuart J. Russell echoes some of Bostrom's concerns while also proposing an approach to developing provably beneficial machines focused on uncertainty and deference to humans, possibly involving inverse reinforcement learning.&lt;br /&gt;
&lt;br /&gt;
在《超级智能》一书中，哲学家尼克·博斯特罗姆提出了一个AI将对人类构成威胁的论点。他认为，如果足够智能的AI选择有目标地行动，它将表现出收敛的行为，如获取资源或保护自己不被关机。如果这个AI的目标没有人性，比如一个AI被告知要尽可能多地计算圆周率的位数，那么它可能会伤害人类，以便获得更多的资源或者防止自身被关闭，最终更好地实现目标。博斯特罗姆还强调了向高级AI充分传达人类价值观存在的困难。他假设了一个例子来说明一种南辕北辙的尝试: 给AI一个让人类微笑的目标。博斯特罗姆认为，如果这种情况下的AI变得非常聪明，它可能会采用大多数人类都会感到恐怖的方法，比如“在人类面部肌肉中插入电极，使其产生持续的笑容” ，因为这将是实现让人类微笑的目标的有效方法。&amp;lt;ref&amp;gt;{{cite web|url=https://www.ted.com/talks/nick_bostrom_what_happens_when_our_computers_get_smarter_than_we_are/transcript|title=What happens when our computers get smarter than we are?|first=Nick|last=Bostrom|publisher=[[TED (conference)]]|date=2015}}&amp;lt;/ref&amp;gt;AI研究人员斯图亚特.J.罗素在他的《人类相容》一书中回应了博斯特罗姆的一些担忧，同时也提出了一种开发可证明有益的机器可能涉及逆强化学习的方法&amp;lt;ref name=&amp;quot;HC&amp;quot;/&amp;gt;{{rp|191–193}}，这种机器侧重解决不确定性和顺从人类的问题。&amp;lt;ref name=&amp;quot;HC&amp;quot;&amp;gt;{{cite book |last=Russell |first=Stuart |date=October 8, 2019 |title=Human Compatible: Artificial Intelligence and the Problem of Control |url= |location=United States |publisher=Viking |page= |isbn=978-0-525-55861-3 |author-link=Stuart J. Russell |oclc=1083694322|title-link=Human Compatible }}&amp;lt;/ref&amp;gt;{{rp|173}}&lt;br /&gt;
&lt;br /&gt;
Concern over risk from artificial intelligence has led to some high-profile donations and investments. A group of prominent tech titans including [[Peter Thiel]], Amazon Web Services and Musk have committed $1 billion to [[OpenAI]], a nonprofit company aimed at championing responsible AI development.&amp;lt;ref&amp;gt;{{cite web|url=https://www.chicagotribune.com/bluesky/technology/ct-tech-titans-against-terminators-20151214-story.html|title=Tech titans like Elon Musk are spending $1 billion to save you from terminators|first=Washington|last=Post|url-status=live|archiveurl=https://web.archive.org/web/20160607121118/http://www.chicagotribune.com/bluesky/technology/ct-tech-titans-against-terminators-20151214-story.html|archivedate=7 June 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; 人工智能领域内专家们的意见是混杂的，担忧和不担忧超越人类能力的AI的观点都占有很大的分额。&amp;lt;ref&amp;gt;{{cite journal}}&amp;lt;/ref&amp;gt;  Facebook CEO [[Mark Zuckerberg]] believes AI will &amp;quot;unlock a huge amount of positive things,&amp;quot; such as curing disease and increasing the safety of autonomous cars.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.businessinsider.com/mark-zuckerberg-shares-thoughts-elon-musks-ai-2018-5|title=Mark Zuckerberg responds to Elon Musk's paranoia about AI: 'AI is going to... help keep our communities safe.'|last=|first=|date=25 May 2018|website=Business Insider|access-date=2019-05-06}}&amp;lt;/ref&amp;gt; In January 2015, Musk donated $10 million to the [[Future of Life Institute]] to fund research on understanding AI decision making. The goal of the institute is to &amp;quot;grow wisdom with which we manage&amp;quot; the growing power of technology. Musk also funds companies developing artificial intelligence such as [[DeepMind]] and [[Vicarious (company)|Vicarious]] to &amp;quot;just keep an eye on what's going on with artificial intelligence.&amp;lt;ref&amp;gt;{{cite web|title = The mysterious artificial intelligence company Elon Musk invested in is developing game-changing smart computers|url = http://www.techinsider.io/mysterious-artificial-intelligence-company-elon-musk-investment-2015-10|website = Tech Insider|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030165333/http://www.techinsider.io/mysterious-artificial-intelligence-company-elon-musk-investment-2015-10|archivedate = 30 October 2015|df = dmy-all}}&amp;lt;/ref&amp;gt; I think there is potentially a dangerous outcome there.&amp;quot;&amp;lt;ref&amp;gt;{{cite web|title = Musk-Backed Group Probes Risks Behind Artificial Intelligence|url = https://www.bloomberg.com/news/articles/2015-07-01/musk-backed-group-probes-risks-behind-artificial-intelligence|website = Bloomberg.com|accessdate = 30 October 2015|first = Jack|last = Clark|url-status=live|archiveurl = https://web.archive.org/web/20151030202356/http://www.bloomberg.com/news/articles/2015-07-01/musk-backed-group-probes-risks-behind-artificial-intelligence|archivedate = 30 October 2015|df = dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite web|title = Elon Musk Is Donating $10M Of His Own Money To Artificial Intelligence Research|url = http://www.fastcompany.com/3041007/fast-feed/elon-musk-is-donating-10m-of-his-own-money-to-artificial-intelligence-research|website = Fast Company|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030202356/http://www.fastcompany.com/3041007/fast-feed/elon-musk-is-donating-10m-of-his-own-money-to-artificial-intelligence-research|archivedate = 30 October 2015|df = dmy-all|date = 2015-01-15}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
对人工智能潜在风险的担忧引来了一些大额的捐献和投资。一些科技巨头，如彼得·蒂尔、亚马逊云服务、以及马斯克已经把10亿美金给了OpenAI，一个拥护和聚焦于开发可靠的AI的非盈利公司。&amp;lt;ref&amp;gt;{{cite web|url=https://www.chicagotribune.com/bluesky/technology/ct-tech-titans-against-terminators-20151214-story.html|title=Tech titans like Elon Musk are spending $1 billion to save you from terminators|first=Washington|last=Post|url-status=live|archiveurl=https://web.archive.org/web/20160607121118/http://www.chicagotribune.com/bluesky/technology/ct-tech-titans-against-terminators-20151214-story.html|archivedate=7 June 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; 人工智能领域内专家们的观点是混杂的，担忧和不担忧超人类AI的意见都占有很大的份额。其他技术行业的领导者相信AI在目前的形式下是有益的，并将继续帮助人类。甲骨文首席执行官马克·赫德表示，AI“实际上将创造更多的就业机会，而不是减少就业机会” ，因为管理AI系统需要人力&amp;lt;ref&amp;gt;{{Cite web|url=https://searcherp.techtarget.com/news/252460208/Oracle-CEO-Mark-Hurd-sees-no-reason-to-fear-ERP-AI|title=Oracle CEO Mark Hurd sees no reason to fear ERP AI|website=SearchERP|language=en|access-date=2019-05-06}}&amp;lt;/ref&amp;gt; 。Facebook 首席执行官马克·扎克伯格相信AI将“解锁大量正面的东西” ，比如治愈疾病和提高自动驾驶汽车的安全性&amp;lt;ref&amp;gt;{{Cite web|url=https://www.businessinsider.com/mark-zuckerberg-shares-thoughts-elon-musks-ai-2018-5|title=Mark Zuckerberg responds to Elon Musk's paranoia about AI: 'AI is going to... help keep our communities safe.'|last=|first=|date=25 May 2018|website=Business Insider|access-date=2019-05-06}}&amp;lt;/ref&amp;gt;。2015年1月，马斯克向未来生命研究所捐赠了1000万美元，用于研究AI决策。该研究所的目标是“用智能管理”日益增长的技术力量。马斯克还为 DeepMind 和 Vicarious 等开发AI的公司提供资金，以“跟进AI的发展”&amp;lt;ref&amp;gt;{{cite web|title = The mysterious artificial intelligence company Elon Musk invested in is developing game-changing smart computers|url = http://www.techinsider.io/mysterious-artificial-intelligence-company-elon-musk-investment-2015-10|website = Tech Insider|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030165333/http://www.techinsider.io/mysterious-artificial-intelligence-company-elon-musk-investment-2015-10|archivedate = 30 October 2015|df = dmy-all}}&amp;lt;/ref&amp;gt;因为认为这个领域“可能会产生危险的后果”&amp;lt;ref&amp;gt;{{cite web|title = Musk-Backed Group Probes Risks Behind Artificial Intelligence|url = https://www.bloomberg.com/news/articles/2015-07-01/musk-backed-group-probes-risks-behind-artificial-intelligence|website = Bloomberg.com|accessdate = 30 October 2015|first = Jack|last = Clark|url-status=live|archiveurl = https://web.archive.org/web/20151030202356/http://www.bloomberg.com/news/articles/2015-07-01/musk-backed-group-probes-risks-behind-artificial-intelligence|archivedate = 30 October 2015|df = dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite web|title = Elon Musk Is Donating $10M Of His Own Money To Artificial Intelligence Research|url = http://www.fastcompany.com/3041007/fast-feed/elon-musk-is-donating-10m-of-his-own-money-to-artificial-intelligence-research|website = Fast Company|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030202356/http://www.fastcompany.com/3041007/fast-feed/elon-musk-is-donating-10m-of-his-own-money-to-artificial-intelligence-research|archivedate = 30 October 2015|df = dmy-all|date = 2015-01-15}}&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
For the danger of uncontrolled advanced AI to be realized, the hypothetical AI would have to overpower or out-think all of humanity, which a minority of experts argue is a possibility far enough in the future to not be worth researching.&amp;lt;ref&amp;gt;{{cite web|title = Is artificial intelligence really an existential threat to humanity?|url = http://thebulletin.org/artificial-intelligence-really-existential-threat-humanity8577|website = Bulletin of the Atomic Scientists|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030054330/http://thebulletin.org/artificial-intelligence-really-existential-threat-humanity8577|archivedate = 30 October 2015|df = dmy-all|date = 2015-08-09}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite web|title = The case against killer robots, from a guy actually working on artificial intelligence|url = http://fusion.net/story/54583/the-case-against-killer-robots-from-a-guy-actually-building-ai/|website = Fusion.net|accessdate = 31 January 2016|url-status=live|archiveurl = https://web.archive.org/web/20160204175716/http://fusion.net/story/54583/the-case-against-killer-robots-from-a-guy-actually-building-ai/|archivedate = 4 February 2016|df = dmy-all}}&amp;lt;/ref&amp;gt; Other counterarguments revolve around humans being either intrinsically or convergently valuable from the perspective of an artificial intelligence.&amp;lt;ref&amp;gt;{{cite web|title = Will artificial intelligence destroy humanity? Here are 5 reasons not to worry.|url = https://www.vox.com/2014/8/22/6043635/5-reasons-we-shouldnt-worry-about-super-intelligent-computers-taking|website = Vox|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030092203/http://www.vox.com/2014/8/22/6043635/5-reasons-we-shouldnt-worry-about-super-intelligent-computers-taking|archivedate = 30 October 2015|df = dmy-all|date = 2014-08-22}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For the danger of uncontrolled advanced AI to be realized, the hypothetical AI would have to overpower or out-think all of humanity, which a minority of experts argue is a possibility far enough in the future to not be worth researching. Other counterarguments revolve around humans being either intrinsically or convergently valuable from the perspective of an artificial intelligence.&lt;br /&gt;
&lt;br /&gt;
为了实现不受控制的先进人工智能的危险，假设的人工智能必须超越或超越整个人类，一小部分专家认为这种可能性在未来足够遥远，不值得研究。其他反对意见则围绕着从人工智能的角度来看， '''&amp;lt;font color=#32cd32&amp;gt; 人类有内在或可聚合的价值。&amp;lt;/font&amp;gt;'''&lt;br /&gt;
&lt;br /&gt;
如果要实现不受控制的高级AI，这个假想中的AI必须超越或者说在思想上超越全人类，一小部分专家认为这种可能性在足够遥远未来才会出现，不值得研究。其他反对意见则认为，从AI的角度来看，人类或者具有内在价值，或者具有可交流的价值。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]） 不太能翻译 Other counterarguments revolve around humans being either intrinsically or convergently valuable from the perspective of an artificial intelligence.一句&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====人性贬值 ====&lt;br /&gt;
&lt;br /&gt;
{{Main|Computer Power and Human Reason}}&lt;br /&gt;
&lt;br /&gt;
[[Joseph Weizenbaum]] wrote that AI applications cannot, by definition, successfully simulate genuine human empathy and that the use of AI technology in fields such as [[customer service]] or [[psychotherapy]]&amp;lt;ref&amp;gt;In the early 1970s, [[Kenneth Colby]] presented a version of Weizenbaum's [[ELIZA]] known as DOCTOR which he promoted as a serious therapeutic tool. {{Harv|Crevier|1993|pp=132–144}}&amp;lt;/ref&amp;gt; was deeply misguided. Weizenbaum was also bothered that AI researchers (and some philosophers) were willing to view the human mind as nothing more than a computer program (a position now known as [[computationalism]]). To Weizenbaum these points suggest that AI research devalues human life.&amp;lt;ref name=&amp;quot;Weizenbaum's critique&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Joseph Weizenbaum wrote that AI applications cannot, by definition, successfully simulate genuine human empathy and that the use of AI technology in fields such as customer service or psychotherapy was deeply misguided. Weizenbaum was also bothered that AI researchers (and some philosophers) were willing to view the human mind as nothing more than a computer program (a position now known as computationalism). To Weizenbaum these points suggest that AI research devalues human life.&lt;br /&gt;
&lt;br /&gt;
约瑟夫·维森鲍姆写道，根据定义，AI应用程序不能模拟人类的同理心，并且在诸如客户服务或心理治疗等领域使用AI技术是严重错误&amp;lt;ref&amp;gt;In the early 1970s, [[Kenneth Colby]] presented a version of Weizenbaum's [[ELIZA]] known as DOCTOR which he promoted as a serious therapeutic tool. {{Harv|Crevier|1993|pp=132–144}}&amp;lt;/ref&amp;gt; 。维森鲍姆还对AI研究人员(以及一些哲学家)将人类思维视为一个计算机程序(现在称为计算主义)而感到困扰。对维森鲍姆来说，这些观点表明AI研究贬低了人类的生命价值。&amp;lt;ref name=&amp;quot;Weizenbaum's critique&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====社会正义====&lt;br /&gt;
&lt;br /&gt;
{{further|Algorithmic bias}}&lt;br /&gt;
&lt;br /&gt;
One concern is that AI programs may be programmed to be biased against certain groups, such as women and minorities, because most of the developers are wealthy Caucasian men.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.channelnewsasia.com/news/commentary/artificial-intelligence-big-data-bias-hiring-loans-key-challenge-11097374|title=Commentary: Bad news. Artificial intelligence is biased|website=CNA}}&amp;lt;/ref&amp;gt; Support for artificial intelligence is higher among men (with 47% approving) than women (35% approving).&lt;br /&gt;
&lt;br /&gt;
One concern is that AI programs may be programmed to be biased against certain groups, such as women and minorities, because most of the developers are wealthy Caucasian men. Support for artificial intelligence is higher among men (with 47% approving) than women (35% approving).&lt;br /&gt;
&lt;br /&gt;
人们担心的一个问题是，AI程序可能会对某些群体存在偏见，比如女性和少数族裔，因为大多数开发者都是富有的白人男性&amp;lt;ref&amp;gt;{{Cite web|url=https://www.channelnewsasia.com/news/commentary/artificial-intelligence-big-data-bias-hiring-loans-key-challenge-11097374|title=Commentary: Bad news. Artificial intelligence is biased|website=CNA}}&amp;lt;/ref&amp;gt;。男性对AI的支持率(47%)高于女性(35%)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Algorithms have a host of applications in today's legal system already, assisting officials ranging from judges to parole officers and public defenders in gauging the predicted likelihood of recidivism of defendants.&amp;lt;ref name=&amp;quot;propublica.org&amp;quot;&amp;gt;{{Cite web|url=https://www.propublica.org/article/how-we-analyzed-the-compas-recidivism-algorithm|title=How We Analyzed the COMPAS Recidivism Algorithm|last=Jeff Larson|first=Julia Angwin|date=2016-05-23|website=ProPublica|language=en|access-date=2019-07-23}}&amp;lt;/ref&amp;gt; COMPAS (an acronym for Correctional Offender Management Profiling for Alternative Sanctions) counts among the most widely utilized commercially available solutions.&amp;lt;ref name=&amp;quot;propublica.org&amp;quot;/&amp;gt; It has been suggested that COMPAS assigns an exceptionally elevated risk of recidivism to black defendants while, conversely, ascribing low risk estimate to white defendants significantly more often than statistically expected.&amp;lt;ref name=&amp;quot;propublica.org&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Algorithms have a host of applications in today's legal system already, assisting officials ranging from judges to parole officers and public defenders in gauging the predicted likelihood of recidivism of defendants. COMPAS (an acronym for Correctional Offender Management Profiling for Alternative Sanctions) counts among the most widely utilized commercially available solutions. It has been suggested that COMPAS assigns an exceptionally elevated risk of recidivism to black defendants while, conversely, ascribing low risk estimate to white defendants significantly more often than statistically expected.&lt;br /&gt;
&lt;br /&gt;
算法在今天的法律体系中已经有了大量的应用，它能协助法官以及假释官员，以及哪些负责评估被告再次犯罪可能性的公设辩护人&amp;lt;ref name=&amp;quot;propublica.org&amp;quot;&amp;gt;{{Cite web|url=https://www.propublica.org/article/how-we-analyzed-the-compas-recidivism-algorithm|title=How We Analyzed the COMPAS Recidivism Algorithm|last=Jeff Larson|first=Julia Angwin|date=2016-05-23|website=ProPublica|language=en|access-date=2019-07-23}}&amp;lt;/ref&amp;gt;。COMPAS（Correctional Offender Management Profiling for Alternative Sanctions，即“替代性制裁的惩罚性罪犯管理分析”的首字母缩写)是商业上使用最广泛的解决方案之一&amp;lt;ref name=&amp;quot;propublica.org&amp;quot;/&amp;gt;。有人指出，COMPAS 对黑人被告累犯风险的评估数值非常高，而相反的，白人被告低风险估计的频率明显高于统计学期望。&amp;lt;ref name=&amp;quot;propublica.org&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==== 劳动力需求降低====&lt;br /&gt;
&lt;br /&gt;
{{Further|Technological unemployment#21st century}}&lt;br /&gt;
&lt;br /&gt;
The relationship between automation and employment is complicated. While automation eliminates old jobs, it also creates new jobs through micro-economic and macro-economic effects.&amp;lt;ref&amp;gt;E McGaughey, 'Will Robots Automate Your Job Away? Full Employment, Basic Income, and Economic Democracy' (2018) [https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3044448 SSRN, part 2(3)]&amp;lt;/ref&amp;gt; Unlike previous waves of automation, many middle-class jobs may be eliminated by artificial intelligence; ''[[The Economist]]'' states that &amp;quot;the worry that AI could do to white-collar jobs what steam power did to blue-collar ones during the Industrial Revolution&amp;quot; is &amp;quot;worth taking seriously&amp;quot;.&amp;lt;ref&amp;gt;{{cite news|title=Automation and anxiety|url=https://www.economist.com/news/special-report/21700758-will-smarter-machines-cause-mass-unemployment-automation-and-anxiety|accessdate=13 January 2018|work=The Economist|date=9 May 2015}}&amp;lt;/ref&amp;gt; Subjective estimates of the risk vary widely; for example, Michael Osborne and [[Carl Benedikt Frey]] estimate 47% of U.S. jobs are at &amp;quot;high risk&amp;quot; of potential automation, while an OECD report classifies only 9% of U.S.&amp;lt;!-- see report p. 33 table 4; 9% is both the OECD average and the US average --&amp;gt; jobs as &amp;quot;high risk&amp;quot;.&amp;lt;ref&amp;gt;{{cite news|last1=Lohr|first1=Steve|title=Robots Will Take Jobs, but Not as Fast as Some Fear, New Report Says|url=https://www.nytimes.com/2017/01/12/technology/robots-will-take-jobs-but-not-as-fast-as-some-fear-new-report-says.html|accessdate=13 January 2018|work=The New York Times|date=2017}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite journal|date=1 January 2017|title=The future of employment: How susceptible are jobs to computerisation?|journal=Technological Forecasting and Social Change|volume=114|pages=254–280|doi=10.1016/j.techfore.2016.08.019|issn=0040-1625|last1=Frey|first1=Carl Benedikt|last2=Osborne|first2=Michael A|citeseerx=10.1.1.395.416}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Arntz, Melanie, Terry Gregory, and Ulrich Zierahn. &amp;quot;The risk of automation for jobs in OECD countries: A comparative analysis.&amp;quot; OECD Social, Employment, and Migration Working Papers 189 (2016). p. 33.&amp;lt;/ref&amp;gt; Jobs at extreme risk range from paralegals to fast food cooks, while job demand is likely to increase for care-related professions ranging from personal healthcare to the clergy.&amp;lt;ref&amp;gt;{{cite news|last1=Mahdawi|first1=Arwa|title=What jobs will still be around in 20 years? Read this to prepare your future|url=https://www.theguardian.com/us-news/2017/jun/26/jobs-future-automation-robots-skills-creative-health|accessdate=13 January 2018|work=The Guardian|date=26 June 2017}}&amp;lt;/ref&amp;gt; Author [[Martin Ford (author)|Martin Ford]] and others go further and argue that many jobs are routine, repetitive and (to an AI) predictable; Ford warns that these jobs may be automated in the next couple of decades, and that many of the new jobs may not be &amp;quot;accessible to people with average capability&amp;quot;, even with retraining. Economists point out that in the past technology has tended to increase rather than reduce total employment, but acknowledge that &amp;quot;we're in uncharted territory&amp;quot; with AI.&amp;lt;ref name=&amp;quot;guardian jobs debate&amp;quot;&amp;gt;{{cite news|last1=Ford|first1=Martin|last2=Colvin|first2=Geoff|title=Will robots create more jobs than they destroy?|url=https://www.theguardian.com/technology/2015/sep/06/will-robots-create-destroy-jobs|accessdate=13 January 2018|work=The Guardian|date=6 September 2015}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The relationship between automation and employment is complicated. While automation eliminates old jobs, it also creates new jobs through micro-economic and macro-economic effects. Unlike previous waves of automation, many middle-class jobs may be eliminated by artificial intelligence; The Economist states that &amp;quot;the worry that AI could do to white-collar jobs what steam power did to blue-collar ones during the Industrial Revolution&amp;quot; is &amp;quot;worth taking seriously&amp;quot;. Subjective estimates of the risk vary widely; for example, Michael Osborne and Carl Benedikt Frey estimate 47% of U.S. jobs are at &amp;quot;high risk&amp;quot; of potential automation, while an OECD report classifies only 9% of U.S.&amp;lt;!-- see report p. 33 table 4; 9% is both the OECD average and the US average --&amp;gt; jobs as &amp;quot;high risk&amp;quot;. Jobs at extreme risk range from paralegals to fast food cooks, while job demand is likely to increase for care-related professions ranging from personal healthcare to the clergy. Author Martin Ford and others go further and argue that many jobs are routine, repetitive and (to an AI) predictable; Ford warns that these jobs may be automated in the next couple of decades, and that many of the new jobs may not be &amp;quot;accessible to people with average capability&amp;quot;, even with retraining. Economists point out that in the past technology has tended to increase rather than reduce total employment, but acknowledge that &amp;quot;we're in uncharted territory&amp;quot; with AI.&lt;br /&gt;
&lt;br /&gt;
自动化与就业的关系是复杂的。自动化在减少过时工作的同时，也通过微观经济和宏观经济效应创造了新的就业机会&amp;lt;ref&amp;gt;E McGaughey, 'Will Robots Automate Your Job Away? Full Employment, Basic Income, and Economic Democracy' (2018) [https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3044448 SSRN, part 2(3)]&amp;lt;/ref&amp;gt;。与以往的自动化浪潮不同，许多中产阶级的工作可能会被AI淘汰。《经济学人》杂志指出，“AI对白领工作的影响，就像工业革命时期蒸汽动力对蓝领工作的影响一样，需要我们正视”&amp;lt;ref&amp;gt;{{cite news|title=Automation and anxiety|url=https://www.economist.com/news/special-report/21700758-will-smarter-machines-cause-mass-unemployment-automation-and-anxiety|accessdate=13 January 2018|work=The Economist|date=9 May 2015}}&amp;lt;/ref&amp;gt;。对风险的主观估计差别很大，例如，迈克尔·奥斯本和卡尔·贝内迪克特·弗雷估计，美国47% 的工作有较高风险被自动化取代 ，而经合组织的报告认为美国仅有9% 的工作处于“高风险”状态&amp;lt;ref&amp;gt;{{cite news|last1=Lohr|first1=Steve|title=Robots Will Take Jobs, but Not as Fast as Some Fear, New Report Says|url=https://www.nytimes.com/2017/01/12/technology/robots-will-take-jobs-but-not-as-fast-as-some-fear-new-report-says.html|accessdate=13 January 2018|work=The New York Times|date=2017}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite journal|date=1 January 2017|title=The future of employment: How susceptible are jobs to computerisation?|journal=Technological Forecasting and Social Change|volume=114|pages=254–280|doi=10.1016/j.techfore.2016.08.019|issn=0040-1625|last1=Frey|first1=Carl Benedikt|last2=Osborne|first2=Michael A|citeseerx=10.1.1.395.416}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Arntz, Melanie, Terry Gregory, and Ulrich Zierahn. &amp;quot;The risk of automation for jobs in OECD countries: A comparative analysis.&amp;quot; OECD Social, Employment, and Migration Working Papers 189 (2016). p. 33.&amp;lt;/ref&amp;gt;。从律师助理到快餐厨师等职业都面临着极大的风险，而个人医疗保健、神职人员等护理相关职业的就业需求可能会增加&amp;lt;ref&amp;gt;{{cite news|last1=Mahdawi|first1=Arwa|title=What jobs will still be around in 20 years? Read this to prepare your future|url=https://www.theguardian.com/us-news/2017/jun/26/jobs-future-automation-robots-skills-creative-health|accessdate=13 January 2018|work=The Guardian|date=26 June 2017}}&amp;lt;/ref&amp;gt;。作家马丁•福特和其他人进一步指出，许多工作都是常规、重复的，对AI而言是可以预测的。福特警告道，这些工作可能在未来几十年内实现自动化，而且即便对失业人员进行再培训，许多能力一般的人也不能获得新工作。经济学家指出，在过去技术往往会增加而不是减少总就业人数，但他们承认，AI“正处于未知领域”&amp;lt;ref name=&amp;quot;guardian jobs debate&amp;quot;&amp;gt;{{cite news|last1=Ford|first1=Martin|last2=Colvin|first2=Geoff|title=Will robots create more jobs than they destroy?|url=https://www.theguardian.com/technology/2015/sep/06/will-robots-create-destroy-jobs|accessdate=13 January 2018|work=The Guardian|date=6 September 2015}}&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====自动化武器====&lt;br /&gt;
&lt;br /&gt;
{{See also|Lethal autonomous weapon}}&lt;br /&gt;
&lt;br /&gt;
Currently, 50+ countries are researching battlefield robots, including the United States, China, Russia, and the United Kingdom. Many people concerned about risk from superintelligent AI also want to limit the use of artificial soldiers and drones.&amp;lt;ref&amp;gt;{{cite web|title = Stephen Hawking, Elon Musk, and Bill Gates Warn About Artificial Intelligence|url = http://observer.com/2015/08/stephen-hawking-elon-musk-and-bill-gates-warn-about-artificial-intelligence/|website = Observer|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030053323/http://observer.com/2015/08/stephen-hawking-elon-musk-and-bill-gates-warn-about-artificial-intelligence/|archivedate = 30 October 2015|df = dmy-all|date = 2015-08-19}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Currently, 50+ countries are researching battlefield robots, including the United States, China, Russia, and the United Kingdom. Many people concerned about risk from superintelligent AI also want to limit the use of artificial soldiers and drones.&lt;br /&gt;
&lt;br /&gt;
目前，包括美国、中国、俄罗斯和英国在内的50多个国家正在研究战场机器人。许多人在担心来自超级智能AI的风险的同时，也希望限制人造士兵和无人机的使用。&amp;lt;ref&amp;gt;{{cite web|title = Stephen Hawking, Elon Musk, and Bill Gates Warn About Artificial Intelligence|url = http://observer.com/2015/08/stephen-hawking-elon-musk-and-bill-gates-warn-about-artificial-intelligence/|website = Observer|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030053323/http://observer.com/2015/08/stephen-hawking-elon-musk-and-bill-gates-warn-about-artificial-intelligence/|archivedate = 30 October 2015|df = dmy-all|date = 2015-08-19}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===道德机器===&lt;br /&gt;
&lt;br /&gt;
Machines with intelligence have the potential to use their intelligence to prevent harm and minimize the risks; they may have the ability to use [[ethics|ethical reasoning]] to better choose their actions in the world. As such, there is a need for policy making to devise policies for and regulate artificial intelligence and robotics.&amp;lt;ref&amp;gt;{{Cite journal|last=Iphofen|first=Ron|last2=Kritikos|first2=Mihalis|date=2019-01-03|title=Regulating artificial intelligence and robotics: ethics by design in a digital society|journal=Contemporary Social Science|pages=1–15|doi=10.1080/21582041.2018.1563803|issn=2158-2041}}&amp;lt;/ref&amp;gt; Research in this area includes [[machine ethics]], [[artificial moral agents]], [[friendly AI]] and discussion towards building a [[human rights]] framework is also in talks.&amp;lt;ref&amp;gt;{{cite_web|url=https://www.voanews.com/episode/ethical-ai-learns-human-rights-framework-4087171|title=Ethical AI Learns Human Rights Framework|accessdate=10 November 2019|website=Voice of America}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Machines with intelligence have the potential to use their intelligence to prevent harm and minimize the risks; they may have the ability to use ethical reasoning to better choose their actions in the world. As such, there is a need for policy making to devise policies for and regulate artificial intelligence and robotics. Research in this area includes machine ethics, artificial moral agents, friendly AI and discussion towards building a human rights framework is also in talks.&lt;br /&gt;
&lt;br /&gt;
具有智能的机器有潜力使用它们的智能来防止伤害和减少风险；它们也有能力利用伦理推理来更好地做出它们在世界上的行动。因此，有必要为AI和机器人制定和规范政策&amp;lt;ref&amp;gt;{{Cite journal|last=Iphofen|first=Ron|last2=Kritikos|first2=Mihalis|date=2019-01-03|title=Regulating artificial intelligence and robotics: ethics by design in a digital society|journal=Contemporary Social Science|pages=1–15|doi=10.1080/21582041.2018.1563803|issn=2158-2041}}&amp;lt;/ref&amp;gt;。这一领域的研究包括机器伦理学、人工道德主题、友好AI以及关于建立人权框架的讨论&amp;lt;ref&amp;gt;{{cite_web|url=https://www.voanews.com/episode/ethical-ai-learns-human-rights-framework-4087171|title=Ethical AI Learns Human Rights Framework|accessdate=10 November 2019|website=Voice of America}}&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====人工道德智能主体 ====&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Wendell Wallach introduced the concept of [[artificial moral agents]] (AMA) in his book ''Moral Machines''&amp;lt;ref&amp;gt;Wendell Wallach (2010). ''Moral Machines'', Oxford University Press.&amp;lt;/ref&amp;gt; For Wallach, AMAs have become a part of the research landscape of artificial intelligence as guided by its two central questions which he identifies as &amp;quot;Does Humanity Want Computers Making Moral Decisions&amp;quot;&amp;lt;ref&amp;gt;Wallach, pp 37–54.&amp;lt;/ref&amp;gt; and &amp;quot;Can (Ro)bots Really Be Moral&amp;quot;.&amp;lt;ref&amp;gt;Wallach, pp 55–73.&amp;lt;/ref&amp;gt; For Wallach, the question is not centered on the issue of ''whether'' machines can demonstrate the equivalent of moral behavior in contrast to the ''constraints'' which society may place on the development of AMAs.&amp;lt;ref&amp;gt;Wallach, Introduction chapter.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Wendell Wallach introduced the concept of artificial moral agents (AMA) in his book Moral Machines For Wallach, AMAs have become a part of the research landscape of artificial intelligence as guided by its two central questions which he identifies as &amp;quot;Does Humanity Want Computers Making Moral Decisions&amp;quot; and &amp;quot;Can (Ro)bots Really Be Moral&amp;quot;. For Wallach, the question is not centered on the issue of whether machines can demonstrate the equivalent of moral behavior in contrast to the constraints which society may place on the development of AMAs.&lt;br /&gt;
&lt;br /&gt;
温德尔•沃勒克在他的著作《道德机器》(Moral Machines)&amp;lt;ref&amp;gt;Wendell Wallach (2010). ''Moral Machines'', Oxford University Press.&amp;lt;/ref&amp;gt;中提出了人工道德智能主体(AMA)的概念。在两个核心问题的指导下，AMA 已经成为AI研究领域的一部分。他将这两个核心问题定义为“人类是否希望计算机做出道德决策”和“机器人真的可以拥有道德吗”。对于沃勒克来说，这个问题的重点并不是机器能否适应社会，表现与社会对AMA发展所施加的限制相对应的道德行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==== 机器伦理学====&lt;br /&gt;
&lt;br /&gt;
{{Main|Machine ethics}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The field of machine ethics is concerned with giving machines ethical principles, or a procedure for discovering a way to resolve the ethical dilemmas they might encounter, enabling them to function in an ethically responsible manner through their own ethical decision making.&amp;lt;ref name=&amp;quot;autogenerated1&amp;quot;&amp;gt;Michael Anderson and Susan Leigh Anderson (2011), Machine Ethics, Cambridge University Press.&amp;lt;/ref&amp;gt; The field was delineated in the AAAI Fall 2005 Symposium on Machine Ethics: &amp;quot;Past research concerning the relationship between technology and ethics has largely focused on responsible and irresponsible use of technology by human beings, with a few people being interested in how human beings ought to treat machines. In all cases, only human beings have engaged in ethical reasoning. The time has come for adding an ethical dimension to at least some machines. Recognition of the ethical ramifications of behavior involving machines, as well as recent and potential developments in machine autonomy, necessitate this. In contrast to computer hacking, software property issues, privacy issues and other topics normally ascribed to computer ethics, machine ethics is concerned with the behavior of machines towards human users and other machines. Research in machine ethics is key to alleviating concerns with autonomous systems—it could be argued that the notion of autonomous machines without such a dimension is at the root of all fear concerning machine intelligence. Further, investigation of machine ethics could enable the discovery of problems with current ethical theories, advancing our thinking about Ethics.&amp;quot;&amp;lt;ref name=&amp;quot;autogenerated2&amp;quot;&amp;gt;{{cite web|url=http://www.aaai.org/Library/Symposia/Fall/fs05-06 |title=Machine Ethics |work=aaai.org |url-status=dead |archiveurl=https://web.archive.org/web/20141129044821/http://www.aaai.org/Library/Symposia/Fall/fs05-06 |archivedate=29 November 2014 }}&amp;lt;/ref&amp;gt; Machine ethics is sometimes referred to as machine morality, computational ethics or computational morality. A variety of perspectives of this nascent field can be found in the collected edition &amp;quot;Machine Ethics&amp;quot;&amp;lt;ref name=&amp;quot;autogenerated1&amp;quot;/&amp;gt; that stems from the AAAI Fall 2005 Symposium on Machine Ethics.&amp;lt;ref name=&amp;quot;autogenerated2&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The field of machine ethics is concerned with giving machines ethical principles, or a procedure for discovering a way to resolve the ethical dilemmas they might encounter, enabling them to function in an ethically responsible manner through their own ethical decision making. The field was delineated in the AAAI Fall 2005 Symposium on Machine Ethics: &amp;quot;Past research concerning the relationship between technology and ethics has largely focused on responsible and irresponsible use of technology by human beings, with a few people being interested in how human beings ought to treat machines. In all cases, only human beings have engaged in ethical reasoning. The time has come for adding an ethical dimension to at least some machines. Recognition of the ethical ramifications of behavior involving machines, as well as recent and potential developments in machine autonomy, necessitate this. In contrast to computer hacking, software property issues, privacy issues and other topics normally ascribed to computer ethics, machine ethics is concerned with the behavior of machines towards human users and other machines. Research in machine ethics is key to alleviating concerns with autonomous systems—it could be argued that the notion of autonomous machines without such a dimension is at the root of all fear concerning machine intelligence. Further, investigation of machine ethics could enable the discovery of problems with current ethical theories, advancing our thinking about Ethics.&amp;quot; Machine ethics is sometimes referred to as machine morality, computational ethics or computational morality. A variety of perspectives of this nascent field can be found in the collected edition &amp;quot;Machine Ethics&amp;quot; that stems from the AAAI Fall 2005 Symposium on Machine Ethics.&lt;br /&gt;
&lt;br /&gt;
机器伦理学领域关注的是给予机器伦理原则，或者一种用于解决它们可能遇到的伦理困境的方法，使它们能够通过自己的伦理决策以一种符合伦理的方式运作.&amp;lt;ref name=&amp;quot;autogenerated1&amp;quot;&amp;gt;Michael Anderson and Susan Leigh Anderson (2011), Machine Ethics, Cambridge University Press.&amp;lt;/ref&amp;gt;。2005年秋季AAAI机器伦理研讨会描述了这一领域: ”过去关于技术与伦理学之间关系的研究主要侧重于人类是否应该对技术的使用负责，只有少数人对人类应当如何对待机器感兴趣。任何时候都只有人类会参与伦理推理。现在是时候给至少一些机器增加道德层面的考虑了。这势必要的，因为我们认识到了机器行为的道德后果，以及机器自主性领域最新和潜在的发展。与计算机黑客行为、软件产权问题、隐私问题和其他通常归因于计算机道德的主题不同，机器道德关注的是机器对人类用户和其他机器的行为。机器伦理学的研究是减轻人们对自主系统担忧的关键——可以说，人们对机器智能担忧的根源是自主机器概念没有道德维度。此外，在机器伦理学的研究中可以发现当前伦理学理论存在的问题，加深我们对伦理学的思考。”&amp;lt;ref name=&amp;quot;autogenerated2&amp;quot;&amp;gt;{{cite web|url=http://www.aaai.org/Library/Symposia/Fall/fs05-06 |title=Machine Ethics |work=aaai.org |url-status=dead |archiveurl=https://web.archive.org/web/20141129044821/http://www.aaai.org/Library/Symposia/Fall/fs05-06 |archivedate=29 November 2014 }}&amp;lt;/ref&amp;gt; 机器伦理学有时被称为机器道德、计算伦理学或计算伦理学&amp;lt;ref name=&amp;quot;autogenerated1&amp;quot;/&amp;gt;。这个新兴领域的各种观点可以在 AAAI 秋季2005年机器伦理学研讨会上收集的“机器伦理学”版本中找到。&amp;lt;ref name=&amp;quot;autogenerated2&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====善AI与恶AI ====&lt;br /&gt;
&lt;br /&gt;
{{Main|Friendly AI}}&lt;br /&gt;
&lt;br /&gt;
Political scientist [[Charles T. Rubin]] believes that AI can be neither designed nor guaranteed to be benevolent.&amp;lt;ref&amp;gt;{{cite journal|last=Rubin |first=Charles |authorlink=Charles T. Rubin |date=Spring 2003 |title=Artificial Intelligence and Human Nature|journal=The New Atlantis |volume=1 |pages=88–100 |url=http://www.thenewatlantis.com/publications/artificial-intelligence-and-human-nature |url-status=dead |archiveurl=https://web.archive.org/web/20120611115223/http://www.thenewatlantis.com/publications/artificial-intelligence-and-human-nature |archivedate=11 June 2012 |df=dmy}}&amp;lt;/ref&amp;gt; He argues that &amp;quot;any sufficiently advanced benevolence may be indistinguishable from malevolence.&amp;quot; Humans should not assume machines or robots would treat us favorably because there is no ''a priori'' reason to believe that they would be sympathetic to our system of morality, which has evolved along with our particular biology (which AIs would not share). Hyper-intelligent software may not necessarily decide to support the continued existence of humanity and would be extremely difficult to stop. This topic has also recently begun to be discussed in academic publications as a real source of risks to civilization, humans, and planet Earth.&lt;br /&gt;
&lt;br /&gt;
Political scientist Charles T. Rubin believes that AI can be neither designed nor guaranteed to be benevolent. He argues that &amp;quot;any sufficiently advanced benevolence may be indistinguishable from malevolence.&amp;quot; Humans should not assume machines or robots would treat us favorably because there is no a priori reason to believe that they would be sympathetic to our system of morality, which has evolved along with our particular biology (which AIs would not share). Hyper-intelligent software may not necessarily decide to support the continued existence of humanity and would be extremely difficult to stop. This topic has also recently begun to be discussed in academic publications as a real source of risks to civilization, humans, and planet Earth.&lt;br /&gt;
&lt;br /&gt;
政治科学家查尔斯 · 鲁宾认为，AI既不可能被设计成是友好的，也不能保证会是友好的&amp;lt;ref&amp;gt;{{cite journal|last=Rubin |first=Charles |authorlink=Charles T. Rubin |date=Spring 2003 |title=Artificial Intelligence and Human Nature|journal=The New Atlantis |volume=1 |pages=88–100 |url=http://www.thenewatlantis.com/publications/artificial-intelligence-and-human-nature |url-status=dead |archiveurl=https://web.archive.org/web/20120611115223/http://www.thenewatlantis.com/publications/artificial-intelligence-and-human-nature |archivedate=11 June 2012 |df=dmy}}&amp;lt;/ref&amp;gt;。他认为“任何足够的友善都可能难以与邪恶区分。”人类不应该假设机器或机器人会对我们友好，因为没有先验理由认为他们会对我们的道德体系有共鸣。这个体系是在我们特定的生物进化过程中产生的(AI没有这个过程)。超智能软件不一定会认同人类的继续存在，且我们将极难停止超级AI的运转。最近一些学术出版物也开始讨论这个话题，认为它是对文明、人类和地球造成风险的真正来源。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
One proposal to deal with this is to ensure that the first generally intelligent AI is '[[Friendly AI]]' and will be able to control subsequently developed AIs. Some question whether this kind of check could actually remain in place.&lt;br /&gt;
&lt;br /&gt;
One proposal to deal with this is to ensure that the first generally intelligent AI is 'Friendly AI' and will be able to control subsequently developed AIs. Some question whether this kind of check could actually remain in place.&lt;br /&gt;
&lt;br /&gt;
解决这个问题的一个建议是确保第一个具有通用智能的AI是“友好的AI”，并能够控制后面研发的AI。一些人质疑这种“友好”是否真的能够保持不变。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Leading AI researcher [[Rodney Brooks]] writes, &amp;quot;I think it is a mistake to be worrying about us developing malevolent AI anytime in the next few hundred years. I think the worry stems from a fundamental error in not distinguishing the difference between the very real recent advances in a particular aspect of AI and the enormity and complexity of building sentient volitional intelligence.&amp;quot;&amp;lt;ref&amp;gt;{{cite web|last=Brooks|first=Rodney|title=artificial intelligence is a tool, not a threat|date=10 November 2014|url=http://www.rethinkrobotics.com/artificial-intelligence-tool-threat/|url-status=dead|archiveurl=https://web.archive.org/web/20141112130954/http://www.rethinkrobotics.com/artificial-intelligence-tool-threat/|archivedate=12 November 2014|df=dmy-all}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Leading AI researcher Rodney Brooks writes, &amp;quot;I think it is a mistake to be worrying about us developing malevolent AI anytime in the next few hundred years. I think the worry stems from a fundamental error in not distinguishing the difference between the very real recent advances in a particular aspect of AI and the enormity and complexity of building sentient volitional intelligence.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
首席AI研究员罗德尼 · 布鲁克斯写道: “我认为担心我们在未来几百年的研发出邪恶AI是无稽之谈。我觉得这种担忧源于一个根本性的错误，即没有认识到AI在某些领域进展可以很快，但构建有意识有感情的智能则是件庞杂且艰巨的任务。”&amp;lt;ref&amp;gt;{{cite web|last=Brooks|first=Rodney|title=artificial intelligence is a tool, not a threat|date=10 November 2014|url=http://www.rethinkrobotics.com/artificial-intelligence-tool-threat/|url-status=dead|archiveurl=https://web.archive.org/web/20141112130954/http://www.rethinkrobotics.com/artificial-intelligence-tool-threat/|archivedate=12 November 2014|df=dmy-all}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）“我认为担心我们在未来几百年的研发出邪恶AI是无稽之谈。我认为，这种担忧源于一个根本性的错误，即没有认识到AI在某些领域进展可以很快但构建有意识有感情的智能是件庞杂且艰巨的任务。”该句为意译&lt;br /&gt;
  --[[用户:Qige96|Ricky]]（[[用户讨论:Qige96|讨论]]）干得漂亮&lt;br /&gt;
&lt;br /&gt;
===机器意识、知觉和思维 ===&lt;br /&gt;
&lt;br /&gt;
{{Main|Artificial consciousness}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
If an AI system replicates all key aspects of human intelligence, will that system also be [[Sentience|sentient]]—will it have a [[mind]] which has [[consciousness|conscious experiences]]? This question is closely related to the philosophical problem as to the nature of human consciousness, generally referred to as the [[hard problem of consciousness]].&lt;br /&gt;
&lt;br /&gt;
If an AI system replicates all key aspects of human intelligence, will that system also be sentient—will it have a mind which has conscious experiences? This question is closely related to the philosophical problem as to the nature of human consciousness, generally referred to as the hard problem of consciousness.&lt;br /&gt;
&lt;br /&gt;
如果一个AI系统复制了人类智能的所有关键部分，那么这个系统是否也能有意识——它是否能拥有一个有知觉的头脑？这个问题与人类意识本质的哲学问题密切相关，一般称之为意识难题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====意识 ====&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Hard problem of consciousness|Theory of mind}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[David Chalmers]] identified two problems in understanding the mind, which he named the &amp;quot;hard&amp;quot; and &amp;quot;easy&amp;quot; problems of consciousness.&amp;lt;ref name=Chalmers&amp;gt;{{cite journal |url=http://www.imprint.co.uk/chalmers.html |title=Facing up to the problem of consciousness |last=Chalmers |first=David |authorlink=David Chalmers |journal=[[Journal of Consciousness Studies]] |volume= 2 |issue=3 |year=1995 |pages=200–219}} See also [http://consc.net/papers/facing.html this link]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
大卫 · 查尔默斯在理解心智方面提出了两个问题，他称之为意识的“困难”和“容易”问题。 &amp;lt;ref name=Chalmers&amp;gt;{{cite journal |url=http://www.imprint.co.uk/chalmers.html |title=Facing up to the problem of consciousness |last=Chalmers |first=David |authorlink=David Chalmers |journal=[[Journal of Consciousness Studies]] |volume= 2 |issue=3 |year=1995 |pages=200–219}} See also [http://consc.net/papers/facing.html this link]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The easy problem is understanding how the brain processes signals, makes plans and controls behavior. The hard problem is explaining how this ''feels'' or why it should feel like anything at all. Human [[information processing]] is easy to explain, however human [[subjective experience]] is difficult to explain.&lt;br /&gt;
&lt;br /&gt;
The easy problem is understanding how the brain processes signals, makes plans and controls behavior. The hard problem is explaining how this feels or why it should feel like anything at all. Human information processing is easy to explain, however human subjective experience is difficult to explain.&lt;br /&gt;
&lt;br /&gt;
“容易”的问题是理解大脑如何处理信号，制定计划和控制行为。“困难”的问题是如何解释这种感觉或者为什么它会有这种感觉。人类的信息处理过程很容易解释，然而人类的主观体验却很难解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
For example, consider what happens when a person is shown a color swatch and identifies it, saying &amp;quot;it's red&amp;quot;. The easy problem only requires understanding the machinery in the brain that makes it possible for a person to know that the color swatch is red. The hard problem is that people also know something else—they also know ''what red looks like''. (Consider that a person born blind can know that something is red without knowing what red looks like.){{efn|This is based on [[Mary's Room]], a thought experiment first proposed by [[Frank Cameron Jackson|Frank Jackson]] in 1982}} Everyone knows subjective experience exists, because they do it every day (e.g., all sighted people know what red looks like). The hard problem is explaining how the brain creates it, why it exists, and how it is different from knowledge and other aspects of the brain.&lt;br /&gt;
&lt;br /&gt;
For example, consider what happens when a person is shown a color swatch and identifies it, saying &amp;quot;it's red&amp;quot;. The easy problem only requires understanding the machinery in the brain that makes it possible for a person to know that the color swatch is red. The hard problem is that people also know something else—they also know what red looks like. (Consider that a person born blind can know that something is red without knowing what red looks like.) Everyone knows subjective experience exists, because they do it every day (e.g., all sighted people know what red looks like). The hard problem is explaining how the brain creates it, why it exists, and how it is different from knowledge and other aspects of the brain.&lt;br /&gt;
&lt;br /&gt;
例如当一个人看到一张色卡并识别它，说“它是红色的”时会发生什么。这个简单的问题只需要知道这个人大脑中认出色卡是红色的机制。困难的问题是，人们还知道其他一些东西——他们还知道红色长什么样。(一个天生失明的人也能知道什么是红色，即使不知道红色是什么样子。)每个人都知道主观体验的存在，因为他们每天都有主观体验(例如，所有视力正常的人都知道红色是什么样子)。困难的问题是解释大脑如何创造它，为什么它存在，以及它如何区别于知识和大脑的其他方面。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====计算主义和功能主义====&lt;br /&gt;
&lt;br /&gt;
{{Main|Computationalism|Functionalism (philosophy of mind)}}&lt;br /&gt;
&lt;br /&gt;
Computationalism is the position in the [[philosophy of mind]] that the human mind or the human brain (or both) is an information processing system and that thinking is a form of computing.&amp;lt;ref&amp;gt;[[Steven Horst|Horst, Steven]], (2005) [http://plato.stanford.edu/entries/computational-mind/ &amp;quot;The Computational Theory of Mind&amp;quot;] in ''The Stanford Encyclopedia of Philosophy''&amp;lt;/ref&amp;gt; Computationalism argues that the relationship between mind and body is similar or identical to the relationship between software and hardware and thus may be a solution to the [[mind-body problem]]. This philosophical position was inspired by the work of AI researchers and cognitive scientists in the 1960s and was originally proposed by philosophers [[Jerry Fodor]] and [[Hilary Putnam]].&lt;br /&gt;
&lt;br /&gt;
Computationalism is the position in the philosophy of mind that the human mind or the human brain (or both) is an information processing system and that thinking is a form of computing. Computationalism argues that the relationship between mind and body is similar or identical to the relationship between software and hardware and thus may be a solution to the mind-body problem. This philosophical position was inspired by the work of AI researchers and cognitive scientists in the 1960s and was originally proposed by philosophers Jerry Fodor and Hilary Putnam.&lt;br /&gt;
&lt;br /&gt;
计算主义站在心智哲学的立场，认为人类心智或人类大脑(都)是一个信息处理系统，思维是一种计算形式。计算主义认为，思想和身体之间的关系与软件和硬件之间的关系是相似或相同的，因此这也许能帮助解决“意识和身体问题”。这一哲学立场受20世纪60年代AI研究人员和认知科学家的工作的启发，最初由哲学家杰里·福多和希拉里·普特南提出。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====强人工智能假说 ====&lt;br /&gt;
&lt;br /&gt;
{{Main|Chinese room}}&lt;br /&gt;
&lt;br /&gt;
The philosophical position that [[John Searle]] has named [[strong AI hypothesis|&amp;quot;strong AI&amp;quot;]] states: &amp;quot;The appropriately programmed computer with the right inputs and outputs would thereby have a mind in exactly the same sense human beings have minds.&amp;quot;&amp;lt;ref name=&amp;quot;Searle's strong AI&amp;quot;/&amp;gt; Searle counters this assertion with his [[Chinese room]] argument, which asks us to look ''inside'' the computer and try to find where the &amp;quot;mind&amp;quot; might be.&amp;lt;ref name=&amp;quot;Chinese room&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The philosophical position that John Searle has named &amp;quot;strong AI&amp;quot; states: &amp;quot;The appropriately programmed computer with the right inputs and outputs would thereby have a mind in exactly the same sense human beings have minds.&amp;quot; Searle counters this assertion with his Chinese room argument, which asks us to look inside the computer and try to find where the &amp;quot;mind&amp;quot; might be.&lt;br /&gt;
&lt;br /&gt;
“具有正确输入和输出程序的计算机，将因此拥有与人脑意义完全相同的头脑。”约翰·塞尔称这种哲学立场为“强人工智能”，然后用他的中文屋论点反驳了这种说法，他让人们看看电脑内部，并试图找出“思维”可能在哪里。&lt;br /&gt;
 --[[用户:Qige96|Ricky]]([[用户讨论:Qige96讨论]])其实我不认同中文屋，我觉得这就是对系统论（总体大于部分之和）的无视。&lt;br /&gt;
&lt;br /&gt;
====机器人的权利====&lt;br /&gt;
&lt;br /&gt;
{{Main|Robot rights}}&lt;br /&gt;
&lt;br /&gt;
If a machine can be created that has intelligence, could it also ''[[sentience|feel]]''? If it can feel, does it have the same rights as a human? This issue, now known as &amp;quot;[[robot rights]]&amp;quot;, is currently being considered by, for example, California's [[Institute for the Future]], although many critics believe that the discussion is premature.&amp;lt;ref name=&amp;quot;Robot rights&amp;quot;/&amp;gt; Some critics of [[transhumanism]] argue that any hypothetical robot rights would lie on a spectrum with [[animal rights]] and human rights. &amp;lt;ref Name=&amp;quot;Evans 2015&amp;quot;&amp;gt;{{cite journal | last = Evans | first = Woody | authorlink = Woody Evans | title = Posthuman Rights: Dimensions of Transhuman Worlds | journal = Teknokultura | volume = 12 | issue = 2 | date = 2015 | df = dmy-all | doi = 10.5209/rev_TK.2015.v12.n2.49072 | doi-access = free }}&amp;lt;/ref&amp;gt; The subject is profoundly discussed in the 2010 documentary film ''[[Plug &amp;amp; Pray]]'',&amp;lt;ref&amp;gt;{{cite web|url=http://www.plugandpray-film.de/en/content.html|title=Content: Plug &amp;amp; Pray Film – Artificial Intelligence – Robots -|author=maschafilm|work=plugandpray-film.de|url-status=live|archiveurl=https://web.archive.org/web/20160212040134/http://www.plugandpray-film.de/en/content.html|archivedate=12 February 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; and many sci fi media such as [[Star Trek]] Next Generation, with the character of [[Commander Data]], who fought being disassembled for research, and wanted to &amp;quot;become human&amp;quot;, and the robotic holograms in Voyager.&lt;br /&gt;
&lt;br /&gt;
If a machine can be created that has intelligence, could it also feel? If it can feel, does it have the same rights as a human? This issue, now known as &amp;quot;robot rights&amp;quot;, is currently being considered by, for example, California's Institute for the Future, although many critics believe that the discussion is premature. The subject is profoundly discussed in the 2010 documentary film Plug &amp;amp; Pray, and many sci fi media such as Star Trek Next Generation, with the character of Commander Data, who fought being disassembled for research, and wanted to &amp;quot;become human&amp;quot;, and the robotic holograms in Voyager.&lt;br /&gt;
&lt;br /&gt;
如果可以创造出一台有智能的机器，那么它是否也有感觉呢？如果它有感觉，它是否拥有与人类同样的权利？这个目前被称为“机器人权利”的问题正在被人们考虑&amp;lt;ref name=&amp;quot;Robot rights&amp;quot;/&amp;gt;，例如，加利福尼亚的未来研究所就在从事相关研究，尽管许多批评论家认为这种讨论为时过早&amp;lt;ref Name=&amp;quot;Evans 2015&amp;quot;&amp;gt;{{cite journal | last = Evans | first = Woody | authorlink = Woody Evans | title = Posthuman Rights: Dimensions of Transhuman Worlds | journal = Teknokultura | volume = 12 | issue = 2 | date = 2015 | df = dmy-all | doi = 10.5209/rev_TK.2015.v12.n2.49072 | doi-access = free }}&amp;lt;/ref&amp;gt;。2010年的纪录片《插头与祷告》(Plug &amp;amp; Pray)&amp;lt;ref&amp;gt;{{cite web|url=http://www.plugandpray-film.de/en/content.html|title=Content: Plug &amp;amp; Pray Film – Artificial Intelligence – Robots -|author=maschafilm|work=plugandpray-film.de|url-status=live|archiveurl=https://web.archive.org/web/20160212040134/http://www.plugandpray-film.de/en/content.html|archivedate=12 February 2016|df=dmy-all}}&amp;lt;/ref&amp;gt;以及《星际迷航: 下一代》(Star Trek Next Generation)等许多科幻媒体都对这个主题进行了深入讨论。《星际迷航》中有个指挥官角色叫戴塔(Data) ，他希望“变成人类”，和为了不被拆解而抗争。&lt;br /&gt;
&lt;br /&gt;
===超级智能 ===&lt;br /&gt;
&lt;br /&gt;
{{Main|Superintelligence}}&lt;br /&gt;
&lt;br /&gt;
Are there limits to how intelligent machines—or human-machine hybrids—can be? A superintelligence, hyperintelligence, or superhuman intelligence is a hypothetical agent that would possess intelligence far surpassing that of the brightest and most gifted human mind. ''Superintelligence'' may also refer to the form or degree of intelligence possessed by such an agent.&amp;lt;ref name=&amp;quot;Roberts&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Are there limits to how intelligent machines—or human-machine hybrids—can be? A superintelligence, hyperintelligence, or superhuman intelligence is a hypothetical agent that would possess intelligence far surpassing that of the brightest and most gifted human mind. Superintelligence may also refer to the form or degree of intelligence possessed by such an agent.&lt;br /&gt;
&lt;br /&gt;
智能机器——或者说人机混合体——能达到的怎样的程度有限吗？超级智能、超智能或者超人智能是一种假想的智能主体，它拥有的智能远远超过最聪明、最有天赋的人类智慧。超级智能也可以指这种智能体所拥有的智能的形式或程度。&amp;lt;ref name=&amp;quot;Roberts&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====技术奇点====&lt;br /&gt;
&lt;br /&gt;
{{Main|Technological singularity|Moore's law}}&lt;br /&gt;
&lt;br /&gt;
If research into [[artificial general intelligence|Strong AI]] produced sufficiently intelligent software, it might be able to reprogram and improve itself. The improved software would be even better at improving itself, leading to [[Intelligence explosion|recursive self-improvement]].&amp;lt;ref name=&amp;quot;recurse&amp;quot;/&amp;gt; The new intelligence could thus increase exponentially and dramatically surpass humans. Science fiction writer [[Vernor Vinge]] named this scenario &amp;quot;[[technological singularity|singularity]]&amp;quot;.&amp;lt;ref name=Singularity/&amp;gt; Technological singularity is when accelerating progress in technologies will cause a runaway effect wherein artificial intelligence will exceed human intellectual capacity and control, thus radically changing or even ending civilization. Because the capabilities of such an intelligence may be impossible to comprehend, the technological singularity is an occurrence beyond which events are unpredictable or even unfathomable.&amp;lt;ref name=Singularity/&amp;gt;&amp;lt;ref name=&amp;quot;Roberts&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If research into Strong AI produced sufficiently intelligent software, it might be able to reprogram and improve itself. The improved software would be even better at improving itself, leading to recursive self-improvement. The new intelligence could thus increase exponentially and dramatically surpass humans. Science fiction writer Vernor Vinge named this scenario &amp;quot;singularity&amp;quot;. Technological singularity is when accelerating progress in technologies will cause a runaway effect wherein artificial intelligence will exceed human intellectual capacity and control, thus radically changing or even ending civilization. Because the capabilities of such an intelligence may be impossible to comprehend, the technological singularity is an occurrence beyond which events are unpredictable or even unfathomable.&lt;br /&gt;
&lt;br /&gt;
如果对强人工智能的研究造出了足够智能的软件，那么它也许能做到重新编程并改进自己。改进后的软件甚至可以更好地改进自己，从而实现递归的自我改进。这种新的智能因此可以呈指数增长，并大大超过人类&amp;lt;ref name=&amp;quot;recurse&amp;quot;/&amp;gt;。科幻作家弗诺·文奇将这种情况命名为“奇点”&amp;lt;ref name=Singularity/&amp;gt; ：技术的加速发展将导致AI超越人类智力和控制能力的失控局面，从而彻底改变甚至终结人类文明。因为这样的智能人类难以理解，所有技术奇点出现后发生的事是不可预测，或者说深不可测的。&amp;lt;ref name=Singularity/&amp;gt;&amp;lt;ref name=&amp;quot;Roberts&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Ray Kurzweil]] has used [[Moore's law]] (which describes the relentless exponential improvement in digital technology) to calculate that [[desktop computer]]s will have the same processing power as human brains by the year 2029, and predicts that the singularity will occur in 2045.&amp;lt;ref name=Singularity/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Ray Kurzweil has used Moore's law (which describes the relentless exponential improvement in digital technology) to calculate that desktop computers will have the same processing power as human brains by the year 2029, and predicts that the singularity will occur in 2045.&lt;br /&gt;
&lt;br /&gt;
雷·库兹韦尔利用摩尔定律(描述了数字技术指数增长的现象)计算出，到2029年，台式电脑的处理能力将与人类大脑相当，并预测奇点将出现在2045年。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====超人类主义 ====&lt;br /&gt;
&lt;br /&gt;
{{Main|Transhumanism}}&lt;br /&gt;
&lt;br /&gt;
Robot designer [[Hans Moravec]], cyberneticist [[Kevin Warwick]] and inventor [[Ray Kurzweil]] have predicted that humans and machines will merge in the future into [[cyborg]]s that are more capable and powerful than either.&amp;lt;ref name=&amp;quot;Transhumanism&amp;quot;/&amp;gt; This idea, called [[transhumanism]], has roots in [[Aldous Huxley]] and [[Robert Ettinger]].&lt;br /&gt;
&lt;br /&gt;
Robot designer Hans Moravec, cyberneticist Kevin Warwick and inventor Ray Kurzweil have predicted that humans and machines will merge in the future into cyborgs that are more capable and powerful than either. This idea, called transhumanism, has roots in Aldous Huxley and Robert Ettinger.&lt;br /&gt;
&lt;br /&gt;
机器人设计师汉斯·莫拉维克、控制论专家凯文·沃里克和发明家雷·库兹韦尔预言，人类和机器将在未来融合成为比两者都更强的半机器人&amp;lt;ref name=&amp;quot;Transhumanism&amp;quot;/&amp;gt;。这种观点被称为“超人类主义”，这种观点起源于阿道司·赫胥黎和罗伯特•艾廷格。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Edward Fredkin]] argues that &amp;quot;artificial intelligence is the next stage in evolution&amp;quot;, an idea first proposed by [[Samuel Butler (novelist)|Samuel Butler]]'s &amp;quot;[[Darwin among the Machines]]&amp;quot; as far back as 1863, and expanded upon by [[George Dyson (science historian)|George Dyson]] in his book of the same name in 1998.&amp;lt;ref name=&amp;quot;AI as evolution&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Edward Fredkin argues that &amp;quot;artificial intelligence is the next stage in evolution&amp;quot;, an idea first proposed by Samuel Butler's &amp;quot;Darwin among the Machines&amp;quot; as far back as 1863, and expanded upon by George Dyson in his book of the same name in 1998.&lt;br /&gt;
&lt;br /&gt;
爱德华•弗雷德金认为，“人工智能是进化的下一个阶段”。早在1863年，塞缪尔•巴特勒的《机器中的达尔文》(Darwin among the Machines)就首次提出了这一观点，乔治•戴森在1998年的同名著作中对其进行了延伸。&lt;br /&gt;
&lt;br /&gt;
== 经济学 Economics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The long-term economic effects of AI are uncertain. A survey of economists showed disagreement about whether the increasing use of robots and AI will cause a substantial increase in long-term [[unemployment]], but they generally agree that it could be a net benefit, if [[productivity]] gains are [[Redistribution of income and wealth|redistributed]].&amp;lt;ref&amp;gt;{{Cite web|url=http://www.igmchicago.org/surveys/robots-and-artificial-intelligence|title=Robots and Artificial Intelligence|last=|first=|date=|website=www.igmchicago.org|access-date=2019-07-03}}&amp;lt;/ref&amp;gt; A February 2020 European Union white paper on artificial intelligence advocated for artificial intelligence for economic benefits, including &amp;quot;improving healthcare (e.g. making diagnosis more  precise,  enabling  better  prevention  of  diseases), increasing  the  efficiency  of  farming, contributing  to climate  change mitigation  and  adaptation, [and] improving  the  efficiency  of production systems through predictive maintenance&amp;quot;, while acknowledging potential risks.&amp;lt;ref name=&amp;quot;:1&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The long-term economic effects of AI are uncertain. A survey of economists showed disagreement about whether the increasing use of robots and AI will cause a substantial increase in long-term unemployment, but they generally agree that it could be a net benefit, if productivity gains are redistributed. A February 2020 European Union white paper on artificial intelligence advocated for artificial intelligence for economic benefits, including &amp;quot;improving healthcare (e.g. making diagnosis more  precise,  enabling  better  prevention  of  diseases), increasing  the  efficiency  of  farming, contributing  to climate  change mitigation  and  adaptation, [and] improving  the  efficiency  of production systems through predictive maintenance&amp;quot;, while acknowledging potential risks.&lt;br /&gt;
&lt;br /&gt;
人工智能的长期经济效应是不确定的。一项对经济学家的调查显示，在机器人和AI的使用的日益增加是否会导致长期失业率大幅上升的问题上，人们的意见存在分歧。但他们普遍认为，如果生产力提高的成果得到重新分配，也许这也不是一件坏事。2020年2月，欧盟发表了一份关于AI的白皮书，主张为了增加经济利益而使用AI，其中包括“改善医疗保健(例如：使诊断更加精确，能够更好地预防疾病) ，提高耕作效率，为缓解和适应气候变化做出贡献，以及通过预测性维护提高生产系统的效率”，同时也承认AI有潜在风险。&lt;br /&gt;
&lt;br /&gt;
== 规范 Regulation ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Regulation of artificial intelligence|Regulation of algorithms}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The development of public sector policies for promoting and regulating artificial intelligence (AI) is considered necessary to both encourage AI and manage associated risks, but challenging.&amp;lt;ref&amp;gt;{{Cite journal|last=Wirtz|first=Bernd W.|last2=Weyerer|first2=Jan C.|last3=Geyer|first3=Carolin|date=2018-07-24|title=Artificial Intelligence and the Public Sector—Applications and Challenges|journal=International Journal of Public Administration|volume=42|issue=7|pages=596–615|doi=10.1080/01900692.2018.1498103|issn=0190-0692}}&amp;lt;/ref&amp;gt; In 2017 [[Elon Musk]] called for regulation of AI development.&amp;lt;ref&amp;gt;{{cite news|url=https://www.npr.org/sections/thetwo-way/2017/07/17/537686649/elon-musk-warns-governors-artificial-intelligence-poses-existential-risk|title=Elon Musk Warns Governors: Artificial Intelligence Poses 'Existential Risk'|work=NPR.org|accessdate=27 November 2017|language=en}}&amp;lt;/ref&amp;gt; Multiple states now have national policies under development or in place,&amp;lt;ref&amp;gt;{{Cite book|last=Campbell|first=Thomas A.|url=http://www.unicri.it/in_focus/files/Report_AI-An_Overview_of_State_Initiatives_FutureGrasp_7-23-19.pdf|title=Artificial Intelligence: An Overview of State Initiatives|publisher=FutureGrasp, LLC|year=2019|isbn=|location=Evergreen, CO|pages=}}&amp;lt;/ref&amp;gt; and in February 2020, the European Union published its draft strategy paper for promoting and regulating AI.&amp;lt;ref name=&amp;quot;:12&amp;quot;&amp;gt;{{Cite book|last=|first=|url=https://ec.europa.eu/info/sites/info/files/commission-white-paper-artificial-intelligence-feb2020_en.pdf|title=White Paper: On Artificial Intelligence - A European approach to excellence and trust|publisher=European Commission|year=2020|isbn=|location=Brussels|pages=1}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The development of public sector policies for promoting and regulating artificial intelligence (AI) is considered necessary to both encourage AI and manage associated risks, but challenging. In 2017 Elon Musk called for regulation of AI development. Multiple states now have national policies under development or in place, and in February 2020, the European Union published its draft strategy paper for promoting and regulating AI.&lt;br /&gt;
&lt;br /&gt;
促进和规范AI的公共部门政策被认为对鼓励人工智能和控制相关风险是必要的，但具有挑战性。2017年，埃隆 · 马斯克呼吁监管AI的发展。多个国家现在正在制定或实施国家性政策，2020年2月，欧盟公布了促进和管理AI的战略文件草案。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== 小说 In fiction ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Artificial intelligence in fiction}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Capek play.jpg|thumb|The word &amp;quot;robot&amp;quot; itself was coined by [[Karel Čapek]] in his 1921 play ''[[R.U.R.]]'', the title standing for &amp;quot;[[Rossum's Universal Robots]]&amp;quot;“机器人”这个词本身是由[[ 卡雷尔·恰佩克 在他1921年的戏剧《R.U.R》中创造的，剧名代表“Rossum 的万能机器人”(Rossum's Universal Robots)]]]&lt;br /&gt;
&lt;br /&gt;
The word &amp;quot;robot&amp;quot; itself was coined by [[Karel Čapek in his 1921 play R.U.R., the title standing for &amp;quot;Rossum's Universal Robots&amp;quot;]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Thought-capable artificial beings appeared as storytelling devices since antiquity,&amp;lt;ref name=&amp;quot;AI in myth&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Thought-capable artificial beings appeared as storytelling devices since antiquity,&lt;br /&gt;
&lt;br /&gt;
自古以来，具有思考能力的人工生物就作为叙事工具在小说中出现。&lt;br /&gt;
&lt;br /&gt;
and have been a persistent theme in [[science fiction]].&lt;br /&gt;
&lt;br /&gt;
and have been a persistent theme in science fiction.&lt;br /&gt;
&lt;br /&gt;
一直是科幻小说中的一个永恒主题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A common [[Trope (literature)|trope]] in these works began with [[Mary Shelley]]'s ''[[Frankenstein]]'', where a human creation becomes a threat to its masters. This includes such works as [[2001: A Space Odyssey (novel)|Arthur C. Clarke's]] and [[2001: A Space Odyssey (film)|Stanley Kubrick's]] ''[[2001: A Space Odyssey]]'' (both 1968), with [[HAL 9000]], the murderous computer in charge of the ''[[Discovery One]]'' spaceship, as well as ''[[The Terminator]]'' (1984) and ''[[The Matrix]]'' (1999). In contrast, the rare loyal robots such as Gort from ''[[The Day the Earth Stood Still]]'' (1951) and Bishop from ''[[Aliens (film)|Aliens]]'' (1986) are less prominent in popular culture.&amp;lt;ref&amp;gt;{{cite journal|last1=Buttazzo|first1=G.|title=Artificial consciousness: Utopia or real possibility?|journal=[[Computer (magazine)|Computer]]|date=July 2001|volume=34|issue=7|pages=24–30|doi=10.1109/2.933500|df=dmy-all}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A common trope in these works began with Mary Shelley's Frankenstein, where a human creation becomes a threat to its masters. This includes such works as Arthur C. Clarke's and Stanley Kubrick's 2001: A Space Odyssey (both 1968), with HAL 9000, the murderous computer in charge of the Discovery One spaceship, as well as The Terminator (1984) and The Matrix (1999). In contrast, the rare loyal robots such as Gort from The Day the Earth Stood Still (1951) and Bishop from Aliens (1986) are less prominent in popular culture.&lt;br /&gt;
&lt;br /&gt;
在这些作品中，玛丽 · 雪莱的《弗兰肯斯坦》最先使用了这种常见的提法 ，在这部作品中，人造物对其主人产生了威胁。这些作品包括亚瑟·查理斯·克拉克和斯坦利 · 库布里克的《2001: 太空漫游》(2001: a Space Odyssey，都是1968年出品) ，包括哈尔9000(HAL 9000) ，负责发现一号飞船的凶残计算机，以及《终结者》(The Terminator，1984)和《黑客帝国》(The Matrix，1999)。相比之下，像《地球停止转动的日子》(1951)中的格特和《异形》(1986)中的毕晓普（Bishop）这样罕见的忠诚机器人在流行文化中就不那么突出了。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Isaac Asimov]] introduced the [[Three Laws of Robotics]] in many books and stories, most notably the &amp;quot;Multivac&amp;quot; series about a super-intelligent computer of the same name. Asimov's laws are often brought up during lay discussions of machine ethics;&amp;lt;ref&amp;gt;Anderson, Susan Leigh. &amp;quot;Asimov's &amp;quot;three laws of robotics&amp;quot; and machine metaethics.&amp;quot; AI &amp;amp; Society 22.4 (2008): 477–493.&amp;lt;/ref&amp;gt; while almost all artificial intelligence researchers are familiar with Asimov's laws through popular culture, they generally consider the laws useless for many reasons, one of which is their ambiguity.&amp;lt;ref&amp;gt;{{cite journal | last1 = McCauley | first1 = Lee | year = 2007 | title = AI armageddon and the three laws of robotics | url = | journal = Ethics and Information Technology | volume = 9 | issue = 2| pages = 153–164 | doi=10.1007/s10676-007-9138-2| citeseerx = 10.1.1.85.8904}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Isaac Asimov introduced the Three Laws of Robotics in many books and stories, most notably the &amp;quot;Multivac&amp;quot; series about a super-intelligent computer of the same name. Asimov's laws are often brought up during lay discussions of machine ethics; while almost all artificial intelligence researchers are familiar with Asimov's laws through popular culture, they generally consider the laws useless for many reasons, one of which is their ambiguity.&lt;br /&gt;
&lt;br /&gt;
艾萨克 · 阿西莫夫在许多书籍和故事中介绍了机器人三定律，最著名的是关于同名的“Multitvac”超级智能计算机系列。阿西莫夫定律经常在茶余饭后对机器伦理的讨论中被提起。几乎所有的AI研究人员都通过流行文化熟悉阿西莫夫定律，但他们通常认为这些定律因为许多原因而无用，其中一个原因就是它们的描述过于模糊。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Transhumanism]] (the merging of humans and machines) is explored in the [[manga]] ''[[Ghost in the Shell]]'' and the science-fiction series ''[[Dune (novel)|Dune]]''. In the 1980s, artist [[Hajime Sorayama]]'s Sexy Robots series were painted and published in Japan depicting the actual organic human form with lifelike muscular metallic skins and later &amp;quot;the Gynoids&amp;quot; book followed that was used by or influenced movie makers including [[George Lucas]] and other creatives. Sorayama never considered these organic robots to be real part of nature but always unnatural product of the human mind, a fantasy existing in the mind even when realized in actual form.&lt;br /&gt;
&lt;br /&gt;
Transhumanism (the merging of humans and machines) is explored in the manga Ghost in the Shell and the science-fiction series Dune. In the 1980s, artist Hajime Sorayama's Sexy Robots series were painted and published in Japan depicting the actual organic human form with lifelike muscular metallic skins and later &amp;quot;the Gynoids&amp;quot; book followed that was used by or influenced movie makers including George Lucas and other creatives. Sorayama never considered these organic robots to be real part of nature but always unnatural product of the human mind, a fantasy existing in the mind even when realized in actual form.&lt;br /&gt;
&lt;br /&gt;
漫画《攻壳机动队》(manga Ghost in the Shell)和科幻小说《沙丘》(Dune)探讨了超人类主义(人类和机器的结合)。20世纪80年代，艺术家空山基的性感机器人系列在日本绘制并出版，描绘了真实的拥有栩栩如生的金属肌肉皮肤的有机人类形体，后来又出版了《雌蕊》一书，该书被乔治 · 卢卡斯等电影制作人使用。空山基从来不认为这些有机机器人是自然的一部分，而是非自然的人类心智的产品，一个存在于头脑中，也许能以实体形式实现的幻想。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Several works use AI to force us to confront the fundamental question of what makes us human, showing us artificial beings that have [[sentience|the ability to feel]], and thus to suffer. This appears in [[Karel Čapek]]'s ''[[R.U.R.]]'', the films ''[[A.I. Artificial Intelligence]]'' and ''[[Ex Machina (film)|Ex Machina]]'', as well as the novel ''[[Do Androids Dream of Electric Sheep?]]'', by [[Philip K. Dick]]. Dick considers the idea that our understanding of human subjectivity is altered by technology created with artificial intelligence.&amp;lt;ref&amp;gt;{{Cite journal|last=Galvan|first=Jill|date=1 January 1997|title=Entering the Posthuman Collective in Philip K. Dick's &amp;quot;Do Androids Dream of Electric Sheep?&amp;quot;|journal=Science Fiction Studies|volume=24|issue=3|pages=413–429|jstor=4240644}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Several works use AI to force us to confront the fundamental question of what makes us human, showing us artificial beings that have the ability to feel, and thus to suffer. This appears in Karel Čapek's R.U.R., the films A.I. Artificial Intelligence and Ex Machina, as well as the novel Do Androids Dream of Electric Sheep?, by Philip K. Dick. Dick considers the idea that our understanding of human subjectivity is altered by technology created with artificial intelligence.&lt;br /&gt;
&lt;br /&gt;
一些作品向我们展示了有感知的能力，因此也有遭受苦难的能力的AI，迫使我们面对是什么让我们成为人类这一根本问题。这些都在卡雷尔 · 阿佩克的电影《人工智能》、《机器姬》，以及菲利普·K·迪克的小说《机器人会梦见电子羊吗?》中都有出现。迪克认为，AI创造的技术改变了我们对人类主观性的理解。&lt;br /&gt;
&lt;br /&gt;
==参见 See also==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{portal|Computer programming}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{col div|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
* [[溯因推理 Abductive reasoning]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* ''[[爱,死亡,机器人 A.I. Rising]]''&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[人工智能武器装备竞赛 Artificial intelligence arms race]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[行为选择算法 Behavior selection algorithm]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[交易处理自动机 Business process automation]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[基于案例的推理 Case-based reasoning]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[常识推理 Commonsense reasoning]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[涌现算法 Emergent algorithm]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[进化计算 Evolutionary computation]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[人工智能技术的女性 Female gendering of AI technologies]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[人工智能术语表 Glossary of artificial intelligence]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[机器学习 Machine learning]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[数学优化 Mathematical optimization]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[多主体系统 Multi-agent system]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[个性化计算 Personality computing]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[人工智能规范 Regulation of artificial intelligence]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[机器处理自动机 Robotic process automation]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[通用基础收入 Universal basic income]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[弱人工智能Weak AI]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{colend}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==解释说明 Explanatory notes ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{notelist}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==参考资料 References ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{reflist|30em|refs=&lt;br /&gt;
&lt;br /&gt;
{{reflist|30em|refs=&lt;br /&gt;
&lt;br /&gt;
{通货再膨胀 | 30em | 参考文献&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- INTRODUCTION ------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- INTRODUCTION ------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-- 引言——————————————————————————————————————————————————————————————————————————————&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Definition of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Definition of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”人工智能的定义”&lt;br /&gt;
&lt;br /&gt;
Definition of AI as the study of [[intelligent agents]]:&lt;br /&gt;
&lt;br /&gt;
Definition of AI as the study of intelligent agents:&lt;br /&gt;
&lt;br /&gt;
将人工智能定义为对智能体的研究:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|loc=[http://people.cs.ubc.ca/~poole/ci/ch1.pdf p. 1]}}, which provides the version that is used in this article. Note that they use the term &amp;quot;computational intelligence&amp;quot; as a synonym for artificial intelligence.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvtxt|Russell|Norvig|2003}} (who prefer the term &amp;quot;rational agent&amp;quot;) and write &amp;quot;The whole-agent view is now widely accepted in the field&amp;quot; {{Harv|Russell|Norvig|2003|p=55}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--These textbooks are the most widely used in academic AI.--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--These textbooks are the most widely used in academic AI.--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
这些教科书是学术上使用最广泛的&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Legg|Hutter|2007}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &amp;lt;ref name=&amp;quot;Coining of the term AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &amp;lt;ref name=&amp;quot;Coining of the term AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
!-参考名称“ ai”一词的创造力&lt;br /&gt;
&lt;br /&gt;
Although there is some controversy on this point (see {{Harvtxt|Crevier|1993|p=50}}), [[John McCarthy (computer scientist)|McCarthy]] states unequivocally &amp;quot;I came up with the term&amp;quot; in a c|net interview. {{Harv|Skillings|2006}} McCarthy first used the term in the proposal for the Dartmouth conference, which appeared in 1955. {{Harv|McCarthy|Minsky|Rochester|Shannon|1955}}&lt;br /&gt;
&lt;br /&gt;
Although there is some controversy on this point (see ), McCarthy states unequivocally &amp;quot;I came up with the term&amp;quot; in a c|net interview.  McCarthy first used the term in the proposal for the Dartmouth conference, which appeared in 1955. &lt;br /&gt;
&lt;br /&gt;
虽然在这一点上有一些争议(见) ，麦卡锡明确声明“我想出了这个词”在 c | net 采访。麦卡锡在1955年达特茅斯会议的提案中首次使用了这个词。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ ref --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &amp;lt;ref name=&amp;quot;McCarthy's definition of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &amp;lt;ref name=&amp;quot;McCarthy's definition of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
!-参考名称“麦卡锡的 ai”的定义&lt;br /&gt;
&lt;br /&gt;
[[John McCarthy (computer scientist)|McCarthy]]'s definition of AI:&lt;br /&gt;
&lt;br /&gt;
McCarthy's definition of AI:&lt;br /&gt;
&lt;br /&gt;
麦卡锡对人工智能的定义是:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCarthy|2007}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ ref --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;McCorduck's thesis&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;McCorduck's thesis&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
「麦考达克的论文」&lt;br /&gt;
&lt;br /&gt;
This is a central idea of [[Pamela McCorduck]]'s ''Machines Who Think''. She writes: &amp;quot;I like to think of artificial intelligence as the scientific apotheosis of a venerable cultural tradition.&amp;quot; {{Harv|McCorduck|2004|p=34}} &amp;quot;Artificial intelligence in one form or another is an idea that has pervaded Western intellectual history, a dream in urgent need of being realized.&amp;quot; {{Harv|McCorduck|2004|p=xviii}} &amp;quot;Our history is full of attempts—nutty, eerie, comical, earnest, legendary and real—to make artificial intelligences, to reproduce what is the essential us—bypassing the ordinary means. Back and forth between myth and reality, our imaginations supplying what our workshops couldn't, we have engaged for a long time in this odd form of self-reproduction.&amp;quot; {{Harv|McCorduck|2004|p=3}} She traces the desire back to its [[Hellenistic]] roots and calls it the urge to &amp;quot;forge the Gods.&amp;quot; {{Harv|McCorduck|2004|pp=340–400}}&lt;br /&gt;
&lt;br /&gt;
This is a central idea of Pamela McCorduck's Machines Who Think. She writes: &amp;quot;I like to think of artificial intelligence as the scientific apotheosis of a venerable cultural tradition.&amp;quot;  &amp;quot;Artificial intelligence in one form or another is an idea that has pervaded Western intellectual history, a dream in urgent need of being realized.&amp;quot;  &amp;quot;Our history is full of attempts—nutty, eerie, comical, earnest, legendary and real—to make artificial intelligences, to reproduce what is the essential us—bypassing the ordinary means. Back and forth between myth and reality, our imaginations supplying what our workshops couldn't, we have engaged for a long time in this odd form of self-reproduction.&amp;quot;  She traces the desire back to its Hellenistic roots and calls it the urge to &amp;quot;forge the Gods.&amp;quot; &lt;br /&gt;
&lt;br /&gt;
这是帕梅拉 · 麦考达克的《会思考的机器》的中心思想。她写道: “我喜欢把人工智能看作是古老文化传统的科学典范。”“以这样或那样的形式出现的人工智能是一个弥漫在西方思想史上的思想，一个急需实现的梦想。”“我们的历史充满了各种各样的尝试——疯狂的、怪诞的、滑稽的、严肃的、传奇的和真实的——创造人工智能，复制本质上的我们，绕过普通的手段。在神话和现实之间来回穿梭，我们的想象力提供了我们的工作室所不能提供的东西，我们长期以来一直致力于这种奇怪的自我复制形式。”她将这种欲望追溯到希腊化的根源，并称之为“锻造上帝”的冲动&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Fragmentation of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Fragmentation of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Ai 碎片化运动&lt;br /&gt;
&lt;br /&gt;
Pamela {{Harvtxt|McCorduck|2004|p=424}} writes of &amp;quot;the rough shattering of AI in subfields—vision, natural language, decision theory, genetic algorithms, robotics&amp;amp;nbsp;... and these with own sub-subfield—that would hardly have anything to say to each other.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Pamela  writes of &amp;quot;the rough shattering of AI in subfields—vision, natural language, decision theory, genetic algorithms, robotics&amp;amp;nbsp;... and these with own sub-subfield—that would hardly have anything to say to each other.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
帕梅拉写道，“人工智能在子领域——视觉、自然语言、决策理论、遗传算法、机器人... ... 以及这些有自己子领域的领域——受到了粗暴的打击，彼此之间几乎没有什么可说的。”&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Problems of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Problems of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Ai 的问题&lt;br /&gt;
&lt;br /&gt;
This list of intelligent traits is based on the topics covered by the major AI textbooks, including:&lt;br /&gt;
&lt;br /&gt;
This list of intelligent traits is based on the topics covered by the major AI textbooks, including:&lt;br /&gt;
&lt;br /&gt;
这个智能特征列表是基于主要的人工智能教科书所涉及的主题，包括:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;General intelligence&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;General intelligence&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
通用情报局&lt;br /&gt;
&lt;br /&gt;
General intelligence ([[artificial general intelligence|strong AI]]) is discussed in popular introductions to AI:&lt;br /&gt;
&lt;br /&gt;
General intelligence (strong AI) is discussed in popular introductions to AI:&lt;br /&gt;
&lt;br /&gt;
一般智能(强人工智能)在人工智能的常见介绍中被讨论:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Kurzweil|1999}} and {{Harvnb|Kurzweil|2005}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- History ---------------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- History ---------------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-- 历史——————————————————————————————————————————————————————————————————————————————————————————————&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in myth&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in myth&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
神话中的人工智能&lt;br /&gt;
&lt;br /&gt;
AI in myth:&lt;br /&gt;
&lt;br /&gt;
AI in myth:&lt;br /&gt;
&lt;br /&gt;
神话中的人工智能:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=4–5}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=939}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in early science fiction&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in early science fiction&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
早期科幻小说中的人工智能&lt;br /&gt;
&lt;br /&gt;
AI in early science fiction.&lt;br /&gt;
&lt;br /&gt;
AI in early science fiction.&lt;br /&gt;
&lt;br /&gt;
早期科幻小说中的人工智能。&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=17–25}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Formal reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Formal reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”正式推理”&lt;br /&gt;
&lt;br /&gt;
Formal reasoning:&lt;br /&gt;
&lt;br /&gt;
Formal reasoning:&lt;br /&gt;
&lt;br /&gt;
正式推理:&lt;br /&gt;
&lt;br /&gt;
* {{cite book | first = David | last = Berlinski | year = 2000 | title = The Advent of the Algorithm | publisher = Harcourt Books | author-link = David Berlinski | isbn = 978-0-15-601391-8 | oclc = 46890682 | url = https://archive.org/details/adventofalgorith0000berl }}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;{{page needed|date=December 2016}}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI's immediate precursors&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI's immediate precursors&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
人工智能的直接前兆&lt;br /&gt;
&lt;br /&gt;
AI's immediate precursors:&lt;br /&gt;
&lt;br /&gt;
AI's immediate precursors:&lt;br /&gt;
&lt;br /&gt;
大赦国际的直接前身是:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=51–107}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=27–32}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=15, 940}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Moravec|1988|p=3}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
See also {{slink|History of artificial intelligence|Cybernetics and early neural networks}}. Among the researchers who laid the foundations of AI were [[Alan Turing]], [[John von Neumann]], [[Norbert Wiener]], [[Claude Shannon]], [[Warren McCullough]], [[Walter Pitts]] and [[Donald Hebb]].&amp;lt;ref name=&amp;quot;Dartmouth conference&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
See also . Among the researchers who laid the foundations of AI were Alan Turing, John von Neumann, Norbert Wiener, Claude Shannon, Warren McCullough, Walter Pitts and Donald Hebb.&amp;lt;ref name=&amp;quot;Dartmouth conference&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
参见。在奠定人工智能基础的研究人员中，有 Alan Turing，约翰·冯·诺伊曼，Norbert Wiener，Claude Shannon，Warren McCullough，Walter Pitts 和 Donald Hebb。 达特茅斯会议」&lt;br /&gt;
&lt;br /&gt;
[[Dartmouth Workshop|Dartmouth conference]]:&lt;br /&gt;
&lt;br /&gt;
Dartmouth conference:&lt;br /&gt;
&lt;br /&gt;
返回文章页面达特茅斯大会:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=111–136}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=47–49}}, who writes &amp;quot;the conference is generally recognized as the official birthdate of the new science.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=17}}, who call the conference &amp;quot;the birth of artificial intelligence.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|NRC|1999|pp=200–201}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Hegemony of the Dartmouth conference attendees&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Hegemony of the Dartmouth conference attendees&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
达特茅斯会议与会者的霸权&lt;br /&gt;
&lt;br /&gt;
Hegemony of the Dartmouth conference attendees:&lt;br /&gt;
&lt;br /&gt;
Hegemony of the Dartmouth conference attendees:&lt;br /&gt;
&lt;br /&gt;
达特茅斯大会与会者的霸权:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=17}}, who write &amp;quot;for the next 20 years the field would be dominated by these people and their students.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=129–130}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Golden years of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Golden years of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
黄金人工智能时代&lt;br /&gt;
&lt;br /&gt;
&amp;quot;[[History of AI#The golden years 1956–1974|Golden years]]&amp;quot; of AI (successful symbolic reasoning programs 1956–1973):&lt;br /&gt;
&lt;br /&gt;
&amp;quot;Golden years&amp;quot; of AI (successful symbolic reasoning programs 1956–1973):&lt;br /&gt;
&lt;br /&gt;
人工智能的“黄金年代”(1956-1973年成功的符号推理程序) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=243–252}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=52–107}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Moravec|1988|p=9}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=18–21}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The programs described are [[Arthur Samuel]]'s checkers program for the [[IBM 701]], [[Daniel Bobrow]]'s [[STUDENT (computer program)|STUDENT]], [[Allen Newell|Newell]] and [[Herbert A. Simon|Simon]]'s [[Logic Theorist]] and [[Terry Winograd]]'s [[SHRDLU]].&lt;br /&gt;
&lt;br /&gt;
The programs described are Arthur Samuel's checkers program for the IBM 701, Daniel Bobrow's STUDENT, Newell and Simon's Logic Theorist and Terry Winograd's SHRDLU.&lt;br /&gt;
&lt;br /&gt;
所描述的程序有: Arthur Samuel 为 IBM 701设计的检查程序，Daniel Bobrow 的学生，Newell 和 Simon 的逻辑理论家，以及 Terry Winograd 的 SHRDLU。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI funding in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI funding in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
60年代的人工智能资金&lt;br /&gt;
&lt;br /&gt;
[[DARPA]] pours money into undirected pure research into AI during the 1960s:&lt;br /&gt;
&lt;br /&gt;
DARPA pours money into undirected pure research into AI during the 1960s:&lt;br /&gt;
&lt;br /&gt;
20世纪60年代，美国国防部高级研究计划局(DARPA)将资金投入到对人工智能的无目的的纯粹研究中:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|p=131}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=51, 64–65}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|NRC|1999|pp=204–205}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in England&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in England&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在英国的「 ai 」&lt;br /&gt;
&lt;br /&gt;
AI in England:&lt;br /&gt;
&lt;br /&gt;
AI in England:&lt;br /&gt;
&lt;br /&gt;
英国的人工智能:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Howe|1994}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Optimism of early AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Optimism of early AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
早期 ai 的乐观主义&lt;br /&gt;
&lt;br /&gt;
Optimism of early AI:&lt;br /&gt;
&lt;br /&gt;
Optimism of early AI:&lt;br /&gt;
&lt;br /&gt;
早期人工智能的乐观主义:&lt;br /&gt;
&lt;br /&gt;
* [[Herbert A. Simon|Herbert Simon]] quote: {{Harvnb|Simon|1965|p=96}} quoted in {{Harvnb|Crevier|1993|p=109}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[Marvin Minsky]] quote: {{Harvnb|Minsky|1967|p=2}} quoted in {{Harvnb|Crevier|1993|p=109}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;First AI winter&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;First AI winter&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第一 ai 温特”&lt;br /&gt;
&lt;br /&gt;
First [[AI Winter]], [[Mansfield Amendment]], [[Lighthill report]]&lt;br /&gt;
&lt;br /&gt;
First AI Winter, Mansfield Amendment, Lighthill report&lt;br /&gt;
&lt;br /&gt;
第一人工智能冬季，曼斯菲尔德修正案，莱特希尔报告&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=115–117}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=22}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|NRC|1999|pp=212–213}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Howe|1994}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Newquist|1994|pp=189–201}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Expert systems&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Expert systems&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
专家系统”&lt;br /&gt;
&lt;br /&gt;
Expert systems:&lt;br /&gt;
&lt;br /&gt;
Expert systems:&lt;br /&gt;
&lt;br /&gt;
专家系统:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=I.2.1}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=22–24}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=227–331}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 17.4}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=327–335, 434–435}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=145–62, 197–203}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Newquist|1994|pp=155–183}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in the 80s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in the 80s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
80年代的「人工智能」&lt;br /&gt;
&lt;br /&gt;
Boom of the 1980s: rise of [[expert systems]], [[Fifth generation computer|Fifth Generation Project]], [[Alvey]], [[Microelectronics and Computer Technology Corporation|MCC]], [[Strategic Computing Initiative|SCI]]:&lt;br /&gt;
&lt;br /&gt;
Boom of the 1980s: rise of expert systems, Fifth Generation Project, Alvey, MCC, SCI:&lt;br /&gt;
&lt;br /&gt;
20世纪80年代的繁荣: 专家系统的兴起，第五代计划，Alvey，MCC，SCI:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=426–441}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=161–162,197–203, 211, 240}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=24}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|NRC|1999|pp=210–211}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Newquist|1994|pp=235–248}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Second AI winter&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Second AI winter&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
二 ai 温特”&lt;br /&gt;
&lt;br /&gt;
Second [[AI winter]]:&lt;br /&gt;
&lt;br /&gt;
Second AI winter:&lt;br /&gt;
&lt;br /&gt;
第二个 AI 冬天:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=430–435}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=209–210}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|NRC|1999|pp=214–216}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Newquist|1994|pp=301–318}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Formal methods in AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Formal methods in AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
正式的方法在 ai&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Formal methods are now preferred (&amp;quot;Victory of the [[neats vs. scruffies|neats]]&amp;quot;):&lt;br /&gt;
&lt;br /&gt;
Formal methods are now preferred (&amp;quot;Victory of the neats&amp;quot;):&lt;br /&gt;
&lt;br /&gt;
现在更倾向于使用正式的方法(“近亲的胜利”) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=25–26}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=486–487}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI widely used&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI widely used&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
广泛使用的人工智能&lt;br /&gt;
&lt;br /&gt;
AI applications widely used behind the scenes:&lt;br /&gt;
&lt;br /&gt;
AI applications widely used behind the scenes:&lt;br /&gt;
&lt;br /&gt;
在幕后广泛使用的人工智能应用:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=28}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Kurzweil|2005|p=265}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|NRC|1999|pp=216–222}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Newquist|1994|pp=189–201}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in 2000s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in 2000s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2000年代的人工智能&lt;br /&gt;
&lt;br /&gt;
AI becomes hugely successful in the early 21st century&lt;br /&gt;
&lt;br /&gt;
AI becomes hugely successful in the early 21st century&lt;br /&gt;
&lt;br /&gt;
人工智能在21世纪初取得了巨大的成功&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Clark|2015}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- PROBLEMS ------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- PROBLEMS ------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——问题——————————————————————————————————————————————————————————————————————————————————————&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
推理推理&lt;br /&gt;
&lt;br /&gt;
Problem solving, puzzle solving, game playing and deduction:&lt;br /&gt;
&lt;br /&gt;
Problem solving, puzzle solving, game playing and deduction:&lt;br /&gt;
&lt;br /&gt;
解决问题，解决难题，玩游戏和演绎:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|loc=chpt. 3–9}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|loc=chpt. 2,3,7,9}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|loc=chpt. 3,4,6,8}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 7–12}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Uncertain reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Uncertain reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
不确定推理“&lt;br /&gt;
&lt;br /&gt;
Uncertain reasoning:&lt;br /&gt;
&lt;br /&gt;
Uncertain reasoning:&lt;br /&gt;
&lt;br /&gt;
不确定的推理:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=452–644}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=345–395}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=333–381}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 19}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Intractability&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Intractability&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反对者名字“棘手”&lt;br /&gt;
&lt;br /&gt;
[[Intractably|Intractability and efficiency]] and the [[combinatorial explosion]]:&lt;br /&gt;
&lt;br /&gt;
Intractability and efficiency and the combinatorial explosion:&lt;br /&gt;
&lt;br /&gt;
难以驾驭的效率和组合爆炸:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=9, 21–22}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Psychological evidence of sub-symbolic reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Psychological evidence of sub-symbolic reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
亚符号推理的心理学证据”&lt;br /&gt;
&lt;br /&gt;
Psychological evidence of sub-symbolic reasoning:&lt;br /&gt;
&lt;br /&gt;
Psychological evidence of sub-symbolic reasoning:&lt;br /&gt;
&lt;br /&gt;
子符号推理的心理学证据:&lt;br /&gt;
&lt;br /&gt;
* {{Harvtxt|Wason|Shapiro|1966}} showed that people do poorly on completely abstract problems, but if the problem is restated to allow the use of intuitive [[social intelligence]], performance dramatically improves. (See [[Wason selection task]])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvtxt|Kahneman|Slovic|Tversky|1982}} have shown that people are terrible at elementary problems that involve uncertain reasoning. (See [[list of cognitive biases]] for several examples).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvtxt|Lakoff|Núñez|2000}} have controversially argued that even our skills at mathematics depend on knowledge and skills that come from &amp;quot;the body&amp;quot;, i.e. sensorimotor and perceptual skills. (See [[Where Mathematics Comes From]])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Knowledge representation&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Knowledge representation&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
知识表达&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Knowledge representation]]:&lt;br /&gt;
&lt;br /&gt;
Knowledge representation:&lt;br /&gt;
&lt;br /&gt;
知识表示:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=I.2.4}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=320–363}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=23–46, 69–81, 169–196, 235–277, 281–298, 319–345}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=227–243}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 18}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Knowledge engineering&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Knowledge engineering&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
知识工程学&lt;br /&gt;
&lt;br /&gt;
[[Knowledge engineering]]:&lt;br /&gt;
&lt;br /&gt;
Knowledge engineering:&lt;br /&gt;
&lt;br /&gt;
知识工程:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=260–266}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=199–233}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. ≈17.1–17.4}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Representing categories and relations&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Representing categories and relations&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
代表类别和关系&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Representing categories and relations: [[Semantic network]]s, [[description logic]]s, [[inheritance (computer science)|inheritance]] (including [[frame (artificial intelligence)|frames]] and [[scripts (artificial intelligence)|scripts]]):&lt;br /&gt;
&lt;br /&gt;
Representing categories and relations: Semantic networks, description logics, inheritance (including frames and scripts):&lt;br /&gt;
&lt;br /&gt;
表示类别和关系: 语义网络，描述逻辑，继承(包括框架和脚本) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=349–354}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=174–177}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=248–258}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 18.3}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Representing time&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Representing time&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
代表时间”&lt;br /&gt;
&lt;br /&gt;
Representing events and time:[[Situation calculus]], [[event calculus]], [[fluent calculus]] (including solving the [[frame problem]]):&lt;br /&gt;
&lt;br /&gt;
Representing events and time:Situation calculus, event calculus, fluent calculus (including solving the frame problem):&lt;br /&gt;
&lt;br /&gt;
表示事件和时间: 情境演算、事件演算、流演算(包括解决框架问题) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=328–341}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=281–298}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 18.2}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Representing causation&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Representing causation&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
代表因果关系”&lt;br /&gt;
&lt;br /&gt;
[[Causality#Causal calculus|Causal calculus]]:&lt;br /&gt;
&lt;br /&gt;
Causal calculus:&lt;br /&gt;
&lt;br /&gt;
因果演算:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=335–337}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Representing knowledge about knowledge&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Representing knowledge about knowledge&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
代表知识的知识”&lt;br /&gt;
&lt;br /&gt;
Representing knowledge about knowledge: Belief calculus, [[modal logic]]s:&lt;br /&gt;
&lt;br /&gt;
Representing knowledge about knowledge: Belief calculus, modal logics:&lt;br /&gt;
&lt;br /&gt;
代表知识的知识: 信念演算，模态逻辑:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=341–344}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=275–277}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Ontology&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Ontology&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Ref name&amp;quot;ontology&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Ontology (computer science)|Ontology]]:&lt;br /&gt;
&lt;br /&gt;
Ontology:&lt;br /&gt;
&lt;br /&gt;
本体论:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=320–328}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Qualification problem&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Qualification problem&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
资格问题&lt;br /&gt;
&lt;br /&gt;
[[Qualification problem]]:&lt;br /&gt;
&lt;br /&gt;
Qualification problem:&lt;br /&gt;
&lt;br /&gt;
资格问题:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCarthy|Hayes|1969}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003}}{{Page needed|date=February 2011}}&amp;lt;!-- We really need to know where they say this, because it's kind of wrong --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
While McCarthy was primarily concerned with issues in the logical representation of actions, {{Harvnb|Russell|Norvig|2003}} apply the term to the more general issue of default reasoning in the vast network of assumptions underlying all our commonsense knowledge.&lt;br /&gt;
&lt;br /&gt;
While McCarthy was primarily concerned with issues in the logical representation of actions,  apply the term to the more general issue of default reasoning in the vast network of assumptions underlying all our commonsense knowledge.&lt;br /&gt;
&lt;br /&gt;
麦卡锡主要关注的是行为的逻辑表达问题，而把这个术语应用到我们所有常识知识背后庞大的假设网络中更为普遍的缺省推理问题上。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Default reasoning and non-monotonic logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Default reasoning and non-monotonic logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
违约推理和非单调逻辑&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Default reasoning and [[default logic]], [[non-monotonic logic]]s, [[circumscription (logic)|circumscription]], [[closed world assumption]], [[abductive reasoning|abduction]] (Poole ''et al.'' places abduction under &amp;quot;default reasoning&amp;quot;. Luger ''et al.'' places this under &amp;quot;uncertain reasoning&amp;quot;):&lt;br /&gt;
&lt;br /&gt;
Default reasoning and default logic, non-monotonic logics, circumscription, closed world assumption, abduction (Poole et al. places abduction under &amp;quot;default reasoning&amp;quot;. Luger et al. places this under &amp;quot;uncertain reasoning&amp;quot;):&lt;br /&gt;
&lt;br /&gt;
缺省推理和缺省逻辑，非单调逻辑，界限，封闭世界假设，溯因(Poole 等。把绑架放在”缺省推理”下。鲁格尔等人。将其归类为“不确定推理”) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=354–360}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=248–256, 323–335}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=335–363}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=~18.3.3}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Breadth of commonsense knowledge&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Breadth of commonsense knowledge&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
常识的广度知识”&lt;br /&gt;
&lt;br /&gt;
Breadth of commonsense knowledge:&lt;br /&gt;
&lt;br /&gt;
Breadth of commonsense knowledge:&lt;br /&gt;
&lt;br /&gt;
常识知识的广度:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=21}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=113–114}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Moravec|1988|p=13}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Lenat|Guha|1989}} (Introduction)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Intuition&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Intuition&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
直觉&lt;br /&gt;
&lt;br /&gt;
Expert knowledge as [[embodied cognition|embodied]] intuition:&lt;br /&gt;
&lt;br /&gt;
Expert knowledge as embodied intuition:&lt;br /&gt;
&lt;br /&gt;
体现直觉的专业知识:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Dreyfus|Dreyfus|1986}} ([[Hubert Dreyfus]] is a philosopher and critic of AI who was among the first to argue that most useful human knowledge was encoded sub-symbolically. See [[Dreyfus' critique of AI]])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Gladwell|2005}} (Gladwell's ''[[Blink (book)|Blink]]'' is a popular introduction to sub-symbolic reasoning and knowledge.)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Hawkins|Blakeslee|2005}} (Hawkins argues that sub-symbolic knowledge should be the primary focus of AI research.)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Planning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Planning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”计划”组织&lt;br /&gt;
&lt;br /&gt;
[[automated planning and scheduling|Planning]]:&lt;br /&gt;
&lt;br /&gt;
Planning:&lt;br /&gt;
&lt;br /&gt;
规划:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=~I.2.8}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp= 375–459}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=281–316}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=314–329}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 10.1–2, 22}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Information value theory&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Information value theory&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
信息价值理论”&lt;br /&gt;
&lt;br /&gt;
[[Applied information economics|Information value theory]]:&lt;br /&gt;
&lt;br /&gt;
Information value theory:&lt;br /&gt;
&lt;br /&gt;
信息价值理论:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=600–604}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Classical planning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Classical planning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”古典计划”&lt;br /&gt;
&lt;br /&gt;
Classical planning:&lt;br /&gt;
&lt;br /&gt;
Classical planning:&lt;br /&gt;
&lt;br /&gt;
经典的规划:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=375–430}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=281–315}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=314–329}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 10.1–2, 22}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Non-deterministic planning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Non-deterministic planning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
非确定性计划”&lt;br /&gt;
&lt;br /&gt;
Planning and acting in non-deterministic domains: conditional planning, execution monitoring, replanning and continuous planning:&lt;br /&gt;
&lt;br /&gt;
Planning and acting in non-deterministic domains: conditional planning, execution monitoring, replanning and continuous planning:&lt;br /&gt;
&lt;br /&gt;
计划和行动在非确定性领域: 有条件的计划，执行监控，重新计划和持续计划:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=430–449}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Multi-agent planning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Multi-agent planning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
多智能体计划&lt;br /&gt;
&lt;br /&gt;
Multi-agent planning and emergent behavior:&lt;br /&gt;
&lt;br /&gt;
Multi-agent planning and emergent behavior:&lt;br /&gt;
&lt;br /&gt;
多智能体计划与应急行为:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=449–455}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Machine learning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Machine learning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
机器学习“&lt;br /&gt;
&lt;br /&gt;
[[machine learning|Learning]]:&lt;br /&gt;
&lt;br /&gt;
Learning:&lt;br /&gt;
&lt;br /&gt;
学习:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=I.2.6}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=649–788}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=397–438}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=385–542}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 3.3, 10.3, 17.5, 20}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Reinforcement learning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Reinforcement learning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
强化学习&lt;br /&gt;
&lt;br /&gt;
[[Reinforcement learning]]:&lt;br /&gt;
&lt;br /&gt;
Reinforcement learning:&lt;br /&gt;
&lt;br /&gt;
强化学习&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=763–788}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=442–449}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Natural language processing&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Natural language processing&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
自然语言处理&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Natural language processing]]:&lt;br /&gt;
&lt;br /&gt;
Natural language processing:&lt;br /&gt;
&lt;br /&gt;
自然语言处理:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=I.2.7}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=790–831}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=91–104}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=591–632}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Applications of natural language processing&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Applications of natural language processing&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
自然语言处理应用程序”&lt;br /&gt;
&lt;br /&gt;
Applications of natural language processing, including [[information retrieval]] (i.e. [[text mining]]) and [[machine translation]]:&lt;br /&gt;
&lt;br /&gt;
Applications of natural language processing, including information retrieval (i.e. text mining) and machine translation:&lt;br /&gt;
&lt;br /&gt;
自然语言处理的应用，包括信息检索(即。文本挖掘和机器翻译:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=840–857}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=623–630}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Robotics&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Robotics&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
机器人公司”&lt;br /&gt;
&lt;br /&gt;
[[Robotic]]s:&lt;br /&gt;
&lt;br /&gt;
Robotics:&lt;br /&gt;
&lt;br /&gt;
Robotics:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=I.2.9}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=901–942}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=443–460}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Configuration space&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Configuration space&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
配置空间”&lt;br /&gt;
&lt;br /&gt;
Moving and [[Configuration space (physics)|configuration space]]:&lt;br /&gt;
&lt;br /&gt;
Moving and configuration space:&lt;br /&gt;
&lt;br /&gt;
移动和位形空间:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=916–932}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Robotic mapping&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Robotic mapping&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
机器人测绘网&lt;br /&gt;
&lt;br /&gt;
[[Robotic mapping]] (localization, etc):&lt;br /&gt;
&lt;br /&gt;
Robotic mapping (localization, etc):&lt;br /&gt;
&lt;br /&gt;
机器人绘图(本地化等) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=908–915}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Machine perception&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Machine perception&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”机器感知”&lt;br /&gt;
&lt;br /&gt;
[[Machine perception]]:&lt;br /&gt;
&lt;br /&gt;
Machine perception:&lt;br /&gt;
&lt;br /&gt;
机器感知:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=537–581, 863–898}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=~chpt. 6}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Computer vision&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Computer vision&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”计算机视觉”&lt;br /&gt;
&lt;br /&gt;
[[Computer vision]]:&lt;br /&gt;
&lt;br /&gt;
Computer vision:&lt;br /&gt;
&lt;br /&gt;
电脑视觉:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=I.2.10}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=863–898}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 6}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Speech recognition&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Speech recognition&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”语音识别”&lt;br /&gt;
&lt;br /&gt;
[[Speech recognition]]:&lt;br /&gt;
&lt;br /&gt;
Speech recognition:&lt;br /&gt;
&lt;br /&gt;
语音识别:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=~I.2.7}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=568–578}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Object recognition&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Object recognition&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
对象识别”&lt;br /&gt;
&lt;br /&gt;
[[Object recognition]]:&lt;br /&gt;
&lt;br /&gt;
Object recognition:&lt;br /&gt;
&lt;br /&gt;
物体识别:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=885–892}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Emotion and affective computing&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Emotion and affective computing&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
情感与情感计算”&lt;br /&gt;
&lt;br /&gt;
Emotion and [[affective computing]]:&lt;br /&gt;
&lt;br /&gt;
Emotion and affective computing:&lt;br /&gt;
&lt;br /&gt;
情感与情感计算:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Minsky|2006}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&amp;lt;ref name=&amp;quot;Artificial consciousness&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&amp;lt;ref name=&amp;quot;Artificial consciousness&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
!-参考名称“人工意识”&lt;br /&gt;
&lt;br /&gt;
[[Gerald Edelman]], [[Igor Aleksander]] and others have argued that [[artificial consciousness]] is required for strong AI. ({{Harvnb|Aleksander|1995}}; {{Harvnb|Edelman|2007}})&lt;br /&gt;
&lt;br /&gt;
Gerald Edelman, Igor Aleksander and others have argued that artificial consciousness is required for strong AI. (; )&lt;br /&gt;
&lt;br /&gt;
杰拉尔德埃德尔曼，伊戈尔亚历山大和其他人认为，人工意识是强大的人工智能所必需的。(; )&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;ref name=&amp;quot;Brain simulation&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;ref name=&amp;quot;Brain simulation&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”大脑模拟”&lt;br /&gt;
&lt;br /&gt;
[[Artificial brain]] arguments: AI requires a simulation of the operation of the human brain&lt;br /&gt;
&lt;br /&gt;
Artificial brain arguments: AI requires a simulation of the operation of the human brain&lt;br /&gt;
&lt;br /&gt;
人工大脑的论点: 人工智能需要模拟人脑的运作&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=957}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=271 and 279}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A few of the people who make some form of the argument:&lt;br /&gt;
&lt;br /&gt;
A few of the people who make some form of the argument:&lt;br /&gt;
&lt;br /&gt;
一些提出某种论点的人:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Moravec|1988}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Kurzweil|2005|p=262}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Hawkins|Blakeslee|2005}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The most extreme form of this argument (the brain replacement scenario) was put forward by [[Clark Glymour]] in the mid-1970s and was touched on by [[Zenon Pylyshyn]] and [[John Searle]] in 1980.&lt;br /&gt;
&lt;br /&gt;
The most extreme form of this argument (the brain replacement scenario) was put forward by Clark Glymour in the mid-1970s and was touched on by Zenon Pylyshyn and John Searle in 1980.&lt;br /&gt;
&lt;br /&gt;
这种观点(大脑替代情景)最极端的形式是克拉克•格莱莫尔(Clark Glymour)在上世纪70年代中期提出的，泽农•派利辛(Zenon Pylyshyn)和约翰•塞尔(John Searle)在1980年提出了这一观点。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- unused ref&amp;lt;ref name=&amp;quot;AI complete&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- unused ref&amp;lt;ref name=&amp;quot;AI complete&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! -- 未使用的 ref name&amp;quot;ai complete&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[AI complete]]: {{Harvnb|Shapiro|1992|p=9}}&lt;br /&gt;
&lt;br /&gt;
AI complete: &lt;br /&gt;
&lt;br /&gt;
人工智能完成:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ ref --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- APPROACHES -----------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- APPROACHES -----------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
——方法—————————————————————————————————————————————————————————————————————————————————— --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Biological intelligence vs. intelligence in general&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Biological intelligence vs. intelligence in general&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
生物智能对抗一般智能&lt;br /&gt;
&lt;br /&gt;
Biological intelligence vs. intelligence in general:&lt;br /&gt;
&lt;br /&gt;
Biological intelligence vs. intelligence in general:&lt;br /&gt;
&lt;br /&gt;
生物智能 vs 一般智能:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=2–3}}, who make the analogy with [[aeronautical engineering]].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=100–101}}, who writes that there are &amp;quot;two major branches of artificial intelligence: one aimed at producing intelligent behavior regardless of how it was accomplished, and the other aimed at modeling intelligent processes found in nature, particularly human ones.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Kolata|1982}}, a paper in ''[[Science (journal)|Science]]'', which describes [[John McCarthy (computer scientist)|McCarthy's]] indifference to biological models. Kolata quotes McCarthy as writing: &amp;quot;This is AI, so we don't care if it's psychologically real&amp;quot;{{cite web |url=https://books.google.com/books?id=PEkqAAAAMAAJ|title=Science|date=August 1982}}. McCarthy recently reiterated his position at the [[AI@50]] conference where he said &amp;quot;Artificial intelligence is not, by definition, simulation of human intelligence&amp;quot; {{Harv|Maker|2006}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Neats vs. scruffies&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Neats vs. scruffies&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
裁判名称“ neats vs. scruffies”&lt;br /&gt;
&lt;br /&gt;
[[Neats vs. scruffies]]:&lt;br /&gt;
&lt;br /&gt;
Neats vs. scruffies:&lt;br /&gt;
&lt;br /&gt;
Neats vs. scruffies:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=421–424, 486–489}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|p=168}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1983|pp=10–11}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Symbolic vs. sub-symbolic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Symbolic vs. sub-symbolic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”象征对抗子象征”&lt;br /&gt;
&lt;br /&gt;
Symbolic vs. sub-symbolic AI:&lt;br /&gt;
&lt;br /&gt;
Symbolic vs. sub-symbolic AI:&lt;br /&gt;
&lt;br /&gt;
符号人工智能 vs 子符号人工智能:&lt;br /&gt;
&lt;br /&gt;
* {{Harvtxt|Nilsson|1998|p=7}}, who uses the term &amp;quot;sub-symbolic&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;GOFAI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;GOFAI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反对者名字「 gofai 」&lt;br /&gt;
&lt;br /&gt;
{{Harvnb|Haugeland|1985|pp=112–117}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI at CMU in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI at CMU in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
60年代，卡内基梅隆大学的人工智能&lt;br /&gt;
&lt;br /&gt;
Cognitive simulation, [[Allen Newell|Newell]] and [[Herbert A. Simon|Simon]], AI at [[Carnegie Mellon University|CMU]] (then called [[Carnegie Tech]]):&lt;br /&gt;
&lt;br /&gt;
Cognitive simulation, Newell and Simon, AI at CMU (then called Carnegie Tech):&lt;br /&gt;
&lt;br /&gt;
认知模拟，纽威尔和西蒙，卡内基大学(当时称为卡内基技术学院)的人工智能:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=139–179, 245–250, 322–323 (EPAM)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=145–149}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Soar&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Soar&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反战组织「翱翔」&lt;br /&gt;
&lt;br /&gt;
[[Soar (cognitive architecture)|Soar]] (history):&lt;br /&gt;
&lt;br /&gt;
Soar (history):&lt;br /&gt;
&lt;br /&gt;
翱翔(历史) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=450–451}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=258–263}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI at Stanford in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI at Stanford in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
60年代斯坦福大学的人工智能研究&lt;br /&gt;
&lt;br /&gt;
[[John McCarthy (computer scientist)|McCarthy]] and AI research at [[Stanford Artificial Intelligence Laboratory|SAIL]] and [[SRI International]]:&lt;br /&gt;
&lt;br /&gt;
McCarthy and AI research at SAIL and SRI International:&lt;br /&gt;
&lt;br /&gt;
麦卡锡和人工智能研究机构 SAIL 和 SRI International:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=251–259}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993}}&amp;lt;!-- Page number needed --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI at Edinburgh and France in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI at Edinburgh and France in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在60年代的爱丁堡和法国&lt;br /&gt;
&lt;br /&gt;
AI research at [[University of Edinburgh|Edinburgh]] and in France, birth of [[Prolog]]:&lt;br /&gt;
&lt;br /&gt;
AI research at Edinburgh and in France, birth of Prolog:&lt;br /&gt;
&lt;br /&gt;
爱丁堡和法国的人工智能研究，Prolog 的诞生:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=193–196}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Howe|1994}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI at MIT in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI at MIT in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
60年代麻省理工学院的人工智能&lt;br /&gt;
&lt;br /&gt;
AI at [[MIT]] under [[Marvin Minsky]] in the 1960s :&lt;br /&gt;
&lt;br /&gt;
AI at MIT under Marvin Minsky in the 1960s :&lt;br /&gt;
&lt;br /&gt;
上世纪60年代，马文•明斯基(Marvin Minsky)领导下的麻省理工学院(MIT)人工智能课程:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=259–305}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=83–102, 163–176}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=19}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Cyc&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Cyc&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
他们的名字叫“ cyc”&lt;br /&gt;
&lt;br /&gt;
[[Cyc]]:&lt;br /&gt;
&lt;br /&gt;
Cyc:&lt;br /&gt;
&lt;br /&gt;
Cyc:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|p=489}}, who calls it &amp;quot;a determinedly scruffy enterprise&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=239–243}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=363−365}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Lenat|Guha|1989}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Knowledge revolution&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Knowledge revolution&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
知识革命&lt;br /&gt;
&lt;br /&gt;
Knowledge revolution:&lt;br /&gt;
&lt;br /&gt;
Knowledge revolution:&lt;br /&gt;
&lt;br /&gt;
返回文章页面知识革命:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=266–276, 298–300, 314, 421}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=22–23}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Embodied AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Embodied AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反对者名字“ empressive ai”&lt;br /&gt;
&lt;br /&gt;
[[Embodied agent|Embodied]] approaches to AI:&lt;br /&gt;
&lt;br /&gt;
Embodied approaches to AI:&lt;br /&gt;
&lt;br /&gt;
人工智能的具身化方法:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=454–462}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Brooks|1990}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Moravec|1988}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Revival of connectionism&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Revival of connectionism&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
联结主义的复兴&lt;br /&gt;
&lt;br /&gt;
Revival of [[connectionism]]:&lt;br /&gt;
&lt;br /&gt;
Revival of connectionism:&lt;br /&gt;
&lt;br /&gt;
返回文章页面连接主义的复兴:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=214–215}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=25}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Computational intelligence&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Computational intelligence&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
计算机情报网&lt;br /&gt;
&lt;br /&gt;
[[Computational intelligence]]&lt;br /&gt;
&lt;br /&gt;
Computational intelligence&lt;br /&gt;
&lt;br /&gt;
计算智能&lt;br /&gt;
&lt;br /&gt;
* [http://www.ieee-cis.org/ IEEE Computational Intelligence Society] {{webarchive|url=https://web.archive.org/web/20080509191840/http://www.ieee-cis.org/ |date=9 May 2008 }}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Intelligent agents&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Intelligent agents&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
智能特工组织&lt;br /&gt;
&lt;br /&gt;
The [[intelligent agent]] paradigm:&lt;br /&gt;
&lt;br /&gt;
The intelligent agent paradigm:&lt;br /&gt;
&lt;br /&gt;
智能代理范式:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=27, 32–58, 968–972}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=7–21}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=235–240}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Hutter|2005|pp=125–126}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The definition used in this article, in terms of goals, actions, perception and environment, is due to {{Harvtxt|Russell|Norvig|2003}}. Other definitions also include knowledge and learning as additional criteria.&lt;br /&gt;
&lt;br /&gt;
The definition used in this article, in terms of goals, actions, perception and environment, is due to . Other definitions also include knowledge and learning as additional criteria.&lt;br /&gt;
&lt;br /&gt;
本文使用的定义，在目标，行动，感知和环境方面，是由于。其他定义还包括知识和学习作为附加标准。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Agent architectures&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Agent architectures&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
引用名称&amp;quot;代理建筑&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Agent architecture]]s, [[hybrid intelligent system]]s:&lt;br /&gt;
&lt;br /&gt;
Agent architectures, hybrid intelligent systems:&lt;br /&gt;
&lt;br /&gt;
代理体系结构，混合智能系统:&lt;br /&gt;
&lt;br /&gt;
* {{Harvtxt|Russell|Norvig|2003|pp=27, 932, 970–972}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvtxt|Nilsson|1998|loc=chpt. 25}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Hierarchical control system&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Hierarchical control system&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
分级控制系统&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Hierarchical control system]]:&lt;br /&gt;
&lt;br /&gt;
Hierarchical control system:&lt;br /&gt;
&lt;br /&gt;
分层控制系统:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Albus|2002}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- TOOLS ---------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- TOOLS ---------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
——工具———————————————————————————————————————————————————————————————————————————————— --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
搜索引擎&lt;br /&gt;
&lt;br /&gt;
[[Search algorithm]]s:&lt;br /&gt;
&lt;br /&gt;
Search algorithms:&lt;br /&gt;
&lt;br /&gt;
搜索算法:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=59–189}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=113–163}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=79–164, 193–219}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 7–12}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Logic as search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Logic as search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
推理作为搜索”&lt;br /&gt;
&lt;br /&gt;
[[Forward chaining]], [[backward chaining]], [[Horn clause]]s, and logical deduction as search:&lt;br /&gt;
&lt;br /&gt;
Forward chaining, backward chaining, Horn clauses, and logical deduction as search:&lt;br /&gt;
&lt;br /&gt;
正向链接、反向链接、 Horn 子句和逻辑推理作为搜索:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=217–225, 280–294}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=~46–52}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=62–73}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 4.2, 7.2}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Planning as search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Planning as search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
计划作为搜索”&lt;br /&gt;
&lt;br /&gt;
[[State space search]] and [[automated planning and scheduling|planning]]:&lt;br /&gt;
&lt;br /&gt;
State space search and planning:&lt;br /&gt;
&lt;br /&gt;
国家空间搜索和规划:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=382–387}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=298–305}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 10.1–2}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Uninformed search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Uninformed search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
无知搜索”&lt;br /&gt;
&lt;br /&gt;
Uninformed searches ([[breadth first search]], [[depth first search]] and general [[state space search]]):&lt;br /&gt;
&lt;br /&gt;
Uninformed searches (breadth first search, depth first search and general state space search):&lt;br /&gt;
&lt;br /&gt;
不知情的搜索(广度优先搜索搜索、深度优先搜索和一般状态空间搜索) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=59–93}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=113–132}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=79–121}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 8}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Informed search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Informed search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
通知搜索&lt;br /&gt;
&lt;br /&gt;
[[Heuristic]] or informed searches (e.g., greedy [[best-first search|best first]] and [[A* search algorithm|A*]]):&lt;br /&gt;
&lt;br /&gt;
Heuristic or informed searches (e.g., greedy best first and A*):&lt;br /&gt;
&lt;br /&gt;
启发式或知情搜索(例如，贪婪最优先和 a *) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp= 94–109}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=pp. 132–147}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp= 133–150}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 9}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|2017|loc=Section 3.6}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Optimization search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Optimization search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
最优化搜索&lt;br /&gt;
&lt;br /&gt;
[[optimization (mathematics)|Optimization]] searches:&lt;br /&gt;
&lt;br /&gt;
Optimization searches:&lt;br /&gt;
&lt;br /&gt;
优化搜索:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=110–116,120–129}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=56–163}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp= 127–133}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Society based learning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Society based learning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
以学习为基础的社会&lt;br /&gt;
&lt;br /&gt;
[[Artificial life]] and society based learning:&lt;br /&gt;
&lt;br /&gt;
Artificial life and society based learning:&lt;br /&gt;
&lt;br /&gt;
基于人工生命和社会的学习:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=530–541}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Genetic programming&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Genetic programming&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
“基因编程”&lt;br /&gt;
&lt;br /&gt;
[[Genetic programming]] and [[genetic algorithms]]:&lt;br /&gt;
&lt;br /&gt;
Genetic programming and genetic algorithms:&lt;br /&gt;
&lt;br /&gt;
遗传程序设计和遗传算法:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=509–530}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 4.2}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Holland|1975}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Koza|1992}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poli|Langdon|McPhee|2008}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”逻辑”组织&lt;br /&gt;
&lt;br /&gt;
[[Logic]]:&lt;br /&gt;
&lt;br /&gt;
Logic:&lt;br /&gt;
&lt;br /&gt;
逻辑:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=~I.2.3}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=194–310}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=35–77}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 13–16}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Satplan&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Satplan&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反对者名字「 satplan 」&lt;br /&gt;
&lt;br /&gt;
[[Satplan]]:&lt;br /&gt;
&lt;br /&gt;
Satplan:&lt;br /&gt;
&lt;br /&gt;
Satplan:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=402–407}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=300–301}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 21}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Symbolic learning techniques&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Symbolic learning techniques&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
象征学习技巧&lt;br /&gt;
&lt;br /&gt;
[[Explanation based learning]], relevance based learning, [[inductive logic programming]], [[case based reasoning]]:&lt;br /&gt;
&lt;br /&gt;
Explanation based learning, relevance based learning, inductive logic programming, case based reasoning:&lt;br /&gt;
&lt;br /&gt;
基于解释的学习，基于关联的学习，归纳逻辑程序设计，基于案例推理:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=678–710}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=414–416}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=~422–442}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 10.3, 17.5}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Propositional logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Propositional logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
推理逻辑&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Propositional logic]]:&lt;br /&gt;
&lt;br /&gt;
Propositional logic:&lt;br /&gt;
&lt;br /&gt;
命题逻辑&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=204–233}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=45–50}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 13}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;First-order logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;First-order logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
一阶逻辑&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[First-order logic]] and features such as [[equality (mathematics)|equality]]:&lt;br /&gt;
&lt;br /&gt;
First-order logic and features such as equality:&lt;br /&gt;
&lt;br /&gt;
一阶逻辑和功能，如平等:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=~I.2.4}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=240–310}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=268–275}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=50–62}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 15}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Fuzzy logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Fuzzy logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”模糊逻辑”&lt;br /&gt;
&lt;br /&gt;
[[Fuzzy logic]]:&lt;br /&gt;
&lt;br /&gt;
Fuzzy logic:&lt;br /&gt;
&lt;br /&gt;
Fuzzy logic:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=526–527}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Stochastic methods for uncertain reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Stochastic methods for uncertain reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
不确定推理的随机方法&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Stochastic methods for uncertain reasoning:&lt;br /&gt;
&lt;br /&gt;
Stochastic methods for uncertain reasoning:&lt;br /&gt;
&lt;br /&gt;
不确定推理的随机方法:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=~I.2.3}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=462–644}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=345–395}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=165–191, 333–381}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 19}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Bayesian networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Bayesian networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
贝叶斯网络&lt;br /&gt;
&lt;br /&gt;
[[Bayesian network]]s:&lt;br /&gt;
&lt;br /&gt;
Bayesian networks:&lt;br /&gt;
&lt;br /&gt;
贝叶斯网络:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=492–523}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=361–381}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=~182–190, ≈363–379}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 19.3–4}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Bayesian inference&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Bayesian inference&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
引用名称”贝叶斯推断”&lt;br /&gt;
&lt;br /&gt;
[[Bayesian inference]] algorithm:&lt;br /&gt;
&lt;br /&gt;
Bayesian inference algorithm:&lt;br /&gt;
&lt;br /&gt;
贝叶斯推断算法:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=504–519}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=361–381}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=~363–379}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 19.4 &amp;amp; 7}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Bayesian learning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Bayesian learning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
贝叶斯学习&lt;br /&gt;
&lt;br /&gt;
[[Bayesian learning]] and the [[expectation-maximization algorithm]]:&lt;br /&gt;
&lt;br /&gt;
Bayesian learning and the expectation-maximization algorithm:&lt;br /&gt;
&lt;br /&gt;
贝叶斯学习和期望最大化算法:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=712–724}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=424–433}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 20}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Bayesian decision networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Bayesian decision networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
贝叶斯决策网络&lt;br /&gt;
&lt;br /&gt;
[[Bayesian decision theory]] and Bayesian [[decision network]]s:&lt;br /&gt;
&lt;br /&gt;
Bayesian decision theory and Bayesian decision networks:&lt;br /&gt;
&lt;br /&gt;
贝叶斯决策理论和贝叶斯决策网络:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=597–600}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Stochastic temporal models&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Stochastic temporal models&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随机时间模型”&lt;br /&gt;
&lt;br /&gt;
Stochastic temporal models:&lt;br /&gt;
&lt;br /&gt;
Stochastic temporal models:&lt;br /&gt;
&lt;br /&gt;
随机时间模型:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=537–581}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Dynamic Bayesian network]]s:&lt;br /&gt;
&lt;br /&gt;
Dynamic Bayesian networks:&lt;br /&gt;
&lt;br /&gt;
动态贝叶斯网络:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=551–557}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Hidden Markov model]]:&lt;br /&gt;
&lt;br /&gt;
Hidden Markov model:&lt;br /&gt;
&lt;br /&gt;
隐马尔可夫模型&lt;br /&gt;
&lt;br /&gt;
* {{Harv|Russell|Norvig|2003|pp=549–551}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Kalman filter]]s:&lt;br /&gt;
&lt;br /&gt;
Kalman filters:&lt;br /&gt;
&lt;br /&gt;
卡尔曼滤波器:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=551–557}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Decisions theory and analysis&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Decisions theory and analysis&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
决策理论和分析&lt;br /&gt;
&lt;br /&gt;
[[decision theory]] and [[decision analysis]]:&lt;br /&gt;
&lt;br /&gt;
decision theory and decision analysis:&lt;br /&gt;
&lt;br /&gt;
决策理论和决策分析:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=584–597}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=381–394}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Markov decision process&amp;quot; &amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Markov decision process&amp;quot; &amp;gt;&lt;br /&gt;
&lt;br /&gt;
马尔科夫决策过程&lt;br /&gt;
&lt;br /&gt;
[[Markov decision process]]es and dynamic [[decision network]]s:&lt;br /&gt;
&lt;br /&gt;
Markov decision processes and dynamic decision networks:&lt;br /&gt;
&lt;br /&gt;
马尔可夫决策过程和动态决策网络:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=613–631}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Game theory and mechanism design&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Game theory and mechanism design&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
博弈论与机制设计”&lt;br /&gt;
&lt;br /&gt;
[[Game theory]] and [[mechanism design]]:&lt;br /&gt;
&lt;br /&gt;
Game theory and mechanism design:&lt;br /&gt;
&lt;br /&gt;
博弈论与机制设计:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=631–643}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Classifiers&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Classifiers&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”分类器”&lt;br /&gt;
&lt;br /&gt;
Statistical learning methods and [[classifier (mathematics)|classifiers]]:&lt;br /&gt;
&lt;br /&gt;
Statistical learning methods and classifiers:&lt;br /&gt;
&lt;br /&gt;
统计学习方法和分类器:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=712–754}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=453–541}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Kernel methods&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Kernel methods&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
内核方法&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[kernel methods]] such as the [[support vector machine]]:&lt;br /&gt;
&lt;br /&gt;
kernel methods such as the support vector machine:&lt;br /&gt;
&lt;br /&gt;
内核方法，比如支持向量机:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=749–752}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;K-nearest neighbor algorithm&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;K-nearest neighbor algorithm&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
最近邻算法”&lt;br /&gt;
&lt;br /&gt;
[[K-nearest neighbor algorithm]]:&lt;br /&gt;
&lt;br /&gt;
K-nearest neighbor algorithm:&lt;br /&gt;
&lt;br /&gt;
最近邻居法:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=733–736}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Gaussian mixture model&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Gaussian mixture model&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”高斯混合模型”&lt;br /&gt;
&lt;br /&gt;
[[Gaussian mixture model]]:&lt;br /&gt;
&lt;br /&gt;
Gaussian mixture model:&lt;br /&gt;
&lt;br /&gt;
高斯混合模型:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=725–727}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Naive Bayes classifier&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Naive Bayes classifier&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
自然分类器&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Naive Bayes classifier]]:&lt;br /&gt;
&lt;br /&gt;
Naive Bayes classifier:&lt;br /&gt;
&lt;br /&gt;
朴素贝叶斯分类器&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=718}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Decision tree&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Decision tree&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
决策树&lt;br /&gt;
&lt;br /&gt;
[[Alternating decision tree|Decision tree]]:&lt;br /&gt;
&lt;br /&gt;
Decision tree:&lt;br /&gt;
&lt;br /&gt;
决策树:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=653–664}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=403–408}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=408–417}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Classifier performance&amp;quot; &amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Classifier performance&amp;quot; &amp;gt;&lt;br /&gt;
&lt;br /&gt;
分类器性能&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Classifier performance:&lt;br /&gt;
&lt;br /&gt;
Classifier performance:&lt;br /&gt;
&lt;br /&gt;
分类器性能:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|van der Walt|Bernard|2006}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Neural networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Neural networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
“神经网络”&lt;br /&gt;
&lt;br /&gt;
Neural networks and connectionism:&lt;br /&gt;
&lt;br /&gt;
Neural networks and connectionism:&lt;br /&gt;
&lt;br /&gt;
神经网络与连接主义:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=736–748}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=408–414}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=453–505}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 3}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Backpropagation&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Backpropagation&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反向传播法&lt;br /&gt;
&lt;br /&gt;
[[Backpropagation]]:&lt;br /&gt;
&lt;br /&gt;
Backpropagation:&lt;br /&gt;
&lt;br /&gt;
返回文章页面反向传播:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=744–748}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=467–474}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 3.3}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Feedforward neural networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Feedforward neural networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反馈名称“前馈神经网络”&lt;br /&gt;
&lt;br /&gt;
[[Feedforward neural network]]s, [[perceptron]]s and [[radial basis network]]s:&lt;br /&gt;
&lt;br /&gt;
Feedforward neural networks, perceptrons and radial basis networks:&lt;br /&gt;
&lt;br /&gt;
前馈神经网络，感知器和径向基网络:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=739–748, 758}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=458–467}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Recurrent neural networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Recurrent neural networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反馈神经网络&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Recurrent neural networks]], [[Hopfield nets]]:&lt;br /&gt;
&lt;br /&gt;
Recurrent neural networks, Hopfield nets:&lt;br /&gt;
&lt;br /&gt;
回归神经网络 Hopfield 网络:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=758}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=474–505}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Learning in neural networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Learning in neural networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在神经网络中学习&lt;br /&gt;
&lt;br /&gt;
[[Competitive learning]], [[Hebbian theory|Hebbian]] coincidence learning, [[Hopfield network]]s and attractor networks:&lt;br /&gt;
&lt;br /&gt;
Competitive learning, Hebbian coincidence learning, Hopfield networks and attractor networks:&lt;br /&gt;
&lt;br /&gt;
竞争学习，Hebbian 巧合学习，Hopfield 网络和吸引子网络:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=474–505}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Hierarchical temporal memory&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Hierarchical temporal memory&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
层级暂时记忆”&lt;br /&gt;
&lt;br /&gt;
[[Hierarchical temporal memory]]:&lt;br /&gt;
&lt;br /&gt;
Hierarchical temporal memory:&lt;br /&gt;
&lt;br /&gt;
分级暂存记忆:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Hawkins|Blakeslee|2005}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- unused ref&amp;lt;ref name=&amp;quot;Control theory&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- unused ref&amp;lt;ref name=&amp;quot;Control theory&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
!-未使用的参考名称“控制理论”&lt;br /&gt;
&lt;br /&gt;
[[Control theory]]:&lt;br /&gt;
&lt;br /&gt;
Control theory:&lt;br /&gt;
&lt;br /&gt;
控制理论:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=~I.2.8}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=926–932}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ ref --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- PROGRESS -----------------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- PROGRESS -----------------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——进展——————————————————————————————————————————————————————————————————————————————————————————————&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Turing test&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Turing test&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
文档名称“图灵测试”&lt;br /&gt;
&lt;br /&gt;
The [[Turing test]]:&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The Turing test:&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
图灵测试: br / &lt;br /&gt;
&lt;br /&gt;
Turing's original publication:&lt;br /&gt;
&lt;br /&gt;
Turing's original publication:&lt;br /&gt;
&lt;br /&gt;
图灵的原始出版物:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Turing|1950}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Historical influence and philosophical implications:&lt;br /&gt;
&lt;br /&gt;
Historical influence and philosophical implications:&lt;br /&gt;
&lt;br /&gt;
历史影响和哲学含义:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Haugeland|1985|pp=6–9}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|p=24}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=70–71}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=2–3 and 948}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &amp;lt;ref name=&amp;quot;Intrusion detection&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &amp;lt;ref name=&amp;quot;Intrusion detection&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
!-ref name&amp;quot;入侵检测&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Intrusion detection system|Intrusion detection]]:&lt;br /&gt;
&lt;br /&gt;
Intrusion detection:&lt;br /&gt;
&lt;br /&gt;
入侵侦测:&lt;br /&gt;
&lt;br /&gt;
* {{harvnb|Kumar|Kumar|2012}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ ref --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Mathematical definitions of intelligence&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Mathematical definitions of intelligence&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
情报的数学定义&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Mathematical definitions of intelligence:&lt;br /&gt;
&lt;br /&gt;
Mathematical definitions of intelligence:&lt;br /&gt;
&lt;br /&gt;
智力的数学定义:&lt;br /&gt;
&lt;br /&gt;
* {{harvnb|Hernandez-Orallo|2000}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{harvnb|Dowe|Hajek|1997}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{harvnb|Hernandez-Orallo|Dowe|2010}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!------ PHILOSOPHY -----------------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!------ PHILOSOPHY -----------------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
——哲学———————————————————————————————————————————————————————————————————————————————————————————————— --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--not used&amp;lt;ref name=&amp;quot;Philosophy of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--not used&amp;lt;ref name=&amp;quot;Philosophy of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
!-不用引用名“ ai 的哲学”&lt;br /&gt;
&lt;br /&gt;
[[Philosophy of AI]]. All of these positions in this section are mentioned in standard discussions of the subject, such as:&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Philosophy of AI. All of these positions in this section are mentioned in standard discussions of the subject, such as:&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
人工智能哲学。本节中的所有这些立场都在主题的标准讨论中提到，例如: ref&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=947–960}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Fearn|2007|pp=38–55}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ ref --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Dartmouth proposal&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Dartmouth proposal&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
达特茅斯建议书&lt;br /&gt;
&lt;br /&gt;
Dartmouth proposal:&lt;br /&gt;
&lt;br /&gt;
Dartmouth proposal:&lt;br /&gt;
&lt;br /&gt;
返回文章页面达特茅斯求婚:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCarthy|Minsky|Rochester|Shannon|1955}} (the original proposal)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|p=49}} (historical significance)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Physical symbol system hypothesis&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Physical symbol system hypothesis&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”物理符号系统假说”&lt;br /&gt;
&lt;br /&gt;
The [[physical symbol system]]s hypothesis:&lt;br /&gt;
&lt;br /&gt;
The physical symbol systems hypothesis:&lt;br /&gt;
&lt;br /&gt;
物理符号系统假说:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Newell|Simon|1976|p=116}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|p=153}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=18}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Dreyfus' critique&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Dreyfus' critique&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反对者名字“德雷福斯批评”&lt;br /&gt;
&lt;br /&gt;
[[Dreyfus' critique of artificial intelligence]]:&lt;br /&gt;
&lt;br /&gt;
Dreyfus' critique of artificial intelligence:&lt;br /&gt;
&lt;br /&gt;
德雷福斯对人工智能的批判:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Dreyfus|1972}}, {{Harvnb|Dreyfus|Dreyfus|1986}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=120–132}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=211–239}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=950–952}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Gödel himself&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Gödel himself&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Gödel himself&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{{Harvnb|Gödel|1951}}: in this lecture, [[Kurt Gödel]] uses the incompleteness theorem to arrive at the following disjunction: (a) the human mind is not a consistent finite machine, or (b) there exist [[Diophantine equations]] for which it cannot decide whether solutions exist. Gödel finds (b) implausible, and thus seems to have believed the human mind was not equivalent to a finite machine, i.e., its power exceeded that of any finite machine. He recognized that this was only a conjecture, since one could never disprove (b). Yet he considered the disjunctive conclusion to be a &amp;quot;certain fact&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
: in this lecture, Kurt Gödel uses the incompleteness theorem to arrive at the following disjunction: (a) the human mind is not a consistent finite machine, or (b) there exist Diophantine equations for which it cannot decide whether solutions exist. Gödel finds (b) implausible, and thus seems to have believed the human mind was not equivalent to a finite machine, i.e., its power exceeded that of any finite machine. He recognized that this was only a conjecture, since one could never disprove (b). Yet he considered the disjunctive conclusion to be a &amp;quot;certain fact&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
在这个演讲中，Kurt g del 使用不完备性定理得出以下结论: (a)人类的思维不是一致的有限机器，或者(b)存在不能决定是否存在解的丢番图方程。德尔认为(b)是不可信的，因此似乎相信人类的大脑并不等同于一个有限的机器，也就是说，它的力量超过任何有限的机器。他认识到这只是一个猜想，因为人们永远无法反驳(b)。然而，他认为这个选言式的结论是一个“确定的事实”。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;The mathematical objection&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;The mathematical objection&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
数学异议”&lt;br /&gt;
&lt;br /&gt;
The Mathematical Objection:&lt;br /&gt;
&lt;br /&gt;
The Mathematical Objection:&lt;br /&gt;
&lt;br /&gt;
数学上的异议:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=949}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=448–449}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Making the Mathematical Objection:&lt;br /&gt;
&lt;br /&gt;
Making the Mathematical Objection:&lt;br /&gt;
&lt;br /&gt;
提出数学异议:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Lucas|1961}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Penrose|1989}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Refuting Mathematical Objection:&lt;br /&gt;
&lt;br /&gt;
Refuting Mathematical Objection:&lt;br /&gt;
&lt;br /&gt;
驳斥数学异议:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Turing|1950}} under &amp;quot;(2) The Mathematical Objection&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Hofstadter|1979}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Background:&lt;br /&gt;
&lt;br /&gt;
Background:&lt;br /&gt;
&lt;br /&gt;
背景:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Ref=none|Gödel|1931}}, {{Harvnb|Ref=none|Church|1936}}, {{Harvnb|Ref=none|Kleene|1935}}, {{Harvnb|Ref=none|Turing|1937}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Searle's strong AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Searle's strong AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
沙尔强大的人工智能&lt;br /&gt;
&lt;br /&gt;
This version is from {{Harvtxt|Searle|1999}}, and is also quoted in {{Harvnb|Dennett|1991|p=435}}. Searle's original formulation was &amp;quot;The appropriately programmed computer really is a mind, in the sense that computers given the right programs can be literally said to understand and have other cognitive states.&amp;quot; {{Harv|Searle|1980|p=1}}. Strong AI is defined similarly by {{Harvtxt|Russell|Norvig|2003|p=947}}: &amp;quot;The assertion that machines could possibly act intelligently (or, perhaps better, act as if they were intelligent) is called the 'weak AI' hypothesis by philosophers, and the assertion that machines that do so are actually thinking (as opposed to simulating thinking) is called the 'strong AI' hypothesis.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
This version is from , and is also quoted in . Searle's original formulation was &amp;quot;The appropriately programmed computer really is a mind, in the sense that computers given the right programs can be literally said to understand and have other cognitive states.&amp;quot; . Strong AI is defined similarly by : &amp;quot;The assertion that machines could possibly act intelligently (or, perhaps better, act as if they were intelligent) is called the 'weak AI' hypothesis by philosophers, and the assertion that machines that do so are actually thinking (as opposed to simulating thinking) is called the 'strong AI' hypothesis.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
这个版本是从，也是在引用。Searle 最初的构想是“经过适当编程的计算机实际上是一种思维，从这个意义上说，只要编写了正确的程序，计算机就可以理解并拥有其他认知状态。”.强人工智能的定义与此类似: “认为机器可以智能地行动(或者更好地说，仿佛它们是智能的)的断言被哲学家称为‘弱人工智能’假说，而认为机器这样做实际上是在思考(而不是模拟思考)的断言则被称为‘强人工智能’假说。”&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Chinese room&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Chinese room&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
「中文房间」&lt;br /&gt;
&lt;br /&gt;
Searle's [[Chinese room]] argument:&lt;br /&gt;
&lt;br /&gt;
Searle's Chinese room argument:&lt;br /&gt;
&lt;br /&gt;
塞尔的中文房间论点:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Searle|1980}}. Searle's original presentation of the thought experiment.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Searle|1999}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Discussion:&lt;br /&gt;
&lt;br /&gt;
Discussion:&lt;br /&gt;
&lt;br /&gt;
讨论:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=958–960}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=443–445}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=269–271}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- PREDICTIONS --------------------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- PREDICTIONS --------------------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
——预测———————————————————————————————————————————————————————————————————————————————————————————————— --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Robot rights&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Robot rights&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
机器人版权“&lt;br /&gt;
&lt;br /&gt;
[[Robot rights]]:&lt;br /&gt;
&lt;br /&gt;
Robot rights:&lt;br /&gt;
&lt;br /&gt;
返回文章页面机器人版权:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=964}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|''BBC News''|2006}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Prematurity of:&lt;br /&gt;
&lt;br /&gt;
Prematurity of:&lt;br /&gt;
&lt;br /&gt;
早产儿:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Henderson|2007}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In fiction:&lt;br /&gt;
&lt;br /&gt;
In fiction:&lt;br /&gt;
&lt;br /&gt;
在小说中:&lt;br /&gt;
&lt;br /&gt;
* {{Harvtxt|McCorduck|2004|pp=190–25}} discusses ''[[Frankenstein]]'' and identifies the key ethical issues as scientific hubris and the suffering of the monster, i.e. [[robot rights]].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&amp;lt;ref name=&amp;quot;Replaced by machines&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&amp;lt;ref name=&amp;quot;Replaced by machines&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! -- ref name&amp;quot;replaced by machines&amp;quot;&lt;br /&gt;
&lt;br /&gt;
AI could decrease the demand for human labor:&lt;br /&gt;
&lt;br /&gt;
AI could decrease the demand for human labor:&lt;br /&gt;
&lt;br /&gt;
人工智能可以减少对人类劳动力的需求:&lt;br /&gt;
&lt;br /&gt;
* {{harvnb|Russell|Norvig|2003|pp=960–961}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite book | last=Ford | first=Martin | title=The Lights in the Tunnel: Automation, Accelerating Technology and the Economy of the Future | publisher=Acculant Publishing | year=2009 | isbn=978-1-4486-5981-4 | url=http://www.thelightsinthetunnel.com | url-status=live | archiveurl=https://web.archive.org/web/20100906023409/http://www.thelightsinthetunnel.com/ | archivedate=6 September 2010 | df=dmy-all }}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;{{page needed|date=December 2016}}--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ ref --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Weizenbaum's critique&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Weizenbaum's critique&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
裁判员名字「魏岑鲍姆批评」&lt;br /&gt;
&lt;br /&gt;
[[Joseph Weizenbaum]]'s critique of AI:&lt;br /&gt;
&lt;br /&gt;
Joseph Weizenbaum's critique of AI:&lt;br /&gt;
&lt;br /&gt;
约瑟夫·维森鲍姆对人工智能的批判:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Weizenbaum|1976}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=132–144}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=356–373}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=961}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Weizenbaum (the AI researcher who developed the first [[chatterbot]] program, [[ELIZA]]) argued in 1976 that the misuse of artificial intelligence has the potential to devalue human life.&lt;br /&gt;
&lt;br /&gt;
Weizenbaum (the AI researcher who developed the first chatterbot program, ELIZA) argued in 1976 that the misuse of artificial intelligence has the potential to devalue human life.&lt;br /&gt;
&lt;br /&gt;
1976年，Weizenbaum (开发了第一个聊天机器人程序 ELIZA 的人工智能研究员)认为，人工智能的滥用有可能使人的生命贬值。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=Singularity&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=Singularity&amp;gt;&lt;br /&gt;
&lt;br /&gt;
引用名称 singularity&lt;br /&gt;
&lt;br /&gt;
[[Technological singularity]]:&lt;br /&gt;
&lt;br /&gt;
Technological singularity:&lt;br /&gt;
&lt;br /&gt;
技术奇异点:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Vinge|1993}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Kurzweil|2005}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=963}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;recurse&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;recurse&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Recurse&amp;quot;&lt;br /&gt;
&lt;br /&gt;
{{Cite conference | last = Omohundro|first= Steve| author-link= Steve Omohundro | year = 2008| title= The Nature of Self-Improving Artificial Intelligence| publisher=presented and distributed at the 2007 Singularity Summit, San Francisco, CA.}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Transhumanism&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Transhumanism&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反对者名字“超人主义”&lt;br /&gt;
&lt;br /&gt;
[[Transhumanism]]:&lt;br /&gt;
&lt;br /&gt;
Transhumanism:&lt;br /&gt;
&lt;br /&gt;
返回文章页面超人主义:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Moravec|1988}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Kurzweil|2005}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=963}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI as evolution&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI as evolution&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
进化论，人工智能&lt;br /&gt;
&lt;br /&gt;
AI as evolution:&lt;br /&gt;
&lt;br /&gt;
AI as evolution:&lt;br /&gt;
&lt;br /&gt;
人工智能与进化:&lt;br /&gt;
&lt;br /&gt;
* [[Edward Fredkin]] is quoted in {{Harvtxt|McCorduck|2004|p=401}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Butler|1863}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Dyson|1998}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===人工智能教材 AI textbooks ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{refbegin|30em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Hutter |first=Marcus |author-link=Marcus Hutter |year=2005&lt;br /&gt;
&lt;br /&gt;
| last=Hutter |first=Marcus |author-link=Marcus Hutter |year=2005&lt;br /&gt;
&lt;br /&gt;
作者链接: 马库斯 · 哈特2005&lt;br /&gt;
&lt;br /&gt;
| title=Universal Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
| title=Universal Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
通用人工智能&lt;br /&gt;
&lt;br /&gt;
| isbn=978-3-540-22139-5&lt;br /&gt;
&lt;br /&gt;
| isbn=978-3-540-22139-5&lt;br /&gt;
&lt;br /&gt;
| isbn 978-3-540-22139-5&lt;br /&gt;
&lt;br /&gt;
| publisher=Springer&lt;br /&gt;
&lt;br /&gt;
| publisher=Springer&lt;br /&gt;
&lt;br /&gt;
出版商斯普林格&lt;br /&gt;
&lt;br /&gt;
| location=Berlin&lt;br /&gt;
&lt;br /&gt;
| location=Berlin&lt;br /&gt;
&lt;br /&gt;
| 地点: 柏林&lt;br /&gt;
&lt;br /&gt;
| title-link=AIXI }}&lt;br /&gt;
&lt;br /&gt;
| title-link=AIXI }}&lt;br /&gt;
&lt;br /&gt;
| title-link AIXI }&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
|last=Jackson&lt;br /&gt;
&lt;br /&gt;
|last=Jackson&lt;br /&gt;
&lt;br /&gt;
杰克逊&lt;br /&gt;
&lt;br /&gt;
|first=Philip&lt;br /&gt;
&lt;br /&gt;
|first=Philip&lt;br /&gt;
&lt;br /&gt;
第一个菲利普&lt;br /&gt;
&lt;br /&gt;
|author-link=Philip C. Jackson, Jr.&lt;br /&gt;
&lt;br /&gt;
|author-link=Philip C. Jackson, Jr.&lt;br /&gt;
&lt;br /&gt;
作者链接小菲利普 · c · 杰克逊。&lt;br /&gt;
&lt;br /&gt;
|year=1985&lt;br /&gt;
&lt;br /&gt;
|year=1985&lt;br /&gt;
&lt;br /&gt;
1985年&lt;br /&gt;
&lt;br /&gt;
|title=Introduction to Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
|title=Introduction to Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
人工智能简介&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-486-24864-6&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-486-24864-6&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-486-24864-6]&lt;br /&gt;
&lt;br /&gt;
|publisher=Dover&lt;br /&gt;
&lt;br /&gt;
|publisher=Dover&lt;br /&gt;
&lt;br /&gt;
| 出版商 / Dover&lt;br /&gt;
&lt;br /&gt;
|edition=2nd&lt;br /&gt;
&lt;br /&gt;
|edition=2nd&lt;br /&gt;
&lt;br /&gt;
第二版&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/introductiontoar1985jack&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/introductiontoar1985jack&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/introductiontoar1985jack&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
|last1=Luger&lt;br /&gt;
&lt;br /&gt;
|last1=Luger&lt;br /&gt;
&lt;br /&gt;
1 Luger&lt;br /&gt;
&lt;br /&gt;
|first1=George&lt;br /&gt;
&lt;br /&gt;
|first1=George&lt;br /&gt;
&lt;br /&gt;
首先，乔治&lt;br /&gt;
&lt;br /&gt;
|author-link=George Luger&lt;br /&gt;
&lt;br /&gt;
|author-link=George Luger&lt;br /&gt;
&lt;br /&gt;
| 作者链接: George Luger&lt;br /&gt;
&lt;br /&gt;
|last2=Stubblefield&lt;br /&gt;
&lt;br /&gt;
|last2=Stubblefield&lt;br /&gt;
&lt;br /&gt;
2 Stubblefield&lt;br /&gt;
&lt;br /&gt;
|first2=William&lt;br /&gt;
&lt;br /&gt;
|first2=William&lt;br /&gt;
&lt;br /&gt;
| first2威廉&lt;br /&gt;
&lt;br /&gt;
|author2-link=William Stubblefield&lt;br /&gt;
&lt;br /&gt;
|author2-link=William Stubblefield&lt;br /&gt;
&lt;br /&gt;
威廉 · 斯塔布尔菲尔德&lt;br /&gt;
&lt;br /&gt;
|year=2004&lt;br /&gt;
&lt;br /&gt;
|year=2004&lt;br /&gt;
&lt;br /&gt;
2004年&lt;br /&gt;
&lt;br /&gt;
|title=Artificial Intelligence: Structures and Strategies for Complex Problem Solving&lt;br /&gt;
&lt;br /&gt;
|title=Artificial Intelligence: Structures and Strategies for Complex Problem Solving&lt;br /&gt;
&lt;br /&gt;
人工智能: 复杂问题解决的结构和策略&lt;br /&gt;
&lt;br /&gt;
|publisher=Benjamin/Cummings&lt;br /&gt;
&lt;br /&gt;
|publisher=Benjamin/Cummings&lt;br /&gt;
&lt;br /&gt;
出版商 benjamin / cummings&lt;br /&gt;
&lt;br /&gt;
|edition=5th&lt;br /&gt;
&lt;br /&gt;
|edition=5th&lt;br /&gt;
&lt;br /&gt;
第五版&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-8053-4780-7&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-8053-4780-7&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-8053-4780-7]&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/artificialintell0000luge&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/artificialintell0000luge&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/artificialintell0000luge&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Neapolitan |first=Richard |last2=Jiang |first2=Xia |year=2018|authorlink1=Richard Neapolitan&lt;br /&gt;
&lt;br /&gt;
| last=Neapolitan |first=Richard |last2=Jiang |first2=Xia |year=2018|authorlink1=Richard Neapolitan&lt;br /&gt;
&lt;br /&gt;
那不勒斯人 | 第一个 Richard | 最后2个 Jiang | 第一个2个 Xia | 2018年 | 作者: Richard Neapolitan&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence: With an Introduction to Machine Learning&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence: With an Introduction to Machine Learning&lt;br /&gt;
&lt;br /&gt;
人工智能: 机器学习入门&lt;br /&gt;
&lt;br /&gt;
| publisher=Chapman &amp;amp; Hall/CRC&lt;br /&gt;
&lt;br /&gt;
| publisher=Chapman &amp;amp; Hall/CRC&lt;br /&gt;
&lt;br /&gt;
| 出版商 Chapman &amp;amp; hall / crc&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-1-138-50238-3&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-1-138-50238-3&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-1-138-50238-3]&lt;br /&gt;
&lt;br /&gt;
| url=https://www.crcpress.com/Contemporary-Artificial-Intelligence-Second-Edition/Neapolitan-Jiang/p/book/9781138502383&lt;br /&gt;
&lt;br /&gt;
| url=https://www.crcpress.com/Contemporary-Artificial-Intelligence-Second-Edition/Neapolitan-Jiang/p/book/9781138502383&lt;br /&gt;
&lt;br /&gt;
Https://www.crcpress.com/contemporary-artificial-intelligence-second-edition/neapolitan-jiang/p/book/9781138502383&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Nilsson |first=Nils |author-link=Nils Nilsson (researcher) |year=1998&lt;br /&gt;
&lt;br /&gt;
| last=Nilsson |first=Nils |author-link=Nils Nilsson (researcher) |year=1998&lt;br /&gt;
&lt;br /&gt;
Nils Nilsson (研究员) | 1998年&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence: A New Synthesis&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence: A New Synthesis&lt;br /&gt;
&lt;br /&gt;
人工智能: 一种新的综合&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/artificialintell0000nils&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/artificialintell0000nils&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/artificialintell0000nils&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
| publisher=Morgan Kaufmann&lt;br /&gt;
&lt;br /&gt;
| publisher=Morgan Kaufmann&lt;br /&gt;
&lt;br /&gt;
出版商摩根 · 考夫曼&lt;br /&gt;
&lt;br /&gt;
| isbn=978-1-55860-467-4&lt;br /&gt;
&lt;br /&gt;
| isbn=978-1-55860-467-4&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-1-55860-467-4]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{Russell Norvig 2003}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| first = Stuart J.&lt;br /&gt;
&lt;br /&gt;
| first = Stuart J.&lt;br /&gt;
&lt;br /&gt;
首先是斯图尔特 · j。&lt;br /&gt;
&lt;br /&gt;
| last = Russell&lt;br /&gt;
&lt;br /&gt;
| last = Russell&lt;br /&gt;
&lt;br /&gt;
拉塞尔&lt;br /&gt;
&lt;br /&gt;
| first2 = Peter&lt;br /&gt;
&lt;br /&gt;
| first2 = Peter&lt;br /&gt;
&lt;br /&gt;
第二名: 彼得&lt;br /&gt;
&lt;br /&gt;
| last2 = Norvig&lt;br /&gt;
&lt;br /&gt;
| last2 = Norvig&lt;br /&gt;
&lt;br /&gt;
2 Norvig&lt;br /&gt;
&lt;br /&gt;
| title = [[Artificial Intelligence: A Modern Approach]] &amp;lt;!-- | url = http://aima.cs.berkeley.edu/ --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
| title = Artificial Intelligence: A Modern Approach &amp;lt;!-- | url = http://aima.cs.berkeley.edu/ --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
人工智能: 一种现代的方法&lt;br /&gt;
&lt;br /&gt;
| year = 2009&lt;br /&gt;
&lt;br /&gt;
| year = 2009&lt;br /&gt;
&lt;br /&gt;
2009年&lt;br /&gt;
&lt;br /&gt;
| edition = 3rd&lt;br /&gt;
&lt;br /&gt;
| edition = 3rd&lt;br /&gt;
&lt;br /&gt;
第三版&lt;br /&gt;
&lt;br /&gt;
| publisher = Prentice Hall&lt;br /&gt;
&lt;br /&gt;
| publisher = Prentice Hall&lt;br /&gt;
&lt;br /&gt;
出版商 Prentice Hall&lt;br /&gt;
&lt;br /&gt;
| location = Upper Saddle River, New Jersey&lt;br /&gt;
&lt;br /&gt;
| location = Upper Saddle River, New Jersey&lt;br /&gt;
&lt;br /&gt;
| 位置: 新泽西州上萨德尔河&lt;br /&gt;
&lt;br /&gt;
| isbn = 978-0-13-604259-4&lt;br /&gt;
&lt;br /&gt;
| isbn = 978-0-13-604259-4&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-13-604259-4]&lt;br /&gt;
&lt;br /&gt;
| author-link=Stuart J. Russell&lt;br /&gt;
&lt;br /&gt;
| author-link=Stuart J. Russell&lt;br /&gt;
&lt;br /&gt;
作者链接斯图尔特 · j · 拉塞尔&lt;br /&gt;
&lt;br /&gt;
| author2-link=Peter Norvig&lt;br /&gt;
&lt;br /&gt;
| author2-link=Peter Norvig&lt;br /&gt;
&lt;br /&gt;
| author2-link Peter Norvig&lt;br /&gt;
&lt;br /&gt;
| pages=&lt;br /&gt;
&lt;br /&gt;
| pages=&lt;br /&gt;
&lt;br /&gt;
页数&lt;br /&gt;
&lt;br /&gt;
}}.&lt;br /&gt;
&lt;br /&gt;
}}.&lt;br /&gt;
&lt;br /&gt;
}}.&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref          = harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |first1       = David&lt;br /&gt;
&lt;br /&gt;
 |first1       = David&lt;br /&gt;
&lt;br /&gt;
第一名: 大卫&lt;br /&gt;
&lt;br /&gt;
 |last1        = Poole&lt;br /&gt;
&lt;br /&gt;
 |last1        = Poole&lt;br /&gt;
&lt;br /&gt;
最后1个普尔&lt;br /&gt;
&lt;br /&gt;
 |author-link  = David Poole (researcher)&lt;br /&gt;
&lt;br /&gt;
 |author-link  = David Poole (researcher)&lt;br /&gt;
&lt;br /&gt;
作者链接大卫 · 普尔(研究员)&lt;br /&gt;
&lt;br /&gt;
 |first2       = Alan&lt;br /&gt;
&lt;br /&gt;
 |first2       = Alan&lt;br /&gt;
&lt;br /&gt;
第二名: 艾伦&lt;br /&gt;
&lt;br /&gt;
 |last2        = Mackworth&lt;br /&gt;
&lt;br /&gt;
 |last2        = Mackworth&lt;br /&gt;
&lt;br /&gt;
麦克沃斯&lt;br /&gt;
&lt;br /&gt;
 |author2-link = Alan Mackworth&lt;br /&gt;
&lt;br /&gt;
 |author2-link = Alan Mackworth&lt;br /&gt;
&lt;br /&gt;
| author2-link 艾伦 · 麦克沃思&lt;br /&gt;
&lt;br /&gt;
 |first3       = Randy&lt;br /&gt;
&lt;br /&gt;
 |first3       = Randy&lt;br /&gt;
&lt;br /&gt;
第三名: 兰迪&lt;br /&gt;
&lt;br /&gt;
 |last3        = Goebel&lt;br /&gt;
&lt;br /&gt;
 |last3        = Goebel&lt;br /&gt;
&lt;br /&gt;
最后3格贝尔&lt;br /&gt;
&lt;br /&gt;
 |author3-link = Randy Goebel&lt;br /&gt;
&lt;br /&gt;
 |author3-link = Randy Goebel&lt;br /&gt;
&lt;br /&gt;
| author3-link Randy Goebel&lt;br /&gt;
&lt;br /&gt;
 |year         = 1998&lt;br /&gt;
&lt;br /&gt;
 |year         = 1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
 |title        = Computational Intelligence: A Logical Approach&lt;br /&gt;
&lt;br /&gt;
 |title        = Computational Intelligence: A Logical Approach&lt;br /&gt;
&lt;br /&gt;
计算智能: 逻辑方法&lt;br /&gt;
&lt;br /&gt;
 |publisher    = Oxford University Press&lt;br /&gt;
&lt;br /&gt;
 |publisher    = Oxford University Press&lt;br /&gt;
&lt;br /&gt;
牛津大学出版社&lt;br /&gt;
&lt;br /&gt;
 |location     = New York&lt;br /&gt;
&lt;br /&gt;
 |location     = New York&lt;br /&gt;
&lt;br /&gt;
| 地点: 纽约&lt;br /&gt;
&lt;br /&gt;
 |isbn         = 978-0-19-510270-3&lt;br /&gt;
&lt;br /&gt;
 |isbn         = 978-0-19-510270-3&lt;br /&gt;
&lt;br /&gt;
| isbn 978-0-19-510270-3&lt;br /&gt;
&lt;br /&gt;
 |url          = https://archive.org/details/computationalint00pool&lt;br /&gt;
&lt;br /&gt;
 |url          = https://archive.org/details/computationalint00pool&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/computationalint00pool&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book | last=Winston | first=Patrick Henry | author-link=Patrick Winston | year=1984 | title=Artificial Intelligence | publisher=Addison-Wesley | location=Reading, MA | isbn=978-0-201-08259-3 | url=https://archive.org/details/artificialintell00wins }}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite book |last=Rich |first=Elaine |author-link=Elaine Rich |year=1983 |title=Artificial Intelligence |publisher=McGraw-Hill |isbn=978-0-07-052261-9 |url-access=registration |url=https://archive.org/details/ine0000unse }}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Bundy |first=Alan |author-link=Alan Bundy |year=1980&lt;br /&gt;
&lt;br /&gt;
| last=Bundy |first=Alan |author-link=Alan Bundy |year=1980&lt;br /&gt;
&lt;br /&gt;
1980年&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence: An Introductory Course&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence: An Introductory Course&lt;br /&gt;
&lt;br /&gt;
人工智能: 入门课程&lt;br /&gt;
&lt;br /&gt;
| publisher = Edinburgh University Press|edition=2nd&lt;br /&gt;
&lt;br /&gt;
| publisher = Edinburgh University Press|edition=2nd&lt;br /&gt;
&lt;br /&gt;
| 出版商爱丁堡大学出版社 | 第二版&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-85224-410-4&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-85224-410-4&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-85224-410-4]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|first1=David |last1=Poole |author-link=David Poole (researcher)&lt;br /&gt;
&lt;br /&gt;
|first1=David |last1=Poole |author-link=David Poole (researcher)&lt;br /&gt;
&lt;br /&gt;
作者链接大卫 · 普尔(研究员)&lt;br /&gt;
&lt;br /&gt;
|first2=Alan |last2=Mackworth |author2-link=Alan Mackworth&lt;br /&gt;
&lt;br /&gt;
|first2=Alan |last2=Mackworth |author2-link=Alan Mackworth&lt;br /&gt;
&lt;br /&gt;
作者: 艾伦 · 麦克沃思&lt;br /&gt;
&lt;br /&gt;
|year=2017&lt;br /&gt;
&lt;br /&gt;
|year=2017&lt;br /&gt;
&lt;br /&gt;
2017年&lt;br /&gt;
&lt;br /&gt;
|title=Artificial Intelligence: Foundations of Computational Agents&lt;br /&gt;
&lt;br /&gt;
|title=Artificial Intelligence: Foundations of Computational Agents&lt;br /&gt;
&lt;br /&gt;
人工智能: 计算机代理的基础&lt;br /&gt;
&lt;br /&gt;
|publisher = Cambridge University Press|edition=2nd&lt;br /&gt;
&lt;br /&gt;
|publisher = Cambridge University Press|edition=2nd&lt;br /&gt;
&lt;br /&gt;
出版商: 剑桥大学出版社&lt;br /&gt;
&lt;br /&gt;
|isbn=978-1-107-19539-4&lt;br /&gt;
&lt;br /&gt;
|isbn=978-1-107-19539-4&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-1-107-19539-4]&lt;br /&gt;
&lt;br /&gt;
|url=http://artint.info/index.html&lt;br /&gt;
&lt;br /&gt;
|url=http://artint.info/index.html&lt;br /&gt;
&lt;br /&gt;
Http://artint.info/index.html&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
{{refend}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===人工智能的历史 History of AI ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{refbegin|30em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Crevier 1993}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{McCorduck 2004}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Newquist |first=HP |author-link=HP Newquist |year=1994&lt;br /&gt;
&lt;br /&gt;
| last=Newquist |first=HP |author-link=HP Newquist |year=1994&lt;br /&gt;
&lt;br /&gt;
纽奎斯特 | 第一惠普 | 作者林克 · 纽奎斯特 | 1994年&lt;br /&gt;
&lt;br /&gt;
| title=The Brain Makers: Genius, Ego, And Greed In The Quest For Machines That Think&lt;br /&gt;
&lt;br /&gt;
| title=The Brain Makers: Genius, Ego, And Greed In The Quest For Machines That Think&lt;br /&gt;
&lt;br /&gt;
大脑制造者: 寻找思考机器的天才、自我和贪婪&lt;br /&gt;
&lt;br /&gt;
| publisher=Macmillan/SAMS |location=New York&lt;br /&gt;
&lt;br /&gt;
| publisher=Macmillan/SAMS |location=New York&lt;br /&gt;
&lt;br /&gt;
| 出版商 macmillan / sams | 位置: 纽约&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-672-30412-5 |ref=harv&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-672-30412-5 |ref=harv&lt;br /&gt;
&lt;br /&gt;
| isbn 978-0-672-30412-5 | ref harv&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Nilsson |first=Nils |author-link=Nils Nilsson (researcher) |year=2009&lt;br /&gt;
&lt;br /&gt;
| last=Nilsson |first=Nils |author-link=Nils Nilsson (researcher) |year=2009&lt;br /&gt;
&lt;br /&gt;
作者链接 Nils Nilsson (研究员) | 2009年&lt;br /&gt;
&lt;br /&gt;
| title=The Quest for Artificial Intelligence: A History of Ideas and Achievements&lt;br /&gt;
&lt;br /&gt;
| title=The Quest for Artificial Intelligence: A History of Ideas and Achievements&lt;br /&gt;
&lt;br /&gt;
人工智能的探索: 思想和成就的历史&lt;br /&gt;
&lt;br /&gt;
| publisher=Cambridge University Press |location=New York&lt;br /&gt;
&lt;br /&gt;
| publisher=Cambridge University Press |location=New York&lt;br /&gt;
&lt;br /&gt;
出版商剑桥大学出版社 | 位置纽约&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-521-12293-1&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-521-12293-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-521-12293-1]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
{{refend}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===其他资源 Other sources ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{refbegin|30em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite journal|ref=harv |last1=Asada |first1=M. |last2=Hosoda |first2=K. |last3=Kuniyoshi |first3=Y. |last4=Ishiguro |first4=H. |last5=Inui |first5=T. |last6=Yoshikawa |first6=Y. |last7=Ogino |first7=M. |last8=Yoshida |first8=C. |year=2009 |title=Cognitive developmental robotics: a survey |journal=IEEE Transactions on Autonomous Mental Development |volume=1 |issue=1 |pages=12–34 |doi=10.1109/tamd.2009.2021702 }}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite web&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |ref         = {{harvid|ACM|1998}}&lt;br /&gt;
&lt;br /&gt;
 |ref         = &lt;br /&gt;
&lt;br /&gt;
不会&lt;br /&gt;
&lt;br /&gt;
 |publisher   = [[Association for Computing Machinery|ACM]]&lt;br /&gt;
&lt;br /&gt;
 |publisher   = ACM&lt;br /&gt;
&lt;br /&gt;
| 出版商 ACM&lt;br /&gt;
&lt;br /&gt;
 |year        = 1998&lt;br /&gt;
&lt;br /&gt;
 |year        = 1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
 |title       = ACM Computing Classification System: Artificial intelligence&lt;br /&gt;
&lt;br /&gt;
 |title       = ACM Computing Classification System: Artificial intelligence&lt;br /&gt;
&lt;br /&gt;
ACM 电脑分类系统: 人工智能&lt;br /&gt;
&lt;br /&gt;
 |url         = http://www.acm.org/class/1998/I.2.html&lt;br /&gt;
&lt;br /&gt;
 |url         = http://www.acm.org/class/1998/I.2.html&lt;br /&gt;
&lt;br /&gt;
Http://www.acm.org/class/1998/i.2.html&lt;br /&gt;
&lt;br /&gt;
 |accessdate  = 30 August 2007&lt;br /&gt;
&lt;br /&gt;
 |accessdate  = 30 August 2007&lt;br /&gt;
&lt;br /&gt;
2007年8月30日&lt;br /&gt;
&lt;br /&gt;
 |url-status     = dead&lt;br /&gt;
&lt;br /&gt;
 |url-status     = dead&lt;br /&gt;
&lt;br /&gt;
状态死机&lt;br /&gt;
&lt;br /&gt;
 |archiveurl  = https://web.archive.org/web/20071012025921/http://www.acm.org/class/1998/I.2.html&lt;br /&gt;
&lt;br /&gt;
 |archiveurl  = https://web.archive.org/web/20071012025921/http://www.acm.org/class/1998/I.2.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20071012025921/http://www.acm.org/class/1998/i.2.html&lt;br /&gt;
&lt;br /&gt;
 |archivedate = 12 October 2007&lt;br /&gt;
&lt;br /&gt;
 |archivedate = 12 October 2007&lt;br /&gt;
&lt;br /&gt;
2007年10月12日&lt;br /&gt;
&lt;br /&gt;
 |df          = dmy-all&lt;br /&gt;
&lt;br /&gt;
 |df          = dmy-all&lt;br /&gt;
&lt;br /&gt;
我不会放过你的&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=Goodman |first1=Joanna |author-link=Joanna Goodman&lt;br /&gt;
&lt;br /&gt;
| last1=Goodman |first1=Joanna |author-link=Joanna Goodman&lt;br /&gt;
&lt;br /&gt;
乔安娜作者链接: 乔安娜 · 古德曼&lt;br /&gt;
&lt;br /&gt;
| year=2016&lt;br /&gt;
&lt;br /&gt;
| year=2016&lt;br /&gt;
&lt;br /&gt;
2016年&lt;br /&gt;
&lt;br /&gt;
| title=Robots in Law: How Artificial Intelligence is Transforming Legal Services&lt;br /&gt;
&lt;br /&gt;
| title=Robots in Law: How Artificial Intelligence is Transforming Legal Services&lt;br /&gt;
&lt;br /&gt;
法律中的机器人: 人工智能如何改变法律服务&lt;br /&gt;
&lt;br /&gt;
| publisher=Ark Group |edition=1st&lt;br /&gt;
&lt;br /&gt;
| publisher=Ark Group |edition=1st&lt;br /&gt;
&lt;br /&gt;
| 出版商方舟集团 | 第一版&lt;br /&gt;
&lt;br /&gt;
| isbn=978-1-78358-264-8&lt;br /&gt;
&lt;br /&gt;
| isbn=978-1-78358-264-8&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-1-78358-264-8]&lt;br /&gt;
&lt;br /&gt;
| url=https://www.ark-group.com/product/robots-law-how-artificial-intelligence-transforming-legal-services&lt;br /&gt;
&lt;br /&gt;
| url=https://www.ark-group.com/product/robots-law-how-artificial-intelligence-transforming-legal-services&lt;br /&gt;
&lt;br /&gt;
Https://www.ark-group.com/product/robots-law-how-artificial-intelligence-transforming-legal-services&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite encyclopedia&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
 |last=Albus&lt;br /&gt;
&lt;br /&gt;
 |last=Albus&lt;br /&gt;
&lt;br /&gt;
最后的阿不思&lt;br /&gt;
&lt;br /&gt;
 |first=J. S.&lt;br /&gt;
&lt;br /&gt;
 |first=J. S.&lt;br /&gt;
&lt;br /&gt;
首先是 j。美国。&lt;br /&gt;
&lt;br /&gt;
 |year=2002&lt;br /&gt;
&lt;br /&gt;
 |year=2002&lt;br /&gt;
&lt;br /&gt;
2002年&lt;br /&gt;
&lt;br /&gt;
 |pages=11–20&lt;br /&gt;
&lt;br /&gt;
 |pages=11–20&lt;br /&gt;
&lt;br /&gt;
第11-20页&lt;br /&gt;
&lt;br /&gt;
 |title=4-D/RCS: A Reference Model Architecture for Intelligent Unmanned Ground Vehicles&lt;br /&gt;
&lt;br /&gt;
 |title=4-D/RCS: A Reference Model Architecture for Intelligent Unmanned Ground Vehicles&lt;br /&gt;
&lt;br /&gt;
| title 4-d / rcs: 智能无人地面车辆参考模型体系结构&lt;br /&gt;
&lt;br /&gt;
 |editor1-last=Gerhart&lt;br /&gt;
&lt;br /&gt;
 |editor1-last=Gerhart&lt;br /&gt;
&lt;br /&gt;
| 编辑1-last Gerhart&lt;br /&gt;
&lt;br /&gt;
 |editor-first=G.&lt;br /&gt;
&lt;br /&gt;
 |editor-first=G.&lt;br /&gt;
&lt;br /&gt;
| 编辑-第一个 g。&lt;br /&gt;
&lt;br /&gt;
 |editor2-last=Gunderson&lt;br /&gt;
&lt;br /&gt;
 |editor2-last=Gunderson&lt;br /&gt;
&lt;br /&gt;
| 编辑2-last Gunderson&lt;br /&gt;
&lt;br /&gt;
 |editor2-first=R.&lt;br /&gt;
&lt;br /&gt;
 |editor2-first=R.&lt;br /&gt;
&lt;br /&gt;
| 编辑2-first r。&lt;br /&gt;
&lt;br /&gt;
 |editor3-last=Shoemaker&lt;br /&gt;
&lt;br /&gt;
 |editor3-last=Shoemaker&lt;br /&gt;
&lt;br /&gt;
最后一个鞋匠&lt;br /&gt;
&lt;br /&gt;
 |editor3-first=C.&lt;br /&gt;
&lt;br /&gt;
 |editor3-first=C.&lt;br /&gt;
&lt;br /&gt;
3-first c.&lt;br /&gt;
&lt;br /&gt;
 |encyclopedia=Proceedings of the SPIE AeroSense Session on Unmanned Ground Vehicle Technology&lt;br /&gt;
&lt;br /&gt;
 |encyclopedia=Proceedings of the SPIE AeroSense Session on Unmanned Ground Vehicle Technology&lt;br /&gt;
&lt;br /&gt;
美国国家科学院院刊航空感应会议关于无人地面载具技术&lt;br /&gt;
&lt;br /&gt;
 |volume=3693&lt;br /&gt;
&lt;br /&gt;
 |volume=3693&lt;br /&gt;
&lt;br /&gt;
第3693卷&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.isd.mel.nist.gov/documents/albus/4DRCS.pdf&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.isd.mel.nist.gov/documents/albus/4DRCS.pdf&lt;br /&gt;
&lt;br /&gt;
Http://www.isd.mel.nist.gov/documents/albus/4drcs.pdf&lt;br /&gt;
&lt;br /&gt;
 |archive-url=https://web.archive.org/web/20040725051856/http://www.isd.mel.nist.gov/documents/albus/4DRCS.pdf&lt;br /&gt;
&lt;br /&gt;
 |archive-url=https://web.archive.org/web/20040725051856/http://www.isd.mel.nist.gov/documents/albus/4DRCS.pdf&lt;br /&gt;
&lt;br /&gt;
| 档案-网址 https://web.archive.org/web/20040725051856/http://www.isd.mel.nist.gov/documents/albus/4drcs.pdf&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
状态死机&lt;br /&gt;
&lt;br /&gt;
 |archive-date=25 July 2004&lt;br /&gt;
&lt;br /&gt;
 |archive-date=25 July 2004&lt;br /&gt;
&lt;br /&gt;
| 档案-日期2004年7月25日&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
我不会让你失望的&lt;br /&gt;
&lt;br /&gt;
|bibcode=2002SPIE.4715..303A&lt;br /&gt;
&lt;br /&gt;
|bibcode=2002SPIE.4715..303A&lt;br /&gt;
&lt;br /&gt;
| bibcode 2002SPIE. 4715. . 303 a&lt;br /&gt;
&lt;br /&gt;
 |doi=10.1117/12.474462&lt;br /&gt;
&lt;br /&gt;
 |doi=10.1117/12.474462&lt;br /&gt;
&lt;br /&gt;
10.1117 / 12.474462&lt;br /&gt;
&lt;br /&gt;
 |citeseerx=10.1.1.15.14&lt;br /&gt;
&lt;br /&gt;
 |citeseerx=10.1.1.15.14&lt;br /&gt;
&lt;br /&gt;
10.1.1.15.14&lt;br /&gt;
&lt;br /&gt;
 |chapter=4D/RCS: A reference model architecture for intelligent unmanned ground vehicles&lt;br /&gt;
&lt;br /&gt;
 |chapter=4D/RCS: A reference model architecture for intelligent unmanned ground vehicles&lt;br /&gt;
&lt;br /&gt;
| 第4d / rcs: 智能无人地面车辆参考模型体系结构&lt;br /&gt;
&lt;br /&gt;
 |series=Unmanned Ground Vehicle Technology IV&lt;br /&gt;
&lt;br /&gt;
 |series=Unmanned Ground Vehicle Technology IV&lt;br /&gt;
&lt;br /&gt;
系列无人地面载具&lt;br /&gt;
&lt;br /&gt;
 }}&lt;br /&gt;
&lt;br /&gt;
 }}&lt;br /&gt;
&lt;br /&gt;
 }}&lt;br /&gt;
&lt;br /&gt;
* {{Cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last = Aleksander | first= Igor | authorlink = Igor Aleksander&lt;br /&gt;
&lt;br /&gt;
| last = Aleksander | first= Igor | authorlink = Igor Aleksander&lt;br /&gt;
&lt;br /&gt;
最后 | 第一个 Igor | 作者链接 Igor Aleksander&lt;br /&gt;
&lt;br /&gt;
| year=1995&lt;br /&gt;
&lt;br /&gt;
| year=1995&lt;br /&gt;
&lt;br /&gt;
1995年&lt;br /&gt;
&lt;br /&gt;
| title= Artificial Neuroconsciousness: An Update&lt;br /&gt;
&lt;br /&gt;
| title= Artificial Neuroconsciousness: An Update&lt;br /&gt;
&lt;br /&gt;
人工神经意识: 更新&lt;br /&gt;
&lt;br /&gt;
| publisher=IWANN&lt;br /&gt;
&lt;br /&gt;
| publisher=IWANN&lt;br /&gt;
&lt;br /&gt;
出版商 IWANN&lt;br /&gt;
&lt;br /&gt;
| url = http://www.ee.ic.ac.uk/research/neural/publications/iwann.html&lt;br /&gt;
&lt;br /&gt;
| url = http://www.ee.ic.ac.uk/research/neural/publications/iwann.html&lt;br /&gt;
&lt;br /&gt;
Http://www.ee.ic.ac.uk/research/neural/publications/iwann.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl = https://web.archive.org/web/19970302014628/http://www.ee.ic.ac.uk/research/neural/publications/iwann.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl = https://web.archive.org/web/19970302014628/http://www.ee.ic.ac.uk/research/neural/publications/iwann.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/19970302014628/http://www.ee.ic.ac.uk/research/neural/publications/iwann.html&lt;br /&gt;
&lt;br /&gt;
| archivedate = 2 March 1997&lt;br /&gt;
&lt;br /&gt;
| archivedate = 2 March 1997&lt;br /&gt;
&lt;br /&gt;
1997年3月2日&lt;br /&gt;
&lt;br /&gt;
| ref = harv&lt;br /&gt;
&lt;br /&gt;
| ref = harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
}} [http://dblp.uni-trier.de/rec/bibtex/conf/iwann/Aleksander95 BibTex] {{webarchive |url=https://web.archive.org/web/19970302014628/http://www.ee.ic.ac.uk/research/neural/publications/iwann.html |date=2 March 1997}}.&lt;br /&gt;
&lt;br /&gt;
}} [http://dblp.uni-trier.de/rec/bibtex/conf/iwann/Aleksander95 BibTex] .&lt;br /&gt;
&lt;br /&gt;
[}}[ http://dblp.uni-trier.de/rec/BibTex/conf/iwann/aleksander95 / BibTex ].&lt;br /&gt;
&lt;br /&gt;
* {{cite encyclopedia |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Bach |first=Joscha |year=2008 |pages=63–74&lt;br /&gt;
&lt;br /&gt;
| last=Bach |first=Joscha |year=2008 |pages=63–74&lt;br /&gt;
&lt;br /&gt;
最后巴赫 | 第一约沙 | 2008年 | 第63-74页&lt;br /&gt;
&lt;br /&gt;
| title=Seven Principles of Synthetic Intelligence&lt;br /&gt;
&lt;br /&gt;
| title=Seven Principles of Synthetic Intelligence&lt;br /&gt;
&lt;br /&gt;
7 Principles of Synthetic Intelligence | title 7 Principles of Synthetic Intelligence&lt;br /&gt;
&lt;br /&gt;
| editor1-last=Wang |editor1-first=Pei |editor2-last=Goertzel |editor2-first=Ben |editor3-last=Franklin |editor3-first=Stan&lt;br /&gt;
&lt;br /&gt;
| editor1-last=Wang |editor1-first=Pei |editor2-last=Goertzel |editor2-first=Ben |editor3-last=Franklin |editor3-first=Stan&lt;br /&gt;
&lt;br /&gt;
[参考译文][参考译文][参考译文][参考译文][参考译文][参考译文][参考译文]&lt;br /&gt;
&lt;br /&gt;
| work=Artificial General Intelligence, 2008: Proceedings of the First AGI Conference&lt;br /&gt;
&lt;br /&gt;
| work=Artificial General Intelligence, 2008: Proceedings of the First AGI Conference&lt;br /&gt;
&lt;br /&gt;
| 工作人工通用智能，2008: 第一次 AGI 会议记录&lt;br /&gt;
&lt;br /&gt;
| publisher=IOS Press |isbn=978-1-58603-833-5&lt;br /&gt;
&lt;br /&gt;
| publisher=IOS Press |isbn=978-1-58603-833-5&lt;br /&gt;
&lt;br /&gt;
| 出版商 IOS 出版社 | isbn 978-1-58603-833-5&lt;br /&gt;
&lt;br /&gt;
| url=https://books.google.com/books?id=a_ZR81Z25z0C&amp;amp;pg=PA63&lt;br /&gt;
&lt;br /&gt;
| url=https://books.google.com/books?id=a_ZR81Z25z0C&amp;amp;pg=PA63&lt;br /&gt;
&lt;br /&gt;
Https://books.google.com/books?id=a_zr81z25z0c&amp;amp;pg=pa63&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite news |ref={{harvid|''BBC News''|2006}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| date=21 December 2006&lt;br /&gt;
&lt;br /&gt;
| date=21 December 2006&lt;br /&gt;
&lt;br /&gt;
2006年12月21日&lt;br /&gt;
&lt;br /&gt;
| title=Robots could demand legal rights |work=BBC News&lt;br /&gt;
&lt;br /&gt;
| title=Robots could demand legal rights |work=BBC News&lt;br /&gt;
&lt;br /&gt;
机器人可以要求合法权利 | BBC 新闻&lt;br /&gt;
&lt;br /&gt;
| url=http://news.bbc.co.uk/2/hi/technology/6200005.stm |accessdate=3 February 2011&lt;br /&gt;
&lt;br /&gt;
| url=http://news.bbc.co.uk/2/hi/technology/6200005.stm |accessdate=3 February 2011&lt;br /&gt;
&lt;br /&gt;
Http://news.bbc.co.uk/2/hi/technology/6200005.stm  : 2011年2月3日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Brooks |first=Rodney |authorlink=Rodney Brooks |year=1990&lt;br /&gt;
&lt;br /&gt;
| last=Brooks |first=Rodney |authorlink=Rodney Brooks |year=1990&lt;br /&gt;
&lt;br /&gt;
罗德尼 · 布鲁克斯，1990年&lt;br /&gt;
&lt;br /&gt;
| title=Elephants Don't Play Chess&lt;br /&gt;
&lt;br /&gt;
| title=Elephants Don't Play Chess&lt;br /&gt;
&lt;br /&gt;
大象不下国际象棋&lt;br /&gt;
&lt;br /&gt;
| journal=Robotics and Autonomous Systems |volume=6 | issue=1–2 |pages=3–15&lt;br /&gt;
&lt;br /&gt;
| journal=Robotics and Autonomous Systems |volume=6 | issue=1–2 |pages=3–15&lt;br /&gt;
&lt;br /&gt;
机器人学与自主系统 | 第六卷 | 第1-2期 | 第3-15页&lt;br /&gt;
&lt;br /&gt;
| doi=10.1016/S0921-8890(05)80025-9&lt;br /&gt;
&lt;br /&gt;
| doi=10.1016/S0921-8890(05)80025-9&lt;br /&gt;
&lt;br /&gt;
10.1016 / S0921-8890(05)80025-9&lt;br /&gt;
&lt;br /&gt;
| url=http://people.csail.mit.edu/brooks/papers/elephants.pdf | archiveurl= https://web.archive.org/web/20070809020912/http://people.csail.mit.edu/brooks/papers/elephants.pdf&lt;br /&gt;
&lt;br /&gt;
| url=http://people.csail.mit.edu/brooks/papers/elephants.pdf | archiveurl= https://web.archive.org/web/20070809020912/http://people.csail.mit.edu/brooks/papers/elephants.pdf&lt;br /&gt;
&lt;br /&gt;
Http://people.csail.mit.edu/brooks/papers/elephants.pdf  https://web.archive.org/web/20070809020912/http://people.csail.mit.edu/brooks/papers/elephants.pdf&lt;br /&gt;
&lt;br /&gt;
| archivedate=9 August 2007 |url-status=live&lt;br /&gt;
&lt;br /&gt;
| archivedate=9 August 2007 |url-status=live&lt;br /&gt;
&lt;br /&gt;
2007年8月9日&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.588.7539 }}&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.588.7539 }}&lt;br /&gt;
&lt;br /&gt;
10.1.1.588.7539}&lt;br /&gt;
&lt;br /&gt;
* {{cite encyclopedia |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Brooks |first=R. A. |year=1991 |pages=225–239&lt;br /&gt;
&lt;br /&gt;
| last=Brooks |first=R. A. |year=1991 |pages=225–239&lt;br /&gt;
&lt;br /&gt;
| 最后的布鲁克斯 | 最初的 r。答:。1991年，第225-239页&lt;br /&gt;
&lt;br /&gt;
| title=How to build complete creatures rather than isolated cognitive simulators&lt;br /&gt;
&lt;br /&gt;
| title=How to build complete creatures rather than isolated cognitive simulators&lt;br /&gt;
&lt;br /&gt;
如何建造完整的生物而不是孤立的认知模拟器&lt;br /&gt;
&lt;br /&gt;
| editor-last=VanLehn |editor-first=K.&lt;br /&gt;
&lt;br /&gt;
| editor-last=VanLehn |editor-first=K.&lt;br /&gt;
&lt;br /&gt;
| 编辑-最后一个 VanLehn | 编辑-第一个 k。&lt;br /&gt;
&lt;br /&gt;
| encyclopedia=Architectures for Intelligence |location=Hillsdale, NJ |publisher=Lawrence Erlbaum Associates&lt;br /&gt;
&lt;br /&gt;
| encyclopedia=Architectures for Intelligence |location=Hillsdale, NJ |publisher=Lawrence Erlbaum Associates&lt;br /&gt;
&lt;br /&gt;
| 情报百科全书架构 | 位置希尔斯代尔，新泽西 | 出版商 Lawrence Erlbaum Associates&lt;br /&gt;
&lt;br /&gt;
|citeseerx=10.1.1.52.9510}}&lt;br /&gt;
&lt;br /&gt;
|citeseerx=10.1.1.52.9510}}&lt;br /&gt;
&lt;br /&gt;
10.1.1.52.9510}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
 |last=Buchanan&lt;br /&gt;
&lt;br /&gt;
 |last=Buchanan&lt;br /&gt;
&lt;br /&gt;
最后的布坎南&lt;br /&gt;
&lt;br /&gt;
 |first=Bruce G.&lt;br /&gt;
&lt;br /&gt;
 |first=Bruce G.&lt;br /&gt;
&lt;br /&gt;
首先是布鲁斯 · g。&lt;br /&gt;
&lt;br /&gt;
 |year=2005&lt;br /&gt;
&lt;br /&gt;
 |year=2005&lt;br /&gt;
&lt;br /&gt;
2005年&lt;br /&gt;
&lt;br /&gt;
 |pages=53–60&lt;br /&gt;
&lt;br /&gt;
 |pages=53–60&lt;br /&gt;
&lt;br /&gt;
第53-60页&lt;br /&gt;
&lt;br /&gt;
 |title=A (Very) Brief History of Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
 |title=A (Very) Brief History of Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
人工智能简史&lt;br /&gt;
&lt;br /&gt;
 |journal=AI Magazine&lt;br /&gt;
&lt;br /&gt;
 |journal=AI Magazine&lt;br /&gt;
&lt;br /&gt;
人工智能杂志&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.aaai.org/AITopics/assets/PDF/AIMag26-04-016.pdf&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.aaai.org/AITopics/assets/PDF/AIMag26-04-016.pdf&lt;br /&gt;
&lt;br /&gt;
Http://www.aaai.org/aitopics/assets/pdf/aimag26-04-016.pdf&lt;br /&gt;
&lt;br /&gt;
 |archiveurl=https://web.archive.org/web/20070926023314/http://www.aaai.org/AITopics/assets/PDF/AIMag26-04-016.pdf&lt;br /&gt;
&lt;br /&gt;
 |archiveurl=https://web.archive.org/web/20070926023314/http://www.aaai.org/AITopics/assets/PDF/AIMag26-04-016.pdf&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20070926023314/http://www.aaai.org/aitopics/assets/pdf/aimag26-04-016.pdf&lt;br /&gt;
&lt;br /&gt;
 |archivedate=26 September 2007&lt;br /&gt;
&lt;br /&gt;
 |archivedate=26 September 2007&lt;br /&gt;
&lt;br /&gt;
2007年9月26日&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
状态死机&lt;br /&gt;
&lt;br /&gt;
 |df=dmy&lt;br /&gt;
&lt;br /&gt;
 |df=dmy&lt;br /&gt;
&lt;br /&gt;
我不会让你失望的&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite news |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Butler |first=Samuel |authorlink=Samuel Butler (novelist) |date=13 June 1863&lt;br /&gt;
&lt;br /&gt;
| last=Butler |first=Samuel |authorlink=Samuel Butler (novelist) |date=13 June 1863&lt;br /&gt;
&lt;br /&gt;
塞缪尔 · 巴特勒(小说家)1863年6月13日&lt;br /&gt;
&lt;br /&gt;
| title=Darwin among the Machines&lt;br /&gt;
&lt;br /&gt;
| title=Darwin among the Machines&lt;br /&gt;
&lt;br /&gt;
标题: 机器中的达尔文&lt;br /&gt;
&lt;br /&gt;
| work=[[The Press]] |location=Christchurch, New Zealand |department=Letters to the Editor&lt;br /&gt;
&lt;br /&gt;
| work=The Press |location=Christchurch, New Zealand |department=Letters to the Editor&lt;br /&gt;
&lt;br /&gt;
| 工作 | 新闻 | 位置基督城 | 给编辑的信&lt;br /&gt;
&lt;br /&gt;
| url=http://www.nzetc.org/tm/scholarly/tei-ButFir-t1-g1-t1-g1-t4-body.html |accessdate=16 October 2014&lt;br /&gt;
&lt;br /&gt;
| url=http://www.nzetc.org/tm/scholarly/tei-ButFir-t1-g1-t1-g1-t4-body.html |accessdate=16 October 2014&lt;br /&gt;
&lt;br /&gt;
Http://www.nzetc.org/tm/scholarly/tei-butfir-t1-g1-t1-g1-t4-body.html  : 2014年10月16日&lt;br /&gt;
&lt;br /&gt;
| via=Victoria University of Wellington&lt;br /&gt;
&lt;br /&gt;
| via=Victoria University of Wellington&lt;br /&gt;
&lt;br /&gt;
惠灵顿维多利亚大学&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |url         = https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
 |url         = https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
Https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
 |title       = Why 2015 Was a Breakthrough Year in Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
 |title       = Why 2015 Was a Breakthrough Year in Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
为什么2015年是人工智能的突破之年&lt;br /&gt;
&lt;br /&gt;
 |last        = Clark&lt;br /&gt;
&lt;br /&gt;
 |last        = Clark&lt;br /&gt;
&lt;br /&gt;
最后的克拉克&lt;br /&gt;
&lt;br /&gt;
 |first       = Jack&lt;br /&gt;
&lt;br /&gt;
 |first       = Jack&lt;br /&gt;
&lt;br /&gt;
先是杰克&lt;br /&gt;
&lt;br /&gt;
 |website     = Bloomberg News&lt;br /&gt;
&lt;br /&gt;
 |website     = Bloomberg News&lt;br /&gt;
&lt;br /&gt;
彭博新闻网&lt;br /&gt;
&lt;br /&gt;
 |date        = 8 December 2015&lt;br /&gt;
&lt;br /&gt;
 |date        = 8 December 2015&lt;br /&gt;
&lt;br /&gt;
2015年12月8日&lt;br /&gt;
&lt;br /&gt;
 |access-date = 23 November 2016&lt;br /&gt;
&lt;br /&gt;
 |access-date = 23 November 2016&lt;br /&gt;
&lt;br /&gt;
| 2016年11月23日&lt;br /&gt;
&lt;br /&gt;
 |quote       = After a half-decade of quiet breakthroughs in artificial intelligence, 2015 has been a landmark year. Computers are smarter and learning faster than ever.&lt;br /&gt;
&lt;br /&gt;
 |quote       = After a half-decade of quiet breakthroughs in artificial intelligence, 2015 has been a landmark year. Computers are smarter and learning faster than ever.&lt;br /&gt;
&lt;br /&gt;
经过5年人工智能领域的悄然突破，2015年成为了具有里程碑意义的一年。计算机比以往更聪明，学习速度更快。&lt;br /&gt;
&lt;br /&gt;
 |url-status     = live&lt;br /&gt;
&lt;br /&gt;
 |url-status     = live&lt;br /&gt;
&lt;br /&gt;
状态直播&lt;br /&gt;
&lt;br /&gt;
 |archiveurl  = https://web.archive.org/web/20161123053855/https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
 |archiveurl  = https://web.archive.org/web/20161123053855/https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20161123053855/https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
 |archivedate = 23 November 2016&lt;br /&gt;
&lt;br /&gt;
 |archivedate = 23 November 2016&lt;br /&gt;
&lt;br /&gt;
2016年11月23日&lt;br /&gt;
&lt;br /&gt;
 |df          = dmy-all&lt;br /&gt;
&lt;br /&gt;
 |df          = dmy-all&lt;br /&gt;
&lt;br /&gt;
我不会放过你的&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite news |ref={{harvid|''CNN''|2006}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| title=AI set to exceed human brain power&lt;br /&gt;
&lt;br /&gt;
| title=AI set to exceed human brain power&lt;br /&gt;
&lt;br /&gt;
| 人工智能将超越人脑能力&lt;br /&gt;
&lt;br /&gt;
| work=CNN |date=26 July 2006&lt;br /&gt;
&lt;br /&gt;
| work=CNN |date=26 July 2006&lt;br /&gt;
&lt;br /&gt;
2006年7月26日&lt;br /&gt;
&lt;br /&gt;
| url=http://www.cnn.com/2006/TECH/science/07/24/ai.bostrom/&lt;br /&gt;
&lt;br /&gt;
| url=http://www.cnn.com/2006/TECH/science/07/24/ai.bostrom/&lt;br /&gt;
&lt;br /&gt;
Http://www.cnn.com/2006/tech/science/07/24/ai.bostrom/ &lt;br /&gt;
&lt;br /&gt;
| archiveurl= https://web.archive.org/web/20080219001624/http://www.cnn.com/2006/TECH/science/07/24/ai.bostrom/&lt;br /&gt;
&lt;br /&gt;
| archiveurl= https://web.archive.org/web/20080219001624/http://www.cnn.com/2006/TECH/science/07/24/ai.bostrom/&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20080219001624/http://www.cnn.com/2006/tech/science/07/24/ai.bostrom/ &lt;br /&gt;
&lt;br /&gt;
| archivedate=19 February 2008 |url-status=live&lt;br /&gt;
&lt;br /&gt;
| archivedate=19 February 2008 |url-status=live&lt;br /&gt;
&lt;br /&gt;
2008年2月19日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Dennett | first=Daniel | author-link=Daniel Dennett&lt;br /&gt;
&lt;br /&gt;
| last=Dennett | first=Daniel | author-link=Daniel Dennett&lt;br /&gt;
&lt;br /&gt;
丹尼特丹尼特丹尼特丹尼尔丹尼尔丹尼特丹尼尔丹尼特丹尼尔丹尼特丹尼尔丹尼特丹尼尔丹尼特&lt;br /&gt;
&lt;br /&gt;
| year=1991&lt;br /&gt;
&lt;br /&gt;
| year=1991&lt;br /&gt;
&lt;br /&gt;
1991年&lt;br /&gt;
&lt;br /&gt;
| title=Consciousness Explained&lt;br /&gt;
&lt;br /&gt;
| title=Consciousness Explained&lt;br /&gt;
&lt;br /&gt;
意识的解释&lt;br /&gt;
&lt;br /&gt;
| publisher=The Penguin Press&lt;br /&gt;
&lt;br /&gt;
| publisher=The Penguin Press&lt;br /&gt;
&lt;br /&gt;
企鹅出版社&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-7139-9037-9&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-7139-9037-9&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-7139-9037-9]&lt;br /&gt;
&lt;br /&gt;
| title-link=Consciousness Explained }}&lt;br /&gt;
&lt;br /&gt;
| title-link=Consciousness Explained }}&lt;br /&gt;
&lt;br /&gt;
| 标题-链接意识解释}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* {{cite magazine |ref=harv&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* {{cite magazine |ref=harv&lt;br /&gt;
&lt;br /&gt;
!-* { cite magazine | ref harv&lt;br /&gt;
&lt;br /&gt;
| last=Diamond |first=David |date=December 2003&lt;br /&gt;
&lt;br /&gt;
| last=Diamond |first=David |date=December 2003&lt;br /&gt;
&lt;br /&gt;
最后的钻石 | 第一个大卫 | 日期2003年12月&lt;br /&gt;
&lt;br /&gt;
| title=The Love Machine; Building computers that care&lt;br /&gt;
&lt;br /&gt;
| title=The Love Machine; Building computers that care&lt;br /&gt;
&lt;br /&gt;
| 题目: 爱情机器; 制造关心他人的电脑&lt;br /&gt;
&lt;br /&gt;
| magazine=Wired&lt;br /&gt;
&lt;br /&gt;
| magazine=Wired&lt;br /&gt;
&lt;br /&gt;
连线》杂志&lt;br /&gt;
&lt;br /&gt;
| url=https://www.wired.com/wired/archive/11.12/love.html&lt;br /&gt;
&lt;br /&gt;
| url=https://www.wired.com/wired/archive/11.12/love.html&lt;br /&gt;
&lt;br /&gt;
Https://www.wired.com/wired/archive/11.12/love.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl= https://web.archive.org/web/20080518185630/http://www.wired.com/wired/archive/11.12/love.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl= https://web.archive.org/web/20080518185630/http://www.wired.com/wired/archive/11.12/love.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20080518185630/http://www.wired.com/wired/archive/11.12/love.html&lt;br /&gt;
&lt;br /&gt;
| archivedate=18 May 2008 |url-status=live&lt;br /&gt;
&lt;br /&gt;
| archivedate=18 May 2008 |url-status=live&lt;br /&gt;
&lt;br /&gt;
2008年5月18日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
-- * { cite book | ref harv&lt;br /&gt;
&lt;br /&gt;
|first1=Pedro |last1=Domingos |author-link=Pedro Domingos&lt;br /&gt;
&lt;br /&gt;
|first1=Pedro |last1=Domingos |author-link=Pedro Domingos&lt;br /&gt;
&lt;br /&gt;
| first1 Pedro | last1 Domingos | 作者链接 Pedro Domingos&lt;br /&gt;
&lt;br /&gt;
|year=2015&lt;br /&gt;
&lt;br /&gt;
|year=2015&lt;br /&gt;
&lt;br /&gt;
2015年&lt;br /&gt;
&lt;br /&gt;
|title=The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World&lt;br /&gt;
&lt;br /&gt;
|title=The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World&lt;br /&gt;
&lt;br /&gt;
大师级算法: 探索终极学习机器将如何改造我们的世界&lt;br /&gt;
&lt;br /&gt;
|publisher = Basic Books&lt;br /&gt;
&lt;br /&gt;
|publisher = Basic Books&lt;br /&gt;
&lt;br /&gt;
| 出版商 Basic Books&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-465-06192-1&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-465-06192-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-465-06192-1]&lt;br /&gt;
&lt;br /&gt;
|title-link=The Master Algorithm }}&lt;br /&gt;
&lt;br /&gt;
|title-link=The Master Algorithm }}&lt;br /&gt;
&lt;br /&gt;
| title-link The Master Algorithm }&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv |last1=Dowe |first1=D. L. |last2=Hajek |first2=A. R. |year=1997 |title=A computational extension to the Turing Test |journal=Proceedings of the 4th Conference of the Australasian Cognitive Science Society |url=http://www.csse.monash.edu.au/publications/1997/tr-cs97-322-abs.html |url-status=dead |archiveurl=https://web.archive.org/web/20110628194905/http://www.csse.monash.edu.au/publications/1997/tr-cs97-322-abs.html |archivedate=28 June 2011 |df=dmy-all }}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Dreyfus | first=Hubert | authorlink = Hubert Dreyfus&lt;br /&gt;
&lt;br /&gt;
| last=Dreyfus | first=Hubert | authorlink = Hubert Dreyfus&lt;br /&gt;
&lt;br /&gt;
作者: 休伯特 · 德雷福斯&lt;br /&gt;
&lt;br /&gt;
| year = 1972&lt;br /&gt;
&lt;br /&gt;
| year = 1972&lt;br /&gt;
&lt;br /&gt;
1972年&lt;br /&gt;
&lt;br /&gt;
| title = What Computers Can't Do&lt;br /&gt;
&lt;br /&gt;
| title = What Computers Can't Do&lt;br /&gt;
&lt;br /&gt;
计算机不能做什么&lt;br /&gt;
&lt;br /&gt;
| publisher = MIT Press | location = New York&lt;br /&gt;
&lt;br /&gt;
| publisher = MIT Press | location = New York&lt;br /&gt;
&lt;br /&gt;
| 出版商麻省理工学院出版社 | 位置纽约&lt;br /&gt;
&lt;br /&gt;
| isbn = 978-0-06-011082-6&lt;br /&gt;
&lt;br /&gt;
| isbn = 978-0-06-011082-6&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-06-011082-6]&lt;br /&gt;
&lt;br /&gt;
| title-link=What Computers Can't Do }}&lt;br /&gt;
&lt;br /&gt;
| title-link=What Computers Can't Do }}&lt;br /&gt;
&lt;br /&gt;
| title-link What Computers can’t Do }&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref        = harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |last       = Dreyfus&lt;br /&gt;
&lt;br /&gt;
 |last       = Dreyfus&lt;br /&gt;
&lt;br /&gt;
最后一个德雷福斯&lt;br /&gt;
&lt;br /&gt;
 |first      = Hubert&lt;br /&gt;
&lt;br /&gt;
 |first      = Hubert&lt;br /&gt;
&lt;br /&gt;
首先是休伯特&lt;br /&gt;
&lt;br /&gt;
 |authorlink = Hubert Dreyfus&lt;br /&gt;
&lt;br /&gt;
 |authorlink = Hubert Dreyfus&lt;br /&gt;
&lt;br /&gt;
作者: 休伯特 · 德雷福斯&lt;br /&gt;
&lt;br /&gt;
 |last2      = Dreyfus&lt;br /&gt;
&lt;br /&gt;
 |last2      = Dreyfus&lt;br /&gt;
&lt;br /&gt;
最后2名路易达孚&lt;br /&gt;
&lt;br /&gt;
 |first2     = Stuart&lt;br /&gt;
&lt;br /&gt;
 |first2     = Stuart&lt;br /&gt;
&lt;br /&gt;
| first2 Stuart&lt;br /&gt;
&lt;br /&gt;
 |year       = 1986&lt;br /&gt;
&lt;br /&gt;
 |year       = 1986&lt;br /&gt;
&lt;br /&gt;
1986年&lt;br /&gt;
&lt;br /&gt;
 |title      = Mind over Machine: The Power of Human Intuition and Expertise in the Era of the Computer&lt;br /&gt;
&lt;br /&gt;
 |title      = Mind over Machine: The Power of Human Intuition and Expertise in the Era of the Computer&lt;br /&gt;
&lt;br /&gt;
心智胜过机器: 计算机时代人类直觉和专业知识的力量&lt;br /&gt;
&lt;br /&gt;
 |publisher  = Blackwell&lt;br /&gt;
&lt;br /&gt;
 |publisher  = Blackwell&lt;br /&gt;
&lt;br /&gt;
| 出版商 Blackwell&lt;br /&gt;
&lt;br /&gt;
 |location   = Oxford, UK&lt;br /&gt;
&lt;br /&gt;
 |location   = Oxford, UK&lt;br /&gt;
&lt;br /&gt;
| 位置: 牛津，英国&lt;br /&gt;
&lt;br /&gt;
 |isbn       = 978-0-02-908060-3&lt;br /&gt;
&lt;br /&gt;
 |isbn       = 978-0-02-908060-3&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-02-908060-3]&lt;br /&gt;
&lt;br /&gt;
 |url        = https://archive.org/details/mindovermachinep00drey&lt;br /&gt;
&lt;br /&gt;
 |url        = https://archive.org/details/mindovermachinep00drey&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/mindovermachinep00drey&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Dreyfus | first=Hubert | authorlink = Hubert Dreyfus&lt;br /&gt;
&lt;br /&gt;
| last=Dreyfus | first=Hubert | authorlink = Hubert Dreyfus&lt;br /&gt;
&lt;br /&gt;
作者: 休伯特 · 德雷福斯&lt;br /&gt;
&lt;br /&gt;
| year =1992&lt;br /&gt;
&lt;br /&gt;
| year =1992&lt;br /&gt;
&lt;br /&gt;
1992年&lt;br /&gt;
&lt;br /&gt;
| title = What Computers ''Still'' Can't Do&lt;br /&gt;
&lt;br /&gt;
| title = What Computers Still Can't Do&lt;br /&gt;
&lt;br /&gt;
计算机仍然不能做什么&lt;br /&gt;
&lt;br /&gt;
| publisher = MIT Press | location = New York&lt;br /&gt;
&lt;br /&gt;
| publisher = MIT Press | location = New York&lt;br /&gt;
&lt;br /&gt;
| 出版商麻省理工学院出版社 | 位置纽约&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-262-54067-4&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-262-54067-4&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-262-54067-4]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
|last=Dyson&lt;br /&gt;
&lt;br /&gt;
|last=Dyson&lt;br /&gt;
&lt;br /&gt;
戴森&lt;br /&gt;
&lt;br /&gt;
|first=George&lt;br /&gt;
&lt;br /&gt;
|first=George&lt;br /&gt;
&lt;br /&gt;
先是乔治&lt;br /&gt;
&lt;br /&gt;
|authorlink=George Dyson (science historian)&lt;br /&gt;
&lt;br /&gt;
|authorlink=George Dyson (science historian)&lt;br /&gt;
&lt;br /&gt;
乔治 · 戴森(科学历史学家)&lt;br /&gt;
&lt;br /&gt;
|year=1998&lt;br /&gt;
&lt;br /&gt;
|year=1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
|title=Darwin among the Machines&lt;br /&gt;
&lt;br /&gt;
|title=Darwin among the Machines&lt;br /&gt;
&lt;br /&gt;
标题: 机器中的达尔文&lt;br /&gt;
&lt;br /&gt;
|publisher=Allan Lane Science&lt;br /&gt;
&lt;br /&gt;
|publisher=Allan Lane Science&lt;br /&gt;
&lt;br /&gt;
| 出版人 Allan Lane Science&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-7382-0030-9&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-7382-0030-9&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-0-7382-0030-9]&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/darwinamongmachi00dyso&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/darwinamongmachi00dyso&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/darwinamongmachi00dyso&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web|ref=harv |last=Edelman |first=Gerald |authorlink=Gerald Edelman |date=23 November 2007 |title=Gerald Edelman – Neural Darwinism and Brain-based Devices |url=http://lis.epfl.ch/resources/podcast/2007/11/gerald-edelman-neural-darwinism-and.html |publisher=Talking Robots |url-status=dead |archiveurl=https://web.archive.org/web/20091008184132/http://lis.epfl.ch/resources/podcast/2007/11/gerald-edelman-neural-darwinism-and.html |archivedate=8 October 2009}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Edelson |first=Edward |year=1991&lt;br /&gt;
&lt;br /&gt;
| last=Edelson |first=Edward |year=1991&lt;br /&gt;
&lt;br /&gt;
1991年&lt;br /&gt;
&lt;br /&gt;
| title=The Nervous System&lt;br /&gt;
&lt;br /&gt;
| title=The Nervous System&lt;br /&gt;
&lt;br /&gt;
神经系统&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/nervoussystem0000edel&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/nervoussystem0000edel&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/nervoussystem0000edel&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
| publisher=Chelsea House&amp;lt;!--so Worldcat, originally here Remmel Nunn--&amp;gt; |location=New York |isbn=978-0-7910-0464-7&lt;br /&gt;
&lt;br /&gt;
| publisher=Chelsea House&amp;lt;!--so Worldcat, originally here Remmel Nunn--&amp;gt; |location=New York |isbn=978-0-7910-0464-7&lt;br /&gt;
&lt;br /&gt;
| 出版商切尔西之家! -- 所以 worldcat，最初在这里 remmel nunn-- | 位置纽约 | isbn 978-0-7910-0464-7&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Fearn&lt;br /&gt;
&lt;br /&gt;
| last=Fearn&lt;br /&gt;
&lt;br /&gt;
最后的恐惧&lt;br /&gt;
&lt;br /&gt;
| first = Nicholas&lt;br /&gt;
&lt;br /&gt;
| first = Nicholas&lt;br /&gt;
&lt;br /&gt;
| first = Nicholas&lt;br /&gt;
&lt;br /&gt;
| year =2007&lt;br /&gt;
&lt;br /&gt;
| year =2007&lt;br /&gt;
&lt;br /&gt;
2007年&lt;br /&gt;
&lt;br /&gt;
| title= The Latest Answers to the Oldest Questions: A Philosophical Adventure with the World's Greatest Thinkers&lt;br /&gt;
&lt;br /&gt;
| title= The Latest Answers to the Oldest Questions: A Philosophical Adventure with the World's Greatest Thinkers&lt;br /&gt;
&lt;br /&gt;
最古老问题的最新答案: 世界上最伟大思想家的哲学探险&lt;br /&gt;
&lt;br /&gt;
| publisher = Grove Press&lt;br /&gt;
&lt;br /&gt;
| publisher = Grove Press&lt;br /&gt;
&lt;br /&gt;
出版商: 格罗夫出版社&lt;br /&gt;
&lt;br /&gt;
| location=New York |isbn=978-0-8021-1839-4&lt;br /&gt;
&lt;br /&gt;
| location=New York |isbn=978-0-8021-1839-4&lt;br /&gt;
&lt;br /&gt;
| 位置纽约 | isbn 978-0-8021-1839-4&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 | last = Gladwell | first = Malcolm | authorlink= Malcolm Gladwell&lt;br /&gt;
&lt;br /&gt;
 | last = Gladwell | first = Malcolm | authorlink= Malcolm Gladwell&lt;br /&gt;
&lt;br /&gt;
2012年10月12日 | 最后一个马尔科姆·格拉德威尔 | 第一个 Malcolm | 作者 / 链接&lt;br /&gt;
&lt;br /&gt;
 | year = 2005&lt;br /&gt;
&lt;br /&gt;
 | year = 2005&lt;br /&gt;
&lt;br /&gt;
2005年&lt;br /&gt;
&lt;br /&gt;
 | title = Blink&lt;br /&gt;
&lt;br /&gt;
 | title = Blink&lt;br /&gt;
&lt;br /&gt;
标题: 眨眼&lt;br /&gt;
&lt;br /&gt;
 | isbn = 978-0-316-17232-5&lt;br /&gt;
&lt;br /&gt;
 | isbn = 978-0-316-17232-5&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-316-17232-5]&lt;br /&gt;
&lt;br /&gt;
 | publisher = Little, Brown and Co. | location = New York&lt;br /&gt;
&lt;br /&gt;
 | publisher = Little, Brown and Co. | location = New York&lt;br /&gt;
&lt;br /&gt;
| 出版商 Little，Brown and co. | 位置: 纽约&lt;br /&gt;
&lt;br /&gt;
| title-link = Blink (book) }}&lt;br /&gt;
&lt;br /&gt;
| title-link = Blink (book) }}&lt;br /&gt;
&lt;br /&gt;
| title-link Blink (book)}&lt;br /&gt;
&lt;br /&gt;
* {{cite conference | ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Gödel |first=Kurt |authorlink=Kurt Gödel |year=1951&lt;br /&gt;
&lt;br /&gt;
| last=Gödel |first=Kurt |authorlink=Kurt Gödel |year=1951&lt;br /&gt;
&lt;br /&gt;
1951年&lt;br /&gt;
&lt;br /&gt;
| title=Some basic theorems on the foundations of mathematics and their implications&lt;br /&gt;
&lt;br /&gt;
| title=Some basic theorems on the foundations of mathematics and their implications&lt;br /&gt;
&lt;br /&gt;
关于数学基础的一些基本定理及其意义&lt;br /&gt;
&lt;br /&gt;
| conference=Gibbs Lecture&lt;br /&gt;
&lt;br /&gt;
| conference=Gibbs Lecture&lt;br /&gt;
&lt;br /&gt;
会议吉布斯讲座&lt;br /&gt;
&lt;br /&gt;
}} In&amp;lt;br /&amp;gt; {{cite book&lt;br /&gt;
&lt;br /&gt;
}} In&amp;lt;br /&amp;gt; {{cite book&lt;br /&gt;
&lt;br /&gt;
}在 br / { cite book&lt;br /&gt;
&lt;br /&gt;
| editor-last=Feferman |editor-first=Solomon |editorlink=Solomon Feferman |year=1995 |pages=304–23&lt;br /&gt;
&lt;br /&gt;
| editor-last=Feferman |editor-first=Solomon |editorlink=Solomon Feferman |year=1995 |pages=304–23&lt;br /&gt;
&lt;br /&gt;
| 编辑-最后费尔曼 | 编辑-第一所罗门 | 编辑链接所罗门费尔曼 | 1995年 | 第304-23页&lt;br /&gt;
&lt;br /&gt;
| title=Kurt Gödel: Collected Works, Vol. III: Unpublished Essays and Lectures&lt;br /&gt;
&lt;br /&gt;
| title=Kurt Gödel: Collected Works, Vol. III: Unpublished Essays and Lectures&lt;br /&gt;
&lt;br /&gt;
库尔特 · 德尔: 作品集，第卷。三: 未发表的文章和讲座&lt;br /&gt;
&lt;br /&gt;
| publisher=Oxford University Press |isbn=978-0-19-514722-3&lt;br /&gt;
&lt;br /&gt;
| publisher=Oxford University Press |isbn=978-0-19-514722-3&lt;br /&gt;
&lt;br /&gt;
牛津大学出版社 | isbn 978-0-19-514722-3&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Haugeland | first=John | author-link = John Haugeland&lt;br /&gt;
&lt;br /&gt;
| last=Haugeland | first=John | author-link = John Haugeland&lt;br /&gt;
&lt;br /&gt;
作者链接: 约翰 · 豪格兰德&lt;br /&gt;
&lt;br /&gt;
| year = 1985&lt;br /&gt;
&lt;br /&gt;
| year = 1985&lt;br /&gt;
&lt;br /&gt;
1985年&lt;br /&gt;
&lt;br /&gt;
| title = Artificial Intelligence: The Very Idea&lt;br /&gt;
&lt;br /&gt;
| title = Artificial Intelligence: The Very Idea&lt;br /&gt;
&lt;br /&gt;
人工智能: 最重要的理念&lt;br /&gt;
&lt;br /&gt;
| publisher=MIT Press| location= Cambridge, Mass.&lt;br /&gt;
&lt;br /&gt;
| publisher=MIT Press| location= Cambridge, Mass.&lt;br /&gt;
&lt;br /&gt;
麻省理工学院出版社 | 位置: 马萨诸塞州剑桥。&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-262-08153-5&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-262-08153-5&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-0-262-08153-5]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Hawkins | first=Jeff | author-link=Jeff Hawkins&lt;br /&gt;
&lt;br /&gt;
| last=Hawkins | first=Jeff | author-link=Jeff Hawkins&lt;br /&gt;
&lt;br /&gt;
作者链接杰夫 · 霍金斯&lt;br /&gt;
&lt;br /&gt;
| last2=Blakeslee | first2=Sandra&lt;br /&gt;
&lt;br /&gt;
| last2=Blakeslee | first2=Sandra&lt;br /&gt;
&lt;br /&gt;
2 Blakeslee | first2 Sandra&lt;br /&gt;
&lt;br /&gt;
| year=2005&lt;br /&gt;
&lt;br /&gt;
| year=2005&lt;br /&gt;
&lt;br /&gt;
2005年&lt;br /&gt;
&lt;br /&gt;
| title=On Intelligence&lt;br /&gt;
&lt;br /&gt;
| title=On Intelligence&lt;br /&gt;
&lt;br /&gt;
关于智力&lt;br /&gt;
&lt;br /&gt;
| publisher=Owl Books | location=New York, NY&lt;br /&gt;
&lt;br /&gt;
| publisher=Owl Books | location=New York, NY&lt;br /&gt;
&lt;br /&gt;
| 出版商 Owl Books | 位置: 纽约，纽约&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-8050-7853-4&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-8050-7853-4&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-0-8050-7853-4]&lt;br /&gt;
&lt;br /&gt;
| title-link=On Intelligence }}&lt;br /&gt;
&lt;br /&gt;
| title-link=On Intelligence }}&lt;br /&gt;
&lt;br /&gt;
| title-link On Intelligence }&lt;br /&gt;
&lt;br /&gt;
* {{cite news |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Henderson |first=Mark |date=24 April 2007&lt;br /&gt;
&lt;br /&gt;
| last=Henderson |first=Mark |date=24 April 2007&lt;br /&gt;
&lt;br /&gt;
2007年4月24日&lt;br /&gt;
&lt;br /&gt;
| title=Human rights for robots? We're getting carried away&lt;br /&gt;
&lt;br /&gt;
| title=Human rights for robots? We're getting carried away&lt;br /&gt;
&lt;br /&gt;
| 题目: 机器人的人权？我们太激动了&lt;br /&gt;
&lt;br /&gt;
| url=http://www.thetimes.co.uk/tto/technology/article1966391.ece&lt;br /&gt;
&lt;br /&gt;
| url=http://www.thetimes.co.uk/tto/technology/article1966391.ece&lt;br /&gt;
&lt;br /&gt;
Http://www.thetimes.co.uk/tto/technology/article1966391.ece&lt;br /&gt;
&lt;br /&gt;
| work=The Times Online | location=London&lt;br /&gt;
&lt;br /&gt;
| work=The Times Online | location=London&lt;br /&gt;
&lt;br /&gt;
纽约时报在线 | 位置: 伦敦&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Hernandez-Orallo |first=Jose |year=2000&lt;br /&gt;
&lt;br /&gt;
| last=Hernandez-Orallo |first=Jose |year=2000&lt;br /&gt;
&lt;br /&gt;
最后赫尔南德斯-奥拉罗 | 第一何塞 | 2000年&lt;br /&gt;
&lt;br /&gt;
| title=Beyond the Turing Test&lt;br /&gt;
&lt;br /&gt;
| title=Beyond the Turing Test&lt;br /&gt;
&lt;br /&gt;
超越图灵测试&lt;br /&gt;
&lt;br /&gt;
| journal=Journal of Logic, Language and Information |volume=9 |issue=4 |pages=447–466&lt;br /&gt;
&lt;br /&gt;
| journal=Journal of Logic, Language and Information |volume=9 |issue=4 |pages=447–466&lt;br /&gt;
&lt;br /&gt;
逻辑、语言与信息杂志 | 第9卷 | 第4期 | 第447-466页&lt;br /&gt;
&lt;br /&gt;
| doi=10.1023/A:1008367325700&lt;br /&gt;
&lt;br /&gt;
| doi=10.1023/A:1008367325700&lt;br /&gt;
&lt;br /&gt;
10.1023 / a: 1008367325700&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=Hernandez-Orallo |first1=J. |last2=Dowe |first2=D. L. |year=2010&lt;br /&gt;
&lt;br /&gt;
| last1=Hernandez-Orallo |first1=J. |last2=Dowe |first2=D. L. |year=2010&lt;br /&gt;
&lt;br /&gt;
| 最后一次赫尔南德斯-奥拉罗 | 初次1 j。2 d.2010年&lt;br /&gt;
&lt;br /&gt;
| title=Measuring Universal Intelligence: Towards an Anytime Intelligence Test&lt;br /&gt;
&lt;br /&gt;
| title=Measuring Universal Intelligence: Towards an Anytime Intelligence Test&lt;br /&gt;
&lt;br /&gt;
测量普遍智力: 走向随时智力测试&lt;br /&gt;
&lt;br /&gt;
| journal=Artificial Intelligence |volume=174 |issue=18 |pages=1508–1539&lt;br /&gt;
&lt;br /&gt;
| journal=Artificial Intelligence |volume=174 |issue=18 |pages=1508–1539&lt;br /&gt;
&lt;br /&gt;
人工智能杂志 | 第174卷 | 第18期 | 第1508-1539页&lt;br /&gt;
&lt;br /&gt;
| doi=10.1016/j.artint.2010.09.006&lt;br /&gt;
&lt;br /&gt;
| doi=10.1016/j.artint.2010.09.006&lt;br /&gt;
&lt;br /&gt;
10.1016 / j.artint. 2010.09.006&lt;br /&gt;
&lt;br /&gt;
|citeseerx=10.1.1.295.9079}}&lt;br /&gt;
&lt;br /&gt;
|citeseerx=10.1.1.295.9079}}&lt;br /&gt;
&lt;br /&gt;
10.1.1.295.9079}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Hinton |first=G. E. |year=2007&lt;br /&gt;
&lt;br /&gt;
| last=Hinton |first=G. E. |year=2007&lt;br /&gt;
&lt;br /&gt;
最后辛顿 | 第一个 g。2007年&lt;br /&gt;
&lt;br /&gt;
| title=Learning multiple layers of representation&lt;br /&gt;
&lt;br /&gt;
| title=Learning multiple layers of representation&lt;br /&gt;
&lt;br /&gt;
学习多层次的表现&lt;br /&gt;
&lt;br /&gt;
| journal=Trends in Cognitive Sciences |volume=11 | issue=10 |pages=428–434 | doi=10.1016/j.tics.2007.09.004&lt;br /&gt;
&lt;br /&gt;
| journal=Trends in Cognitive Sciences |volume=11 | issue=10 |pages=428–434 | doi=10.1016/j.tics.2007.09.004&lt;br /&gt;
&lt;br /&gt;
认知科学趋势 | 第11卷 | 第10期 | 第428-434页 | doi 10.1016 / j.tics. 2007.09.004&lt;br /&gt;
&lt;br /&gt;
| pmid=17921042 }}&lt;br /&gt;
&lt;br /&gt;
| pmid=17921042 }}&lt;br /&gt;
&lt;br /&gt;
17921042}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Hofstadter | first = Douglas | author-link = Douglas Hofstadter&lt;br /&gt;
&lt;br /&gt;
| last=Hofstadter | first = Douglas | author-link = Douglas Hofstadter&lt;br /&gt;
&lt;br /&gt;
侯世达: 2012年3月15日&lt;br /&gt;
&lt;br /&gt;
| year = 1979&lt;br /&gt;
&lt;br /&gt;
| year = 1979&lt;br /&gt;
&lt;br /&gt;
1979年&lt;br /&gt;
&lt;br /&gt;
| title = Gödel, Escher, Bach: an Eternal Golden Braid&lt;br /&gt;
&lt;br /&gt;
| title = Gödel, Escher, Bach: an Eternal Golden Braid&lt;br /&gt;
&lt;br /&gt;
巴赫: 永恒的金色辫子&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-394-74502-2&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-394-74502-2&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-394-74502-2]&lt;br /&gt;
&lt;br /&gt;
| publisher=Vintage Books&lt;br /&gt;
&lt;br /&gt;
| publisher=Vintage Books&lt;br /&gt;
&lt;br /&gt;
出版商 Vintage Books&lt;br /&gt;
&lt;br /&gt;
| location=New York, NY&lt;br /&gt;
&lt;br /&gt;
| location=New York, NY&lt;br /&gt;
&lt;br /&gt;
纽约，纽约&lt;br /&gt;
&lt;br /&gt;
| title-link=Gödel, Escher, Bach }}&lt;br /&gt;
&lt;br /&gt;
| title-link=Gödel, Escher, Bach }}&lt;br /&gt;
&lt;br /&gt;
| title-link=Gödel, Escher, Bach }}&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
|last=Holland&lt;br /&gt;
&lt;br /&gt;
|last=Holland&lt;br /&gt;
&lt;br /&gt;
去年荷兰&lt;br /&gt;
&lt;br /&gt;
|first=John H.&lt;br /&gt;
&lt;br /&gt;
|first=John H.&lt;br /&gt;
&lt;br /&gt;
首先是约翰 · h。&lt;br /&gt;
&lt;br /&gt;
|year=1975&lt;br /&gt;
&lt;br /&gt;
|year=1975&lt;br /&gt;
&lt;br /&gt;
1975年&lt;br /&gt;
&lt;br /&gt;
|title=Adaptation in Natural and Artificial Systems&lt;br /&gt;
&lt;br /&gt;
|title=Adaptation in Natural and Artificial Systems&lt;br /&gt;
&lt;br /&gt;
自然和人工系统中的适应&lt;br /&gt;
&lt;br /&gt;
|publisher=University of Michigan Press&lt;br /&gt;
&lt;br /&gt;
|publisher=University of Michigan Press&lt;br /&gt;
&lt;br /&gt;
出版商密西根大学出版社&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-262-58111-0&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-262-58111-0&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-0-262-58111-0]&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/adaptationinnatu00holl&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/adaptationinnatu00holl&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/adaptationinnatu00holl&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| first = J. | last = Howe&lt;br /&gt;
&lt;br /&gt;
| first = J. | last = Howe&lt;br /&gt;
&lt;br /&gt;
首先是 j。最后豪&lt;br /&gt;
&lt;br /&gt;
| date = November 1994&lt;br /&gt;
&lt;br /&gt;
| date = November 1994&lt;br /&gt;
&lt;br /&gt;
1994年11月&lt;br /&gt;
&lt;br /&gt;
| title = Artificial Intelligence at Edinburgh University: a Perspective&lt;br /&gt;
&lt;br /&gt;
| title = Artificial Intelligence at Edinburgh University: a Perspective&lt;br /&gt;
&lt;br /&gt;
爱丁堡大学的人工智能: 一个远景&lt;br /&gt;
&lt;br /&gt;
| url=http://www.inf.ed.ac.uk/about/AIhistory.html | accessdate=30 August 2007&lt;br /&gt;
&lt;br /&gt;
| url=http://www.inf.ed.ac.uk/about/AIhistory.html | accessdate=30 August 2007&lt;br /&gt;
&lt;br /&gt;
Http://www.inf.ed.ac.uk/about/aihistory.html  : 2007年8月30日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Hutter |first=M. |year=2012&lt;br /&gt;
&lt;br /&gt;
| last=Hutter |first=M. |year=2012&lt;br /&gt;
&lt;br /&gt;
| 最后的哈特 | 第一个 m。2012年&lt;br /&gt;
&lt;br /&gt;
| title=Theoretical Foundations of Artificial General Intelligence&lt;br /&gt;
&lt;br /&gt;
| title=Theoretical Foundations of Artificial General Intelligence&lt;br /&gt;
&lt;br /&gt;
人工智能的理论基础&lt;br /&gt;
&lt;br /&gt;
| chapter=One Decade of Universal Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
| chapter=One Decade of Universal Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
通用人工智能的十年&lt;br /&gt;
&lt;br /&gt;
| volume=4 | pages=67–88 |series=Atlantis Thinking Machines&lt;br /&gt;
&lt;br /&gt;
| volume=4 | pages=67–88 |series=Atlantis Thinking Machines&lt;br /&gt;
&lt;br /&gt;
| 第4卷 | 第67-88页 | 亚特兰蒂斯思考机器系列&lt;br /&gt;
&lt;br /&gt;
| doi=10.2991/978-94-91216-62-6_5 |isbn=978-94-91216-61-9&lt;br /&gt;
&lt;br /&gt;
| doi=10.2991/978-94-91216-62-6_5 |isbn=978-94-91216-61-9&lt;br /&gt;
&lt;br /&gt;
10.2991 / 978-94-91216-62-65 | isbn 978-94-91216-61-9&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.228.8725 }}&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.228.8725 }}&lt;br /&gt;
&lt;br /&gt;
10.1.1.228.8725}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
!-* { cite journal | ref harv&lt;br /&gt;
&lt;br /&gt;
| last=James |first=William |year=1884&lt;br /&gt;
&lt;br /&gt;
| last=James |first=William |year=1884&lt;br /&gt;
&lt;br /&gt;
1884年&lt;br /&gt;
&lt;br /&gt;
| title=What is Emotion&lt;br /&gt;
&lt;br /&gt;
| title=What is Emotion&lt;br /&gt;
&lt;br /&gt;
什么是情感&lt;br /&gt;
&lt;br /&gt;
| journal=Mind |volume=9 | issue=34 |pages=188–205 |doi=10.1093/mind/os-IX.34.188&lt;br /&gt;
&lt;br /&gt;
| journal=Mind |volume=9 | issue=34 |pages=188–205 |doi=10.1093/mind/os-IX.34.188&lt;br /&gt;
&lt;br /&gt;
心灵日志 | 第9卷 | 第34期 | 第188-205页 | doi 10.1093 / Mind / os-ix. 34.188&lt;br /&gt;
&lt;br /&gt;
}} Cited by {{harvnb|Tao|Tan|2005}}.&lt;br /&gt;
&lt;br /&gt;
}} Cited by .&lt;br /&gt;
&lt;br /&gt;
引用。&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
-- * { cite book | ref harv&lt;br /&gt;
&lt;br /&gt;
| last=Kahneman | first=Daniel | author-link=Daniel Kahneman&lt;br /&gt;
&lt;br /&gt;
| last=Kahneman | first=Daniel | author-link=Daniel Kahneman&lt;br /&gt;
&lt;br /&gt;
作者: 丹尼尔 · 卡尼曼&lt;br /&gt;
&lt;br /&gt;
| last2=Slovic | first2= D.&lt;br /&gt;
&lt;br /&gt;
| last2=Slovic | first2= D.&lt;br /&gt;
&lt;br /&gt;
2 | Slovic | first2 d.&lt;br /&gt;
&lt;br /&gt;
| last3=Tversky | first3=Amos | author3-link=Amos Tversky&lt;br /&gt;
&lt;br /&gt;
| last3=Tversky | first3=Amos | author3-link=Amos Tversky&lt;br /&gt;
&lt;br /&gt;
| last 3 Tversky | first3 Amos | author3-link Amos Tversky&lt;br /&gt;
&lt;br /&gt;
| year=1982&lt;br /&gt;
&lt;br /&gt;
| year=1982&lt;br /&gt;
&lt;br /&gt;
1982年&lt;br /&gt;
&lt;br /&gt;
| title=Judgment under uncertainty: Heuristics and biases&lt;br /&gt;
&lt;br /&gt;
| title=Judgment under uncertainty: Heuristics and biases&lt;br /&gt;
&lt;br /&gt;
不确定条件下的判断: 启发式和偏见&lt;br /&gt;
&lt;br /&gt;
| journal=Science | volume=185 | issue=4157 | pages=1124–31 | publisher=Cambridge University Press | location=New York&lt;br /&gt;
&lt;br /&gt;
| journal=Science | volume=185 | issue=4157 | pages=1124–31 | publisher=Cambridge University Press | location=New York&lt;br /&gt;
&lt;br /&gt;
科学杂志 | 第185卷 | 第4157期 | 第1124-31页 | 出版商剑桥大学出版社 | 位置纽约&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-521-28414-1&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-521-28414-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-521-28414-1]&lt;br /&gt;
&lt;br /&gt;
| pmid=17835457 | doi=10.1126/science.185.4157.1124 }}&lt;br /&gt;
&lt;br /&gt;
| pmid=17835457 | doi=10.1126/science.185.4157.1124 }}&lt;br /&gt;
&lt;br /&gt;
10.1126 / science. 185.4157.1124}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Kaplan |first=Andreas&lt;br /&gt;
&lt;br /&gt;
| last=Kaplan |first=Andreas&lt;br /&gt;
&lt;br /&gt;
最后的卡普兰 | 第一安德烈亚斯&lt;br /&gt;
&lt;br /&gt;
| last2=Haenlein | first2= Michael&lt;br /&gt;
&lt;br /&gt;
| last2=Haenlein | first2= Michael&lt;br /&gt;
&lt;br /&gt;
最后2个 Haenlein 最初2个 Michael&lt;br /&gt;
&lt;br /&gt;
| title=Siri, Siri in my Hand, who's the Fairest in the Land? On the Interpretations, Illustrations and Implications of Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
| title=Siri, Siri in my Hand, who's the Fairest in the Land? On the Interpretations, Illustrations and Implications of Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
谁是世界上最美丽的女人？论人工智能的解释、实例及其意义&lt;br /&gt;
&lt;br /&gt;
| journal=Business Horizons | volume=62 | pages=15–25 | doi=10.1016/j.bushor.2018.08.004 | year=2019 }}&lt;br /&gt;
&lt;br /&gt;
| journal=Business Horizons | volume=62 | pages=15–25 | doi=10.1016/j.bushor.2018.08.004 | year=2019 }}&lt;br /&gt;
&lt;br /&gt;
商业视野杂志 | 第62卷 | 第15-25页 | doi 10.1016 / j.bushor. 2018.08.004 | year 2019}&lt;br /&gt;
&lt;br /&gt;
* {{cite magazine |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Katz |first=Yarden |date=1 November 2012&lt;br /&gt;
&lt;br /&gt;
| last=Katz |first=Yarden |date=1 November 2012&lt;br /&gt;
&lt;br /&gt;
2012年11月1日&lt;br /&gt;
&lt;br /&gt;
| title=Noam Chomsky on Where Artificial Intelligence Went Wrong&lt;br /&gt;
&lt;br /&gt;
| title=Noam Chomsky on Where Artificial Intelligence Went Wrong&lt;br /&gt;
&lt;br /&gt;
诺姆 · 乔姆斯基: 人工智能哪里出了问题&lt;br /&gt;
&lt;br /&gt;
| magazine=The Atlantic&lt;br /&gt;
&lt;br /&gt;
| magazine=The Atlantic&lt;br /&gt;
&lt;br /&gt;
美国《大西洋月刊》&lt;br /&gt;
&lt;br /&gt;
| url=https://www.theatlantic.com/technology/archive/2012/11/noam-chomsky-on-where-artificial-intelligence-went-wrong/261637/?single_page=true |accessdate=26 October 2014&lt;br /&gt;
&lt;br /&gt;
| url=https://www.theatlantic.com/technology/archive/2012/11/noam-chomsky-on-where-artificial-intelligence-went-wrong/261637/?single_page=true |accessdate=26 October 2014&lt;br /&gt;
&lt;br /&gt;
Https://www.theatlantic.com/technology/archive/2012/11/noam-chomsky-on-where-artificial-intelligence-went-wrong/261637/?single_page=true  : 2014年10月26日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web |ref={{harvid|''Kismet''}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| title=Kismet&lt;br /&gt;
&lt;br /&gt;
| title=Kismet&lt;br /&gt;
&lt;br /&gt;
命运&lt;br /&gt;
&lt;br /&gt;
| publisher=MIT Artificial Intelligence Laboratory, Humanoid Robotics Group&lt;br /&gt;
&lt;br /&gt;
| publisher=MIT Artificial Intelligence Laboratory, Humanoid Robotics Group&lt;br /&gt;
&lt;br /&gt;
麻省理工学院人工智能实验室，人形机器人集团&lt;br /&gt;
&lt;br /&gt;
| url=http://www.ai.mit.edu/projects/humanoid-robotics-group/kismet/kismet.html |accessdate=25 October 2014&lt;br /&gt;
&lt;br /&gt;
| url=http://www.ai.mit.edu/projects/humanoid-robotics-group/kismet/kismet.html |accessdate=25 October 2014&lt;br /&gt;
&lt;br /&gt;
Http://www.ai.mit.edu/projects/humanoid-robotics-group/kismet/kismet.html  : 2014年10月25日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Koza |first=John R. |year=1992&lt;br /&gt;
&lt;br /&gt;
| last=Koza |first=John R. |year=1992&lt;br /&gt;
&lt;br /&gt;
1992年，约翰 · r&lt;br /&gt;
&lt;br /&gt;
| title=Genetic Programming (On the Programming of Computers by Means of Natural Selection)&lt;br /&gt;
&lt;br /&gt;
| title=Genetic Programming (On the Programming of Computers by Means of Natural Selection)&lt;br /&gt;
&lt;br /&gt;
遗传程序设计(论计算机通过自然选择的程序设计)&lt;br /&gt;
&lt;br /&gt;
| publisher=MIT Press |isbn=978-0-262-11170-6&lt;br /&gt;
&lt;br /&gt;
| publisher=MIT Press |isbn=978-0-262-11170-6&lt;br /&gt;
&lt;br /&gt;
| 出版商麻省理工学院出版社 | isbn 978-0-262-11170-6&lt;br /&gt;
&lt;br /&gt;
| bibcode=1992gppc.book.....K }}&lt;br /&gt;
&lt;br /&gt;
| bibcode=1992gppc.book.....K }}&lt;br /&gt;
&lt;br /&gt;
1992gppc. book... k }&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* {{cite web |ref=harv&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* {{cite web |ref=harv&lt;br /&gt;
&lt;br /&gt;
!-* { cite web | ref harv&lt;br /&gt;
&lt;br /&gt;
| last=Kleine-Cosack |first=Christian |date=October 2006 |format=PDF&lt;br /&gt;
&lt;br /&gt;
| last=Kleine-Cosack |first=Christian |date=October 2006 |format=PDF&lt;br /&gt;
&lt;br /&gt;
最后克莱恩-科萨克 | 第一个基督徒 | 2006年10月 | 格式 PDF&lt;br /&gt;
&lt;br /&gt;
| title= Recognition and Simulation of Emotions&lt;br /&gt;
&lt;br /&gt;
| title= Recognition and Simulation of Emotions&lt;br /&gt;
&lt;br /&gt;
标题识别和情感模拟&lt;br /&gt;
&lt;br /&gt;
| url= http://ls12-www.cs.tu-dortmund.de//~fink/lectures/SS06/human-robot-interaction/Emotion-RecognitionAndSimulation.pdf&lt;br /&gt;
&lt;br /&gt;
| url= http://ls12-www.cs.tu-dortmund.de//~fink/lectures/SS06/human-robot-interaction/Emotion-RecognitionAndSimulation.pdf&lt;br /&gt;
&lt;br /&gt;
Http://ls12-www.cs.tu-dortmund.de//~fink/lectures/ss06/human-robot-interaction/emotion-recognitionandsimulation.pdf&lt;br /&gt;
&lt;br /&gt;
| archiveurl=https://web.archive.org/web/20080528135730/http://ls12-www.cs.tu-dortmund.de/~fink/lectures/SS06/human-robot-interaction/Emotion-RecognitionAndSimulation.pdf |archivedate=28 May 2008&lt;br /&gt;
&lt;br /&gt;
| archiveurl=https://web.archive.org/web/20080528135730/http://ls12-www.cs.tu-dortmund.de/~fink/lectures/SS06/human-robot-interaction/Emotion-RecognitionAndSimulation.pdf |archivedate=28 May 2008&lt;br /&gt;
&lt;br /&gt;
2008年5月28日 https://web.archive.org/web/20080528135730/http://ls12-www.cs.tu-dortmund.de/~fink/lectures/ss06/human-robot-interaction/emotion-recognitionandsimulation.pdf&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;* {{Cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;* {{Cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
-- * { Cite journal | ref harv&lt;br /&gt;
&lt;br /&gt;
| first = G. | last=Kolata&lt;br /&gt;
&lt;br /&gt;
| first = G. | last=Kolata&lt;br /&gt;
&lt;br /&gt;
| 第一个 g | 最后一个 Kolata&lt;br /&gt;
&lt;br /&gt;
| year=1982&lt;br /&gt;
&lt;br /&gt;
| year=1982&lt;br /&gt;
&lt;br /&gt;
1982年&lt;br /&gt;
&lt;br /&gt;
| title=How can computers get common sense?&lt;br /&gt;
&lt;br /&gt;
| title=How can computers get common sense?&lt;br /&gt;
&lt;br /&gt;
| 题目计算机如何获得常识？&lt;br /&gt;
&lt;br /&gt;
| journal=Science | issue= 4566| pages=1237–1238&lt;br /&gt;
&lt;br /&gt;
| journal=Science | issue= 4566| pages=1237–1238&lt;br /&gt;
&lt;br /&gt;
科学杂志 | 第4566期 | 第1237-1238页&lt;br /&gt;
&lt;br /&gt;
| doi = 10.1126/science.217.4566.1237&lt;br /&gt;
&lt;br /&gt;
| doi = 10.1126/science.217.4566.1237&lt;br /&gt;
&lt;br /&gt;
10.1126 / science. 217.4566.1237&lt;br /&gt;
&lt;br /&gt;
| volume = 217 |pmid=17837639&lt;br /&gt;
&lt;br /&gt;
| volume = 217 |pmid=17837639&lt;br /&gt;
&lt;br /&gt;
217 | pmid 17837639&lt;br /&gt;
&lt;br /&gt;
| bibcode=1982Sci...217.1237K}}&lt;br /&gt;
&lt;br /&gt;
| bibcode=1982Sci...217.1237K}}&lt;br /&gt;
&lt;br /&gt;
1982Sci... 217.1237 k }&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=Kumar | first1=Gulshan&lt;br /&gt;
&lt;br /&gt;
| last1=Kumar | first1=Gulshan&lt;br /&gt;
&lt;br /&gt;
| last1=Kumar | first1=Gulshan&lt;br /&gt;
&lt;br /&gt;
| last2=Kumar | first2=Krishan&lt;br /&gt;
&lt;br /&gt;
| last2=Kumar | first2=Krishan&lt;br /&gt;
&lt;br /&gt;
2 Kumar | first2 Krishan&lt;br /&gt;
&lt;br /&gt;
| title=The Use of Artificial-Intelligence-Based Ensembles for Intrusion Detection: A Review&lt;br /&gt;
&lt;br /&gt;
| title=The Use of Artificial-Intelligence-Based Ensembles for Intrusion Detection: A Review&lt;br /&gt;
&lt;br /&gt;
| 题目: 基于人工智能的集成在入侵检测中的应用: 综述&lt;br /&gt;
&lt;br /&gt;
| journal=Applied Computational Intelligence and Soft Computing&lt;br /&gt;
&lt;br /&gt;
| journal=Applied Computational Intelligence and Soft Computing&lt;br /&gt;
&lt;br /&gt;
应用计算智能和软计算&lt;br /&gt;
&lt;br /&gt;
| year=2012&lt;br /&gt;
&lt;br /&gt;
| year=2012&lt;br /&gt;
&lt;br /&gt;
2012年&lt;br /&gt;
&lt;br /&gt;
| volume=2012&lt;br /&gt;
&lt;br /&gt;
| volume=2012&lt;br /&gt;
&lt;br /&gt;
2012年&lt;br /&gt;
&lt;br /&gt;
| pages=1–20&lt;br /&gt;
&lt;br /&gt;
| pages=1–20&lt;br /&gt;
&lt;br /&gt;
第1-20页&lt;br /&gt;
&lt;br /&gt;
| doi=10.1155/2012/850160&lt;br /&gt;
&lt;br /&gt;
| doi=10.1155/2012/850160&lt;br /&gt;
&lt;br /&gt;
10.1155 / 2012 / 850160&lt;br /&gt;
&lt;br /&gt;
| doi-access=free&lt;br /&gt;
&lt;br /&gt;
| doi-access=free&lt;br /&gt;
&lt;br /&gt;
免费访问&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Kurzweil | first=Ray | author-link=Ray Kurzweil&lt;br /&gt;
&lt;br /&gt;
| last=Kurzweil | first=Ray | author-link=Ray Kurzweil&lt;br /&gt;
&lt;br /&gt;
最后一个库兹韦尔 | 第一个雷 | 作者链接雷 · 库兹韦尔&lt;br /&gt;
&lt;br /&gt;
| year=1999&lt;br /&gt;
&lt;br /&gt;
| year=1999&lt;br /&gt;
&lt;br /&gt;
1999年&lt;br /&gt;
&lt;br /&gt;
| title=The Age of Spiritual Machines&lt;br /&gt;
&lt;br /&gt;
| title=The Age of Spiritual Machines&lt;br /&gt;
&lt;br /&gt;
精神机器时代&lt;br /&gt;
&lt;br /&gt;
| publisher=Penguin Books&lt;br /&gt;
&lt;br /&gt;
| publisher=Penguin Books&lt;br /&gt;
&lt;br /&gt;
企鹅出版社&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-670-88217-5&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-670-88217-5&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-670-88217-5]&lt;br /&gt;
&lt;br /&gt;
| title-link=The Age of Spiritual Machines }}&lt;br /&gt;
&lt;br /&gt;
| title-link=The Age of Spiritual Machines }}&lt;br /&gt;
&lt;br /&gt;
| title-link The Age of Spiritual Machines }&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Kurzweil | first=Ray | author-link=Ray Kurzweil&lt;br /&gt;
&lt;br /&gt;
| last=Kurzweil | first=Ray | author-link=Ray Kurzweil&lt;br /&gt;
&lt;br /&gt;
最后一个库兹韦尔 | 第一个雷 | 作者链接雷 · 库兹韦尔&lt;br /&gt;
&lt;br /&gt;
| year=2005&lt;br /&gt;
&lt;br /&gt;
| year=2005&lt;br /&gt;
&lt;br /&gt;
2005年&lt;br /&gt;
&lt;br /&gt;
| title=The Singularity is Near&lt;br /&gt;
&lt;br /&gt;
| title=The Singularity is Near&lt;br /&gt;
&lt;br /&gt;
标题奇点迫近&lt;br /&gt;
&lt;br /&gt;
| publisher=Penguin Books&lt;br /&gt;
&lt;br /&gt;
| publisher=Penguin Books&lt;br /&gt;
&lt;br /&gt;
企鹅出版社&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-670-03384-3&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-670-03384-3&lt;br /&gt;
&lt;br /&gt;
| isbn 978-0-670-03384-3&lt;br /&gt;
&lt;br /&gt;
| title-link=The Singularity is Near }}&lt;br /&gt;
&lt;br /&gt;
| title-link=The Singularity is Near }}&lt;br /&gt;
&lt;br /&gt;
| title-link 奇点迫近}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Lakoff | first=George | author-link=George Lakoff&lt;br /&gt;
&lt;br /&gt;
| last=Lakoff | first=George | author-link=George Lakoff&lt;br /&gt;
&lt;br /&gt;
最后拉考夫 | 第一个乔治 | 作者链接乔治拉考夫&lt;br /&gt;
&lt;br /&gt;
| last2=Núñez | first2=Rafael E. | author2-link=Rafael E. Núñez| year=2000&lt;br /&gt;
&lt;br /&gt;
| last2=Núñez | first2=Rafael E. | author2-link=Rafael E. Núñez| year=2000&lt;br /&gt;
&lt;br /&gt;
2000年2月2日 | 最后2秒 | 第一2个 Rafael e. | 作者2-link Rafael e. n E. | 2000年&lt;br /&gt;
&lt;br /&gt;
| title=Where Mathematics Comes From: How the Embodied Mind Brings Mathematics into Being&lt;br /&gt;
&lt;br /&gt;
| title=Where Mathematics Comes From: How the Embodied Mind Brings Mathematics into Being&lt;br /&gt;
&lt;br /&gt;
数学从何而来: 具身思维如何使数学成为现实&lt;br /&gt;
&lt;br /&gt;
| publisher=Basic Books&lt;br /&gt;
&lt;br /&gt;
| publisher=Basic Books&lt;br /&gt;
&lt;br /&gt;
| 出版商 Basic Books&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-465-03771-1&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-465-03771-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-0-465-03771-1]&lt;br /&gt;
&lt;br /&gt;
| title-link=Where Mathematics Comes From }}&lt;br /&gt;
&lt;br /&gt;
| title-link=Where Mathematics Comes From }}&lt;br /&gt;
&lt;br /&gt;
| title-link Where Mathematics Comes From }&lt;br /&gt;
&lt;br /&gt;
* {{Cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=Langley |first1=Pat |year=2011&lt;br /&gt;
&lt;br /&gt;
| last1=Langley |first1=Pat |year=2011&lt;br /&gt;
&lt;br /&gt;
2011年1月1日&lt;br /&gt;
&lt;br /&gt;
| title=The changing science of machine learning&lt;br /&gt;
&lt;br /&gt;
| title=The changing science of machine learning&lt;br /&gt;
&lt;br /&gt;
不断变化的机器学习科学&lt;br /&gt;
&lt;br /&gt;
| journal=[[Machine Learning (journal)|Machine Learning]]&lt;br /&gt;
&lt;br /&gt;
| journal=Machine Learning&lt;br /&gt;
&lt;br /&gt;
机器学习》杂志&lt;br /&gt;
&lt;br /&gt;
| volume=82 |issue=3 |pages=275–279&lt;br /&gt;
&lt;br /&gt;
| volume=82 |issue=3 |pages=275–279&lt;br /&gt;
&lt;br /&gt;
第82卷，第3期，第275-279页&lt;br /&gt;
&lt;br /&gt;
| doi=10.1007/s10994-011-5242-y&lt;br /&gt;
&lt;br /&gt;
| doi=10.1007/s10994-011-5242-y&lt;br /&gt;
&lt;br /&gt;
10.1007 / s10994-011-5242-y&lt;br /&gt;
&lt;br /&gt;
|doi-access=free&lt;br /&gt;
&lt;br /&gt;
|doi-access=free&lt;br /&gt;
&lt;br /&gt;
免费访问&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite techreport |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Law |first=Diane |date=June 1994&lt;br /&gt;
&lt;br /&gt;
| last=Law |first=Diane |date=June 1994&lt;br /&gt;
&lt;br /&gt;
最后的法律 | 第一个黛安 | 日期1994年6月&lt;br /&gt;
&lt;br /&gt;
| title=Searle, Subsymbolic Functionalism and Synthetic Intelligence&lt;br /&gt;
&lt;br /&gt;
| title=Searle, Subsymbolic Functionalism and Synthetic Intelligence&lt;br /&gt;
&lt;br /&gt;
塞尔，次符号功能主义和综合智能&lt;br /&gt;
&lt;br /&gt;
| institution=University of Texas at Austin |page=AI94-222&lt;br /&gt;
&lt;br /&gt;
| institution=University of Texas at Austin |page=AI94-222&lt;br /&gt;
&lt;br /&gt;
机构德克萨斯州大学奥斯汀分校 | 第 AI94-222页&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.38.8384&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.38.8384&lt;br /&gt;
&lt;br /&gt;
10.1.1.38.8384&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite techreport |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=Legg |first1=Shane |last2=Hutter |first2=Marcus |date=15 June 2007&lt;br /&gt;
&lt;br /&gt;
| last1=Legg |first1=Shane |last2=Hutter |first2=Marcus |date=15 June 2007&lt;br /&gt;
&lt;br /&gt;
2007年6月15日&lt;br /&gt;
&lt;br /&gt;
| title=A Collection of Definitions of Intelligence&lt;br /&gt;
&lt;br /&gt;
| title=A Collection of Definitions of Intelligence&lt;br /&gt;
&lt;br /&gt;
文章标题: 智慧的定义集&lt;br /&gt;
&lt;br /&gt;
| institution=[[IDSIA]] |number=07-07 |arxiv=0706.3639&lt;br /&gt;
&lt;br /&gt;
| institution=IDSIA |number=07-07 |arxiv=0706.3639&lt;br /&gt;
&lt;br /&gt;
机构 IDSIA | 07-07 | arxiv 0706.3639&lt;br /&gt;
&lt;br /&gt;
|bibcode=2007arXiv0706.3639L}}&lt;br /&gt;
&lt;br /&gt;
|bibcode=2007arXiv0706.3639L}}&lt;br /&gt;
&lt;br /&gt;
|bibcode=2007arXiv0706.3639L}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Lenat | first=Douglas | author-link=Douglas Lenat&lt;br /&gt;
&lt;br /&gt;
| last=Lenat | first=Douglas | author-link=Douglas Lenat&lt;br /&gt;
&lt;br /&gt;
作者链接道格拉斯 · 莱纳特&lt;br /&gt;
&lt;br /&gt;
| last2=Guha | first2=R. V.&lt;br /&gt;
&lt;br /&gt;
| last2=Guha | first2=R. V.&lt;br /&gt;
&lt;br /&gt;
2 Guha | first2 r.五。&lt;br /&gt;
&lt;br /&gt;
| year = 1989&lt;br /&gt;
&lt;br /&gt;
| year = 1989&lt;br /&gt;
&lt;br /&gt;
1989年&lt;br /&gt;
&lt;br /&gt;
| title = Building Large Knowledge-Based Systems&lt;br /&gt;
&lt;br /&gt;
| title = Building Large Knowledge-Based Systems&lt;br /&gt;
&lt;br /&gt;
建造大型知识推理系统&lt;br /&gt;
&lt;br /&gt;
| publisher = Addison-Wesley&lt;br /&gt;
&lt;br /&gt;
| publisher = Addison-Wesley&lt;br /&gt;
&lt;br /&gt;
出版商 Addison-Wesley&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-201-51752-1&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-201-51752-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-201-51752-1]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{Cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Lighthill |first=James |author-link=James Lighthill |year=1973&lt;br /&gt;
&lt;br /&gt;
| last=Lighthill |first=James |author-link=James Lighthill |year=1973&lt;br /&gt;
&lt;br /&gt;
作者链接: 詹姆斯 · 莱特希尔1973年&lt;br /&gt;
&lt;br /&gt;
| contribution= Artificial Intelligence: A General Survey&lt;br /&gt;
&lt;br /&gt;
| contribution= Artificial Intelligence: A General Survey&lt;br /&gt;
&lt;br /&gt;
人工智能: 一般调查&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence: a paper symposium&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence: a paper symposium&lt;br /&gt;
&lt;br /&gt;
人工智能: 论文研讨会&lt;br /&gt;
&lt;br /&gt;
| publisher=Science Research Council&lt;br /&gt;
&lt;br /&gt;
| publisher=Science Research Council&lt;br /&gt;
&lt;br /&gt;
科学研究委员会&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Lucas | first= John | author-link = John Lucas (philosopher)&lt;br /&gt;
&lt;br /&gt;
| last=Lucas | first= John | author-link = John Lucas (philosopher)&lt;br /&gt;
&lt;br /&gt;
约翰 · 卢卡斯(哲学家)&lt;br /&gt;
&lt;br /&gt;
| year = 1961&lt;br /&gt;
&lt;br /&gt;
| year = 1961&lt;br /&gt;
&lt;br /&gt;
1961年&lt;br /&gt;
&lt;br /&gt;
| contribution=Minds, Machines and Gödel&lt;br /&gt;
&lt;br /&gt;
| contribution=Minds, Machines and Gödel&lt;br /&gt;
&lt;br /&gt;
投稿: 思想，机器和 g del&lt;br /&gt;
&lt;br /&gt;
| editor-last = Anderson | editor-first =A.R.&lt;br /&gt;
&lt;br /&gt;
| editor-last = Anderson | editor-first =A.R.&lt;br /&gt;
&lt;br /&gt;
| 编辑-最后一个安德森 | 编辑-第一个 a.r。&lt;br /&gt;
&lt;br /&gt;
| title=Minds and Machines&lt;br /&gt;
&lt;br /&gt;
| title=Minds and Machines&lt;br /&gt;
&lt;br /&gt;
文章标题: 思想与机器&lt;br /&gt;
&lt;br /&gt;
| url = http://users.ox.ac.uk/~jrlucas/Godel/mmg.html | accessdate=30 August 2007&lt;br /&gt;
&lt;br /&gt;
| url = http://users.ox.ac.uk/~jrlucas/Godel/mmg.html | accessdate=30 August 2007&lt;br /&gt;
&lt;br /&gt;
Http://users.ox.ac.uk/~jrlucas/godel/mmg.html  : 2007年8月30日&lt;br /&gt;
&lt;br /&gt;
| archiveurl= https://web.archive.org/web/20070819165214/http://users.ox.ac.uk/~jrlucas/Godel/mmg.html| archivedate= 19 August 2007 | url-status=live&lt;br /&gt;
&lt;br /&gt;
| archiveurl= https://web.archive.org/web/20070819165214/http://users.ox.ac.uk/~jrlucas/Godel/mmg.html| archivedate= 19 August 2007 | url-status=live&lt;br /&gt;
&lt;br /&gt;
Https://web.archive.org/web/20070819165214/http://users.ox.ac.uk/~jrlucas/godel/mmg.html| 2007年8月19日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=Lungarella |first1=M. |last2=Metta |first2=G. |last3=Pfeifer |first3=R. |last4=Sandini |first4=G. |year=2003&lt;br /&gt;
&lt;br /&gt;
| last1=Lungarella |first1=M. |last2=Metta |first2=G. |last3=Pfeifer |first3=R. |last4=Sandini |first4=G. |year=2003&lt;br /&gt;
&lt;br /&gt;
1 | Lungarella | first1 m.2 Metta | first2 g.3 Pfeifer | first3 r.最后4个 Sandini 最初4个 g。2003年&lt;br /&gt;
&lt;br /&gt;
| title=Developmental robotics: a survey&lt;br /&gt;
&lt;br /&gt;
| title=Developmental robotics: a survey&lt;br /&gt;
&lt;br /&gt;
发展机器人学: 一项调查&lt;br /&gt;
&lt;br /&gt;
| journal=Connection Science |volume=15 | issue=4 |pages=151–190 |citeseerx=10.1.1.83.7615 | doi=10.1080/09540090310001655110&lt;br /&gt;
&lt;br /&gt;
| journal=Connection Science |volume=15 | issue=4 |pages=151–190 |citeseerx=10.1.1.83.7615 | doi=10.1080/09540090310001655110&lt;br /&gt;
&lt;br /&gt;
15 | issue 4 | pages 151-190 | citeserx 10.1.1.83.7615 | doi 10.1080 / 09540090310001655110&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
 |last=Maker&lt;br /&gt;
&lt;br /&gt;
 |last=Maker&lt;br /&gt;
&lt;br /&gt;
最后一个制造者&lt;br /&gt;
&lt;br /&gt;
 |first=Meg Houston&lt;br /&gt;
&lt;br /&gt;
 |first=Meg Houston&lt;br /&gt;
&lt;br /&gt;
首先是梅格 · 休斯顿&lt;br /&gt;
&lt;br /&gt;
 |year=2006&lt;br /&gt;
&lt;br /&gt;
 |year=2006&lt;br /&gt;
&lt;br /&gt;
2006年&lt;br /&gt;
&lt;br /&gt;
 |title=AI@50: AI Past, Present, Future&lt;br /&gt;
&lt;br /&gt;
 |title=AI@50: AI Past, Present, Future&lt;br /&gt;
&lt;br /&gt;
50: AI 过去，现在，未来&lt;br /&gt;
&lt;br /&gt;
 |location=Dartmouth College&lt;br /&gt;
&lt;br /&gt;
 |location=Dartmouth College&lt;br /&gt;
&lt;br /&gt;
| 位置达特茅斯学院&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html&lt;br /&gt;
&lt;br /&gt;
Http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html&lt;br /&gt;
&lt;br /&gt;
 |archive-url=https://web.archive.org/web/20070103222615/http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html&lt;br /&gt;
&lt;br /&gt;
 |archive-url=https://web.archive.org/web/20070103222615/http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html&lt;br /&gt;
&lt;br /&gt;
| 档案-网址 https://web.archive.org/web/20070103222615/http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
状态死机&lt;br /&gt;
&lt;br /&gt;
 |archive-date=3 January 2007&lt;br /&gt;
&lt;br /&gt;
 |archive-date=3 January 2007&lt;br /&gt;
&lt;br /&gt;
| 档案-日期2007年1月3日&lt;br /&gt;
&lt;br /&gt;
 |accessdate=16 October 2008&lt;br /&gt;
&lt;br /&gt;
 |accessdate=16 October 2008&lt;br /&gt;
&lt;br /&gt;
2008年10月16日&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
我不会让你失望的&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite news |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Markoff |first=John | date=16 February 2011&amp;lt;!-- corrected 24 February 2011--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
| last=Markoff |first=John | date=16 February 2011&amp;lt;!-- corrected 24 February 2011--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2011年2月16日修正2011年2月24日&lt;br /&gt;
&lt;br /&gt;
| title=Computer Wins on 'Jeopardy!': Trivial, It's Not |work=The New York Times&lt;br /&gt;
&lt;br /&gt;
| title=Computer Wins on 'Jeopardy!': Trivial, It's Not |work=The New York Times&lt;br /&gt;
&lt;br /&gt;
电脑赢得“危险边缘” ！《纽约时报》 : 微不足道，这不是工作&lt;br /&gt;
&lt;br /&gt;
| url=https://www.nytimes.com/2011/02/17/science/17jeopardy-watson.html |accessdate=25 October 2014&lt;br /&gt;
&lt;br /&gt;
| url=https://www.nytimes.com/2011/02/17/science/17jeopardy-watson.html |accessdate=25 October 2014&lt;br /&gt;
&lt;br /&gt;
Https://www.nytimes.com/2011/02/17/science/17jeopardy-watson.html  : 2014年10月25日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web | ref = harv | last1 = McCarthy | first1 = John | authorlink1 = John McCarthy (computer scientist) | last2 = Minsky | first2 = Marvin | authorlink2 = Marvin Minsky | last3 = Rochester | first3 = Nathan | authorlink3 = Nathan Rochester | last4 = Shannon | first4 = Claude | authorlink4 = Claude Shannon | year = 1955 | title = A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence | url = http://www-formal.stanford.edu/jmc/history/dartmouth/dartmouth.html | accessdate = 30 August 2007 | archiveurl = https://web.archive.org/web/20070826230310/http://www-formal.stanford.edu/jmc/history/dartmouth/dartmouth.html | archivedate = 26 August 2007 | url-status=dead | df = dmy-all }}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1 = McCarthy | first1 = John | author-link = John McCarthy (computer scientist)&lt;br /&gt;
&lt;br /&gt;
| last1 = McCarthy | first1 = John | author-link = John McCarthy (computer scientist)&lt;br /&gt;
&lt;br /&gt;
约翰 · 麦卡锡(计算机科学家)&lt;br /&gt;
&lt;br /&gt;
| last2 = Hayes | first2=P. J.&lt;br /&gt;
&lt;br /&gt;
| last2 = Hayes | first2=P. J.&lt;br /&gt;
&lt;br /&gt;
2 | last 2 | Hayes | first2 p.J.&lt;br /&gt;
&lt;br /&gt;
| year = 1969&lt;br /&gt;
&lt;br /&gt;
| year = 1969&lt;br /&gt;
&lt;br /&gt;
1969年&lt;br /&gt;
&lt;br /&gt;
| title= Some philosophical problems from the standpoint of artificial intelligence&lt;br /&gt;
&lt;br /&gt;
| title= Some philosophical problems from the standpoint of artificial intelligence&lt;br /&gt;
&lt;br /&gt;
从人工智能的角度看一些哲学问题&lt;br /&gt;
&lt;br /&gt;
| journal =Machine Intelligence | volume= 4 | pages = 463–502&lt;br /&gt;
&lt;br /&gt;
| journal =Machine Intelligence | volume= 4 | pages = 463–502&lt;br /&gt;
&lt;br /&gt;
机器智能 | 第四卷 | 第463-502页&lt;br /&gt;
&lt;br /&gt;
| url=http://www-formal.stanford.edu/jmc/mcchay69.html | accessdate=30 August 2007&lt;br /&gt;
&lt;br /&gt;
| url=http://www-formal.stanford.edu/jmc/mcchay69.html | accessdate=30 August 2007&lt;br /&gt;
&lt;br /&gt;
Http://www-formal.stanford.edu/jmc/mcchay69.html  : 2007年8月30日&lt;br /&gt;
&lt;br /&gt;
| archiveurl= https://web.archive.org/web/20070810233856/http://www-formal.stanford.edu/jmc/mcchay69.html| archivedate= 10 August 2007 | url-status=live| citeseerx=10.1.1.85.5082}}&lt;br /&gt;
&lt;br /&gt;
| archiveurl= https://web.archive.org/web/20070810233856/http://www-formal.stanford.edu/jmc/mcchay69.html| archivedate= 10 August 2007 | url-status=live| citeseerx=10.1.1.85.5082}}&lt;br /&gt;
&lt;br /&gt;
2007年8月10日 |  https://web.archive.org/web/20070810233856/http://www-formal.stanford.edu/jmc/mcchay69.html| 档案 / 日期 | url-status live | citeseerx 10.1.85.5082}&lt;br /&gt;
&lt;br /&gt;
* {{cite web&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |ref         = harv&lt;br /&gt;
&lt;br /&gt;
 |ref         = harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
 |last        = McCarthy&lt;br /&gt;
&lt;br /&gt;
 |last        = McCarthy&lt;br /&gt;
&lt;br /&gt;
最后麦卡锡&lt;br /&gt;
&lt;br /&gt;
 |first       = John&lt;br /&gt;
&lt;br /&gt;
 |first       = John&lt;br /&gt;
&lt;br /&gt;
第一个约翰&lt;br /&gt;
&lt;br /&gt;
 |authorlink  = John McCarthy (computer scientist)&lt;br /&gt;
&lt;br /&gt;
 |authorlink  = John McCarthy (computer scientist)&lt;br /&gt;
&lt;br /&gt;
约翰 · 麦卡锡(计算机科学家)&lt;br /&gt;
&lt;br /&gt;
 |title       = What Is Artificial Intelligence?&lt;br /&gt;
&lt;br /&gt;
 |title       = What Is Artificial Intelligence?&lt;br /&gt;
&lt;br /&gt;
什么是人工智能？&lt;br /&gt;
&lt;br /&gt;
 |date        = 12 November 2007&lt;br /&gt;
&lt;br /&gt;
 |date        = 12 November 2007&lt;br /&gt;
&lt;br /&gt;
2007年11月12日&lt;br /&gt;
&lt;br /&gt;
 |url         = http://www-formal.stanford.edu/jmc/whatisai/whatisai.html&lt;br /&gt;
&lt;br /&gt;
 |url         = http://www-formal.stanford.edu/jmc/whatisai/whatisai.html&lt;br /&gt;
&lt;br /&gt;
Http://www-formal.stanford.edu/jmc/whatisai/whatisai.html&lt;br /&gt;
&lt;br /&gt;
 |url-status     = dead&lt;br /&gt;
&lt;br /&gt;
 |url-status     = dead&lt;br /&gt;
&lt;br /&gt;
状态死机&lt;br /&gt;
&lt;br /&gt;
 |archiveurl  = https://web.archive.org/web/20151118212402/http://www-formal.stanford.edu/jmc/whatisai/whatisai.html&lt;br /&gt;
&lt;br /&gt;
 |archiveurl  = https://web.archive.org/web/20151118212402/http://www-formal.stanford.edu/jmc/whatisai/whatisai.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20151118212402/http://www-formal.stanford.edu/jmc/whatisai/whatisai.html&lt;br /&gt;
&lt;br /&gt;
 |archivedate = 18 November 2015&lt;br /&gt;
&lt;br /&gt;
 |archivedate = 18 November 2015&lt;br /&gt;
&lt;br /&gt;
2015年11月18日&lt;br /&gt;
&lt;br /&gt;
 |df          = dmy-all&lt;br /&gt;
&lt;br /&gt;
 |df          = dmy-all&lt;br /&gt;
&lt;br /&gt;
我不会放过你的&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Minsky | first=Marvin | author-link=Marvin Minsky&lt;br /&gt;
&lt;br /&gt;
| last=Minsky | first=Marvin | author-link=Marvin Minsky&lt;br /&gt;
&lt;br /&gt;
最后一个明斯基 | 第一个马文 | 作者链接马文明斯基&lt;br /&gt;
&lt;br /&gt;
| year = 1967&lt;br /&gt;
&lt;br /&gt;
| year = 1967&lt;br /&gt;
&lt;br /&gt;
1967年&lt;br /&gt;
&lt;br /&gt;
| title = Computation: Finite and Infinite Machines&lt;br /&gt;
&lt;br /&gt;
| title = Computation: Finite and Infinite Machines&lt;br /&gt;
&lt;br /&gt;
计算: 有限和无限机器&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/computationfinit0000mins&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/computationfinit0000mins&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/computationfinit0000mins&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
| publisher = Prentice-Hall | location=Englewood Cliffs, N.J.&lt;br /&gt;
&lt;br /&gt;
| publisher = Prentice-Hall | location=Englewood Cliffs, N.J.&lt;br /&gt;
&lt;br /&gt;
| 出版商 Prentice-Hall | 位置: 恩格尔伍德克利夫斯，新泽西州。&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-13-165449-5&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-13-165449-5&lt;br /&gt;
&lt;br /&gt;
| isbn 978-0-13-165449-5&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Minsky | first=Marvin | author-link=Marvin Minsky&lt;br /&gt;
&lt;br /&gt;
| last=Minsky | first=Marvin | author-link=Marvin Minsky&lt;br /&gt;
&lt;br /&gt;
最后一个明斯基 | 第一个马文 | 作者链接马文明斯基&lt;br /&gt;
&lt;br /&gt;
| year = 2006&lt;br /&gt;
&lt;br /&gt;
| year = 2006&lt;br /&gt;
&lt;br /&gt;
2006年&lt;br /&gt;
&lt;br /&gt;
| title = The Emotion Machine&lt;br /&gt;
&lt;br /&gt;
| title = The Emotion Machine&lt;br /&gt;
&lt;br /&gt;
标题: 情感机器&lt;br /&gt;
&lt;br /&gt;
| publisher = Simon &amp;amp; Schusterl | location=New York, NY&lt;br /&gt;
&lt;br /&gt;
| publisher = Simon &amp;amp; Schusterl | location=New York, NY&lt;br /&gt;
&lt;br /&gt;
| 出版商 Simon &amp;amp; schuster | 位置: 纽约，纽约&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-7432-7663-4&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-7432-7663-4&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-7432-7663-4]&lt;br /&gt;
&lt;br /&gt;
| title-link=The Emotion Machine }}&lt;br /&gt;
&lt;br /&gt;
| title-link=The Emotion Machine }}&lt;br /&gt;
&lt;br /&gt;
| title-link The Emotion Machine }&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Moravec | first=Hans | author-link=Hans Moravec&lt;br /&gt;
&lt;br /&gt;
| last=Moravec | first=Hans | author-link=Hans Moravec&lt;br /&gt;
&lt;br /&gt;
| last=Moravec | first=Hans | author-link=Hans Moravec&lt;br /&gt;
&lt;br /&gt;
| year = 1988&lt;br /&gt;
&lt;br /&gt;
| year = 1988&lt;br /&gt;
&lt;br /&gt;
1988年&lt;br /&gt;
&lt;br /&gt;
| title = Mind Children&lt;br /&gt;
&lt;br /&gt;
| title = Mind Children&lt;br /&gt;
&lt;br /&gt;
标题: 小心孩子&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/mindchildrenfutu00mora&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/mindchildrenfutu00mora&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/mindchildrenfutu00mora&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
| publisher = Harvard University Press&lt;br /&gt;
&lt;br /&gt;
| publisher = Harvard University Press&lt;br /&gt;
&lt;br /&gt;
哈佛大学出版社&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-674-57616-2&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-674-57616-2&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-0-674-57616-2]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Norvig |first=Peter |authorlink=Peter Norvig |date=25 June 2012&amp;lt;!--page metadata, last modified--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
| last=Norvig |first=Peter |authorlink=Peter Norvig |date=25 June 2012&amp;lt;!--page metadata, last modified--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2012年6月25日---- 页面元数据，最后修改&lt;br /&gt;
&lt;br /&gt;
| title=On Chomsky and the Two Cultures of Statistical Learning&lt;br /&gt;
&lt;br /&gt;
| title=On Chomsky and the Two Cultures of Statistical Learning&lt;br /&gt;
&lt;br /&gt;
乔姆斯基与两种统计学习文化&lt;br /&gt;
&lt;br /&gt;
| publisher=Peter Norvig&lt;br /&gt;
&lt;br /&gt;
| publisher=Peter Norvig&lt;br /&gt;
&lt;br /&gt;
出版商 Peter Norvig&lt;br /&gt;
&lt;br /&gt;
| url=http://norvig.com/chomsky.html&lt;br /&gt;
&lt;br /&gt;
| url=http://norvig.com/chomsky.html&lt;br /&gt;
&lt;br /&gt;
Http://norvig.com/chomsky.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl=https://web.archive.org/web/20141019223259/http://norvig.com/chomsky.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl=https://web.archive.org/web/20141019223259/http://norvig.com/chomsky.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20141019223259/http://norvig.com/chomsky.html&lt;br /&gt;
&lt;br /&gt;
| archivedate=19 October 2014 |url-status=live&lt;br /&gt;
&lt;br /&gt;
| archivedate=19 October 2014 |url-status=live&lt;br /&gt;
&lt;br /&gt;
2014年10月19日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref={{harvid|NRC|1999}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| author=NRC (United States National Research Council) | authorlink=United States National Research Council&lt;br /&gt;
&lt;br /&gt;
| author=NRC (United States National Research Council) | authorlink=United States National Research Council&lt;br /&gt;
&lt;br /&gt;
作者 NRC (美国国家研究委员会)&lt;br /&gt;
&lt;br /&gt;
| year=1999&lt;br /&gt;
&lt;br /&gt;
| year=1999&lt;br /&gt;
&lt;br /&gt;
1999年&lt;br /&gt;
&lt;br /&gt;
| chapter=Developments in Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
| chapter=Developments in Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
人工智能的发展&lt;br /&gt;
&lt;br /&gt;
| title=Funding a Revolution: Government Support for Computing Research&lt;br /&gt;
&lt;br /&gt;
| title=Funding a Revolution: Government Support for Computing Research&lt;br /&gt;
&lt;br /&gt;
资助一场革命: 政府对计算机研究的支持&lt;br /&gt;
&lt;br /&gt;
| publisher=National Academy Press&lt;br /&gt;
&lt;br /&gt;
| publisher=National Academy Press&lt;br /&gt;
&lt;br /&gt;
美国国家科学院出版社&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Needham | first=Joseph | authorlink = Joseph Needham&lt;br /&gt;
&lt;br /&gt;
| last=Needham | first=Joseph | authorlink = Joseph Needham&lt;br /&gt;
&lt;br /&gt;
作者: 约瑟夫 · 李约瑟&lt;br /&gt;
&lt;br /&gt;
| year=1986&lt;br /&gt;
&lt;br /&gt;
| year=1986&lt;br /&gt;
&lt;br /&gt;
1986年&lt;br /&gt;
&lt;br /&gt;
| title=Science and Civilization in China: Volume 2&lt;br /&gt;
&lt;br /&gt;
| title=Science and Civilization in China: Volume 2&lt;br /&gt;
&lt;br /&gt;
中国的科学与文明: 第二卷&lt;br /&gt;
&lt;br /&gt;
| publisher=Caves Books Ltd.&lt;br /&gt;
&lt;br /&gt;
| publisher=Caves Books Ltd.&lt;br /&gt;
&lt;br /&gt;
| 出版商洞穴图书有限公司。&lt;br /&gt;
&lt;br /&gt;
| title-link=Science and Civilization in China }}&lt;br /&gt;
&lt;br /&gt;
| title-link=Science and Civilization in China }}&lt;br /&gt;
&lt;br /&gt;
| 题目链接中国的科学与文明}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal|ref=harv |last=Newell |first=Allen |author-link=Allen Newell |last2=Simon |first2=H. A. |authorlink2=Herbert A. Simon |year=1976 |title=Computer Science as Empirical Inquiry: Symbols and Search |journal=Communications of the ACM |volume=19 |issue=3 |doi=10.1145/360018.360022 |url=http://www.rci.rutgers.edu/~cfs/472_html/AI_SEARCH/PSS/PSSH4.html |pages=113–126 |url-status=dead |archiveurl=https://web.archive.org/web/20081007162810/http://www.rci.rutgers.edu/~cfs/472_html/AI_SEARCH/PSS/PSSH4.html |archivedate=7 October 2008|doi-access=free }}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Nilsson |first=Nils |author-link = Nils Nilsson (researcher) |year=1983&lt;br /&gt;
&lt;br /&gt;
| last=Nilsson |first=Nils |author-link = Nils Nilsson (researcher) |year=1983&lt;br /&gt;
&lt;br /&gt;
| 最后尼尔森 | 第一个尼尔斯 | 作者链接尼尔斯尼尔森(研究员) | 1983年&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence Prepares for 2001&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence Prepares for 2001&lt;br /&gt;
&lt;br /&gt;
人工智能为2001年做准备&lt;br /&gt;
&lt;br /&gt;
| journal=AI Magazine |volume=1 |number=1&lt;br /&gt;
&lt;br /&gt;
| journal=AI Magazine |volume=1 |number=1&lt;br /&gt;
&lt;br /&gt;
人工智能杂志 | 第一卷 | 第一期&lt;br /&gt;
&lt;br /&gt;
| url=https://ai.stanford.edu/~nilsson/OnlinePubs-Nils/General%20Essays/AIMag04-04-002.pdf&lt;br /&gt;
&lt;br /&gt;
| url=https://ai.stanford.edu/~nilsson/OnlinePubs-Nils/General%20Essays/AIMag04-04-002.pdf&lt;br /&gt;
&lt;br /&gt;
Https://ai.stanford.edu/~nilsson/onlinepubs-nils/general%20essays/aimag04-04-002.pdf&lt;br /&gt;
&lt;br /&gt;
}} Presidential Address to the [[Association for the Advancement of Artificial Intelligence]].&lt;br /&gt;
&lt;br /&gt;
}} Presidential Address to the Association for the Advancement of Artificial Intelligence.&lt;br /&gt;
&lt;br /&gt;
美国总统的美国人工智能协会地址。&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=O'Brien |first1=James |last2=Marakas |first2=George |year=2011&lt;br /&gt;
&lt;br /&gt;
| last1=O'Brien |first1=James |last2=Marakas |first2=George |year=2011&lt;br /&gt;
&lt;br /&gt;
2011年1月1日&lt;br /&gt;
&lt;br /&gt;
| title=Management Information Systems |publisher=McGraw-Hill/Irwin |edition=10th&lt;br /&gt;
&lt;br /&gt;
| title=Management Information Systems |publisher=McGraw-Hill/Irwin |edition=10th&lt;br /&gt;
&lt;br /&gt;
| 题目: 管理信息系统 | 出版商 mcgraw-hill / irwin | 第10版&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-07-337681-3&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-07-337681-3&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-07-337681-3]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=O'Connor |first=Kathleen Malone |year=1994&lt;br /&gt;
&lt;br /&gt;
| last=O'Connor |first=Kathleen Malone |year=1994&lt;br /&gt;
&lt;br /&gt;
1994年，凯瑟琳 · 马龙&lt;br /&gt;
&lt;br /&gt;
| title=The alchemical creation of life (takwin) and other concepts of Genesis in medieval Islam&lt;br /&gt;
&lt;br /&gt;
| title=The alchemical creation of life (takwin) and other concepts of Genesis in medieval Islam&lt;br /&gt;
&lt;br /&gt;
中世纪伊斯兰教的炼金术创造生命(takwin)和创世纪的其他概念&lt;br /&gt;
&lt;br /&gt;
| pages=1–435 | publisher=University of Pennsylvania&lt;br /&gt;
&lt;br /&gt;
| pages=1–435 | publisher=University of Pennsylvania&lt;br /&gt;
&lt;br /&gt;
| 第1-435页 | 出版商宾夕法尼亚大学&lt;br /&gt;
&lt;br /&gt;
| url=http://repository.upenn.edu/dissertations/AAI9503804&lt;br /&gt;
&lt;br /&gt;
| url=http://repository.upenn.edu/dissertations/AAI9503804&lt;br /&gt;
&lt;br /&gt;
Http://repository.upenn.edu/dissertations/aai9503804&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Oudeyer |first=P-Y. |year=2010&lt;br /&gt;
&lt;br /&gt;
| last=Oudeyer |first=P-Y. |year=2010&lt;br /&gt;
&lt;br /&gt;
| 最后一个 Oudeyer | 第一个 p-y。2010年&lt;br /&gt;
&lt;br /&gt;
| title=On the impact of robotics in behavioral and cognitive sciences: from insect navigation to human cognitive development&lt;br /&gt;
&lt;br /&gt;
| title=On the impact of robotics in behavioral and cognitive sciences: from insect navigation to human cognitive development&lt;br /&gt;
&lt;br /&gt;
机器人技术对行为和认知科学的影响: 从昆虫导航到人类认知发展&lt;br /&gt;
&lt;br /&gt;
| journal=IEEE Transactions on Autonomous Mental Development |volume=2 |issue=1 |pages=2–16&lt;br /&gt;
&lt;br /&gt;
| journal=IEEE Transactions on Autonomous Mental Development |volume=2 |issue=1 |pages=2–16&lt;br /&gt;
&lt;br /&gt;
自主智力发展杂志 | 第2卷 | 第1期 | 第2-16页&lt;br /&gt;
&lt;br /&gt;
| url=http://www.pyoudeyer.com/IEEETAMDOudeyer10.pdf | doi=10.1109/tamd.2009.2039057&lt;br /&gt;
&lt;br /&gt;
| url=http://www.pyoudeyer.com/IEEETAMDOudeyer10.pdf | doi=10.1109/tamd.2009.2039057&lt;br /&gt;
&lt;br /&gt;
Http://www.pyoudeyer.com/ieeetamdoudeyer10.pdf 10.1109 / tamd. 2009.2039057&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Penrose |first=Roger |author-link=Roger Penrose |year=1989&lt;br /&gt;
&lt;br /&gt;
| last=Penrose |first=Roger |author-link=Roger Penrose |year=1989&lt;br /&gt;
&lt;br /&gt;
最后一个彭罗斯 | 第一个罗杰 | 作者链接罗杰彭罗斯 | 1989年&lt;br /&gt;
&lt;br /&gt;
| title=The Emperor's New Mind: Concerning Computer, Minds and The Laws of Physics&lt;br /&gt;
&lt;br /&gt;
| title=The Emperor's New Mind: Concerning Computer, Minds and The Laws of Physics&lt;br /&gt;
&lt;br /&gt;
皇帝的新头脑: 关于计算机，头脑和物理定律&lt;br /&gt;
&lt;br /&gt;
| publisher=[[Oxford University Press]]&lt;br /&gt;
&lt;br /&gt;
| publisher=Oxford University Press&lt;br /&gt;
&lt;br /&gt;
牛津大学出版社&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-19-851973-7&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-19-851973-7&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-19-851973-7]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* {{cite techreport |ref=harv&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* {{cite techreport |ref=harv&lt;br /&gt;
&lt;br /&gt;
!-* { cite techreport | ref harv&lt;br /&gt;
&lt;br /&gt;
| last=Picard |first=Rosalind |authorlink=Rosalind Picard |year=1995&lt;br /&gt;
&lt;br /&gt;
| last=Picard |first=Rosalind |authorlink=Rosalind Picard |year=1995&lt;br /&gt;
&lt;br /&gt;
作者: Rosalind Picard 1995年&lt;br /&gt;
&lt;br /&gt;
| title=Affective Computing |institution=MIT |number=321&lt;br /&gt;
&lt;br /&gt;
| title=Affective Computing |institution=MIT |number=321&lt;br /&gt;
&lt;br /&gt;
情感计算机 | 机构麻省理工学院 | 321号&lt;br /&gt;
&lt;br /&gt;
| url=http://affect.media.mit.edu/pdfs/95.picard.pdf&lt;br /&gt;
&lt;br /&gt;
| url=http://affect.media.mit.edu/pdfs/95.picard.pdf&lt;br /&gt;
&lt;br /&gt;
Http://affect.media.mit.edu/pdfs/95.picard.pdf&lt;br /&gt;
&lt;br /&gt;
| laysource=Abstract |layurl=http://vismod.media.mit.edu/pub/tech-reports/TR-321-ABSTRACT.html&lt;br /&gt;
&lt;br /&gt;
| laysource=Abstract |layurl=http://vismod.media.mit.edu/pub/tech-reports/TR-321-ABSTRACT.html&lt;br /&gt;
&lt;br /&gt;
2012年3月15日 |  http://vismod.media.mit.edu/pub/tech-reports/tr-321-Abstract.html&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
-- * { cite book | ref harv&lt;br /&gt;
&lt;br /&gt;
| last1=Poli |first1=R. |last2=Langdon |first2=W. B. |last3=McPhee |first3=N. F. |year=2008&lt;br /&gt;
&lt;br /&gt;
| last1=Poli |first1=R. |last2=Langdon |first2=W. B. |last3=McPhee |first3=N. F. |year=2008&lt;br /&gt;
&lt;br /&gt;
1 Poli | first1 r.最后2个兰登，最初2个 w。乙。3 McPhee | first3 n.2008年&lt;br /&gt;
&lt;br /&gt;
| title=A Field Guide to Genetic Programming |publisher=Lulu.com |isbn=978-1-4092-0073-4&lt;br /&gt;
&lt;br /&gt;
| title=A Field Guide to Genetic Programming |publisher=Lulu.com |isbn=978-1-4092-0073-4&lt;br /&gt;
&lt;br /&gt;
遗传编程实地指南 | 出版商 lulu. com | isbn 978-1-4092-0073-4&lt;br /&gt;
&lt;br /&gt;
| url=http://www.gp-field-guide.org.uk/ |via=gp-field-guide.org.uk&lt;br /&gt;
&lt;br /&gt;
| url=http://www.gp-field-guide.org.uk/ |via=gp-field-guide.org.uk&lt;br /&gt;
&lt;br /&gt;
Http://www.gp-field-guide.org.uk/  gp-field-guide.org.uk&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
 |last=Rajani&lt;br /&gt;
&lt;br /&gt;
 |last=Rajani&lt;br /&gt;
&lt;br /&gt;
最后的拉贾尼&lt;br /&gt;
&lt;br /&gt;
 |first=Sandeep&lt;br /&gt;
&lt;br /&gt;
 |first=Sandeep&lt;br /&gt;
&lt;br /&gt;
第一个 Sandeep&lt;br /&gt;
&lt;br /&gt;
 |year=2011&lt;br /&gt;
&lt;br /&gt;
 |year=2011&lt;br /&gt;
&lt;br /&gt;
2011年&lt;br /&gt;
&lt;br /&gt;
 |title=Artificial Intelligence – Man or Machine&lt;br /&gt;
&lt;br /&gt;
 |title=Artificial Intelligence – Man or Machine&lt;br /&gt;
&lt;br /&gt;
| 题目: 人工智能-人还是机器&lt;br /&gt;
&lt;br /&gt;
 |journal=International Journal of Information Technology and Knowledge Management&lt;br /&gt;
&lt;br /&gt;
 |journal=International Journal of Information Technology and Knowledge Management&lt;br /&gt;
&lt;br /&gt;
国际信息技术与知识管理杂志&lt;br /&gt;
&lt;br /&gt;
 |volume=4&lt;br /&gt;
&lt;br /&gt;
 |volume=4&lt;br /&gt;
&lt;br /&gt;
第四卷&lt;br /&gt;
&lt;br /&gt;
 |issue=1&lt;br /&gt;
&lt;br /&gt;
 |issue=1&lt;br /&gt;
&lt;br /&gt;
第一期&lt;br /&gt;
&lt;br /&gt;
 |pages=173–176&lt;br /&gt;
&lt;br /&gt;
 |pages=173–176&lt;br /&gt;
&lt;br /&gt;
第173-176页&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.csjournals.com/IJITKM/PDF%204-1/35.Sandeep%20Rajani.pdf&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.csjournals.com/IJITKM/PDF%204-1/35.Sandeep%20Rajani.pdf&lt;br /&gt;
&lt;br /&gt;
Http://www.csjournals.com/ijitkm/pdf%204-1/35.sandeep%20rajani.pdf&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
状态死机&lt;br /&gt;
&lt;br /&gt;
 |archiveurl=https://web.archive.org/web/20130118095844/http://www.csjournals.com/IJITKM/PDF%204-1/35.Sandeep%20Rajani.pdf&lt;br /&gt;
&lt;br /&gt;
 |archiveurl=https://web.archive.org/web/20130118095844/http://www.csjournals.com/IJITKM/PDF%204-1/35.Sandeep%20Rajani.pdf&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20130118095844/http://www.csjournals.com/ijitkm/pdf%204-1/35.sandeep%20rajani.pdf&lt;br /&gt;
&lt;br /&gt;
 |archivedate=18 January 2013&lt;br /&gt;
&lt;br /&gt;
 |archivedate=18 January 2013&lt;br /&gt;
&lt;br /&gt;
2013年1月18日&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
我不会让你失望的&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* Ronald, E. M. A.  and Sipper, M.  [https://drive.google.com/file/d/0B6G3tbmMcpR4TFdHSXNFWUtlNWc/view?usp=sharing Intelligence is not enough: On the socialization of talking machines, Minds and Machines], vol. 11, no. 4, pp.&amp;amp;nbsp;567–576, November 2001.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* Ronald, E. M. A.  and Sipper, M.  [https://drive.google.com/file/d/0B6G3tbmMcpR4VnpOX0xxazFNbjA/view?usp=sharing What use is a Turing chatterbox?], Communications of the ACM, vol. 43, no. 10, pp.&amp;amp;nbsp;21–23, October 2000.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Cite journal&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
 |last=Searle&lt;br /&gt;
&lt;br /&gt;
 |last=Searle&lt;br /&gt;
&lt;br /&gt;
最后 Searle&lt;br /&gt;
&lt;br /&gt;
 |first=John&lt;br /&gt;
&lt;br /&gt;
 |first=John&lt;br /&gt;
&lt;br /&gt;
第一个约翰&lt;br /&gt;
&lt;br /&gt;
 |author-link=John Searle&lt;br /&gt;
&lt;br /&gt;
 |author-link=John Searle&lt;br /&gt;
&lt;br /&gt;
作者链接约翰 · 塞尔&lt;br /&gt;
&lt;br /&gt;
 |year=1980&lt;br /&gt;
&lt;br /&gt;
 |year=1980&lt;br /&gt;
&lt;br /&gt;
1980年&lt;br /&gt;
&lt;br /&gt;
 |title=Minds, Brains and Programs&lt;br /&gt;
&lt;br /&gt;
 |title=Minds, Brains and Programs&lt;br /&gt;
&lt;br /&gt;
文章标题: 思想，大脑和程序&lt;br /&gt;
&lt;br /&gt;
 |journal=Behavioral and Brain Sciences&lt;br /&gt;
&lt;br /&gt;
 |journal=Behavioral and Brain Sciences&lt;br /&gt;
&lt;br /&gt;
行为与脑科学杂志&lt;br /&gt;
&lt;br /&gt;
 |volume=3&lt;br /&gt;
&lt;br /&gt;
 |volume=3&lt;br /&gt;
&lt;br /&gt;
第三卷&lt;br /&gt;
&lt;br /&gt;
 |issue=3&lt;br /&gt;
&lt;br /&gt;
 |issue=3&lt;br /&gt;
&lt;br /&gt;
第三期&lt;br /&gt;
&lt;br /&gt;
 |pages=417–457&lt;br /&gt;
&lt;br /&gt;
 |pages=417–457&lt;br /&gt;
&lt;br /&gt;
第417-457页&lt;br /&gt;
&lt;br /&gt;
 |doi=10.1017/S0140525X00005756&lt;br /&gt;
&lt;br /&gt;
 |doi=10.1017/S0140525X00005756&lt;br /&gt;
&lt;br /&gt;
10.1017 / s0140525x0005756&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
我不会让你失望的&lt;br /&gt;
&lt;br /&gt;
|url=http://cogprints.org/7150/1/10.1.1.83.5248.pdf&lt;br /&gt;
&lt;br /&gt;
|url=http://cogprints.org/7150/1/10.1.1.83.5248.pdf&lt;br /&gt;
&lt;br /&gt;
Http://cogprints.org/7150/1/10.1.1.83.5248.pdf&lt;br /&gt;
&lt;br /&gt;
 }}&lt;br /&gt;
&lt;br /&gt;
 }}&lt;br /&gt;
&lt;br /&gt;
 }}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref         = harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |last        = Searle&lt;br /&gt;
&lt;br /&gt;
 |last        = Searle&lt;br /&gt;
&lt;br /&gt;
最后 Searle&lt;br /&gt;
&lt;br /&gt;
 |first       = John&lt;br /&gt;
&lt;br /&gt;
 |first       = John&lt;br /&gt;
&lt;br /&gt;
第一个约翰&lt;br /&gt;
&lt;br /&gt;
 |author-link = John Searle&lt;br /&gt;
&lt;br /&gt;
 |author-link = John Searle&lt;br /&gt;
&lt;br /&gt;
作者链接约翰 · 塞尔&lt;br /&gt;
&lt;br /&gt;
 |year        = 1999&lt;br /&gt;
&lt;br /&gt;
 |year        = 1999&lt;br /&gt;
&lt;br /&gt;
1999年&lt;br /&gt;
&lt;br /&gt;
 |title       = Mind, language and society&lt;br /&gt;
&lt;br /&gt;
 |title       = Mind, language and society&lt;br /&gt;
&lt;br /&gt;
文章标题: 思想，语言和社会&lt;br /&gt;
&lt;br /&gt;
 |publisher   = Basic Books&lt;br /&gt;
&lt;br /&gt;
 |publisher   = Basic Books&lt;br /&gt;
&lt;br /&gt;
| 出版商 Basic Books&lt;br /&gt;
&lt;br /&gt;
 |location    = New York, NY&lt;br /&gt;
&lt;br /&gt;
 |location    = New York, NY&lt;br /&gt;
&lt;br /&gt;
纽约，纽约&lt;br /&gt;
&lt;br /&gt;
 |isbn        = 978-0-465-04521-1&lt;br /&gt;
&lt;br /&gt;
 |isbn        = 978-0-465-04521-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-0-465-04521-1]&lt;br /&gt;
&lt;br /&gt;
 |oclc        = 231867665&lt;br /&gt;
&lt;br /&gt;
 |oclc        = 231867665&lt;br /&gt;
&lt;br /&gt;
231867665&lt;br /&gt;
&lt;br /&gt;
 |url         = https://archive.org/details/mindlanguagesoci00sear&lt;br /&gt;
&lt;br /&gt;
 |url         = https://archive.org/details/mindlanguagesoci00sear&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/mindlanguagesoci00sear&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Shapiro | first= Stuart C. | editor-first=Stuart C. | editor-last=Shapiro&lt;br /&gt;
&lt;br /&gt;
| last=Shapiro | first= Stuart C. | editor-first=Stuart C. | editor-last=Shapiro&lt;br /&gt;
&lt;br /&gt;
最后一个夏皮罗 | 第一个斯图尔特 c. | 编辑-第一个斯图尔特 c. | 编辑-最后一个夏皮罗&lt;br /&gt;
&lt;br /&gt;
| year=1992&lt;br /&gt;
&lt;br /&gt;
| year=1992&lt;br /&gt;
&lt;br /&gt;
1992年&lt;br /&gt;
&lt;br /&gt;
| contribution=Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
| contribution=Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
人工智能&lt;br /&gt;
&lt;br /&gt;
| title=Encyclopedia of Artificial Intelligence | edition=2nd | pages=54–57&lt;br /&gt;
&lt;br /&gt;
| title=Encyclopedia of Artificial Intelligence | edition=2nd | pages=54–57&lt;br /&gt;
&lt;br /&gt;
人工智能百科全书 | 第二版 | 第54-57页&lt;br /&gt;
&lt;br /&gt;
| url=http://www.cse.buffalo.edu/~shapiro/Papers/ai.pdf&lt;br /&gt;
&lt;br /&gt;
| url=http://www.cse.buffalo.edu/~shapiro/Papers/ai.pdf&lt;br /&gt;
&lt;br /&gt;
Http://www.cse.buffalo.edu/~shapiro/papers/ai.pdf&lt;br /&gt;
&lt;br /&gt;
| publisher=John Wiley | location=New York&lt;br /&gt;
&lt;br /&gt;
| publisher=John Wiley | location=New York&lt;br /&gt;
&lt;br /&gt;
| 出版人约翰 · 威利 | 位置: 纽约&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-471-50306-4&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-471-50306-4&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-471-50306-4]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Simon | first = H. A. | author-link=Herbert A. Simon&lt;br /&gt;
&lt;br /&gt;
| last=Simon | first = H. A. | author-link=Herbert A. Simon&lt;br /&gt;
&lt;br /&gt;
最后的西蒙 | 第一个 h. a。| 作者链接赫伯特·西蒙&lt;br /&gt;
&lt;br /&gt;
| year = 1965&lt;br /&gt;
&lt;br /&gt;
| year = 1965&lt;br /&gt;
&lt;br /&gt;
1965年&lt;br /&gt;
&lt;br /&gt;
| title=The Shape of Automation for Men and Management&lt;br /&gt;
&lt;br /&gt;
| title=The Shape of Automation for Men and Management&lt;br /&gt;
&lt;br /&gt;
男性和管理自动化的形态&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/shapeofautomatio00simo&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/shapeofautomatio00simo&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/shapeofautomatio00simo&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
| publisher = Harper &amp;amp; Row | location = New York&lt;br /&gt;
&lt;br /&gt;
| publisher = Harper &amp;amp; Row | location = New York&lt;br /&gt;
&lt;br /&gt;
| 出版商 Harper &amp;amp; Row | 位置: 纽约&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Skillings | first=Jonathan&lt;br /&gt;
&lt;br /&gt;
| last=Skillings | first=Jonathan&lt;br /&gt;
&lt;br /&gt;
最后的技能 | 第一个乔纳森&lt;br /&gt;
&lt;br /&gt;
| url=http://news.cnet.com/Getting-machines-to-think-like-us/2008-11394_3-6090207.html&lt;br /&gt;
&lt;br /&gt;
| url=http://news.cnet.com/Getting-machines-to-think-like-us/2008-11394_3-6090207.html&lt;br /&gt;
&lt;br /&gt;
Http://news.cnet.com/getting-machines-to-think-like-us/2008-11394_3-6090207.html&lt;br /&gt;
&lt;br /&gt;
| title=Getting Machines to Think Like Us&lt;br /&gt;
&lt;br /&gt;
| title=Getting Machines to Think Like Us&lt;br /&gt;
&lt;br /&gt;
让机器像我们一样思考&lt;br /&gt;
&lt;br /&gt;
| work=cnet&lt;br /&gt;
&lt;br /&gt;
| work=cnet&lt;br /&gt;
&lt;br /&gt;
我会在 cnet 工作&lt;br /&gt;
&lt;br /&gt;
| date=3 July 2006&lt;br /&gt;
&lt;br /&gt;
| date=3 July 2006&lt;br /&gt;
&lt;br /&gt;
2006年7月3日&lt;br /&gt;
&lt;br /&gt;
| accessdate=3 February 2011&lt;br /&gt;
&lt;br /&gt;
| accessdate=3 February 2011&lt;br /&gt;
&lt;br /&gt;
2011年2月3日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite conference |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Solomonoff |first=Ray |authorlink=Ray Solomonoff |year=1956&lt;br /&gt;
&lt;br /&gt;
| last=Solomonoff |first=Ray |authorlink=Ray Solomonoff |year=1956&lt;br /&gt;
&lt;br /&gt;
作者: Ray Solomonoff 1956年&lt;br /&gt;
&lt;br /&gt;
| title=An Inductive Inference Machine&lt;br /&gt;
&lt;br /&gt;
| title=An Inductive Inference Machine&lt;br /&gt;
&lt;br /&gt;
归纳推理机&lt;br /&gt;
&lt;br /&gt;
| conference=Dartmouth Summer Research Conference on Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
| conference=Dartmouth Summer Research Conference on Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
达特茅斯夏季人工智能研究会议&lt;br /&gt;
&lt;br /&gt;
| url=http://world.std.com/~rjs/indinf56.pdf |via=std.com, pdf scanned copy of the original&lt;br /&gt;
&lt;br /&gt;
| url=http://world.std.com/~rjs/indinf56.pdf |via=std.com, pdf scanned copy of the original&lt;br /&gt;
&lt;br /&gt;
Http://world.std.com/~rjs/indinf56.pdf  : http: / / www.std. com / pdf&lt;br /&gt;
&lt;br /&gt;
}} Later published as&amp;lt;br /&amp;gt;{{cite book&lt;br /&gt;
&lt;br /&gt;
}} Later published as&amp;lt;br /&amp;gt;{{cite book&lt;br /&gt;
&lt;br /&gt;
}}后来作为 br / { cite book 出版&lt;br /&gt;
&lt;br /&gt;
| last=Solomonoff |first=Ray |year=1957 |pages=56–62&lt;br /&gt;
&lt;br /&gt;
| last=Solomonoff |first=Ray |year=1957 |pages=56–62&lt;br /&gt;
&lt;br /&gt;
最后所罗门诺夫 | 第一射线 | 1957年 | 第56-62页&lt;br /&gt;
&lt;br /&gt;
| chapter=An Inductive Inference Machine&lt;br /&gt;
&lt;br /&gt;
| chapter=An Inductive Inference Machine&lt;br /&gt;
&lt;br /&gt;
归纳推理机&lt;br /&gt;
&lt;br /&gt;
| title=IRE Convention Record |volume=Section on Information Theory, part 2&lt;br /&gt;
&lt;br /&gt;
| title=IRE Convention Record |volume=Section on Information Theory, part 2&lt;br /&gt;
&lt;br /&gt;
信息理论部分，第二部分&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite conference |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Tao |first=Jianhua |first2=Tieniu |last2=Tan |year=2005&lt;br /&gt;
&lt;br /&gt;
| last=Tao |first=Jianhua |first2=Tieniu |last2=Tan |year=2005&lt;br /&gt;
&lt;br /&gt;
2 Tieniu | last 2 Tan | year 2005&lt;br /&gt;
&lt;br /&gt;
| conference=Affective Computing: A Review&lt;br /&gt;
&lt;br /&gt;
| conference=Affective Computing: A Review&lt;br /&gt;
&lt;br /&gt;
会议情感计算: 回顾&lt;br /&gt;
&lt;br /&gt;
| booktitle=Affective Computing and Intelligent Interaction |volume=[[LNCS]] 3784 |pages=981–995&lt;br /&gt;
&lt;br /&gt;
| booktitle=Affective Computing and Intelligent Interaction |volume=LNCS 3784 |pages=981–995&lt;br /&gt;
&lt;br /&gt;
| 书名情感计算和智能交互 | 卷 LNCS 3784 | 页981-995&lt;br /&gt;
&lt;br /&gt;
 |publisher=Springer |doi=10.1007/11573548&lt;br /&gt;
&lt;br /&gt;
 |publisher=Springer |doi=10.1007/11573548&lt;br /&gt;
&lt;br /&gt;
| 出版商 Springer | doi 10.1007 / 11573548&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Tecuci |first=Gheorghe |date=March–April 2012&lt;br /&gt;
&lt;br /&gt;
| last=Tecuci |first=Gheorghe |date=March–April 2012&lt;br /&gt;
&lt;br /&gt;
2012年3-4月&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
人工智能&lt;br /&gt;
&lt;br /&gt;
| journal=Wiley Interdisciplinary Reviews: Computational Statistics&lt;br /&gt;
&lt;br /&gt;
| journal=Wiley Interdisciplinary Reviews: Computational Statistics&lt;br /&gt;
&lt;br /&gt;
杂志 Wiley 跨学科评论: 计算机数据&lt;br /&gt;
&lt;br /&gt;
| volume=4 |issue=2 |pages=168–180 |doi=10.1002/wics.200&lt;br /&gt;
&lt;br /&gt;
| volume=4 |issue=2 |pages=168–180 |doi=10.1002/wics.200&lt;br /&gt;
&lt;br /&gt;
第四卷，第二期，第168-180页，页数10.1002 / wics. 200&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
|last=Thro&lt;br /&gt;
&lt;br /&gt;
|last=Thro&lt;br /&gt;
&lt;br /&gt;
最后一次&lt;br /&gt;
&lt;br /&gt;
|first=Ellen&lt;br /&gt;
&lt;br /&gt;
|first=Ellen&lt;br /&gt;
&lt;br /&gt;
首先是艾伦&lt;br /&gt;
&lt;br /&gt;
|year=1993&lt;br /&gt;
&lt;br /&gt;
|year=1993&lt;br /&gt;
&lt;br /&gt;
1993年&lt;br /&gt;
&lt;br /&gt;
|title=Robotics: The Marriage of Computers and Machines&lt;br /&gt;
&lt;br /&gt;
|title=Robotics: The Marriage of Computers and Machines&lt;br /&gt;
&lt;br /&gt;
机器人技术: 计算机与机器的联姻&lt;br /&gt;
&lt;br /&gt;
|location=New York&lt;br /&gt;
&lt;br /&gt;
|location=New York&lt;br /&gt;
&lt;br /&gt;
| 地点: 纽约&lt;br /&gt;
&lt;br /&gt;
|publisher=Facts on File&lt;br /&gt;
&lt;br /&gt;
|publisher=Facts on File&lt;br /&gt;
&lt;br /&gt;
文件中的事实&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-8160-2628-9&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-8160-2628-9&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-8160-2628-9]&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/isbn_9780816026289&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/isbn_9780816026289&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/isbn_9780816026289&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{Turing 1950}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite web&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
 |last=van der Walt&lt;br /&gt;
&lt;br /&gt;
 |last=van der Walt&lt;br /&gt;
&lt;br /&gt;
最后一个范德沃尔特&lt;br /&gt;
&lt;br /&gt;
 |first=Christiaan&lt;br /&gt;
&lt;br /&gt;
 |first=Christiaan&lt;br /&gt;
&lt;br /&gt;
第一个克里斯蒂安&lt;br /&gt;
&lt;br /&gt;
 |last2=Bernard&lt;br /&gt;
&lt;br /&gt;
 |last2=Bernard&lt;br /&gt;
&lt;br /&gt;
最后2个 Bernard&lt;br /&gt;
&lt;br /&gt;
 |first2=Etienne&lt;br /&gt;
&lt;br /&gt;
 |first2=Etienne&lt;br /&gt;
&lt;br /&gt;
| first2 Etienne&lt;br /&gt;
&lt;br /&gt;
 |year=2006&lt;br /&gt;
&lt;br /&gt;
 |year=2006&lt;br /&gt;
&lt;br /&gt;
2006年&lt;br /&gt;
&lt;br /&gt;
 |title=Data characteristics that determine classifier performance&lt;br /&gt;
&lt;br /&gt;
 |title=Data characteristics that determine classifier performance&lt;br /&gt;
&lt;br /&gt;
| 决定分类器性能的数据特征&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf&lt;br /&gt;
&lt;br /&gt;
Http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf&lt;br /&gt;
&lt;br /&gt;
 |accessdate=5 August 2009&lt;br /&gt;
&lt;br /&gt;
 |accessdate=5 August 2009&lt;br /&gt;
&lt;br /&gt;
2009年8月5日&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
状态死机&lt;br /&gt;
&lt;br /&gt;
 |archiveurl=https://web.archive.org/web/20090325194051/http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf&lt;br /&gt;
&lt;br /&gt;
 |archiveurl=https://web.archive.org/web/20090325194051/http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20090325194051/http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf&lt;br /&gt;
&lt;br /&gt;
 |archivedate=25 March 2009&lt;br /&gt;
&lt;br /&gt;
 |archivedate=25 March 2009&lt;br /&gt;
&lt;br /&gt;
2009年3月25日&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
我不会让你失望的&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal | ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Vinge | first=Vernor | authorlink=Vernor Vinge&lt;br /&gt;
&lt;br /&gt;
| last=Vinge | first=Vernor | authorlink=Vernor Vinge&lt;br /&gt;
&lt;br /&gt;
最后一个 Vinge | 第一个 Vernor | authorlink Vernor Vinge&lt;br /&gt;
&lt;br /&gt;
| year=1993&lt;br /&gt;
&lt;br /&gt;
| year=1993&lt;br /&gt;
&lt;br /&gt;
1993年&lt;br /&gt;
&lt;br /&gt;
| title=The Coming Technological Singularity: How to Survive in the Post-Human Era&lt;br /&gt;
&lt;br /&gt;
| title=The Coming Technological Singularity: How to Survive in the Post-Human Era&lt;br /&gt;
&lt;br /&gt;
即将到来的技术奇异点: 如何在后人类时代生存&lt;br /&gt;
&lt;br /&gt;
| journal=Vision 21: Interdisciplinary Science and Engineering in the Era of Cyberspace | pages=11 | url=http://www-rohan.sdsu.edu/faculty/vinge/misc/singularity.html&lt;br /&gt;
&lt;br /&gt;
| journal=Vision 21: Interdisciplinary Science and Engineering in the Era of Cyberspace | pages=11 | url=http://www-rohan.sdsu.edu/faculty/vinge/misc/singularity.html&lt;br /&gt;
&lt;br /&gt;
视觉21: 网络时代的跨学科科学与工程杂志 | 第11页 |  http://www-rohan.sdsu.edu/faculty/vinge/misc/singularity.html&lt;br /&gt;
&lt;br /&gt;
| bibcode=1993vise.nasa...11V }}&lt;br /&gt;
&lt;br /&gt;
| bibcode=1993vise.nasa...11V }}&lt;br /&gt;
&lt;br /&gt;
1993 vise. nasa... 11V }&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=Wason | first1=P. C. | author-link=Peter Cathcart Wason&lt;br /&gt;
&lt;br /&gt;
| last1=Wason | first1=P. C. | author-link=Peter Cathcart Wason&lt;br /&gt;
&lt;br /&gt;
| last 1 Wason | first1 p.作者链接: Peter Cathcart Wason&lt;br /&gt;
&lt;br /&gt;
| last2=Shapiro | first2=D.&lt;br /&gt;
&lt;br /&gt;
| last2=Shapiro | first2=D.&lt;br /&gt;
&lt;br /&gt;
2 Shapiro | first2 d.&lt;br /&gt;
&lt;br /&gt;
| editor=Foss, B. M.&lt;br /&gt;
&lt;br /&gt;
| editor=Foss, B. M.&lt;br /&gt;
&lt;br /&gt;
编辑 Foss，B.m。&lt;br /&gt;
&lt;br /&gt;
| year=1966&lt;br /&gt;
&lt;br /&gt;
| year=1966&lt;br /&gt;
&lt;br /&gt;
1966年&lt;br /&gt;
&lt;br /&gt;
| title=New horizons in psychology&lt;br /&gt;
&lt;br /&gt;
| title=New horizons in psychology&lt;br /&gt;
&lt;br /&gt;
心理学的新视野&lt;br /&gt;
&lt;br /&gt;
|chapter-url=https://archive.org/details/newhorizonsinpsy0000foss&lt;br /&gt;
&lt;br /&gt;
|chapter-url=https://archive.org/details/newhorizonsinpsy0000foss&lt;br /&gt;
&lt;br /&gt;
| 章节-网址 https://archive.org/details/newhorizonsinpsy0000foss&lt;br /&gt;
&lt;br /&gt;
|chapter-url-access=registration&lt;br /&gt;
&lt;br /&gt;
|chapter-url-access=registration&lt;br /&gt;
&lt;br /&gt;
| chapter-url-access registration&lt;br /&gt;
&lt;br /&gt;
| location=Harmondsworth | publisher=Penguin&lt;br /&gt;
&lt;br /&gt;
| location=Harmondsworth | publisher=Penguin&lt;br /&gt;
&lt;br /&gt;
| 地址 Harmondsworth | 出版商 Penguin&lt;br /&gt;
&lt;br /&gt;
| chapter=Reasoning&lt;br /&gt;
&lt;br /&gt;
| chapter=Reasoning&lt;br /&gt;
&lt;br /&gt;
推理 | 第一章&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Weizenbaum | first = Joseph | authorlink=Joseph Weizenbaum&lt;br /&gt;
&lt;br /&gt;
| last=Weizenbaum | first = Joseph | authorlink=Joseph Weizenbaum&lt;br /&gt;
&lt;br /&gt;
2012年3月15日 | 约瑟夫·维森鲍姆&lt;br /&gt;
&lt;br /&gt;
| year = 1976&lt;br /&gt;
&lt;br /&gt;
| year = 1976&lt;br /&gt;
&lt;br /&gt;
1976年&lt;br /&gt;
&lt;br /&gt;
| title = Computer Power and Human Reason&lt;br /&gt;
&lt;br /&gt;
| title = Computer Power and Human Reason&lt;br /&gt;
&lt;br /&gt;
计算机能力与人类理性&lt;br /&gt;
&lt;br /&gt;
| publisher = W.H. Freeman &amp;amp; Company | location = San Francisco&lt;br /&gt;
&lt;br /&gt;
| publisher = W.H. Freeman &amp;amp; Company | location = San Francisco&lt;br /&gt;
&lt;br /&gt;
出版商 w.h。弗里曼公司 | 地点: 旧金山&lt;br /&gt;
&lt;br /&gt;
| isbn = 978-0-7167-0464-5&lt;br /&gt;
&lt;br /&gt;
| isbn = 978-0-7167-0464-5&lt;br /&gt;
&lt;br /&gt;
| isbn 978-0-7167-0464-5&lt;br /&gt;
&lt;br /&gt;
| title-link=Computer Power and Human Reason }}&lt;br /&gt;
&lt;br /&gt;
| title-link=Computer Power and Human Reason }}&lt;br /&gt;
&lt;br /&gt;
| title-link 计算机能力和人类理性}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=Weng |first1=J. |last2=McClelland |last3=Pentland |first3=A. |last4=Sporns |first4=O.&lt;br /&gt;
&lt;br /&gt;
| last1=Weng |first1=J. |last2=McClelland |last3=Pentland |first3=A. |last4=Sporns |first4=O.&lt;br /&gt;
&lt;br /&gt;
最后1个翁最初1个 j。最后2个麦克利兰最后3个彭特兰最初3个 a。最后4个运动项目。&lt;br /&gt;
&lt;br /&gt;
| last5=Stockman |first5=I. |last6=Sur |first6=M. |last7=Thelen |first7=E. |year=2001&lt;br /&gt;
&lt;br /&gt;
| last5=Stockman |first5=I. |last6=Sur |first6=M. |last7=Thelen |first7=E. |year=2001&lt;br /&gt;
&lt;br /&gt;
| 最后5个斯托克曼 | 最初5个。6:00.7 Thelen | first7 e.2001年&lt;br /&gt;
&lt;br /&gt;
| url=http://www.cse.msu.edu/dl/SciencePaper.pdf |via=msu.edu | doi= 10.1126/science.291.5504.599&lt;br /&gt;
&lt;br /&gt;
| url=http://www.cse.msu.edu/dl/SciencePaper.pdf |via=msu.edu | doi= 10.1126/science.291.5504.599&lt;br /&gt;
&lt;br /&gt;
Http://www.cse.msu.edu/dl/sciencepaper.pdf 10.1126 / science. 291.5504.599&lt;br /&gt;
&lt;br /&gt;
| pmid=11229402 | title=Autonomous mental development by robots and animals |journal=Science |volume=291 | issue=5504 |pages=599–600&lt;br /&gt;
&lt;br /&gt;
| pmid=11229402 | title=Autonomous mental development by robots and animals |journal=Science |volume=291 | issue=5504 |pages=599–600&lt;br /&gt;
&lt;br /&gt;
机器人和动物的自主智力开发 | 科学杂志 | 第291卷 | 第5504期 | 第599-600页&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|url=http://www-formal.stanford.edu/jmc/whatisai/node3.html&lt;br /&gt;
&lt;br /&gt;
|url=http://www-formal.stanford.edu/jmc/whatisai/node3.html&lt;br /&gt;
&lt;br /&gt;
Http://www-formal.stanford.edu/jmc/whatisai/node3.html&lt;br /&gt;
&lt;br /&gt;
|title=Applications of AI&lt;br /&gt;
&lt;br /&gt;
|title=Applications of AI&lt;br /&gt;
&lt;br /&gt;
| 人工智能的应用&lt;br /&gt;
&lt;br /&gt;
|website=www-formal.stanford.edu&lt;br /&gt;
&lt;br /&gt;
|website=www-formal.stanford.edu&lt;br /&gt;
&lt;br /&gt;
网站 www-formal.stanford.edu&lt;br /&gt;
&lt;br /&gt;
|access-date=25 September 2016}}&lt;br /&gt;
&lt;br /&gt;
|access-date=25 September 2016}}&lt;br /&gt;
&lt;br /&gt;
| access-date 25 September 2016}&lt;br /&gt;
&lt;br /&gt;
{{refend}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==扩展阅读 Further reading ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{refbegin|30em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* DH Author, 'Why Are There Still So Many Jobs? The History and Future of Workplace Automation' (2015) 29(3) Journal of Economic Perspectives 3.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[Margaret Boden|Boden, Margaret]], ''Mind As Machine'', [[Oxford University Press]], 2006.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[Kenneth Cukier|Cukier, Kenneth]], &amp;quot;Ready for Robots?  How to Think about the Future of AI&amp;quot;, ''[[Foreign Affairs]]'', vol. 98, no. 4 (July/August 2019), pp.&amp;amp;nbsp;192–98.  [[George Dyson (science historian)|George Dyson]], historian of computing, writes (in what might be called &amp;quot;Dyson's Law&amp;quot;) that &amp;quot;Any system simple enough to be understandable will not be complicated enough to behave intelligently, while any system complicated enough to behave intelligently will be too complicated to understand.&amp;quot; (p.&amp;amp;nbsp;197.)  Computer scientist [[Alex Pentland]] writes:  &amp;quot;Current [[machine learning|AI machine-learning]] [[algorithm]]s are, at their core, dead simple stupid.  They work, but they work by brute force.&amp;quot; (p.&amp;amp;nbsp;198.)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[Pedro Domingos|Domingos, Pedro]], &amp;quot;Our Digital Doubles:  AI will serve our species, not control it&amp;quot;, ''[[Scientific American]]'', vol. 319, no. 3 (September 2018), pp.&amp;amp;nbsp;88–93.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[Alison Gopnik|Gopnik, Alison]], &amp;quot;Making AI More Human:  Artificial intelligence has staged a revival by starting to incorporate what we know about how children learn&amp;quot;, ''[[Scientific American]]'', vol. 316, no. 6 (June 2017), pp.&amp;amp;nbsp;60–65.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* Johnston, John (2008) ''The Allure of Machinic Life: Cybernetics, Artificial Life, and the New AI'', MIT Press.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[Christof Koch|Koch, Christof]], &amp;quot;Proust among the Machines&amp;quot;, ''[[Scientific American]]'', vol. 321, no. 6 (December 2019), pp.&amp;amp;nbsp;46–49. [[Christof Koch]] doubts the possibility of &amp;quot;intelligent&amp;quot; machines attaining [[consciousness]], because &amp;quot;[e]ven the most sophisticated [[brain simulation]]s are unlikely to produce conscious [[feelings]].&amp;quot; (p.&amp;amp;nbsp;48.) According to Koch, &amp;quot;Whether machines can become [[sentience|sentient]] [is important] for [[ethics|ethical]] reasons. If computers experience life through their own senses, they cease to be purely a means to an end determined by their usefulness to... humans. Per GNW [the [[Global Workspace Theory#Global neuronal workspace|Global Neuronal Workspace]] theory], they turn from mere objects into subjects... with a [[point of view (philosophy)|point of view]].... Once computers' [[cognitive abilities]] rival those of humanity, their impulse to push for legal and political [[rights]] will become irresistible – the right not to be deleted, not to have their memories wiped clean, not to suffer [[pain]] and degradation. The alternative, embodied by IIT [Integrated Information Theory], is that computers will remain only supersophisticated machinery, ghostlike empty shells, devoid of what we value most: the feeling of life itself.&amp;quot; (p.&amp;amp;nbsp;49.)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[Gary Marcus|Marcus, Gary]], &amp;quot;Am I Human?: Researchers need new ways to distinguish artificial intelligence from the natural kind&amp;quot;, ''[[Scientific American]]'', vol. 316, no. 3 (March 2017), pp.&amp;amp;nbsp;58–63.  A stumbling block to AI has been an incapacity for reliable [[disambiguation]].  An example is the &amp;quot;pronoun disambiguation problem&amp;quot;:  a machine has no way of determining to whom or what a [[pronoun]] in a sentence refers. (p.&amp;amp;nbsp;61.)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* E McGaughey, 'Will Robots Automate Your Job Away? Full Employment, Basic Income, and Economic Democracy' (2018) [https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3044448 SSRN, part 2(3)].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[George Musser]], &amp;quot;[[Artificial Imagination]]:  How machines could learn [[creativity]] and [[common sense]], among other human qualities&amp;quot;, ''[[Scientific American]]'', vol. 320, no. 5 (May 2019), pp.&amp;amp;nbsp;58–63.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* Myers, Courtney Boyd ed. (2009). [https://www.forbes.com/2009/06/22/singularity-robots-computers-opinions-contributors-artificial-intelligence-09_land.html &amp;quot;The AI Report&amp;quot;]. ''Forbes'' June 2009&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite book |last=Raphael |first=Bertram |author-link=Bertram Raphael |year=1976 |title=The Thinking Computer |publisher=W.H.Freeman and Company |isbn=978-0-7167-0723-3 |url=https://archive.org/details/thinkingcomputer00raph }}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* Scharre, Paul, &amp;quot;Killer Apps:  The Real Dangers of an AI Arms Race&amp;quot;, ''[[Foreign Affairs]]'', vol. 98, no. 3 (May/June 2019), pp.&amp;amp;nbsp;135–44.  &amp;quot;Today's AI technologies are powerful but unreliable.  Rules-based systems cannot deal with circumstances their programmers did not anticipate.  Learning systems are limited by the data on which they were trained.  AI failures have already led to tragedy.  Advanced autopilot features in cars, although they perform well in some circumstances, have driven cars without warning into trucks, concrete barriers, and parked cars.  In the wrong situation, AI systems go from supersmart to superdumb in an instant.  When an enemy is trying to manipulate and hack an AI system, the risks are even greater.&amp;quot;  (p.&amp;amp;nbsp;140.) &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite journal | last1 = Serenko | first1 = Alexander | year = 2010 | title = The development of an AI journal ranking based on the revealed preference approach | url = http://www.aserenko.com/papers/JOI_Serenko_AI_Journal_Ranking_Published.pdf | journal = Journal of Informetrics | volume = 4 | issue = 4| pages = 447–459 | doi = 10.1016/j.joi.2010.04.001}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite journal | last1 = Serenko | first1 = Alexander | author2=Michael Dohan | year = 2011 | title = Comparing the expert survey and citation impact journal ranking methods: Example from the field of Artificial Intelligence | url = http://www.aserenko.com/papers/JOI_AI_Journal_Ranking_Serenko.pdf | journal = Journal of Informetrics | volume = 5 | issue = 4| pages = 629–649 | doi = 10.1016/j.joi.2011.06.002}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* Sun, R. &amp;amp; Bookman, L. (eds.), ''Computational Architectures: Integrating Neural and Symbolic Processes''. Kluwer Academic Publishers, Needham, MA. 1994.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite web&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|url=http://www.technologyreview.com/news/533686/2014-in-computing-breakthroughs-in-artificial-intelligence/&lt;br /&gt;
&lt;br /&gt;
|url=http://www.technologyreview.com/news/533686/2014-in-computing-breakthroughs-in-artificial-intelligence/&lt;br /&gt;
&lt;br /&gt;
Http://www.technologyreview.com/news/533686/2014-in-computing-breakthroughs-in-artificial-intelligence/ &lt;br /&gt;
&lt;br /&gt;
|title=2014 in Computing: Breakthroughs in Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
|title=2014 in Computing: Breakthroughs in Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
2014年《计算机: 人工智能的突破》&lt;br /&gt;
&lt;br /&gt;
|author=Tom Simonite&lt;br /&gt;
&lt;br /&gt;
|author=Tom Simonite&lt;br /&gt;
&lt;br /&gt;
作者: Tom Simonite&lt;br /&gt;
&lt;br /&gt;
|date=29 December 2014&lt;br /&gt;
&lt;br /&gt;
|date=29 December 2014&lt;br /&gt;
&lt;br /&gt;
2014年12月29日&lt;br /&gt;
&lt;br /&gt;
|work=MIT Technology Review&lt;br /&gt;
&lt;br /&gt;
|work=MIT Technology Review&lt;br /&gt;
&lt;br /&gt;
麻省理工学院技术评论&lt;br /&gt;
&lt;br /&gt;
|accessdate=&lt;br /&gt;
&lt;br /&gt;
|accessdate=&lt;br /&gt;
&lt;br /&gt;
访问日期&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* [[Adam Tooze|Tooze, Adam]], &amp;quot;Democracy and Its Discontents&amp;quot;, ''[[The New York Review of Books]]'', vol. LXVI, no. 10 (6 June 2019), pp.&amp;amp;nbsp;52–53, 56–57.  &amp;quot;Democracy has no clear answer for the mindless operation of [[bureaucracy|bureaucratic]] and [[technology|technological power]].  We may indeed be witnessing its extension in the form of artificial intelligence and [[robotics]].  Likewise, after decades of dire warning, the [[environmentalism|environmental problem]] remains fundamentally unaddressed.... Bureaucratic overreach and environmental catastrophe are precisely the kinds of slow-moving existential challenges that democracies deal with very badly.... Finally, there is the threat du jour:  [[corporation]]s and the technologies they promote.&amp;quot;  (pp.&amp;amp;nbsp;56–57.)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{refend}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==外部链接 External links ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--======================== {{No more links}} ============================&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--========================  ============================&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--========================  ============================&lt;br /&gt;
&lt;br /&gt;
                        | PLEASE BE CAUTIOUS IN ADDING MORE LINKS TO THIS ARTICLE. Wikipedia  |&lt;br /&gt;
&lt;br /&gt;
                        | PLEASE BE CAUTIOUS IN ADDING MORE LINKS TO THIS ARTICLE. Wikipedia  |&lt;br /&gt;
&lt;br /&gt;
请谨慎添加更多链接到本文。维基百科 | &lt;br /&gt;
&lt;br /&gt;
                        | is not a collection of links nor should it be used for advertising. |&lt;br /&gt;
&lt;br /&gt;
                        | is not a collection of links nor should it be used for advertising. |&lt;br /&gt;
&lt;br /&gt;
不是一个链接的集合，也不应该用来做广告。|&lt;br /&gt;
&lt;br /&gt;
                        |                                                                     |&lt;br /&gt;
&lt;br /&gt;
                        |                                                                     |&lt;br /&gt;
&lt;br /&gt;
                        |                                                                     |&lt;br /&gt;
&lt;br /&gt;
                        |           Excessive or inappropriate links WILL BE DELETED.         |&lt;br /&gt;
&lt;br /&gt;
                        |           Excessive or inappropriate links WILL BE DELETED.         |&lt;br /&gt;
&lt;br /&gt;
| 过多或不适当的链接将被删除。|&lt;br /&gt;
&lt;br /&gt;
                        | See [[Wikipedia:External links]] &amp;amp; [[Wikipedia:Spam]] for details.  |&lt;br /&gt;
&lt;br /&gt;
                        | See Wikipedia:External links &amp;amp; Wikipedia:Spam for details.  |&lt;br /&gt;
&lt;br /&gt;
查看维基百科: 外部链接和维基百科: 垃圾信息。|&lt;br /&gt;
&lt;br /&gt;
                        |                                                                     |&lt;br /&gt;
&lt;br /&gt;
                        |                                                                     |&lt;br /&gt;
&lt;br /&gt;
                        |                                                                     |&lt;br /&gt;
&lt;br /&gt;
                        | If there are already plentiful links, please propose additions or   |&lt;br /&gt;
&lt;br /&gt;
                        | If there are already plentiful links, please propose additions or   |&lt;br /&gt;
&lt;br /&gt;
如果已经有大量的链接，请提出附加或 | &lt;br /&gt;
&lt;br /&gt;
                        | replacements on this article's discussion page, or submit your link |&lt;br /&gt;
&lt;br /&gt;
                        | replacements on this article's discussion page, or submit your link |&lt;br /&gt;
&lt;br /&gt;
更新本文讨论页面，或者提交你的链接&lt;br /&gt;
&lt;br /&gt;
                        | to the relevant category at the Open Directory Project (dmoz.org)   |&lt;br /&gt;
&lt;br /&gt;
                        | to the relevant category at the Open Directory Project (dmoz.org)   |&lt;br /&gt;
&lt;br /&gt;
| 相关类别的 dmoz (dmoz. org) | &lt;br /&gt;
&lt;br /&gt;
                        | and link back to that category using the {{dmoz}} template.         |&lt;br /&gt;
&lt;br /&gt;
                        | and link back to that category using the  template.         |&lt;br /&gt;
&lt;br /&gt;
并使用该模板链接回该类别。|&lt;br /&gt;
&lt;br /&gt;
                        ======================= {{No more links}} =============================--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
                        =======================  =============================--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
                        =======================  =============================--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Sister project links|voy=no|species=no|d=Q11660|v=Portal:Artificial intelligence|n=no|s=no|c=Category:Artificial intelligence|wikt=artificial intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{IEP|art-inte|Artificial Intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite SEP |url-id=logic-ai |title=Logic and Artificial Intelligence |last=Thomason |first=Richmond}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [http://aitopics.org/ AITopics] – A large directory of links and other resources maintained by the [[Association for the Advancement of Artificial Intelligence]], the leading organization of academic AI researchers.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://www.bbc.co.uk/programmes/p003k9fc Artificial Intelligence], BBC Radio 4 discussion with John Agar, Alison Adam &amp;amp; Igor Aleksander (''In Our Time'', Dec. 8, 2005)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Navboxes&lt;br /&gt;
&lt;br /&gt;
{{Navboxes&lt;br /&gt;
&lt;br /&gt;
{导航框&lt;br /&gt;
&lt;br /&gt;
|list=&lt;br /&gt;
&lt;br /&gt;
|list=&lt;br /&gt;
&lt;br /&gt;
名单&lt;br /&gt;
&lt;br /&gt;
{{John McCarthy navbox}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{philosophy of mind}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{philosophy of science}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Evolutionary computation}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Computable knowledge}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Computer science}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{emerging technologies|topics=yes|infocom=yes}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Robotics}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
{{Existential_risk_from_artificial_intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Philosophy of mind}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Cybernetics}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Computer science}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Evolutionary computation}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{emerging technologies|topics=yes|infocom=yes}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Glossaries of science and engineering}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Authority control}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:Artificial Intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Artificial intelligence| ]]&amp;lt;!--please leave the empty space as standard--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;!--please leave the empty space as standard--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
!-请离开空白的空间作为标准 -- &lt;br /&gt;
&lt;br /&gt;
[[Category:Cybernetics]]&lt;br /&gt;
&lt;br /&gt;
Category:Cybernetics&lt;br /&gt;
&lt;br /&gt;
类别: 控制论&lt;br /&gt;
&lt;br /&gt;
[[Category:Formal sciences]]&lt;br /&gt;
&lt;br /&gt;
Category:Formal sciences&lt;br /&gt;
&lt;br /&gt;
类别: 正规科学&lt;br /&gt;
&lt;br /&gt;
[[Category:Technology in society]]&lt;br /&gt;
&lt;br /&gt;
Category:Technology in society&lt;br /&gt;
&lt;br /&gt;
类别: 社会中的技术&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational neuroscience]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational neuroscience&lt;br /&gt;
&lt;br /&gt;
类别: 计算神经科学&lt;br /&gt;
&lt;br /&gt;
[[Category:Emerging technologies]]&lt;br /&gt;
&lt;br /&gt;
Category:Emerging technologies&lt;br /&gt;
&lt;br /&gt;
类别: 新兴技术&lt;br /&gt;
&lt;br /&gt;
[[Category:Unsolved problems in computer science]]&lt;br /&gt;
&lt;br /&gt;
Category:Unsolved problems in computer science&lt;br /&gt;
&lt;br /&gt;
类别: 计算机科学中未解决的问题&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Artificial intelligence]]. Its edit history can be viewed at [[人工智能/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;/div&gt;</summary>
		<author><name>Pumpkin南瓜</name></author>
	</entry>
	<entry>
		<id>https://wiki.swarma.org/index.php?title=%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD&amp;diff=19669</id>
		<title>人工智能</title>
		<link rel="alternate" type="text/html" href="https://wiki.swarma.org/index.php?title=%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD&amp;diff=19669"/>
		<updated>2020-12-04T14:51:59Z</updated>

		<summary type="html">&lt;p&gt;Pumpkin南瓜：/* 经济学 Economics */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;br&amp;gt;&lt;br /&gt;
此词条已由Thingamabob初步翻译。&lt;br /&gt;
&lt;br /&gt;
 本词条的“方法”之前所有部分已有[[用户:Paradoxist-Paradoxer|Paradoxist@Paradoxer]]审校。翻译老哥tql！&lt;br /&gt;
 本词条的“方法”、“工具”、“伦理”部分已有[[用户:Qige96|Ricky]]审校。为本词条的翻译点赞！&lt;br /&gt;
&lt;br /&gt;
! -- 定义 -- &lt;br /&gt;
&lt;br /&gt;
In [[computer science]], '''artificial intelligence''' ('''AI'''), sometimes called '''machine intelligence''', is [[intelligence]] demonstrated by [[machine]]s, in contrast to the '''natural intelligence'''&amp;lt;!--boldface per WP:R#PLA--&amp;gt; displayed by [[human intelligence|humans]] and [[animal cognition|animals]]. Leading AI textbooks define the field as the study of &amp;quot;[[intelligent agent]]s&amp;quot;: any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals.&amp;lt;ref name=&amp;quot;Definition of AI&amp;quot;/&amp;gt; Colloquially, the term &amp;quot;artificial intelligence&amp;quot; is often used to describe machines (or computers) that mimic &amp;quot;cognitive&amp;quot; functions that humans associate with the [[human mind]], such as &amp;quot;learning&amp;quot; and &amp;quot;problem solving&amp;quot;.{{sfn|Russell|Norvig|2009|p=2}}&lt;br /&gt;
&lt;br /&gt;
In computer science, artificial intelligence (AI), sometimes called machine intelligence, is intelligence demonstrated by machines, in contrast to the natural intelligence&amp;lt;!--boldface per WP:R#PLA--&amp;gt; displayed by humans and animals. Leading AI textbooks define the field as the study of &amp;quot;intelligent agents&amp;quot;: any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals. Colloquially, the term &amp;quot;artificial intelligence&amp;quot; is often used to describe machines (or computers) that mimic &amp;quot;cognitive&amp;quot; functions that humans associate with the human mind, such as &amp;quot;learning&amp;quot; and &amp;quot;problem solving&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color=#ff8000&amp;gt;人工智能 Artificial Intelligence,AI&amp;lt;/font&amp;gt;'''，在计算机科学中亦称'''&amp;lt;font color=#ff8000&amp;gt;机器智能 Machine Intelligence&amp;lt;/font&amp;gt;'''。与人和其他动物表现出的'''&amp;lt;font color=#ff8000&amp;gt;自然智能 Nature Intelligence&amp;lt;/font&amp;gt;'''相反，AI指由人制造出来的机器所表现出来的智能。前沿AI的教科书把AI定义为对“智能体”的研究：智能体指任何感知周围环境并采取行动以最大化其成功实现目标的机会的机器。通俗来说，“AI”就是机器模仿人类与人类大脑相关的“认知”功能：例如“学习”和“解决问题”&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
As machines become increasingly capable, tasks considered to require &amp;quot;intelligence&amp;quot; are often removed from the definition of AI, a phenomenon known as the [[AI effect]].&amp;lt;ref&amp;gt;{{Harvnb|McCorduck|2004|p=204}}&amp;lt;/ref&amp;gt; A quip in Tesler's Theorem says &amp;quot;AI is whatever hasn't been done yet.&amp;quot;&amp;lt;ref&amp;gt;{{Cite web|url=http://people.cs.georgetown.edu/~maloof/cosc270.f17/cosc270-intro-handout.pdf|title=Artificial Intelligence: An Introduction, p. 37|last=Maloof|first=Mark|date=|website=georgetown.edu|access-date=}}&amp;lt;/ref&amp;gt; For instance, [[optical character recognition]] is frequently excluded from things considered to be AI,&amp;lt;ref&amp;gt;{{cite web|url=https://hackernoon.com/how-ai-is-getting-groundbreaking-changes-in-talent-management-and-hr-tech-d24ty3zzd|title= How AI Is Getting Groundbreaking Changes In Talent Management And HR Tech|publisher=Hackernoon}}&amp;lt;/ref&amp;gt; having become a routine technology.&amp;lt;ref&amp;gt;{{cite magazine |last=Schank |first=Roger C.  |title=Where's the AI |magazine=AI magazine |volume=12 |issue=4 |year=1991|p=38}}&amp;lt;/ref&amp;gt; Modern machine capabilities generally classified as AI include successfully [[natural language understanding|understanding human speech]],{{sfn|Russell|Norvig|2009}} competing at the highest level in [[strategic game]] systems (such as [[chess]] and [[Go (game)|Go]]),&amp;lt;ref name=&amp;quot;bbc-alphago&amp;quot;/&amp;gt; [[autonomous car|autonomously operating cars]], intelligent routing in [[content delivery network]]s, and [[military simulations]]&amp;lt;ref&amp;gt;{{Cite web|url=https://www.ai.mil/docs/Understanding%20AI%20Technology.pdf|title=Department of Defense Joint AI Center - Understanding AI Technology|last=Allen|first=Gregory|date=April 2020|website=AI.mil - The official site of the Department of Defense Joint Artificial Intelligence Center|url-status=live|archive-url=|archive-date=|access-date=25 April 2020}}&amp;lt;/ref&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color=#00ff00&amp;gt;以下搬运存在尾端缺失！&amp;lt;/font&amp;gt;'''&lt;br /&gt;
'''&amp;lt;font color=#ff0000&amp;gt;As machines become increasingly capable, tasks considered to require &amp;quot;intelligence&amp;quot; are often removed from the definition of AI, a phenomenon known as the AI effect. A quip in Tesler's Theorem says &amp;quot;AI is whatever hasn't been done yet.&amp;quot; For instance, optical character recognition is frequently excluded from things considered to be AI, having become a routine technology. Modern machine capabilities generally classified as AI include successfully understanding human speech, competing at the highest level in strategic game systems (such as chess and Go),&amp;lt;/font&amp;gt;'''&lt;br /&gt;
&lt;br /&gt;
AI的范围也有争议：随着机器的能力越来越大，很多被认为需要“智能”的任务被一个个从AI范畴中除名。这就是所谓的AI效应。'''&amp;lt;font color=#f32cd32&amp;gt;泰斯勒定理&amp;lt;/font&amp;gt;'''巧妙地把AI描述为“AI是任何还没有实现的东西。”所以比如光学字符识别就往往不再被认为属于AI行列，而已经成为了一种常规技术。被认为是AI的现代机器功能包括顺利理解人类口语，在策略型游戏中完成高水平的竞赛（例如国际象棋和围棋）,自动驾驶汽车，内容分发网络和军事模拟的智能规划。&lt;br /&gt;
&lt;br /&gt;
  --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）1. tasks considered to require &amp;quot;intelligence&amp;quot; are often removed from the definition of AI,很多被认为需要“智能”的任务不再被认为是AI  一句为意译  ；2.Tesler's Theorem（暂译为特斯勒定理）未找到确切翻译；&lt;br /&gt;
'''&amp;lt;font color=#0000ff&amp;gt;已解决！&amp;lt;/font&amp;gt;'''&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- SUMMARIZING HISTORY --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- SUMMARIZING HISTORY --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——总结历史——&lt;br /&gt;
&lt;br /&gt;
Artificial intelligence was founded as an academic discipline in 1955, and in the years since has experienced several waves of optimism,&amp;lt;ref name=&amp;quot;Optimism of early AI&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;AI in the 80s&amp;quot;/&amp;gt; followed by disappointment and the loss of funding (known as an &amp;quot;[[AI winter]]&amp;quot;),&amp;lt;ref name=&amp;quot;First AI winter&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Second AI winter&amp;quot;/&amp;gt; followed by new approaches, success and renewed funding.&amp;lt;ref name=&amp;quot;AI in the 80s&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;AI in 2000s&amp;quot;/&amp;gt; For most of its history, AI research has been divided into sub-fields that often fail to communicate with each other.&amp;lt;ref name=&amp;quot;Fragmentation of AI&amp;quot;/&amp;gt; These sub-fields are based on technical considerations, such as particular goals (e.g. &amp;quot;[[robotics]]&amp;quot; or &amp;quot;[[machine learning]]&amp;quot;),&amp;lt;ref name=&amp;quot;Problems of AI&amp;quot;/&amp;gt; the use of particular tools (&amp;quot;[[logic]]&amp;quot; or [[artificial neural network]]s), or deep philosophical differences.&amp;lt;ref name=&amp;quot;Biological intelligence vs. intelligence in general&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Neats vs. scruffies&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Symbolic vs. sub-symbolic&amp;quot;/&amp;gt; Sub-fields have also been based on social factors (particular institutions or the work of particular researchers).&amp;lt;ref name=&amp;quot;Fragmentation of AI&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Artificial intelligence was founded as an academic discipline in 1955, and in the years since has experienced several waves of optimism, followed by disappointment and the loss of funding (known as an &amp;quot;AI winter&amp;quot;), followed by new approaches, success and renewed funding. For most of its history, AI research has been divided into sub-fields that often fail to communicate with each other. These sub-fields are based on technical considerations, such as particular goals (e.g. &amp;quot;robotics&amp;quot; or &amp;quot;machine learning&amp;quot;), the use of particular tools (&amp;quot;logic&amp;quot; or artificial neural networks), or deep philosophical differences. Sub-fields have also been based on social factors (particular institutions or the work of particular researchers).&lt;br /&gt;
&lt;br /&gt;
1955年AI作为一门学科被建立起来，后来经历过几段乐观时期与紧随而来的亏损以及缺乏资金的困境（也就是“AI寒冬”），每次又找到了新的出路，取得了新的成果和新的投资。对于大多数描述AI的历史，AI研究被划分为互不关联的子领域。人们通常把技术考量作为这些子领域的划分依据，比如特殊目标（例如“机器人学”或者“机器学习”），特殊工具的使用（“逻辑”或者人工神经网络），或者在哲学层面深层次的区别。子领域的划分也与社会因素有关（比如某些特定机构或者特定研究者所做的工作）。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- SUMMARIZING PROBLEMS, APPROACHES, TOOLS --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- SUMMARIZING PROBLEMS, APPROACHES, TOOLS --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——总结问题、方法、工具——&lt;br /&gt;
&lt;br /&gt;
The traditional problems (or goals) of AI research include [[automated reasoning|reasoning]], [[knowledge representation]], [[Automated planning and scheduling|planning]], [[machine learning|learning]], [[natural language processing]], [[machine perception|perception]] and the ability to move and manipulate objects.&amp;lt;ref name=&amp;quot;Problems of AI&amp;quot;/&amp;gt; [[artificial general intelligence|General intelligence]] is among the field's long-term goals.&amp;lt;ref name=&amp;quot;General intelligence&amp;quot;/&amp;gt; Approaches include [[#Statistical|statistical methods]], [[#Sub-symbolic|computational intelligence]], and [[#Symbolic|traditional symbolic AI]]. Many tools are used in AI, including versions of [[#Search and optimization|search and mathematical optimization]], [[artificial neural network]]s, and [[#Probabilistic methods for uncertain reasoning|methods based on statistics, probability and economics]]. The AI field draws upon [[computer science]], [[Information engineering (field)|information engineering]], [[mathematics]], [[psychology]], [[linguistics]], [[philosophy]], and many other fields.&lt;br /&gt;
&lt;br /&gt;
The traditional problems (or goals) of AI research include reasoning, knowledge representation, planning, learning, natural language processing, perception and the ability to move and manipulate objects. General intelligence is among the field's long-term goals. Approaches include statistical methods, computational intelligence, and traditional symbolic AI. Many tools are used in AI, including versions of search and mathematical optimization, artificial neural networks, and methods based on statistics, probability and economics. The AI field draws upon computer science, information engineering, mathematics, psychology, linguistics, philosophy, and many other fields.&lt;br /&gt;
&lt;br /&gt;
AI研究的传统问题或者说目标包括'''&amp;lt;font color=#ff8000&amp;gt;自动推理 Automated Reasoning&amp;lt;/font&amp;gt; '''，'''&amp;lt;font color=#ff8000&amp;gt;知识表示 Knowledge Representation&amp;lt;/font&amp;gt;'''，'''&amp;lt;font color=#ff8000&amp;gt;自动规划 Automated Planning and Scheduling&amp;lt;/font&amp;gt;'''，'''&amp;lt;font color=#ff8000&amp;gt;学习 Learning&amp;lt;/font&amp;gt;'''，'''&amp;lt;font color=#ff8000&amp;gt;自然语言处理 Natural Language Processing&amp;lt;/font&amp;gt;'''，感知以及移动和熟练操控物体的能力。实现通用AI目前仍然是该领域的长远目标。比较流行的研究方法包括统计方法，计算智能和传统AI所用的符号计算。目前有大量的工具应用于AI，其中包括搜索和数学优化、人工神经网络以及基于统计学、概率论和经济学的算法。AI领域涉及计算机科学，信息工程，数学，心理学，语言学，哲学及其他学科。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- SUMMARISING FICTION/SPECULATION, PHILOSOPHY, HISTORY --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- SUMMARISING FICTION/SPECULATION, PHILOSOPHY, HISTORY --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——总结小说 / 推测，哲学，历史——&lt;br /&gt;
&lt;br /&gt;
The field was founded on the assumption that [[human intelligence]] &amp;quot;can be so precisely described that a machine can be made to simulate it&amp;quot;.&amp;lt;ref&amp;gt;See the [[Dartmouth Workshop|Dartmouth proposal]], under [[#Philosophy|Philosophy]], below.&amp;lt;/ref&amp;gt; This raises philosophical arguments about the nature of the [[mind]] and the ethics of creating artificial beings endowed with human-like intelligence. These issues have been explored by [[History of AI#AI in myth, fiction and speculation|myth]], [[artificial intelligence in fiction|fiction]] and [[philosophy of AI|philosophy]] since [[ancient history|antiquity]].&amp;lt;ref name=&amp;quot;McCorduck's thesis&amp;quot;/&amp;gt; Some people also consider AI to be [[existential risk|a danger to humanity]] if it progresses unabated.&amp;lt;ref&amp;gt;{{cite web|url=https://betanews.com/2016/10/21/artificial-intelligence-stephen-hawking/|title=Stephen Hawking believes AI could be mankind's last accomplishment|date=21 October 2016|website=BetaNews|url-status=live|archiveurl=https://web.archive.org/web/20170828183930/https://betanews.com/2016/10/21/artificial-intelligence-stephen-hawking/|archivedate=28 August 2017|df=dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;pmid31835078&amp;quot;&amp;gt;{{cite journal |vauthors=Lombardo P, Boehm I, Nairz K |title=RadioComics – Santa Claus and the future of radiology |journal=Eur J Radiol |volume=122 |issue=1 |pages=108771 |year=2020 |pmid=31835078 |doi=10.1016/j.ejrad.2019.108771|doi-access=free }}&amp;lt;/ref&amp;gt; Others believe that AI, unlike previous technological revolutions, will create a [[Technological unemployment#21st century|risk of mass unemployment]].&amp;lt;ref name=&amp;quot;guardian jobs debate&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The field was founded on the assumption that human intelligence &amp;quot;can be so precisely described that a machine can be made to simulate it&amp;quot;. This raises philosophical arguments about the nature of the mind and the ethics of creating artificial beings endowed with human-like intelligence. These issues have been explored by myth, fiction and philosophy since antiquity. Others believe that AI, unlike previous technological revolutions, will create a risk of mass unemployment.&lt;br /&gt;
&lt;br /&gt;
这一领域是建立在人类智能“可以被精确描述从而使机器可以模拟”的观点上的。这一观点引出了关于思维的本质和创造具有类人智能AI的伦理方面的哲学争论，于是自古以来就有一些神话、小说以及哲学对此类问题展开过探讨。一些人认为AI的发展不会威胁人类生存；但另一些人认为AI与以前的技术革命不同，它将带来大规模失业的风险。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- SUMMARIZING APPLICATIONS, STATE OF THE ART --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- SUMMARIZING APPLICATIONS, STATE OF THE ART --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——总结应用，最新进展——&lt;br /&gt;
&lt;br /&gt;
In the twenty-first century, AI techniques have experienced a resurgence following concurrent advances in [[Computer performance|computer power]], large amounts of [[big data|data]], and theoretical understanding; and AI techniques have become an essential part of the [[technology industry]], helping to solve many challenging problems in computer science, [[software engineering]] and [[operations research]].&amp;lt;ref name=&amp;quot;AI widely used&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;AI in 2000s&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In the twenty-first century, AI techniques have experienced a resurgence following concurrent advances in computer power, large amounts of data, and theoretical understanding; and AI techniques have become an essential part of the technology industry, helping to solve many challenging problems in computer science, software engineering and operations research.&lt;br /&gt;
&lt;br /&gt;
在二十一世纪，随着计算机能力、大量数据和理论认识的同步发展，人工智能技术经历了一次复兴; 人工智能技术已成为技术工业的重要组成部分，帮助解决了计算机科学、软件工程和运筹学中的许多具有挑战性的问题。&lt;br /&gt;
&lt;br /&gt;
{{toclimit|3}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== 历史 History ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- THIS IS A SOCIAL HISTORY. TECHNICAL HISTORY IS COVERED IN THE &amp;quot;APPROACHES&amp;quot; AND &amp;quot;TOOLS&amp;quot; SECTIONS. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- THIS IS A SOCIAL HISTORY. TECHNICAL HISTORY IS COVERED IN THE &amp;quot;APPROACHES&amp;quot; AND &amp;quot;TOOLS&amp;quot; SECTIONS. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这是一部社会史。“方法”和“工具”部分介绍了技术历史。--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{{Main|History of artificial intelligence|Timeline of artificial intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Didrachm Phaistos obverse CdM.jpg|thumb|Silver [[didrachma]] from [[Crete]] depicting [[Talos]], an ancient mythical [[automaton]] with artificial intelligence]银[来自克里特岛的描绘塔罗斯的狄拉克马，一种古代神话中的具有人工智能的自动机]]&lt;br /&gt;
&lt;br /&gt;
Silver [[didrachma from Crete depicting Talos, an ancient mythical automaton with artificial intelligence]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- PRE-20TH CENTURY. MAYBE TO BE KEPT SHORT. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- PRE-20TH CENTURY. MAYBE TO BE KEPT SHORT. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! -- 20世纪前。也许是为了保持简短。--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Thought-capable [[artificial being]]s appeared as [[storytelling device]]s in antiquity,&amp;lt;ref name=&amp;quot;AI in myth&amp;quot;/&amp;gt; and have been common in fiction, as in [[Mary Shelley]]'s ''[[Frankenstein]]'' or [[Karel Čapek]]'s ''[[R.U.R. (Rossum's Universal Robots)]]''.&amp;lt;!-- PLEASE DON'T ADD MORE EXAMPLES. THIS IS ENOUGH. SEE SECTION AT BOTTOM OF ARTICLE ON SPECULATION.--&amp;gt;&amp;lt;ref name=&amp;quot;AI in early science fiction&amp;quot;/&amp;gt; These characters and their fates raised many of the same issues now discussed in the [[ethics of artificial intelligence]].&amp;lt;ref name=&amp;quot;McCorduck's thesis&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Thought-capable artificial beings appeared as storytelling devices in antiquity, and have been common in fiction, as in Mary Shelley's Frankenstein or Karel Čapek's R.U.R. (Rossum's Universal Robots).&amp;lt;!-- PLEASE DON'T ADD MORE EXAMPLES. THIS IS ENOUGH. SEE SECTION AT BOTTOM OF ARTICLE ON SPECULATION.--&amp;gt; These characters and their fates raised many of the same issues now discussed in the ethics of artificial intelligence.&lt;br /&gt;
&lt;br /&gt;
具有思维能力的人造生物在古代以故事讲述者的方式出现，在小说中也很常见。比如玛丽 · 雪莱的《弗兰肯斯坦》和卡雷尔 · 阿佩克的《罗素姆的万能机器人》(Rossum's Universal Robots，R.U.R.) ——小说中的角色和他们的命运向人们提出了许多现在在人工智能伦理学中讨论的同样的问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- MAJOR INTELLECTUAL PRECURSORS: LOGIC, THEORY OF COMPUTATION, CYBERNETICS, INFORMATION THEORY, EARLY NEURAL NETS --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- MAJOR INTELLECTUAL PRECURSORS: LOGIC, THEORY OF COMPUTATION, CYBERNETICS, INFORMATION THEORY, EARLY NEURAL NETS --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——主要智能前体: 逻辑学、计算理论、控制论、信息论、早期神经网络&lt;br /&gt;
&lt;br /&gt;
The study of mechanical or [[formal reasoning|&amp;quot;formal&amp;quot; reasoning]] began with [[philosopher]]s and mathematicians in antiquity. The study of mathematical logic led directly to [[Alan Turing]]'s [[theory of computation]], which suggested that a machine, by shuffling symbols as simple as &amp;quot;0&amp;quot; and &amp;quot;1&amp;quot;, could simulate any conceivable act of mathematical deduction. This insight, that digital computers can simulate any process of formal reasoning, is known as the [[Church–Turing thesis]].&amp;lt;ref name=&amp;quot;Formal reasoning&amp;quot;/&amp;gt; Along with concurrent discoveries in [[Neuroscience|neurobiology]], [[information theory]] and [[cybernetic]]s, this led researchers to consider the possibility of building an electronic brain. Turing proposed changing the question from whether a machine was intelligent, to &amp;quot;whether or not it is possible for machinery to show intelligent behaviour&amp;quot;.&amp;lt;ref&amp;gt;{{Citation | last = Turing | first = Alan | authorlink=Alan Turing | year=1948 | chapter=Machine Intelligence | title = The Essential Turing: The ideas that gave birth to the computer age | editor=Copeland, B. Jack | isbn = 978-0-19-825080-7 | publisher = Oxford University Press | location = Oxford | page = 412 }}&amp;lt;/ref&amp;gt; The first work that is now generally recognized as AI was [[Warren McCullouch|McCullouch]] and [[Walter Pitts|Pitts]]' 1943 formal design for [[Turing-complete]] &amp;quot;artificial neurons&amp;quot;.{{sfn|Russell|Norvig|2009|p=16}}&lt;br /&gt;
&lt;br /&gt;
The study of mechanical or &amp;quot;formal&amp;quot; reasoning began with philosophers and mathematicians in antiquity. The study of mathematical logic led directly to Alan Turing's theory of computation, which suggested that a machine, by shuffling symbols as simple as &amp;quot;0&amp;quot; and &amp;quot;1&amp;quot;, could simulate any conceivable act of mathematical deduction. This insight, that digital computers can simulate any process of formal reasoning, is known as the Church–Turing thesis. The first work that is now generally recognized as AI was McCullouch and Pitts' 1943 formal design for Turing-complete &amp;quot;artificial neurons&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
机械化或者说“形式化”推理的研究始于古代的哲学家和数学家。这些数理逻辑的研究直接催生了图灵的计算理论，即机器可以通过移动如“0”和“1”的简单的符号，就能模拟任何通过数学推演可以想到的过程，这一观点被称为'''&amp;lt;font color=#ff8000&amp;gt;邱奇-图灵论题 Church–Turing Thesis&amp;lt;/font&amp;gt;'''。图灵提出“如果人类无法区分机器和人类的回应，那么机器可以被认为是“智能的”。目前人们公认的最早的AI工作是由麦卡洛和皮茨在1943年正式设计的图灵完备“人工神经元”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
  --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）图灵提出“如果人类无法区分机器和人类的回应，那么机器可以被认为是“智能的” 一句为从原版wiki上补充的&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- THE &amp;quot;GOLDEN YEARS&amp;quot; 1956-1974 --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- THE &amp;quot;GOLDEN YEARS&amp;quot; 1956-1974 --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! -- “黄金年代”1956 -- 1974 --&lt;br /&gt;
&lt;br /&gt;
The field of AI research was born at [[Dartmouth workshop|a workshop]] at [[Dartmouth College]] in 1956,&amp;lt;ref name=&amp;quot;Dartmouth conference&amp;quot;/&amp;gt; where the term &amp;quot;Artificial Intelligence&amp;quot; was coined by [[John McCarthy (computer scientist)|John McCarthy]] to distinguish the field from cybernetics and escape the influence of the cyberneticist [[Norbert Wiener]].&amp;lt;ref&amp;gt;{{cite journal |last=McCarthy |first=John |authorlink=John McCarthy (computer scientist) |title=Review of ''The Question of Artificial Intelligence'' |journal=Annals of the History of Computing |volume=10 |number=3 |year=1988 |pages=224–229}}, collected in {{cite book |last=McCarthy |first=John |authorlink=John McCarthy (computer scientist) |title=Defending AI Research: A Collection of Essays and Reviews |publisher=CSLI |year=1996 |chapter=10. Review of ''The Question of Artificial Intelligence''}}, p. 73, &amp;quot;[O]ne of the reasons for inventing the term &amp;quot;artificial intelligence&amp;quot; was to escape association with &amp;quot;cybernetics&amp;quot;. Its concentration on analog feedback seemed misguided, and I wished to avoid having either to accept Norbert (not Robert) Wiener as a guru or having to argue with him.&amp;quot;&amp;lt;/ref&amp;gt; Attendees [[Allen Newell]] ([[Carnegie Mellon University|CMU]]), [[Herbert A. Simon|Herbert Simon]] (CMU), John McCarthy ([[Massachusetts Institute of Technology|MIT]]), [[Marvin Minsky]] (MIT) and [[Arthur Samuel]] ([[IBM]]) became the founders and leaders of AI research.&amp;lt;ref name=&amp;quot;Hegemony of the Dartmouth conference attendees&amp;quot;/&amp;gt; They and their students produced programs that the press described as &amp;quot;astonishing&amp;quot;:{{sfn|Russell|Norvig|2003|p=18|quote=it was astonishing whenever a computer did anything kind of smartish}} computers were learning [[draughts|checkers]] strategies (c. 1954)&amp;lt;ref&amp;gt;Schaeffer J. (2009) Didn't Samuel Solve That Game?. In: One Jump Ahead. Springer, Boston, MA&amp;lt;/ref&amp;gt; (and by 1959 were reportedly playing better than the average human),&amp;lt;ref&amp;gt;{{cite journal|last1=Samuel|first1=A. L.|title=Some Studies in Machine Learning Using the Game of Checkers|journal=IBM Journal of Research and Development|date=July 1959|volume=3|issue=3|pages=210–229|doi=10.1147/rd.33.0210|citeseerx=10.1.1.368.2254}}&amp;lt;/ref&amp;gt; solving word problems in algebra, proving [[Theorem|logical theorems]] ([[Logic Theorist]], first run c. 1956) and speaking English.&amp;lt;ref name=&amp;quot;Golden years of AI&amp;quot;/&amp;gt; By the middle of the 1960s, research in the U.S. was heavily funded by the [[DARPA|Department of Defense]]&amp;lt;ref name=&amp;quot;AI funding in the 60s&amp;quot;/&amp;gt; and laboratories had been established around the world.&amp;lt;ref name=&amp;quot;AI in England&amp;quot;/&amp;gt; AI's founders were optimistic about the future: [[Herbert A. Simon|Herbert Simon]] predicted, &amp;quot;machines will be capable, within twenty years, of doing any work a man can do&amp;quot;. [[Marvin Minsky]] agreed, writing, &amp;quot;within a generation&amp;amp;nbsp;... the problem of creating 'artificial intelligence' will substantially be solved&amp;quot;.&amp;lt;ref name=&amp;quot;Optimism of early AI&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The field of AI research was born at a workshop at Dartmouth College in 1956, Attendees Allen Newell (CMU), Herbert Simon (CMU), John McCarthy (MIT), Marvin Minsky (MIT) and Arthur Samuel (IBM) became the founders and leaders of AI research. (and by 1959 were reportedly playing better than the average human), solving word problems in algebra, proving logical theorems (Logic Theorist, first run c. 1956) and speaking English. By the middle of the 1960s, research in the U.S. was heavily funded by the Department of Defense and laboratories had been established around the world. AI's founders were optimistic about the future: Herbert Simon predicted, &amp;quot;machines will be capable, within twenty years, of doing any work a man can do&amp;quot;. Marvin Minsky agreed, writing, &amp;quot;within a generation&amp;amp;nbsp;... the problem of creating 'artificial intelligence' will substantially be solved&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
AI研究于1956年起源于在达特茅斯学院举办的一个研讨会，与会者艾伦·纽厄尔(CMU)，赫伯特·西蒙(CMU)，约翰·麦卡锡(MIT)，马文•明斯基(MIT)和阿瑟·塞缪尔(IBM)成为了AI研究的创始人和领导者。他们和他们的学生做了一个被新闻表述为“叹为观止”的计算机学习策略(以及在1959年就被报道达到人类的平均水平之上) ，解决代数应用题，证明逻辑理论'''&amp;lt;font color=#32cd32&amp;gt;（逻辑理论家）&amp;lt;/font&amp;gt;'''以及说英语。到20世纪60年代中期，美国国防高级研究计划局斥重资支持研究，世界各地纷纷建立研究室。AI的创始人对未来充满乐观: 赫伯特 · 西蒙预言，“二十年内，机器将能完成人能做到的一切工作。”。马文•明斯基对此表示同意，他写道: “在一代人的时间里... ... 创造‘AI’的问题将得到实质性的解决。”&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
  --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）不太明白first run c. 1956的含义&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- FIRST AI WINTER --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- FIRST AI WINTER --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! 第一个人工智能的冬天&lt;br /&gt;
&lt;br /&gt;
They failed to recognize the difficulty of some of the remaining tasks. Progress slowed and in 1974, in response to the criticism of [[Sir James Lighthill]]{{sfn|Lighthill|1973}} and ongoing pressure from the US Congress to fund more productive projects, both the U.S. and British governments cut off exploratory research in AI. The next few years would later be called an &amp;quot;[[AI winter]]&amp;quot;,&amp;lt;ref name=&amp;quot;First AI winter&amp;quot;/&amp;gt; a period when obtaining funding for AI projects was difficult.&lt;br /&gt;
&lt;br /&gt;
They failed to recognize the difficulty of some of the remaining tasks. Progress slowed and in 1974, in response to the criticism of Sir James Lighthill and ongoing pressure from the US Congress to fund more productive projects, both the U.S. and British governments cut off exploratory research in AI. The next few years would later be called an &amp;quot;AI winter&amp;quot;, a period when obtaining funding for AI projects was difficult.&lt;br /&gt;
&lt;br /&gt;
他们没有意识到现存任务的一些困难。研究进程放缓，在1974年，由于詹姆斯·莱特希尔的指责以及美国国会需要分拨基金给其他有成效的项目，美国和英国政府都削减了探索性AI研究项目。接下来的几年被称为“AI寒冬”，在这一时期AI研究很难得到经费。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- BOOM OF THE 1980s, SECOND AI WINTER --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- BOOM OF THE 1980s, SECOND AI WINTER --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! 20世纪80年代的繁荣，第二个人工智能的冬天&lt;br /&gt;
&lt;br /&gt;
In the early 1980s, AI research was revived by the commercial success of [[expert system]]s,&amp;lt;ref name=&amp;quot;Expert systems&amp;quot;/&amp;gt; a form of AI program that simulated the knowledge and analytical skills of human experts. By 1985, the market for AI had reached over a billion dollars. At the same time, Japan's [[fifth generation computer]] project inspired the U.S and British governments to restore funding for [[academic research]].&amp;lt;ref name=&amp;quot;AI in the 80s&amp;quot;/&amp;gt; However, beginning with the collapse of the [[Lisp Machine]] market in 1987, AI once again fell into disrepute, and a second, longer-lasting hiatus began.&amp;lt;ref name=&amp;quot;Second AI winter&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In the early 1980s, AI research was revived by the commercial success of expert systems, a form of AI program that simulated the knowledge and analytical skills of human experts. By 1985, the market for AI had reached over a billion dollars. At the same time, Japan's fifth generation computer project inspired the U.S and British governments to restore funding for academic research. However, beginning with the collapse of the Lisp Machine market in 1987, AI once again fell into disrepute, and a second, longer-lasting hiatus began.&lt;br /&gt;
&lt;br /&gt;
在20世纪80年代初期，由于专家系统在商业上取得的成功，AI研究迎来了复兴，专家系统是一种能够模拟人类专家的知识和分析能力的程序。到1985年，AI市场超过了10亿美元。与此同时，日本的第五代计算机项目促使了美国和英国政府恢复对学术研究的资助。然而，随着1987年 Lisp 机器市场的崩溃，AI再一次遭遇低谷，并陷入了第二次持续更长时间的停滞。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The development of [[metal–oxide–semiconductor]] (MOS) [[very-large-scale integration]] (VLSI), in the form of [[complementary MOS]] (CMOS) [[transistor]] technology, enabled the development of practical [[artificial neural network]] (ANN) technology in the 1980s. A landmark publication in the field was the 1989 book ''Analog VLSI Implementation of Neural Systems'' by Carver A. Mead and Mohammed Ismail.&amp;lt;ref name=&amp;quot;Mead&amp;quot;&amp;gt;{{cite book|url=http://fennetic.net/irc/Christopher%20R.%20Carroll%20Carver%20Mead%20Mohammed%20Ismail%20Analog%20VLSI%20Implementation%20of%20Neural%20Systems.pdf|title=Analog VLSI Implementation of Neural Systems|date=8 May 1989|publisher=[[Kluwer Academic Publishers]]|isbn=978-1-4613-1639-8|last1=Mead|first1=Carver A.|last2=Ismail|first2=Mohammed|series=The Kluwer International Series in Engineering and Computer Science|volume=80|location=Norwell, MA|doi=10.1007/978-1-4613-1639-8}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The development of metal–oxide–semiconductor (MOS) very-large-scale integration (VLSI), in the form of complementary MOS (CMOS) transistor technology, enabled the development of practical artificial neural network (ANN) technology in the 1980s. A landmark publication in the field was the 1989 book Analog VLSI Implementation of Neural Systems by Carver A. Mead and Mohammed Ismail.&lt;br /&gt;
&lt;br /&gt;
20世纪80年代，'''&amp;lt;font color=#ff8000&amp;gt;互补金属氧化物半导体；Complementary Metal Oxide Semiconductor，CMOS&amp;lt;/font&amp;gt;'''技术的出现带来了'''&amp;lt;font color=#ff8000&amp;gt;金属氧化物半导体；Metal Oxide Semiconductor，MOS&amp;lt;/font&amp;gt;''''''&amp;lt;font color=#ff8000&amp;gt;超大规模集成电路；Very Large Scale Integration，VLSI&amp;lt;/font&amp;gt;'''的发展，使实用的'''&amp;lt;font color=#ff8000&amp;gt;人工神经网络；Artificial Neural Network，ANN&amp;lt;/font&amp;gt;''' 技术得以发展。这一领域里程碑式的出版物是1989年出版的《模拟 VLSI 神经系统的实现》， 作者是卡弗 · a · 米德和穆罕默德 · 伊斯梅尔。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- FORMAL METHODS RISING IN THE 90s --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- FORMAL METHODS RISING IN THE 90s --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——形式方法兴起于90年代&lt;br /&gt;
&lt;br /&gt;
In the late 1990s and early 21st century, AI began to be used for logistics, [[data mining]], [[medical diagnosis]] and other areas.&amp;lt;ref name=&amp;quot;AI widely used&amp;quot;/&amp;gt; The success was due to increasing computational power (see [[Moore's law]] and [[transistor count]]), greater emphasis on solving specific problems, new ties between AI and other fields (such as [[statistics]], [[economics]] and [[mathematical optimization|mathematics]]), and a commitment by researchers to mathematical methods and scientific standards.&amp;lt;ref name=&amp;quot;Formal methods in AI&amp;quot;/&amp;gt; [[IBM Deep Blue|Deep Blue]] became the first computer chess-playing system to beat a reigning world chess champion, [[Garry Kasparov]], on 11 May 1997.{{sfn|McCorduck|2004|pp=480–483}}&lt;br /&gt;
&lt;br /&gt;
In the late 1990s and early 21st century, AI began to be used for logistics, data mining, medical diagnosis and other areas. The success was due to increasing computational power (see Moore's law and transistor count), greater emphasis on solving specific problems, new ties between AI and other fields (such as statistics, economics and mathematics), and a commitment by researchers to mathematical methods and scientific standards. Deep Blue became the first computer chess-playing system to beat a reigning world chess champion, Garry Kasparov, on 11 May 1997.&lt;br /&gt;
&lt;br /&gt;
在20世纪90年代末和21世纪初，人工智能开始被用于物流、数据挖掘、医疗诊断和其他领域。这种成功归功于计算能力的提高(见摩尔定律和晶体管数量)、对解决特定问题的更大重视、人工智能与其它领域(如统计学、经济学和数学)之间的新联系，以及研究人员对数学方法和科学标准的承诺。1997年5月11日，深蓝成为第一个击败国际象棋卫冕冠军加里·卡斯帕罗夫的计算机国际象棋系统。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--DEEP LEARNING, BIG DATA &amp;amp; MACHINE LEARNING IN THE 2010s --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--DEEP LEARNING, BIG DATA &amp;amp; MACHINE LEARNING IN THE 2010s --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! 2010年代的深度学习、大数据和机器学习&lt;br /&gt;
&lt;br /&gt;
In 2011, a ''[[Jeopardy!]]'' [[quiz show]] exhibition match, [[IBM]]'s [[question answering system]], [[Watson (artificial intelligence software)|Watson]], defeated the two greatest ''Jeopardy!'' champions, [[Brad Rutter]] and [[Ken Jennings]], by a significant margin.{{sfn|Markoff|2011}} [[Moore's law|Faster computers]], algorithmic improvements, and access to [[big data|large amounts of data]] enabled advances in [[machine learning]] and perception; data-hungry [[deep learning]] methods started to dominate accuracy benchmarks [[Deep learning#Deep learning revolution|around 2012]].&amp;lt;ref&amp;gt;{{cite web|title=Ask the AI experts: What's driving today's progress in AI?|url=https://www.mckinsey.com/business-functions/mckinsey-analytics/our-insights/ask-the-ai-experts-whats-driving-todays-progress-in-ai|website=McKinsey &amp;amp; Company|accessdate=13 April 2018|language=en}}&amp;lt;/ref&amp;gt; The [[Kinect]], which provides a 3D body–motion interface for the [[Xbox 360]] and the [[Xbox One]], uses algorithms that emerged from lengthy AI research&amp;lt;ref&amp;gt;{{cite web|url=http://www.i-programmer.info/news/105-artificial-intelligence/2176-kinects-ai-breakthrough-explained.html|title=Kinect's AI breakthrough explained|author=Administrator|work=i-programmer.info|url-status=live|archiveurl=https://web.archive.org/web/20160201031242/http://www.i-programmer.info/news/105-artificial-intelligence/2176-kinects-ai-breakthrough-explained.html|archivedate=1 February 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; as do [[intelligent personal assistant]]s in [[smartphone]]s.&amp;lt;ref&amp;gt;{{cite web|url=http://readwrite.com/2013/01/15/virtual-personal-assistants-the-future-of-your-smartphone-infographic|title=Virtual Personal Assistants &amp;amp; The Future Of Your Smartphone [Infographic]|date=15 January 2013|author=Rowinski, Dan|work=ReadWrite|url-status=live|archiveurl=https://web.archive.org/web/20151222083034/http://readwrite.com/2013/01/15/virtual-personal-assistants-the-future-of-your-smartphone-infographic|archivedate=22 December 2015|df=dmy-all}}&amp;lt;/ref&amp;gt; In March 2016, [[AlphaGo]] won 4 out of 5 games of [[Go (game)|Go]] in a match with Go champion [[Lee Sedol]], becoming the first [[Computer Go|computer Go-playing system]] to beat a professional Go player without [[Go handicaps|handicaps]].&amp;lt;ref name=&amp;quot;bbc-alphago&amp;quot;&amp;gt;{{cite web|url=https://deepmind.com/alpha-go.html|title=AlphaGo – Google DeepMind|url-status=live|archiveurl=https://web.archive.org/web/20160310191926/https://www.deepmind.com/alpha-go.html|archivedate=10 March 2016|df=dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Artificial intelligence: Google's AlphaGo beats Go master Lee Se-dol|url=https://www.bbc.com/news/technology-35785875|accessdate=1 October 2016|work=BBC News|date=12 March 2016|url-status=live|archiveurl=https://web.archive.org/web/20160826103910/http://www.bbc.com/news/technology-35785875|archivedate=26 August 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; In the 2017 [[Future of Go Summit]], [[AlphaGo]] won a [[AlphaGo versus Ke Jie|three-game match]] with [[Ke Jie]],&amp;lt;ref&amp;gt;{{cite journal|url=https://www.wired.com/2017/05/win-china-alphagos-designers-explore-new-ai/|title=After Win in China, AlphaGo's Designers Explore New AI|journal=Wired|date=27 May 2017|url-status=live|archiveurl=https://web.archive.org/web/20170602234726/https://www.wired.com/2017/05/win-china-alphagos-designers-explore-new-ai/|archivedate=2 June 2017|df=dmy-all|last1=Metz|first1=Cade}}&amp;lt;/ref&amp;gt; who at the time continuously held the world No. 1 ranking for two years.&amp;lt;ref&amp;gt;{{cite web|url=http://www.goratings.org/|title=World's Go Player Ratings|date=May 2017|url-status=live|archiveurl=https://web.archive.org/web/20170401123616/https://www.goratings.org/|archivedate=1 April 2017|df=dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite web|title=柯洁迎19岁生日 雄踞人类世界排名第一已两年|url=http://sports.sina.com.cn/go/2016-08-02/doc-ifxunyya3020238.shtml|language=Chinese|date=May 2017|url-status=live|archiveurl=https://web.archive.org/web/20170811222849/http://sports.sina.com.cn/go/2016-08-02/doc-ifxunyya3020238.shtml|archivedate=11 August 2017|df=dmy-all}}&amp;lt;/ref&amp;gt; This marked the completion of a significant milestone in the development of Artificial Intelligence as Go is a relatively complex game, more so than Chess.&lt;br /&gt;
&lt;br /&gt;
In 2011, a Jeopardy! quiz show exhibition match, IBM's question answering system, Watson, defeated the two greatest Jeopardy! champions, Brad Rutter and Ken Jennings, by a significant margin. Faster computers, algorithmic improvements, and access to large amounts of data enabled advances in machine learning and perception; data-hungry deep learning methods started to dominate accuracy benchmarks around 2012. The Kinect, which provides a 3D body–motion interface for the Xbox 360 and the Xbox One, uses algorithms that emerged from lengthy AI research as do intelligent personal assistants in smartphones. In March 2016, AlphaGo won 4 out of 5 games of Go in a match with Go champion Lee Sedol, becoming the first computer Go-playing system to beat a professional Go player without handicaps. In the 2017 Future of Go Summit, AlphaGo won a three-game match with Ke Jie, who at the time continuously held the world No. 1 ranking for two years. This marked the completion of a significant milestone in the development of Artificial Intelligence as Go is a relatively complex game, more so than Chess.&lt;br /&gt;
&lt;br /&gt;
2011年，IBM的问答系统沃森参加《危险边缘》节目，以明显的优势打败了两名最强的人类冠军布拉德·拉特和肯·詹宁斯。更快的计算，算法的改进，以及大量数据的获取，使得机器学习和感知能力得到提高； 2012年前后，'''&amp;lt;font color=#ff8000&amp;gt;数据饥渴&amp;lt;/font&amp;gt;'''深度学习方法实现的精确度已经成为基准。Xbox 360和 Xbox One 的外设Kinect提供了3D人体运动交互功能，同智能手机上的智能助手一样，它使用的算法归功于漫长的AI研究； 2016年3月，AlphaGo与围棋冠军李世石的比赛中五局四胜，成为第一个击败无残疾围棋职业选手的计算机围棋系统；在2017年围棋未来峰会上，AlphaGo在三番棋的对决当中赢得了蝉联两届世界冠军的柯洁。这标志着AI发展的一个重要里程碑的完成，因为围棋是一种比国际象棋更复杂的游戏。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to [[Bloomberg News|Bloomberg's]] Jack Clark, 2015 was a landmark year for artificial intelligence, with the number of software projects that use AI [[Google]] increased from a &amp;quot;sporadic usage&amp;quot; in 2012 to more than 2,700 projects. Clark also presents factual data indicating the improvements of AI since 2012 supported by lower error rates in image processing tasks.&amp;lt;ref name=&amp;quot;:0&amp;quot;&amp;gt;{{cite web&lt;br /&gt;
&lt;br /&gt;
According to Bloomberg's Jack Clark, 2015 was a landmark year for artificial intelligence, with the number of software projects that use AI Google increased from a &amp;quot;sporadic usage&amp;quot; in 2012 to more than 2,700 projects. Clark also presents factual data indicating the improvements of AI since 2012 supported by lower error rates in image processing tasks.&amp;lt;ref name=&amp;quot;:0&amp;quot;&amp;gt;{{cite web&lt;br /&gt;
&lt;br /&gt;
彭博社的杰克·克拉克认为2015年是AI的里程碑年，使用谷歌AI的软件项目从几个到2015年超过了2700个。克拉克还给出了说明2012年以来AI在进步的真实数据，这些数据显示了AI在图像处理任务中的错误率越来越低。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |url         = https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
 |url         = https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
Https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
 |title       = Why 2015 Was a Breakthrough Year in Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
 |title       = Why 2015 Was a Breakthrough Year in Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
为什么2015年是人工智能的突破之年&lt;br /&gt;
&lt;br /&gt;
 |last        = Clark&lt;br /&gt;
&lt;br /&gt;
 |last        = Clark&lt;br /&gt;
&lt;br /&gt;
最后的克拉克&lt;br /&gt;
&lt;br /&gt;
 |first       = Jack&lt;br /&gt;
&lt;br /&gt;
 |first       = Jack&lt;br /&gt;
&lt;br /&gt;
先是杰克&lt;br /&gt;
&lt;br /&gt;
 |website     = Bloomberg News&lt;br /&gt;
&lt;br /&gt;
 |website     = Bloomberg News&lt;br /&gt;
&lt;br /&gt;
彭博新闻网&lt;br /&gt;
&lt;br /&gt;
 |date        = 8 December 2015&lt;br /&gt;
&lt;br /&gt;
 |date        = 8 December 2015&lt;br /&gt;
&lt;br /&gt;
2015年12月8日&lt;br /&gt;
&lt;br /&gt;
 |access-date = 23 November 2016&lt;br /&gt;
&lt;br /&gt;
 |access-date = 23 November 2016&lt;br /&gt;
&lt;br /&gt;
| 2016年11月23日&lt;br /&gt;
&lt;br /&gt;
 |quote       = After a half-decade of quiet breakthroughs in artificial intelligence, 2015 has been a landmark year. Computers are smarter and learning faster than ever.&lt;br /&gt;
&lt;br /&gt;
 |quote       = After a half-decade of quiet breakthroughs in artificial intelligence, 2015 has been a landmark year. Computers are smarter and learning faster than ever.&lt;br /&gt;
&lt;br /&gt;
经过5年人工智能领域的悄然突破，2015年成为了具有里程碑意义的一年。计算机比以往更聪明，学习速度更快。&lt;br /&gt;
&lt;br /&gt;
 |url-status     = live&lt;br /&gt;
&lt;br /&gt;
 |url-status     = live&lt;br /&gt;
&lt;br /&gt;
状态直播&lt;br /&gt;
&lt;br /&gt;
 |archiveurl  = https://web.archive.org/web/20161123053855/https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
 |archiveurl  = https://web.archive.org/web/20161123053855/https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20161123053855/https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
 |archivedate = 23 November 2016&lt;br /&gt;
&lt;br /&gt;
 |archivedate = 23 November 2016&lt;br /&gt;
&lt;br /&gt;
2016年11月23日&lt;br /&gt;
&lt;br /&gt;
 |df          = dmy-all&lt;br /&gt;
&lt;br /&gt;
 |df          = dmy-all&lt;br /&gt;
&lt;br /&gt;
我不会放过你的&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;/ref&amp;gt; He attributes this to an increase in affordable [[Artificial neural network|neural networks]], due to a rise in cloud computing infrastructure and to an increase in research tools and datasets.&amp;lt;ref name=&amp;quot;AI in 2000s&amp;quot;/&amp;gt; Other cited examples include Microsoft's development of a Skype system that can automatically translate from one language to another and Facebook's system that can describe images to blind people.&amp;lt;ref name=&amp;quot;:0&amp;quot;/&amp;gt; In a 2017 survey, one in five companies reported they had &amp;quot;incorporated AI in some offerings or processes&amp;quot;.&amp;lt;ref&amp;gt;{{cite web|title=Reshaping Business With Artificial Intelligence|url=https://sloanreview.mit.edu/projects/reshaping-business-with-artificial-intelligence/|website=MIT Sloan Management Review|accessdate=2 May 2018|language=en}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite web|last1=Lorica|first1=Ben|title=The state of AI adoption|url=https://www.oreilly.com/ideas/the-state-of-ai-adoption|website=O'Reilly Media|accessdate=2 May 2018|language=en|date=18 December 2017}}&amp;lt;/ref&amp;gt; Around 2016, [[China]] greatly accelerated its government funding; given its large supply of data and its rapidly increasing research output, some observers believe it may be on track to becoming an &amp;quot;AI superpower&amp;quot;.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.cnas.org/publications/reports/understanding-chinas-ai-strategy|title=Understanding China's AI Strategy|last=Allen|first=Gregory|date=February 6, 2019|website=Center for a New American Security|access-date=}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news |title=Review {{!}} How two AI superpowers – the U.S. and China – battle for supremacy in the field |url=https://www.washingtonpost.com/outlook/in-the-race-for-supremacy-in-artificial-intelligence-its-us-innovation-vs-chinese-ambition/2018/11/02/013e0030-b08c-11e8-aed9-001309990777_story.html |accessdate=4 November 2018 |work=Washington Post |date=2 November 2018 |language=en}}&amp;lt;/ref&amp;gt; However, it has been acknowledged that reports regarding artificial intelligence have tended to be exaggerated.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.theregister.co.uk/2019/02/22/artificial_intelligence_you_know_it_isnt_real_yeah/|title=Artificial Intelligence: You know it isn't real, yeah?|first=Alistair Dabbs 22 Feb 2019|last=at 10:11|website=www.theregister.co.uk}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=https://joshworth.com/stop-calling-in-artificial-intelligence/|title=Stop Calling it Artificial Intelligence}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=https://www.gbgplc.com/inside/ai/|title=AI isn't taking over the world – it doesn't exist yet|website=GBG Global website}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;/ref&amp;gt; He attributes this to an increase in affordable neural networks, due to a rise in cloud computing infrastructure and to an increase in research tools and datasets. Around 2016, China greatly accelerated its government funding; given its large supply of data and its rapidly increasing research output, some observers believe it may be on track to becoming an &amp;quot;AI superpower&amp;quot;. However, it has been acknowledged that reports regarding artificial intelligence have tended to be exaggerated.&lt;br /&gt;
&lt;br /&gt;
他把这归因于廉价的神经网络的增加，而神经网络的发展又是因为云计算基础设施以及研究工具和数据集的增加。还有微软的Skype系统可以将一门语言自动翻译成另一门，脸书系统可以把图片描述给盲人听。2016年前后，中国加大了政府资助。在此之后的大量数据供应和研究产出的快速增长让一些观察者认为，中国可能正走上成为“AI超级大国”之路。然而，有关AI的报告被承认了有夸大之嫌。2017年的一个调查中，五分之一的公司报道“他们在一些项目中用到了AI”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== 定义 Definitions ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Computer science defines AI research as the study of &amp;quot;[[intelligent agent]]s&amp;quot;: any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals.&amp;lt;ref name=&amp;quot;Definition of AI&amp;quot;/&amp;gt; A more elaborate definition characterizes AI as &amp;quot;a system's ability to correctly interpret external data, to learn from such data, and to use those learnings to achieve specific goals and tasks through flexible adaptation.&amp;quot;&amp;lt;ref&amp;gt;{{Cite journal|title=Siri, Siri, in my hand: Who's the fairest in the land? On the interpretations, illustrations, and implications of artificial intelligence|first1=Andreas|last1=Kaplan|first2=Michael|last2=Haenlein|date=1 January 2019|journal=Business Horizons|volume=62|issue=1|pages=15–25|doi=10.1016/j.bushor.2018.08.004}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Computer science defines AI research as the study of &amp;quot;intelligent agents&amp;quot;: any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals.&lt;br /&gt;
&lt;br /&gt;
计算机科学将对AI的研究定义为对“智能体”的研究。智能体是任何感知周围环境并采取行动以最大化其成功实现目标的机会的设备。对AI更精确的定义是“一个可以正确理解并学习输入数据，并用学习结果通过灵活调整，实现具体目标或任务的系统”。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== 基本知识 Basics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This section is for explaining, to non-specialists, core concepts that are helpful for understanding AI; feel free to greatly expand or even draw out into its own &amp;quot;Introduction to AI&amp;quot; article, similar to [[Introduction to Quantum Mechanics]] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This section is for explaining, to non-specialists, core concepts that are helpful for understanding AI; feel free to greatly expand or even draw out into its own &amp;quot;Introduction to AI&amp;quot; article, similar to Introduction to Quantum Mechanics --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这部分是为了向非专业人士解释有助于理解人工智能的核心概念，你可以随意扩展甚至引用到它自己的“人工智能导论”文章中，类似于量子力学导论——&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A typical AI analyzes its environment and takes actions that maximize its chance of success.&amp;lt;ref name=&amp;quot;Definition of AI&amp;quot;/&amp;gt; An AI's intended [[utility function|utility function (or goal)]] can be simple (&amp;quot;1 if the AI wins a game of [[Go (game)|Go]], 0 otherwise&amp;quot;) or complex (&amp;quot;Do mathematically similar actions to the ones succeeded in the past&amp;quot;). Goals can be explicitly defined or induced. If the AI is programmed for &amp;quot;[[reinforcement learning]]&amp;quot;, goals can be implicitly induced by rewarding some types of behavior or punishing others.{{efn|The act of doling out rewards can itself be formalized or automated into a &amp;quot;[[reward function]]&amp;quot;.}} Alternatively, an evolutionary system can induce goals by using a &amp;quot;[[fitness function]]&amp;quot; to mutate and preferentially replicate high-scoring AI systems, similar to how animals evolved to innately desire certain goals such as finding food.{{sfn|Domingos|2015|loc=Chapter 5}} Some AI systems, such as nearest-neighbor, instead of reason by analogy, these systems are not generally given goals, except to the degree that goals are implicit in their training data.{{sfn|Domingos|2015|loc=Chapter 7}} Such systems can still be benchmarked if the non-goal system is framed as a system whose &amp;quot;goal&amp;quot; is to successfully accomplish its narrow classification task.&amp;lt;ref&amp;gt;Lindenbaum, M., Markovitch, S., &amp;amp; Rusakov, D. (2004). Selective sampling for nearest neighbor classifiers. Machine learning, 54(2), 125–152.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A typical AI analyzes its environment and takes actions that maximize its chance of success.&lt;br /&gt;
&lt;br /&gt;
一般的AI会分析其环境，并采取行动最大限度地提高其成功的机会。AI的预期效用函数（或者说目标）可以很简单（比如如果赢了围棋就是1，否则为0），也可以很复杂（做一些从数学层面上与过去的成功案例相似的行为）。目标可以被明确定义或诱导。如果AI被设定为“'''&amp;lt;font color=#ff8000&amp;gt;强化学习 Reinforcement Learning &amp;lt;/font&amp;gt;'''”，那么目标就可以通过奖励某些行为或惩罚其他行为来间接诱导出来。再比如进化系统可以通过“适应功能”产生突变或者优先发展得分高的AI系统来导出目标，这与动物进化出寻找食物的本能类似。一些诸如最近邻插值的AI系统，不是通过类比来推理的。这些系统通常没有给定目标，除非目标隐含在它们的训练数据中。如果将非目标系统框定为一个以成功完成其小范围分类任务为目标的系统，那么这些系统仍然可以作为基准。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
AI often revolves around the use of [[algorithms]]. An algorithm is a set of unambiguous instructions that a mechanical computer can execute.{{efn|Terminology varies; see [[algorithm characterizations]].}} A complex algorithm is often built on top of other, simpler, algorithms. A simple example of an algorithm is the following (optimal for first player) recipe for play at [[tic-tac-toe]]:{{sfn|Domingos|2015|loc=Chapter 1}}&lt;br /&gt;
&lt;br /&gt;
AI often revolves around the use of algorithms. An algorithm is a set of unambiguous instructions that a mechanical computer can execute. A complex algorithm is often built on top of other, simpler, algorithms. A simple example of an algorithm is the following (optimal for first player) recipe for play at tic-tac-toe:&lt;br /&gt;
&lt;br /&gt;
AI离不开算法的使用。算法是机械计算机可以执行的一组明确的指令。复杂的算法通常是建立在其他更简单的算法之上的。一个算法的简单例子是下面的井字游戏指令(对于第一个玩家来说是最有利的) :&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
# If someone has a &amp;quot;threat&amp;quot; (that is, two in a row), take the remaining square. Otherwise,&lt;br /&gt;
&lt;br /&gt;
 If someone has a &amp;quot;threat&amp;quot; (that is, two in a row), take the remaining square. Otherwise,&lt;br /&gt;
如果某人产生了一个“威胁”(也就是说有两个棋子连续了) ，把下一步棋下在两个棋外剩下的方上块。否则,&lt;br /&gt;
&lt;br /&gt;
# if a move &amp;quot;forks&amp;quot; to create two threats at once, play that move. Otherwise,&lt;br /&gt;
&lt;br /&gt;
 if a move &amp;quot;forks&amp;quot; to create two threats at once, play that move. Otherwise,&lt;br /&gt;
&lt;br /&gt;
如果某一步棋可以制造“叉子”棋阵同时制造两个威胁，那就下那一步。否则,&lt;br /&gt;
&lt;br /&gt;
# take the center square if it is free. Otherwise,&lt;br /&gt;
&lt;br /&gt;
 take the center square if it is free. Otherwise,&lt;br /&gt;
&lt;br /&gt;
如果中心的格子还是空的话，就走中间的格子。否则,&lt;br /&gt;
&lt;br /&gt;
# if your opponent has played in a corner, take the opposite corner. Otherwise,&lt;br /&gt;
&lt;br /&gt;
 if your opponent has played in a corner, take the opposite corner. Otherwise,&lt;br /&gt;
&lt;br /&gt;
如果你的对手在一个角落里布子，那就走另一个角落。否则,&lt;br /&gt;
&lt;br /&gt;
# take an empty corner if one exists. Otherwise,&lt;br /&gt;
&lt;br /&gt;
 take an empty corner if one exists. Otherwise,&lt;br /&gt;
&lt;br /&gt;
如果有空角落，就下在空角落上。否则,&lt;br /&gt;
&lt;br /&gt;
# take any empty square.&lt;br /&gt;
&lt;br /&gt;
 take any empty square.&lt;br /&gt;
&lt;br /&gt;
随便找个空格子。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Many AI algorithms are capable of learning from data; they can enhance themselves by learning new [[heuristic (computer science)|heuristics]] (strategies, or &amp;quot;rules of thumb&amp;quot;, that have worked well in the past), or can themselves write other algorithms. Some of the &amp;quot;learners&amp;quot; described below, including Bayesian networks, decision trees, and nearest-neighbor, could theoretically, (given infinite data, time, and memory) learn to approximate any [[function (mathematics)|function]], including which combination of mathematical functions would best describe the world{{citation needed|date=June 2019}}. These learners could therefore, derive all possible knowledge, by considering every possible hypothesis and matching them against the data. In practice, it is almost never possible to consider every possibility, because of the phenomenon of &amp;quot;[[combinatorial explosion]]&amp;quot;, where the amount of time needed to solve a problem grows exponentially. Much of AI research involves figuring out how to identify and avoid considering broad range of possibilities that are unlikely to be beneficial.&amp;lt;ref name=&amp;quot;Intractability&amp;quot;/&amp;gt;{{sfn|Domingos|2015|loc=Chapter 2, Chapter 3}} For example, when viewing a map and looking for the shortest driving route from [[Denver]] to [[New York City|New York]] in the East, one can in most cases skip looking at any path through [[San Francisco]] or other areas far to the West; thus, an AI wielding a pathfinding algorithm like [[A* search algorithm|A*]] can avoid the combinatorial explosion that would ensue if every possible route had to be ponderously considered in turn.&amp;lt;ref&amp;gt;{{cite journal&lt;br /&gt;
&lt;br /&gt;
Many AI algorithms are capable of learning from data; they can enhance themselves by learning new heuristics (strategies, or &amp;quot;rules of thumb&amp;quot;, that have worked well in the past), or can themselves write other algorithms. Some of the &amp;quot;learners&amp;quot; described below, including Bayesian networks, decision trees, and nearest-neighbor, could theoretically, (given infinite data, time, and memory) learn to approximate any function, including which combination of mathematical functions would best describe the world. These learners could therefore, derive all possible knowledge, by considering every possible hypothesis and matching them against the data. In practice, it is almost never possible to consider every possibility, because of the phenomenon of &amp;quot;combinatorial explosion&amp;quot;, where the amount of time needed to solve a problem grows exponentially. Much of AI research involves figuring out how to identify and avoid considering broad range of possibilities that are unlikely to be beneficial. For example, when viewing a map and looking for the shortest driving route from Denver to New York in the East, one can in most cases skip looking at any path through San Francisco or other areas far to the West; thus, an AI wielding a pathfinding algorithm like A* can avoid the combinatorial explosion that would ensue if every possible route had to be ponderously considered in turn.&amp;lt;ref&amp;gt;{{cite journal&lt;br /&gt;
&lt;br /&gt;
许多AI算法可以从数据中学习；他们可以通过学习新的启发(过去起作用的策略，或“经验法则”) 或者自己编写其他算法来强化自己。下面的一些“学习者”，包括'''&amp;lt;font color=#ff8000&amp;gt;贝叶斯网络 Bayesian Networks&amp;lt;/font&amp;gt;'''、'''&amp;lt;font color=#ff8000&amp;gt;决策树 Decision Trees&amp;lt;/font&amp;gt;'''和'''&amp;lt;font color=#ff8000&amp;gt;最近邻 Nearest-neighbor&amp;lt;/font&amp;gt;'''，在理论上(给定无限的数据、时间和记忆)可以学习近似任何函数，包括数学函数如何组合可以最好地描述世界。因此，这些学习者可以通过考虑每一种可能的假设，并将它们与数据进行匹配，从而获得所有可能的知识。实际上考虑所有的可能性几乎是不可能，因为很可能会导致“'''&amp;lt;font color=#ff8000&amp;gt;组合爆炸 Combinatorial Explosion&amp;lt;/font&amp;gt;'''”，即解决一个问题所需的时间呈指数级增长。很多AI研究都在探索如何识别和避免考虑广泛且无益的可能性。例如,当看地图寻找从东边丹佛到纽约的最短行驶路线时,大部分人都不会去看通过西边的旧金山或其他地理位置的路径;因此，一个使用像A*这样的寻路算法的AI可以避免每条可能的路径都必须依次考虑以造成组合爆炸的情况。&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
The earliest (and easiest to understand) approach to AI was symbolism (such as formal logic): &amp;quot;If an otherwise healthy adult has a fever, then they may have [[influenza]]&amp;quot;. A second, more general, approach is [[Bayesian inference]]: &amp;quot;If the current patient has a fever, adjust the probability they have influenza in such-and-such way&amp;quot;. The third major approach, extremely popular in routine business AI applications, are analogizers such as [[Support vector machine|SVM]] and [[K-nearest neighbor algorithm|nearest-neighbor]]: &amp;quot;After examining the records of known past patients whose temperature, symptoms, age, and other factors mostly match the current patient, X% of those patients turned out to have influenza&amp;quot;. A fourth approach is harder to intuitively understand, but is inspired by how the brain's machinery works: the [[artificial neural network]] approach uses artificial &amp;quot;[[neurons]]&amp;quot; that can learn by comparing itself to the desired output and altering the strengths of the connections between its internal neurons to &amp;quot;reinforce&amp;quot; connections that seemed to be useful. These four main approaches can overlap with each other and with evolutionary systems; for example, neural nets can learn to make inferences, to generalize, and to make analogies. Some systems implicitly or explicitly use multiple of these approaches, alongside many other AI and non-AI algorithms; the best approach is often different depending on the problem.{{sfn|Domingos|2015|loc=Chapter 2, Chapter 4, Chapter 6}}&amp;lt;!-- The influenza example is expanded from Domingos chapter 6; feel free to put in a better example if you have one --&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Can neural network computers learn from experience, and if so, could they ever become what we would call 'smart'?|url=https://www.scientificamerican.com/article/can-neural-network-comput/|accessdate=24 March 2018|work=Scientific American|date=2018|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The earliest (and easiest to understand) approach to AI was symbolism (such as formal logic): &amp;quot;If an otherwise healthy adult has a fever, then they may have influenza&amp;quot;. A second, more general, approach is Bayesian inference: &amp;quot;If the current patient has a fever, adjust the probability they have influenza in such-and-such way&amp;quot;. The third major approach, extremely popular in routine business AI applications, are analogizers such as SVM and nearest-neighbor: &amp;quot;After examining the records of known past patients whose temperature, symptoms, age, and other factors mostly match the current patient, X% of those patients turned out to have influenza&amp;quot;. A fourth approach is harder to intuitively understand, but is inspired by how the brain's machinery works: the artificial neural network approach uses artificial &amp;quot;neurons&amp;quot; that can learn by comparing itself to the desired output and altering the strengths of the connections between its internal neurons to &amp;quot;reinforce&amp;quot; connections that seemed to be useful. These four main approaches can overlap with each other and with evolutionary systems; for example, neural nets can learn to make inferences, to generalize, and to make analogies. Some systems implicitly or explicitly use multiple of these approaches, alongside many other AI and non-AI algorithms; the best approach is often different depending on the problem.&amp;lt;!-- The influenza example is expanded from Domingos chapter 6; feel free to put in a better example if you have one --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
AI最早的(也是最容易理解的)研究方法是'''&amp;lt;font color=#ff8000&amp;gt;符号主义 Symbolism &amp;lt;/font&amp;gt;'''(比如形式逻辑):“如果一个原本健康的成年人发烧了，那么他们可能患上了流感。”第二种更普遍的方法是贝叶斯推断: “如果这个患者发烧了，会考虑多个方面判断他们感染流感的可能性”。第三个主要的方法：类比，在日常商业AI应用中非常常见，例如'''&amp;lt;font color=#ff8000&amp;gt;支持向量机 Support Vector Machine, SVM&amp;lt;/font&amp;gt;'''和'''&amp;lt;font color=#ff8000&amp;gt;最近邻 Nearest-neighbor &amp;lt;/font&amp;gt;''': “在考量了过去体温、症状、年龄和其他因素与现在的病人匹配的病人的记录，这些病人中x%患有流感”。第四种方法相较来说更难以直观理解，它受到大脑工作机制的启发: 人工神经网络方法使用人工“神经元” ，这种神经元可以通过将自身与期望的输出进行比较，并改变内部神经元之间的连接强度，以“强化”似乎有用的连接，从而进行学习。这四种主要的方法可以有交叉，也可以与进化系统交叉; 例如，神经网络可以学习做推论、概括和进行类比。一些系统隐式或显式地使用这些方法中的多个，以及许多其他AI和非AI算法; 根据问题不同往往最佳解决方案也不同.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Learning algorithms work on the basis that strategies, algorithms, and inferences that worked well in the past are likely to continue working well in the future. These inferences can be obvious, such as &amp;quot;since the sun rose every morning for the last 10,000 days, it will probably rise tomorrow morning as well&amp;quot;. They can be nuanced, such as &amp;quot;X% of [[Family (biology)|families]] have geographically separate species with color variants, so there is a Y% chance that undiscovered [[black swan theory|black swans]] exist&amp;quot;. Learners also work on the basis of &amp;quot;[[Occam's razor#Probability theory and statistics|Occam's razor]]&amp;quot;: The simplest theory that explains the data is the likeliest. Therefore, according to Occam's razor principle, a learner must be designed such that it prefers simpler theories to complex theories, except in cases where the complex theory is proven substantially better.&lt;br /&gt;
&lt;br /&gt;
Learning algorithms work on the basis that strategies, algorithms, and inferences that worked well in the past are likely to continue working well in the future. These inferences can be obvious, such as &amp;quot;since the sun rose every morning for the last 10,000 days, it will probably rise tomorrow morning as well&amp;quot;. They can be nuanced, such as &amp;quot;X% of families have geographically separate species with color variants, so there is a Y% chance that undiscovered black swans exist&amp;quot;. Learners also work on the basis of &amp;quot;Occam's razor&amp;quot;: The simplest theory that explains the data is the likeliest. Therefore, according to Occam's razor principle, a learner must be designed such that it prefers simpler theories to complex theories, except in cases where the complex theory is proven substantially better.&lt;br /&gt;
&lt;br /&gt;
学习算法的工作基础是策略、算法和推论，如果这些基础在之前运行良好，那么在未来可能能继续很好地运作。这些推论是显而易见的，例如“在过去的10000天里，太阳每天早上都升起，明天早上也可能升起”。他们可能会有细微差别，比如“ x% 的科有颜色变异且地理隔离的物种，所以有 y% 的可能性未被发现的黑天鹅是存在的”。学习者也在“'''&amp;lt;font color=#ff8000&amp;gt;奥卡姆剃刀 Occam's Razor&amp;lt;/font&amp;gt;'''”的基础上学习: 最简单的可以解释数据的理论是最有可能的。因此，根据奥卡姆剃刀原则，一个学习者必须被设计成更倾向于简单的理论而不是复杂的理论，除非复杂的理论被证明实质上更好。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Overfitted Data.png|thumb|The blue line could be an example of [[overfitting]] a linear function due to random noise.]蓝线是[[由于随机噪声过拟合线性函数]的一个例子。]&lt;br /&gt;
]&lt;br /&gt;
&lt;br /&gt;
The blue line could be an example of [[overfitting a linear function due to random noise.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Settling on a bad, overly complex theory gerrymandered to fit all the past training data is known as [[overfitting]]. Many systems attempt to reduce overfitting by rewarding a theory in accordance with how well it fits the data, but penalizing the theory in accordance with how complex the theory is.{{sfn|Domingos|2015|loc=Chapter 6, Chapter 7}} Besides classic overfitting, learners can also disappoint by &amp;quot;learning the wrong lesson&amp;quot;. A toy example is that an image classifier trained only on pictures of brown horses and black cats might conclude that all brown patches are likely to be horses.{{sfn|Domingos|2015|p=286}} A real-world example is that, unlike humans, current image classifiers don't determine the spatial relationship between components of the picture; instead, they learn abstract patterns of pixels that humans are oblivious to, but that linearly correlate with images of certain types of real objects. Faintly superimposing such a pattern on a legitimate image results in an &amp;quot;adversarial&amp;quot; image that the system misclassifies.{{efn|Adversarial vulnerabilities can also result in nonlinear systems, or from non-pattern perturbations. Some systems are so brittle that changing a single adversarial pixel predictably induces misclassification.}}&amp;lt;ref&amp;gt;{{cite news|title=Single pixel change fools AI programs|url=https://www.bbc.com/news/technology-41845878|accessdate=12 March 2018|work=BBC News|date=3 November 2017}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=AI Has a Hallucination Problem That's Proving Tough to Fix|url=https://www.wired.com/story/ai-has-a-hallucination-problem-thats-proving-tough-to-fix/|accessdate=12 March 2018|work=WIRED|date=2018}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite arxiv|eprint=1412.6572|last1=Goodfellow|first1=Ian J.|last2=Shlens|first2=Jonathon|last3=Szegedy|first3=Christian|title=Explaining and Harnessing Adversarial Examples|class=stat.ML|year=2014}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Settling on a bad, overly complex theory gerrymandered to fit all the past training data is known as overfitting. Many systems attempt to reduce overfitting by rewarding a theory in accordance with how well it fits the data, but penalizing the theory in accordance with how complex the theory is. Besides classic overfitting, learners can also disappoint by &amp;quot;learning the wrong lesson&amp;quot;. A toy example is that an image classifier trained only on pictures of brown horses and black cats might conclude that all brown patches are likely to be horses. A real-world example is that, unlike humans, current image classifiers don't determine the spatial relationship between components of the picture; instead, they learn abstract patterns of pixels that humans are oblivious to, but that linearly correlate with images of certain types of real objects. Faintly superimposing such a pattern on a legitimate image results in an &amp;quot;adversarial&amp;quot; image that the system misclassifies.&lt;br /&gt;
&lt;br /&gt;
用一个错误且过于复杂的理论拟合过去所有的训练数据，这被称为'''&amp;lt;font color=#ff8000&amp;gt;过拟合 Overfitting&amp;lt;/font&amp;gt;'''。许多系统试图通过依据理论拟合数据的程度奖励和复杂程度惩罚来减少过拟合。除了常见的过拟合外，学习者也会因为“走错方向”而失望。一个简单的例子是，一个图像分类器训练时只用棕马和黑猫的图片，那么它就很可能得出所有的棕色斑块都是马的结论。一个现实世界的例子是，目前的图像分类器并与人类不同，他们不厘清图像各部分间的空间关系; 相反，它们学习人类察觉不到的抽象，但与某类真实物体图像线性相关的像素图案。将这种图案稍微叠加在原本正确的图像上，就会导致系统将图像错误分类。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Détection de personne - exemple 3.jpg|thumb|A self-driving car system may use a neural network to determine which parts of the picture seem to match previous training images of pedestrians, and then model those areas as slow-moving but somewhat unpredictable rectangular prisms that must be avoided.自动驾驶汽车系统可以使用神经网络来确定图像的哪些部分与先前训练数据里的行人图像匹配，然后将这些区域建模为移动缓慢但有点不可预测，且必须避让的矩形棱柱。&amp;lt;ref&amp;gt;{{cite book|last1=Matti|first1=D.|last2=Ekenel|first2=H. K.|last3=Thiran|first3=J. P.|title=Combining LiDAR space clustering and convolutional neural networks for pedestrian detection|journal=2017 14th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS)|date=2017|pages=1–6|doi=10.1109/AVSS.2017.8078512|isbn=978-1-5386-2939-0|arxiv=1710.06160}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|last1=Ferguson|first1=Sarah|last2=Luders|first2=Brandon|last3=Grande|first3=Robert C.|last4=How|first4=Jonathan P.|title=Real-Time Predictive Modeling and Robust Avoidance of Pedestrians with Uncertain, Changing Intentions|journal=Algorithmic Foundations of Robotics XI|volume=107|date=2015|pages=161–177|doi=10.1007/978-3-319-16595-0_10|publisher=Springer, Cham|language=en|series=Springer Tracts in Advanced Robotics|isbn=978-3-319-16594-3|arxiv=1405.5581}}&amp;lt;/ref&amp;gt;]]&lt;br /&gt;
&lt;br /&gt;
A self-driving car system may use a neural network to determine which parts of the picture seem to match previous training images of pedestrians, and then model those areas as slow-moving but somewhat unpredictable rectangular prisms that must be avoided.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Compared with humans, existing AI lacks several features of human &amp;quot;[[commonsense reasoning]]&amp;quot;; most notably, humans have powerful mechanisms for reasoning about &amp;quot;[[naïve physics]]&amp;quot; such as space, time, and physical interactions. This enables even young children to easily make inferences like &amp;quot;If I roll this pen off a table, it will fall on the floor&amp;quot;. Humans also have a powerful mechanism of &amp;quot;[[folk psychology]]&amp;quot; that helps them to interpret natural-language sentences such as &amp;quot;The city councilmen refused the demonstrators a permit because they advocated violence&amp;quot;. (A generic AI has difficulty discerning whether the ones alleged to be advocating violence are the councilmen or the demonstrators.)&amp;lt;ref&amp;gt;{{cite news|title=Cultivating Common Sense {{!}} DiscoverMagazine.com|url=http://discovermagazine.com/2017/april-2017/cultivating-common-sense|accessdate=24 March 2018|work=Discover Magazine|date=2017}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Davis|first1=Ernest|last2=Marcus|first2=Gary|title=Commonsense reasoning and commonsense knowledge in artificial intelligence|journal=Communications of the ACM|date=24 August 2015|volume=58|issue=9|pages=92–103|doi=10.1145/2701413|url=https://cacm.acm.org/magazines/2015/9/191169-commonsense-reasoning-and-commonsense-knowledge-in-artificial-intelligence/}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Winograd|first1=Terry|title=Understanding natural language|journal=Cognitive Psychology|date=January 1972|volume=3|issue=1|pages=1–191|doi=10.1016/0010-0285(72)90002-3}}&amp;lt;/ref&amp;gt; This lack of &amp;quot;common knowledge&amp;quot; means that AI often makes different mistakes than humans make, in ways that can seem incomprehensible. For example, existing self-driving cars cannot reason about the location nor the intentions of pedestrians in the exact way that humans do, and instead must use non-human modes of reasoning to avoid accidents.&amp;lt;ref&amp;gt;{{cite news|title=Don't worry: Autonomous cars aren't coming tomorrow (or next year)|url=http://autoweek.com/article/technology/fully-autonomous-vehicles-are-more-decade-down-road|accessdate=24 March 2018|work=Autoweek|date=2016}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|last1=Knight|first1=Will|title=Boston may be famous for bad drivers, but it's the testing ground for a smarter self-driving car|url=https://www.technologyreview.com/s/608871/finally-a-driverless-car-with-some-common-sense/|accessdate=27 March 2018|work=MIT Technology Review|date=2017|language=en}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Prakken|first1=Henry|title=On the problem of making autonomous vehicles conform to traffic law|journal=Artificial Intelligence and Law|date=31 August 2017|volume=25|issue=3|pages=341–363|doi=10.1007/s10506-017-9210-0|doi-access=free}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Compared with humans, existing AI lacks several features of human &amp;quot;commonsense reasoning&amp;quot;; most notably, humans have powerful mechanisms for reasoning about &amp;quot;naïve physics&amp;quot; such as space, time, and physical interactions. This enables even young children to easily make inferences like &amp;quot;If I roll this pen off a table, it will fall on the floor&amp;quot;. Humans also have a powerful mechanism of &amp;quot;folk psychology&amp;quot; that helps them to interpret natural-language sentences such as &amp;quot;The city councilmen refused the demonstrators a permit because they advocated violence&amp;quot;. (A generic AI has difficulty discerning whether the ones alleged to be advocating violence are the councilmen or the demonstrators.) This lack of &amp;quot;common knowledge&amp;quot; means that AI often makes different mistakes than humans make, in ways that can seem incomprehensible. For example, existing self-driving cars cannot reason about the location nor the intentions of pedestrians in the exact way that humans do, and instead must use non-human modes of reasoning to avoid accidents.&lt;br /&gt;
&lt;br /&gt;
与人类相比，现有的AI缺少人类“常识推理”的几个特征; 最值得注意的是，人类拥有强大的对如空间、时间和物理相互作用等“自然物理”推理机制。这使得即使是小孩子也能够轻易地做出推论，比如“如果我把这支笔从桌子上滚下来，它就会掉到地板上”。人类还有一种强大的“人群心理”机制，帮助他们理解诸如“市议员因为示威者鼓吹暴力而拒绝给予许可”的自然语言，但一般的AI难以辨别被指控鼓吹暴力的人是议员还是示威者。这种“常识”的缺乏意味着AI经常会犯一些与人类不同的错误，这些错误看起来是难以理解的。例如，现在的自动驾驶汽车不能像人类那样准确推理方位和行人的意图，而只能使用非人类的推理模式来避免事故。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== 挑战 Challenges ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- This is linked to in the introduction to the article and to the &amp;quot;AI research&amp;quot; section --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- This is linked to in the introduction to the article and to the &amp;quot;AI research&amp;quot; section --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这跟文章的导言和“人工智能研究”部分有关——&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The cognitive capabilities of current architectures are very limited, using only a simplified version of what intelligence is really capable of. For instance, the human mind has come up with ways to reason beyond measure and logical explanations to different occurrences in life. What would have been otherwise straightforward, an equivalently difficult problem may be challenging to solve computationally as opposed to using the human mind. This gives rise to two classes of models: structuralist and functionalist. The structural models aim to loosely mimic the basic intelligence operations of the mind such as reasoning and logic. The functional model refers to the correlating data to its computed counterpart.&amp;lt;ref&amp;gt;{{Cite journal|last=Lieto|first=Antonio|date=May 2018|title=The knowledge level in cognitive architectures: Current limitations and possible developments|journal=Cognitive Systems Research|volume=48|pages=39–55|doi=10.1016/j.cogsys.2017.05.001|hdl=2318/1665207|hdl-access=free}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The cognitive capabilities of current architectures are very limited, using only a simplified version of what intelligence is really capable of. For instance, the human mind has come up with ways to reason beyond measure and logical explanations to different occurrences in life. What would have been otherwise straightforward, an equivalently difficult problem may be challenging to solve computationally as opposed to using the human mind. This gives rise to two classes of models: structuralist and functionalist. The structural models aim to loosely mimic the basic intelligence operations of the mind such as reasoning and logic. The functional model refers to the correlating data to its computed counterpart.&lt;br /&gt;
&lt;br /&gt;
当前架构的认知能力非常有限，只做到了智能真正能够做到的事情的冰山一角。例如，人类的大脑已经想出了各种方法来推理生活中难以度量且不太合逻辑的事件。原本直截了当且困难程度相差不大的问题，与使用人类思维相比，对于计算机可能是具有挑战性的。这就产生了两类模型: '''&amp;lt;font color=#ff8000&amp;gt;结构主义 Structuralist&amp;lt;/font&amp;gt;'''和'''&amp;lt;font color=#ff8000&amp;gt;功能主义 Functionalist&amp;lt;/font&amp;gt;'''。结构模型旨在大致模拟大脑的基本认知功能，如推理和逻辑；功能模型是指与其计算的数据相关联的数据。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The overall research goal of artificial intelligence is to create technology that allows computers and machines to function in an intelligent manner. The general problem of simulating (or creating) intelligence has been broken down into sub-problems. These consist of particular traits or capabilities that researchers expect an intelligent system to display. The traits described below have received the most attention.&amp;lt;ref name=&amp;quot;Problems of AI&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The overall research goal of artificial intelligence is to create technology that allows computers and machines to function in an intelligent manner. The general problem of simulating (or creating) intelligence has been broken down into sub-problems. These consist of particular traits or capabilities that researchers expect an intelligent system to display. The traits described below have received the most attention.&lt;br /&gt;
&lt;br /&gt;
AI的总体研究目标是创造能够使计算机和机器以智能方式运行的技术。模拟(或创造)智能的一般问题已被分解为若干子问题。这些问题中涉及到的特征或能力是研究人员期望智能系统展示的。受到了最多的关注的是下面描述的几个特征。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== 推理，解决问题 Reasoning, problem solving ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&amp;lt;!-- SOLVED PROBLEMS --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&amp;lt;!-- SOLVED PROBLEMS --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这在介绍中有关——解决问题——&lt;br /&gt;
&lt;br /&gt;
Early researchers developed algorithms that imitated step-by-step reasoning that humans use when they solve puzzles or make logical deductions.&amp;lt;ref name=&amp;quot;Reasoning&amp;quot;/&amp;gt; By the late 1980s and 1990s, AI research had developed methods for dealing with [[uncertainty|uncertain]] or incomplete information, employing concepts from [[probability]] and [[economics]].&amp;lt;ref name=&amp;quot;Uncertain reasoning&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Early researchers developed algorithms that imitated step-by-step reasoning that humans use when they solve puzzles or make logical deductions. By the late 1980s and 1990s, AI research had developed methods for dealing with uncertain or incomplete information, employing concepts from probability and economics.&lt;br /&gt;
&lt;br /&gt;
早期的研究人员开发了一种算法，这种算法模仿了人类在解决谜题或进行逻辑推理时所使用的循序渐进的推理。到20世纪80年代末和90年代，AI研究使用概率论和经济学的理论开发出了处理不确定或不完全信息的方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These algorithms proved to be insufficient for solving large reasoning problems because they experienced a &amp;quot;combinatorial explosion&amp;quot;: they became exponentially slower as the problems grew larger.&amp;lt;ref name=&amp;quot;Intractability&amp;quot;/&amp;gt; In fact, even humans rarely use the step-by-step deduction that early AI research was able to model. They solve most of their problems using fast, intuitive judgments.&amp;lt;ref name=&amp;quot;Psychological evidence of sub-symbolic reasoning&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
These algorithms proved to be insufficient for solving large reasoning problems because they experienced a &amp;quot;combinatorial explosion&amp;quot;: they became exponentially slower as the problems grew larger. In fact, even humans rarely use the step-by-step deduction that early AI research was able to model. They solve most of their problems using fast, intuitive judgments.&lt;br /&gt;
&lt;br /&gt;
这些算法被证明不足以解决大型推理问题，因为它们经历了一个“组合爆炸” : 随着问题规模变得越来越大，它们的处理效率呈指数级下降。事实上，即使是人类也很少使用早期AI研究建模的逐步推理。人们通过快速、直觉的判断来解决大多数问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== 知识表示 Knowledge representation ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这个链接在介绍中——&lt;br /&gt;
&lt;br /&gt;
[[File:GFO taxonomy tree.png|right|thumb|An ontology represents knowledge as a set of concepts within a domain and the relationships between those concepts.本体将知识表示为领域中的一组概念以及这些概念之间的关系。]]&lt;br /&gt;
&lt;br /&gt;
An ontology represents knowledge as a set of concepts within a domain and the relationships between those concepts.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Knowledge representation|Commonsense knowledge}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Knowledge representation]]&amp;lt;ref name=&amp;quot;Knowledge representation&amp;quot;/&amp;gt; and [[knowledge engineering]]&amp;lt;ref name=&amp;quot;Knowledge engineering&amp;quot;/&amp;gt; are central to classical AI research. Some &amp;quot;expert systems&amp;quot; attempt to gather together explicit knowledge possessed by experts in some narrow domain. In addition, some projects attempt to gather the &amp;quot;commonsense knowledge&amp;quot; known to the average person into a database containing extensive knowledge about the world. Among the things a comprehensive commonsense knowledge base would contain are: objects, properties, categories and relations between objects;&amp;lt;ref name=&amp;quot;Representing categories and relations&amp;quot;/&amp;gt; situations, events, states and time;&amp;lt;ref name=&amp;quot;Representing time&amp;quot;/&amp;gt; causes and effects;&amp;lt;ref name=&amp;quot;Representing causation&amp;quot;/&amp;gt; knowledge about knowledge (what we know about what other people know);&amp;lt;ref name=&amp;quot;Representing knowledge about knowledge&amp;quot;/&amp;gt; and many other, less well researched domains. A representation of &amp;quot;what exists&amp;quot; is an [[ontology (computer science)|ontology]]: the set of objects, relations, concepts, and properties formally described so that software agents can interpret them. The [[semantics]] of these are captured as [[description logic]] concepts, roles, and individuals, and typically implemented as classes, properties, and individuals in the [[Web Ontology Language]].&amp;lt;ref&amp;gt;{{cite book |last=Sikos |first=Leslie F. |date=June 2017 |title=Description Logics in Multimedia Reasoning |url=https://www.springer.com/us/book/9783319540658 |location=Cham |publisher=Springer |isbn=978-3-319-54066-5 |doi=10.1007/978-3-319-54066-5 |url-status=live |archiveurl=https://web.archive.org/web/20170829120912/https://www.springer.com/us/book/9783319540658 |archivedate=29 August 2017 |df=dmy-all }}&amp;lt;/ref&amp;gt; The most general ontologies are called [[upper ontology|upper ontologies]], which attempt to provide a foundation for all other knowledge&amp;lt;ref name=&amp;quot;Ontology&amp;quot;/&amp;gt; by acting as mediators between [[Domain ontology|domain ontologies]] that cover specific knowledge about a particular knowledge domain (field of interest or area of concern). Such formal knowledge representations can be used in content-based indexing and retrieval,&amp;lt;ref&amp;gt;{{cite journal|last1=Smoliar|first1=Stephen W.|last2=Zhang|first2=HongJiang|title=Content based video indexing and retrieval|journal=IEEE Multimedia|date=1994|volume=1|issue=2|pages=62–72|doi=10.1109/93.311653}}&amp;lt;/ref&amp;gt; scene interpretation,&amp;lt;ref&amp;gt;{{cite journal|last1=Neumann|first1=Bernd|last2=Möller|first2=Ralf|title=On scene interpretation with description logics|journal=Image and Vision Computing|date=January 2008|volume=26|issue=1|pages=82–101|doi=10.1016/j.imavis.2007.08.013}}&amp;lt;/ref&amp;gt; clinical decision support,&amp;lt;ref&amp;gt;{{cite journal|last1=Kuperman|first1=G. J.|last2=Reichley|first2=R. M.|last3=Bailey|first3=T. C.|title=Using Commercial Knowledge Bases for Clinical Decision Support: Opportunities, Hurdles, and Recommendations|journal=Journal of the American Medical Informatics Association|date=1 July 2006|volume=13|issue=4|pages=369–371|doi=10.1197/jamia.M2055|pmid=16622160|pmc=1513681}}&amp;lt;/ref&amp;gt; knowledge discovery (mining &amp;quot;interesting&amp;quot; and actionable inferences from large databases),&amp;lt;ref&amp;gt;{{cite journal|last1=MCGARRY|first1=KEN|title=A survey of interestingness measures for knowledge discovery|journal=The Knowledge Engineering Review|date=1 December 2005|volume=20|issue=1|page=39|doi=10.1017/S0269888905000408|url=https://semanticscholar.org/paper/baf7f99e1b567868a6dc6238cc5906881242da01}}&amp;lt;/ref&amp;gt; and other areas.&amp;lt;ref&amp;gt;{{cite conference |url= |title=Automatic annotation and semantic retrieval of video sequences using multimedia ontologies |last1=Bertini |first1=M |last2=Del Bimbo |first2=A |last3=Torniai |first3=C |date=2006 |publisher=ACM |book-title=MM '06 Proceedings of the 14th ACM international conference on Multimedia |pages=679–682 |location=Santa Barbara |conference=14th ACM international conference on Multimedia}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Knowledge representation The most general ontologies are called upper ontologies, which attempt to provide a foundation for all other knowledge scene interpretation, clinical decision support, knowledge discovery (mining &amp;quot;interesting&amp;quot; and actionable inferences from large databases), and other areas.&lt;br /&gt;
&lt;br /&gt;
传统的AI研究的重点是'''&amp;lt;font color=#ff8000&amp;gt;知识表示 Knowledge Representation&amp;lt;/font&amp;gt;'''和'''&amp;lt;font color=#ff8000&amp;gt;知识工程 Knowledge Engineering&amp;lt;/font&amp;gt;'''。有些“专家系统”试图将某一小领域的专家所拥有的知识收集起来。此外，一些项目试图将普通人的“常识”收集到一个包含对世界的认知的知识的大数据库中。这些常识包括：情景、事件、状态和时间;原因和结果;关于知识的知识(我们知道别人知道什么);和许多其他研究较少的领域。“存在的东西”的表示是本体，本体是被正式描述的对象、关系、概念和属性的集合，这样的形式可以让软件智能体能够理解它。本体的语义描述了逻辑概念、角色和个体，通常在Web本体语言中以类、属性和个体的形式实现。最常见的本体称为'''&amp;lt;font color=#ff8000&amp;gt;上本体 Upper Ontology&amp;lt;/font&amp;gt;''',它试图为所有其他知识提供一个基础，它充当涵盖有关特定知识领域(兴趣领域或关注领域)的特定知识的领域本体之间的中介。这种形式化的知识表示可以用于基于内容的索引和检索，场景解释，临床决策，知识发现(从大型数据库中挖掘“有趣的”和可操作的推论)等领域。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Among the most difficult problems in knowledge representation are:&lt;br /&gt;
&lt;br /&gt;
Among the most difficult problems in knowledge representation are:&lt;br /&gt;
&lt;br /&gt;
知识表示中最困难的问题是:&lt;br /&gt;
&lt;br /&gt;
;[[Default reasoning]] and the [[qualification problem]]: Many of the things people know take the form of &amp;quot;working assumptions&amp;quot;. For example, if a bird comes up in conversation, people typically picture an animal that is fist-sized, sings, and flies. None of these things are true about all birds. [[John McCarthy (computer scientist)|John McCarthy]] identified this problem in 1969&amp;lt;ref name=&amp;quot;Qualification problem&amp;quot;/&amp;gt; as the qualification problem: for any commonsense rule that AI researchers care to represent, there tend to be a huge number of exceptions. Almost nothing is simply true or false in the way that abstract logic requires. AI research has explored a number of solutions to this problem.&amp;lt;ref name=&amp;quot;Default reasoning and non-monotonic logic&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Default reasoning and the qualification problem: Many of the things people know take the form of &amp;quot;working assumptions&amp;quot;. For example, if a bird comes up in conversation, people typically picture an animal that is fist-sized, sings, and flies. None of these things are true about all birds. John McCarthy identified this problem in 1969 as the qualification problem: for any commonsense rule that AI researchers care to represent, there tend to be a huge number of exceptions. Almost nothing is simply true or false in the way that abstract logic requires. AI research has explored a number of solutions to this problem.&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color=#ff8000&amp;gt;缺省推理 Default Reasoning&amp;lt;/font&amp;gt;''' 和'''&amp;lt;font color=#ff8000&amp;gt; 限定性问题 Qualification Problem&amp;lt;/font&amp;gt;''': 人们对事物的认知常常基于一个可行的假设。提到鸟，人们通常会想象一只拳头大小、会唱歌、会飞的动物，但并不是所有鸟类都有这样的特性。1969年约翰 · 麦卡锡将其归咎于限定性问题: 对于AI研究人员所关心的任何常识性规则来说，大量的例外往往存在。几乎没有什么在抽象逻辑角度是完全真或完全假。AI研究探索了许多解决这个问题的方法。&lt;br /&gt;
&lt;br /&gt;
;Breadth of commonsense knowledge: The number of atomic facts that the average person knows is very large. Research projects that attempt to build a complete knowledge base of [[commonsense knowledge]] (e.g., [[Cyc]]) require enormous amounts of laborious [[ontology engineering|ontological engineering]]—they must be built, by hand, one complicated concept at a time.&amp;lt;ref name=&amp;quot;Breadth of commonsense knowledge&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Breadth of commonsense knowledge: The number of atomic facts that the average person knows is very large. Research projects that attempt to build a complete knowledge base of commonsense knowledge (e.g., Cyc) require enormous amounts of laborious ontological engineering—they must be built, by hand, one complicated concept at a time.&lt;br /&gt;
&lt;br /&gt;
常识的广度: 常人掌握的“元常识”的数量是非常大的。一个像Cyc一样的完整的常识库若能建成，其需要大量劳动密集的本体工程ーー这些复杂的常识概念必须由人工一个一个地构建。&lt;br /&gt;
&lt;br /&gt;
   --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）。想要建立一个像Cyc一样的完整的常识库  一句为省译&lt;br /&gt;
&lt;br /&gt;
;Subsymbolic form of some commonsense knowledge: Much of what people know is not represented as &amp;quot;facts&amp;quot; or &amp;quot;statements&amp;quot; that they could express verbally. For example, a chess master will avoid a particular chess position because it &amp;quot;feels too exposed&amp;quot;{{sfn|Dreyfus|Dreyfus|1986}} or an art critic can take one look at a statue and realize that it is a fake.{{sfn|Gladwell|2005}} These are non-conscious and sub-symbolic intuitions or tendencies in the human brain.&amp;lt;ref name=&amp;quot;Intuition&amp;quot;/&amp;gt; Knowledge like this informs, supports and provides a context for symbolic, conscious knowledge. As with the related problem of sub-symbolic reasoning, it is hoped that [[situated artificial intelligence|situated AI]], [[computational intelligence]], or [[#Statistical|statistical AI]] will provide ways to represent this kind of knowledge.&amp;lt;ref name=&amp;quot;Intuition&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Subsymbolic form of some commonsense knowledge: Much of what people know is not represented as &amp;quot;facts&amp;quot; or &amp;quot;statements&amp;quot; that they could express verbally. For example, a chess master will avoid a particular chess position because it &amp;quot;feels too exposed&amp;quot; or an art critic can take one look at a statue and realize that it is a fake. These are non-conscious and sub-symbolic intuitions or tendencies in the human brain. Knowledge like this informs, supports and provides a context for symbolic, conscious knowledge. As with the related problem of sub-symbolic reasoning, it is hoped that situated AI, computational intelligence, or statistical AI will provide ways to represent this kind of knowledge.&lt;br /&gt;
&lt;br /&gt;
常识的'''&amp;lt;font color=#ff8000&amp;gt;亚符号 Subsymbolic&amp;lt;/font&amp;gt;''' 形式: 人们所知道的许多东西必不能用可以口头表达的“事实”或“陈述”描述。例如，一个国际象棋大师会避免下某个位置，因为觉得这步棋“感觉上太激进”；或者一个艺术评论家可以看一眼雕像，就知道它是假的。这些是人类大脑中无意识和亚符号的直觉。这种知识为符号化的、有意识的知识提供信息和语境。与亚符号推理的相关问题一样，我们希望情境AI、计算智能或统计AI能够表示这类知识。&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]） 这种知识为符号化的、有意识的知识提供信息和语境 一句为省译&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== 规划 Planning ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这个链接在介绍中——&lt;br /&gt;
&lt;br /&gt;
[[File:Hierarchical-control-system.svg|thumb| A [[hierarchical control system]] is a form of [[control system]] in which a set of devices and governing software is arranged in a hierarchy分层控制系统是控制系统的一种形式，在这种控制系统中，一组设备和控制软件被放在一个层次结构中.]]&lt;br /&gt;
&lt;br /&gt;
 A [[hierarchical control system is a form of control system in which a set of devices and governing software is arranged in a hierarchy.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Automated planning and scheduling}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Intelligent agents must be able to set goals and achieve them.&amp;lt;ref name=&amp;quot;Planning&amp;quot;/&amp;gt; They need a way to visualize the future—a representation of the state of the world and be able to make predictions about how their actions will change it—and be able to make choices that maximize the [[utility]] (or &amp;quot;value&amp;quot;) of available choices.&amp;lt;ref name=&amp;quot;Information value theory&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Intelligent agents must be able to set goals and achieve them. They need a way to visualize the future—a representation of the state of the world and be able to make predictions about how their actions will change it—and be able to make choices that maximize the utility (or &amp;quot;value&amp;quot;) of available choices.&lt;br /&gt;
&lt;br /&gt;
智能体必须能够设定并实现目标。他们需要能够有设想未来的办法——这是一种对其所处环境状况的表述，并能够预测他们的行动将如何改变环境——依此能够选择使效用（或者“价值”）最大化的选项。&lt;br /&gt;
&lt;br /&gt;
  --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]） 并能够预测他们的行动将如何改变环境——依此能够选择使效用（或者“价值”）最大化的选项 一句为省译&lt;br /&gt;
&lt;br /&gt;
In classical planning problems, the agent can assume that it is the only system acting in the world, allowing the agent to be certain of the consequences of its actions.&amp;lt;ref name=&amp;quot;Classical planning&amp;quot;/&amp;gt; However, if the agent is not the only actor, then it requires that the agent can reason under uncertainty. This calls for an agent that can not only assess its environment and make predictions but also evaluate its predictions and adapt based on its assessment.&amp;lt;ref name=&amp;quot;Non-deterministic planning&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In classical planning problems, the agent can assume that it is the only system acting in the world, allowing the agent to be certain of the consequences of its actions. However, if the agent is not the only actor, then it requires that the agent can reason under uncertainty. This calls for an agent that can not only assess its environment and make predictions but also evaluate its predictions and adapt based on its assessment.&lt;br /&gt;
&lt;br /&gt;
在经典的规划问题中，智能体可以假设它是世界上唯一运行着的系统，以便于智能体确定其做出某个行为带来的后果。然而，如果智能体不是唯一的参与者，这就要求智能体能够在不确定的情况下进行推理。这需要一智能体不仅能够评估其环境和作出预测，而且还评估其预测和根据其预测做出调整。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Multi-agent planning]] uses the [[cooperation]] and competition of many agents to achieve a given goal. [[Emergent behavior]] such as this is used by [[evolutionary algorithms]] and [[swarm intelligence]].&amp;lt;ref name=&amp;quot;Multi-agent planning&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Multi-agent planning uses the cooperation and competition of many agents to achieve a given goal. Emergent behavior such as this is used by evolutionary algorithms and swarm intelligence.&lt;br /&gt;
多智能体规划利用多个智能体之间的协作和竞争来达到目标。进化算法和群体智能会用到类似这样的涌现行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===学习 Learning ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这个链接在介绍中——&lt;br /&gt;
&lt;br /&gt;
{{Main|Machine learning}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Machine learning (ML), a fundamental concept of AI research since the field's inception,&amp;lt;ref&amp;gt;[[Alan Turing]] discussed the centrality of learning as early as 1950, in his classic paper &amp;quot;[[Computing Machinery and Intelligence]]&amp;quot;.{{Harv|Turing|1950}} In 1956, at the original Dartmouth AI summer conference, [[Ray Solomonoff]] wrote a report on unsupervised probabilistic machine learning: &amp;quot;An Inductive Inference Machine&amp;quot;.{{Harv|Solomonoff|1956}}&amp;lt;/ref&amp;gt; is the study of computer algorithms that improve automatically through experience.&amp;lt;ref&amp;gt;This is a form of [[Tom M. Mitchell|Tom Mitchell]]'s widely quoted definition of machine learning: &amp;quot;A computer program is set to learn from an experience ''E'' with respect to some task ''T'' and some performance measure ''P'' if its performance on ''T'' as measured by ''P'' improves with experience ''E''.&amp;quot;&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Machine learning&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Machine learning (ML), a fundamental concept of AI research since the field's inception, is the study of computer algorithms that improve automatically through experience.&lt;br /&gt;
&lt;br /&gt;
机器学习'''&amp;lt;font color=#ff8000&amp;gt; Machine Learning,ML&amp;lt;/font&amp;gt;'''是自AI诞生以来就有的一个基本概念，它研究如何通过经验自动改进计算机算法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Unsupervised learning]] is the ability to find patterns in a stream of input, without requiring a human to label the inputs first. [[Supervised learning]] includes both [[statistical classification|classification]] and numerical [[Regression analysis|regression]], which requires a human to label the input data first. Classification is used to determine what category something belongs in, and occurs after a program sees a number of examples of things from several categories. Regression is the attempt to produce a function that describes the relationship between inputs and outputs and predicts how the outputs should change as the inputs change.&amp;lt;ref name=&amp;quot;Machine learning&amp;quot;/&amp;gt; Both classifiers and regression learners can be viewed as &amp;quot;function approximators&amp;quot; trying to learn an unknown (possibly implicit) function; for example, a spam classifier can be viewed as learning a function that maps from the text of an email to one of two categories, &amp;quot;spam&amp;quot; or &amp;quot;not spam&amp;quot;. [[Computational learning theory]] can assess learners by [[computational complexity]], by [[sample complexity]] (how much data is required), or by other notions of [[optimization theory|optimization]].&amp;lt;ref&amp;gt;{{cite journal|last1=Jordan|first1=M. I.|last2=Mitchell|first2=T. M.|title=Machine learning: Trends, perspectives, and prospects|journal=Science|date=16 July 2015|volume=349|issue=6245|pages=255–260|doi=10.1126/science.aaa8415|pmid=26185243|bibcode=2015Sci...349..255J}}&amp;lt;/ref&amp;gt; In [[reinforcement learning]]&amp;lt;ref name=&amp;quot;Reinforcement learning&amp;quot;/&amp;gt; the agent is rewarded for good responses and punished for bad ones. The agent uses this sequence of rewards and punishments to form a strategy for operating in its problem space.&lt;br /&gt;
&lt;br /&gt;
Unsupervised learning is the ability to find patterns in a stream of input, without requiring a human to label the inputs first. Supervised learning includes both classification and numerical regression, which requires a human to label the input data first. Classification is used to determine what category something belongs in, and occurs after a program sees a number of examples of things from several categories. Regression is the attempt to produce a function that describes the relationship between inputs and outputs and predicts how the outputs should change as the inputs change. In reinforcement learning the agent is rewarded for good responses and punished for bad ones. The agent uses this sequence of rewards and punishments to form a strategy for operating in its problem space.&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color=#ff8000&amp;gt;无监督学习 Unsupervised Learning&amp;lt;/font&amp;gt;'''可以从数据流中发现某种模式，而不需要人类提前标注数据。'''&amp;lt;font color=#ff8000&amp;gt;有监督学习 Supervised Learning&amp;lt;/font&amp;gt;'''包括分类和回归，这需要人类首先标注数据。分类被用于确定某物属于哪个类别，这需要把大量来自多个类别的例子投入程序；回归用来产生一个描述输入和输出之间的关系的函数，并预测输出会如何随着输入的变化而变化。在强化学习中，智能体会因为好的回应而受到奖励，因为坏的回应而受到惩罚；智能体通过一系列的奖励和惩罚形成了一个在其问题空间中可施行的策略。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===自然语言处理 Natural language processing ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这个链接在介绍中——&lt;br /&gt;
&lt;br /&gt;
[[File:ParseTree.svg|thumb| A [[parse tree]] represents the [[syntax|syntactic]] structure of a sentence according to some [[formal grammar]].]一个[[根据某种形式语法，解析树表示一个句子的句法结构]]&lt;br /&gt;
&lt;br /&gt;
 A [[parse tree represents the syntactic structure of a sentence according to some formal grammar.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Natural language processing}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Natural language processing]]&amp;lt;ref name=&amp;quot;Natural language processing&amp;quot;/&amp;gt; (NLP) gives machines the ability to read and [[natural language understanding|understand]] human language. A sufficiently powerful natural language processing system would enable [[natural-language user interface]]s and the acquisition of knowledge directly from human-written sources, such as newswire texts. Some straightforward applications of natural language processing include [[information retrieval]], [[text mining]], [[question answering]]&amp;lt;ref&amp;gt;[https://www.academia.edu/2475776/Versatile_question_answering_systems_seeing_in_synthesis &amp;quot;Versatile question answering systems: seeing in synthesis&amp;quot;] {{webarchive|url=https://web.archive.org/web/20160201125047/http://www.academia.edu/2475776/Versatile_question_answering_systems_seeing_in_synthesis |date=1 February 2016 }}, Mittal et al., IJIIDS, 5(2), 119–142, 2011&lt;br /&gt;
&lt;br /&gt;
Natural language processing (NLP) gives machines the ability to read and understand human language. A sufficiently powerful natural language processing system would enable natural-language user interfaces and the acquisition of knowledge directly from human-written sources, such as newswire texts. Some straightforward applications of NLP include information retrieval, text mining, question answering&amp;lt;ref&amp;gt;[https://www.academia.edu/2475776/Versatile_question_answering_systems_seeing_in_synthesis &amp;quot;Versatile question answering systems: seeing in synthesis&amp;quot;] , Mittal et al., IJIIDS, 5(2), 119–142, 2011&lt;br /&gt;
&lt;br /&gt;
自然语言处理(NLP)赋予机器阅读和理解人类语言的能力。一个足够强大的自然语言处理系统可以提供自然语言用户界面，并能直接从如新闻专线文本的人类文字中获取知识。一些简单的自然语言处理的应用包括信息检索、文本挖掘、问答和机器翻译。目前许多方法使用词的共现频率来构建文本的句法表示。用“关键词定位”策略进行搜索很常见且可扩展，但很粗糙;搜索“狗”可能只匹配与含“狗”字的文档，而漏掉与“犬”匹配的文档。“词汇相关性”策略使用如“事故”这样的词出现的频次，评估文本想表达的情感。现代统计NLP方法可以结合所有这些策略以及其他策略，在以页或段落为单位的处理上获得还能让人接受的准确度，但仍然缺乏对单独的句子进行分类所需的语义理解。除了编码语义常识常见的困难外，现有的语义NLP有时可扩展性太差，无法应用到在商业中。而“叙述性”NLP除了达到语义NLP的功能之外，还想最终能做到充分理解常识推理。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt; and [[machine translation]].&amp;lt;ref name=&amp;quot;Applications of natural language processing&amp;quot;/&amp;gt; Many current approaches use word co-occurrence frequencies to construct syntactic representations of text. &amp;quot;Keyword spotting&amp;quot; strategies for search are popular and scalable but dumb; a search query for &amp;quot;dog&amp;quot; might only match documents with the literal word &amp;quot;dog&amp;quot; and miss a document with the word &amp;quot;poodle&amp;quot;. &amp;quot;Lexical affinity&amp;quot; strategies use the occurrence of words such as &amp;quot;accident&amp;quot; to [[sentiment analysis|assess the sentiment]] of a document. Modern statistical NLP approaches can combine all these strategies as well as others, and often achieve acceptable accuracy at the page or paragraph level, but continue to lack the semantic understanding required to classify isolated sentences well. Besides the usual difficulties with encoding semantic commonsense knowledge, existing semantic NLP sometimes scales too poorly to be viable in business applications. Beyond semantic NLP, the ultimate goal of &amp;quot;narrative&amp;quot; NLP is to embody a full understanding of commonsense reasoning.&amp;lt;ref&amp;gt;{{cite journal|last1=Cambria|first1=Erik|last2=White|first2=Bebo|title=Jumping NLP Curves: A Review of Natural Language Processing Research [Review Article]|journal=IEEE Computational Intelligence Magazine|date=May 2014|volume=9|issue=2|pages=48–57|doi=10.1109/MCI.2014.2307227}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt; and machine translation.&lt;br /&gt;
&lt;br /&gt;
/ ref 和机器翻译。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===知觉 Perception ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这个链接在介绍中——&lt;br /&gt;
&lt;br /&gt;
{{Main|Machine perception|Computer vision|Speech recognition}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Ääretuvastuse näide.png|thumb|[[Feature detection (computer vision)|Feature detection]] (pictured: [[edge detection]]) helps AI compose informative abstract structures out of raw data.Feature detection (pictured: edge detection) helps AI compose informative abstract structures out of raw data.]]]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[图片: 边缘检测特征提取]帮助AI从原始数据中合成有信息量的抽象结构&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Machine perception]]&amp;lt;ref name=&amp;quot;Machine perception&amp;quot;/&amp;gt; is the ability to use input from sensors (such as cameras (visible spectrum or infrared), microphones, wireless signals, and active [[lidar]], sonar, radar, and [[tactile sensor]]s) to deduce aspects of the world. Applications include [[speech recognition]],&amp;lt;ref name=&amp;quot;Speech recognition&amp;quot;/&amp;gt; [[facial recognition system|facial recognition]], and [[object recognition]].&amp;lt;ref name=&amp;quot;Object recognition&amp;quot;/&amp;gt; [[Computer vision]] is the ability to analyze visual input. Such input is usually ambiguous; a giant, fifty-meter-tall pedestrian far away may produce exactly the same pixels as a nearby normal-sized pedestrian, requiring the AI to judge the relative likelihood and reasonableness of different interpretations, for example by using its &amp;quot;object model&amp;quot; to assess that fifty-meter pedestrians do not exist.&amp;lt;ref name=&amp;quot;Computer vision&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Machine perception is the ability to use input from sensors (such as cameras (visible spectrum or infrared), microphones, wireless signals, and active lidar, sonar, radar, and tactile sensors) to deduce aspects of the world. Applications include speech recognition, facial recognition, and object recognition. Computer vision is the ability to analyze visual input. Such input is usually ambiguous; a giant, fifty-meter-tall pedestrian far away may produce exactly the same pixels as a nearby normal-sized pedestrian, requiring the AI to judge the relative likelihood and reasonableness of different interpretations, for example by using its &amp;quot;object model&amp;quot; to assess that fifty-meter pedestrians do not exist.&lt;br /&gt;
&lt;br /&gt;
机器感知是利用传感器(如可见光或红外线摄像头、麦克风、无线信号、激光雷达、声纳、雷达和触觉传感器)的输入来推断世界的不同角度的能力。应用包括语音识别、面部识别和物体识别。计算机视觉是分析可视化输入的能力。这种输入通常是模糊的; 一个在远处50米高的巨人可能会与近处正常大小的行人占据完全相同的像素，这就要求AI判断不同解释的相对可能性和合理性，例如使用”物体模型”来判断50米高的巨人其实是不存在的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== 运动和操作 Motion and manipulation ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这个链接在介绍中——&lt;br /&gt;
&lt;br /&gt;
{{Main|Robotics}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
AI is heavily used in [[robotics]].&amp;lt;ref name=&amp;quot;Robotics&amp;quot;/&amp;gt; Advanced [[robotic arm]]s and other [[industrial robot]]s, widely used in modern factories, can learn from experience how to move efficiently despite the presence of friction and gear slippage.&amp;lt;ref name=&amp;quot;Configuration space&amp;quot;/&amp;gt; A modern mobile robot, when given a small, static, and visible environment, can easily determine its location and [[robotic mapping|map]] its environment; however, dynamic environments, such as (in [[endoscopy]]) the interior of a patient's breathing body, pose a greater challenge. [[Motion planning]] is the process of breaking down a movement task into &amp;quot;primitives&amp;quot; such as individual joint movements. Such movement often involves compliant motion, a process where movement requires maintaining physical contact with an object.{{sfn|Tecuci|2012}}&amp;lt;ref name=&amp;quot;Robotic mapping&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Cadena|first1=Cesar|last2=Carlone|first2=Luca|last3=Carrillo|first3=Henry|last4=Latif|first4=Yasir|last5=Scaramuzza|first5=Davide|last6=Neira|first6=Jose|last7=Reid|first7=Ian|last8=Leonard|first8=John J.|title=Past, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age|journal=IEEE Transactions on Robotics|date=December 2016|volume=32|issue=6|pages=1309–1332|doi=10.1109/TRO.2016.2624754|arxiv=1606.05830|bibcode=2016arXiv160605830C}}&amp;lt;/ref&amp;gt; [[Moravec's paradox]] generalizes that low-level sensorimotor skills that humans take for granted are, counterintuitively, difficult to program into a robot; the paradox is named after [[Hans Moravec]], who stated in 1988 that &amp;quot;it is comparatively easy to make computers exhibit adult level performance on intelligence tests or playing checkers, and difficult or impossible to give them the skills of a one-year-old when it comes to perception and mobility&amp;quot;.&amp;lt;ref&amp;gt;{{Cite book| first = Hans | last = Moravec | year = 1988 | title = Mind Children | publisher = Harvard University Press | author-link =Hans Moravec| p=15}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|last1=Chan|first1=Szu Ping|title=This is what will happen when robots take over the world|url=https://www.telegraph.co.uk/finance/economics/11994694/Heres-what-will-happen-when-robots-take-over-the-world.html|accessdate=23 April 2018|date=15 November 2015}}&amp;lt;/ref&amp;gt; This is attributed to the fact that, unlike checkers, physical dexterity has been a direct target of [[natural selection]] for millions of years.&amp;lt;ref name=&amp;quot;The Economist&amp;quot;&amp;gt;{{cite news|title=IKEA furniture and the limits of AI|url=https://www.economist.com/news/leaders/21740735-humans-have-had-good-run-most-recent-breakthrough-robotics-it-clear|accessdate=24 April 2018|work=The Economist|date=2018|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
AI is heavily used in robotics. Moravec's paradox generalizes that low-level sensorimotor skills that humans take for granted are, counterintuitively, difficult to program into a robot; the paradox is named after Hans Moravec, who stated in 1988 that &amp;quot;it is comparatively easy to make computers exhibit adult level performance on intelligence tests or playing checkers, and difficult or impossible to give them the skills of a one-year-old when it comes to perception and mobility&amp;quot;. This is attributed to the fact that, unlike checkers, physical dexterity has been a direct target of natural selection for millions of years.&lt;br /&gt;
&lt;br /&gt;
AI在机器人学中应用广泛。在现代工厂中广泛使用的高级机械臂和其他工业机器人，可以从经验中学习如何在存在摩擦和齿轮滑移的情况下有效地移动。当处在一个静态且可见的小环境中时，现代移动机器人可以很容易地确定自己的位置并绘制环境地图；然而如果是动态环境，比如用内窥镜检查病人呼吸的身体的内部，难度就会更高。运动规划是将一个运动任务分解为如单个的关节运动这样的“基本任务”的过程。这种运动通常包括顺应运动，在这个过程中需要与物体保持物理接触。'''&amp;lt;font color=#ff8000&amp;gt;莫拉维克悖论 Moravec's Paradox&amp;lt;/font&amp;gt;''' 概括了人类理所当然认为低水平的感知运动技能很难在编程给机器人的事实，这个悖论是以汉斯 · 莫拉维克的名字命名的，他在1988年表示: “让计算机在智力测试或下跳棋中展现出成人水平的表现相对容易，但要让计算机拥有一岁小孩的感知和移动能力却很难，甚至不可能。”这是因为，身体灵巧性在数百万年的自然选择中一直作为一个直接的目标以增强人类的生存能力；而与此相比，跳棋技能则很奢侈，“擅长跳棋”的基因并不被生存导向的自然选择所偏好与富集。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）这是因为，与跳棋不同，身体灵巧性一直在数百万年的自然选择后才形成的。一句为意译&lt;br /&gt;
 --[[用户:Paradoxist-Paradoxer|Paradoxist@Paradoxer]]（[[用户讨论:Paradoxist-Paradoxer|讨论]]）应强调自然选择的目标是如何的——修改为如上更佳。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== 社会智能 Social intelligence ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这个链接在介绍中——&lt;br /&gt;
&lt;br /&gt;
{{Main|Affective computing}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Kismet robot at MIT Museum.jpg|thumb|[[Kismet (robot)|Kismet]], a robot with rudimentary social skills{{sfn|''Kismet''}}Kismet，一个具有基本社交技能的机器人]]]]&lt;br /&gt;
&lt;br /&gt;
Kismet, a robot with rudimentary social skills]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Moravec's paradox can be extended to many forms of social intelligence.&amp;lt;ref&amp;gt;{{cite magazine |last1=Thompson|first1=Derek|title=What Jobs Will the Robots Take?|url=https://www.theatlantic.com/business/archive/2014/01/what-jobs-will-the-robots-take/283239/|accessdate=24 April 2018|magazine=The Atlantic|date=2018}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Scassellati|first1=Brian|title=Theory of mind for a humanoid robot|journal=Autonomous Robots|volume=12|issue=1|year=2002|pages=13–24|doi=10.1023/A:1013298507114}}&amp;lt;/ref&amp;gt; Distributed multi-agent coordination of autonomous vehicles remains a difficult problem.&amp;lt;ref&amp;gt;{{cite journal|last1=Cao|first1=Yongcan|last2=Yu|first2=Wenwu|last3=Ren|first3=Wei|last4=Chen|first4=Guanrong|title=An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination|journal=IEEE Transactions on Industrial Informatics|date=February 2013|volume=9|issue=1|pages=427–438|doi=10.1109/TII.2012.2219061|arxiv=1207.3231}}&amp;lt;/ref&amp;gt; [[Affective computing]] is an interdisciplinary umbrella that comprises systems which recognize, interpret, process, or simulate human [[Affect (psychology)|affects]].{{sfn|Thro|1993}}{{sfn|Edelson|1991}}{{sfn|Tao|Tan|2005}} Moderate successes related to affective computing include textual [[sentiment analysis]] and, more recently, multimodal affect analysis (see [[multimodal sentiment analysis]]), wherein AI classifies the affects displayed by a videotaped subject.&amp;lt;ref&amp;gt;{{cite journal|last1=Poria|first1=Soujanya|last2=Cambria|first2=Erik|last3=Bajpai|first3=Rajiv|last4=Hussain|first4=Amir|title=A review of affective computing: From unimodal analysis to multimodal fusion|journal=Information Fusion|date=September 2017|volume=37|pages=98–125|doi=10.1016/j.inffus.2017.02.003|hdl=1893/25490|hdl-access=free}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Moravec's paradox can be extended to many forms of social intelligence. Distributed multi-agent coordination of autonomous vehicles remains a difficult problem. Affective computing is an interdisciplinary umbrella that comprises systems which recognize, interpret, process, or simulate human affects. Moderate successes related to affective computing include textual sentiment analysis and, more recently, multimodal affect analysis (see multimodal sentiment analysis), wherein AI classifies the affects displayed by a videotaped subject.&lt;br /&gt;
&lt;br /&gt;
莫拉维克悖论可以扩展到社会智能的许多形式。自动驾驶汽车分布式多智能体协调一直是一个难题。情感计算是一个跨学科交叉领域，包括了识别、解释、处理、模拟人的情感的系统。与情感计算相关的一些还算成功的领域有文本情感分析，以及最近的'''&amp;lt;font color=#ff8000&amp;gt;多模态情感分析 Multimodal Affect Analysis&amp;lt;/font&amp;gt;''' ，多模态情感分析中AI可以做到将录像中被试表现出的情感进行分类。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In the long run, social skills and an understanding of human emotion and [[game theory]] would be valuable to a social agent. Being able to predict the actions of others by understanding their motives and emotional states would allow an agent to make better decisions. Some computer systems mimic human emotion and expressions to appear more sensitive to the emotional dynamics of human interaction, or to otherwise facilitate [[human–computer interaction]].&amp;lt;ref name=&amp;quot;Emotion and affective computing&amp;quot;/&amp;gt; Similarly, some [[virtual assistant]]s are programmed to speak conversationally or even to banter humorously; this tends to give naïve users an unrealistic conception of how intelligent existing computer agents actually are.&amp;lt;ref&amp;gt;{{cite magazine|last1=Waddell|first1=Kaveh|title=Chatbots Have Entered the Uncanny Valley|url=https://www.theatlantic.com/technology/archive/2017/04/uncanny-valley-digital-assistants/523806/|accessdate=24 April 2018|magazine=The Atlantic|date=2018}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In the long run, social skills and an understanding of human emotion and game theory would be valuable to a social agent. Being able to predict the actions of others by understanding their motives and emotional states would allow an agent to make better decisions. Some computer systems mimic human emotion and expressions to appear more sensitive to the emotional dynamics of human interaction, or to otherwise facilitate human–computer interaction.&lt;br /&gt;
&lt;br /&gt;
从长远来看，社交技巧以及对人类情感和博弈论的理解对社会智能体的价值很高。能够通过理解他人的动机和情绪状态来预测他人的行为，会让智能体做出更好的决策。有些计算机系统模仿人类的情感和表情，有利于对人类交互的情感动力学更敏感，或利于促进人机交互。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== 通用智能 General intelligence ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is linked to in the introduction --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——这个链接在介绍中——&lt;br /&gt;
&lt;br /&gt;
{{Main|Artificial general intelligence|AI-complete}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Historically, projects such as the Cyc knowledge base (1984–) and the massive Japanese [[Fifth generation computer|Fifth Generation Computer Systems]] initiative (1982–1992) attempted to cover the breadth of human cognition. These early projects failed to escape the limitations of non-quantitative symbolic logic models and, in retrospect, greatly underestimated the difficulty of cross-domain AI. Nowadays, the vast majority of current AI researchers work instead on tractable &amp;quot;narrow AI&amp;quot; applications (such as medical diagnosis or automobile navigation).&amp;lt;ref name=&amp;quot;contemporary agi&amp;quot;&amp;gt;{{cite book|last1=Pennachin|first1=C.|last2=Goertzel|first2=B.|title=Contemporary Approaches to Artificial General Intelligence|journal=Artificial General Intelligence. Cognitive Technologies|date=2007|doi=10.1007/978-3-540-68677-4_1|publisher=Springer|location=Berlin, Heidelberg|series=Cognitive Technologies|isbn=978-3-540-23733-4}}&amp;lt;/ref&amp;gt; Many researchers predict that such &amp;quot;narrow AI&amp;quot; work in different individual domains will eventually be incorporated into a machine with [[artificial general intelligence]] (AGI), combining most of the narrow skills mentioned in this article and at some point even exceeding human ability in most or all these areas.&amp;lt;ref name=&amp;quot;General intelligence&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Roberts&amp;quot;&amp;gt;{{cite magazine|last1=Roberts|first1=Jacob|title=Thinking Machines: The Search for Artificial Intelligence|magazine=Distillations|date=2016|volume=2|issue=2|pages=14–23|url=https://www.sciencehistory.org/distillations/magazine/thinking-machines-the-search-for-artificial-intelligence|accessdate=20 March 2018|archive-url=https://web.archive.org/web/20180819152455/https://www.sciencehistory.org/distillations/magazine/thinking-machines-the-search-for-artificial-intelligence|archive-date=19 August 2018|url-status=dead}}&amp;lt;/ref&amp;gt; Many advances have general, cross-domain significance. One high-profile example is that [[DeepMind]] in the 2010s developed a &amp;quot;generalized artificial intelligence&amp;quot; that could learn many diverse [[Atari 2600|Atari]] games on its own, and later developed a variant of the system which succeeds at [[Catastrophic interference#The Sequential Learning Problem: McCloskey and Cohen (1989)|sequential learning]].&amp;lt;ref&amp;gt;{{cite news|title=The superhero of artificial intelligence: can this genius keep it in check?|url=https://www.theguardian.com/technology/2016/feb/16/demis-hassabis-artificial-intelligence-deepmind-alphago|accessdate=26 April 2018|work=the Guardian|date=16 February 2016|language=en}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Mnih|first1=Volodymyr|last2=Kavukcuoglu|first2=Koray|last3=Silver|first3=David|last4=Rusu|first4=Andrei A.|last5=Veness|first5=Joel|last6=Bellemare|first6=Marc G.|last7=Graves|first7=Alex|last8=Riedmiller|first8=Martin|last9=Fidjeland|first9=Andreas K.|last10=Ostrovski|first10=Georg|last11=Petersen|first11=Stig|last12=Beattie|first12=Charles|last13=Sadik|first13=Amir|last14=Antonoglou|first14=Ioannis|last15=King|first15=Helen|last16=Kumaran|first16=Dharshan|last17=Wierstra|first17=Daan|last18=Legg|first18=Shane|last19=Hassabis|first19=Demis|title=Human-level control through deep reinforcement learning|journal=Nature|date=26 February 2015|volume=518|issue=7540|pages=529–533|doi=10.1038/nature14236|pmid=25719670|bibcode=2015Natur.518..529M}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|last1=Sample|first1=Ian|title=Google's DeepMind makes AI program that can learn like a human|url=https://www.theguardian.com/global/2017/mar/14/googles-deepmind-makes-ai-program-that-can-learn-like-a-human|accessdate=26 April 2018|work=the Guardian|date=14 March 2017|language=en}}&amp;lt;/ref&amp;gt; Besides [[transfer learning]],&amp;lt;ref&amp;gt;{{cite news|title=From not working to neural networking|url=https://www.economist.com/news/special-report/21700756-artificial-intelligence-boom-based-old-idea-modern-twist-not|accessdate=26 April 2018|work=The Economist|date=2016|language=en}}&amp;lt;/ref&amp;gt; hypothetical AGI breakthroughs could include the development of reflective architectures that can engage in decision-theoretic metareasoning, and figuring out how to &amp;quot;slurp up&amp;quot; a comprehensive knowledge base from the entire unstructured [[World Wide Web|Web]].{{sfn|Russell|Norvig|2009|chapter=27. AI: The Present and Future}} Some argue that some kind of (currently-undiscovered) conceptually straightforward, but mathematically difficult, &amp;quot;Master Algorithm&amp;quot; could lead to AGI.{{sfn|Domingos|2015|chapter=9. The Pieces of the Puzzle Fall into Place}} Finally, a few &amp;quot;emergent&amp;quot; approaches look to simulating human intelligence extremely closely, and believe that [[anthropomorphism|anthropomorphic]] features like an [[artificial brain]] or simulated [[developmental robotics|child development]] may someday reach a critical point where general intelligence emerges.&amp;lt;ref name=&amp;quot;Brain simulation&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Goertzel|first1=Ben|last2=Lian|first2=Ruiting|last3=Arel|first3=Itamar|last4=de Garis|first4=Hugo|last5=Chen|first5=Shuo|title=A world survey of artificial brain projects, Part II: Biologically inspired cognitive architectures|journal=Neurocomputing|date=December 2010|volume=74|issue=1–3|pages=30–49|doi=10.1016/j.neucom.2010.08.012}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Historically, projects such as the Cyc knowledge base (1984–) and the massive Japanese Fifth Generation Computer Systems initiative (1982–1992) attempted to cover the breadth of human cognition. These early projects failed to escape the limitations of non-quantitative symbolic logic models and, in retrospect, greatly underestimated the difficulty of cross-domain AI. Nowadays, the vast majority of current AI researchers work instead on tractable &amp;quot;narrow AI&amp;quot; applications (such as medical diagnosis or automobile navigation). Many researchers predict that such &amp;quot;narrow AI&amp;quot; work in different individual domains will eventually be incorporated into a machine with artificial general intelligence (AGI), combining most of the narrow skills mentioned in this article and at some point even exceeding human ability in most or all these areas. Many advances have general, cross-domain significance. One high-profile example is that DeepMind in the 2010s developed a &amp;quot;generalized artificial intelligence&amp;quot; that could learn many diverse Atari games on its own, and later developed a variant of the system which succeeds at sequential learning. Besides transfer learning, hypothetical AGI breakthroughs could include the development of reflective architectures that can engage in decision-theoretic metareasoning, and figuring out how to &amp;quot;slurp up&amp;quot; a comprehensive knowledge base from the entire unstructured Web. Some argue that some kind of (currently-undiscovered) conceptually straightforward, but mathematically difficult, &amp;quot;Master Algorithm&amp;quot; could lead to AGI. Finally, a few &amp;quot;emergent&amp;quot; approaches look to simulating human intelligence extremely closely, and believe that anthropomorphic features like an artificial brain or simulated child development may someday reach a critical point where general intelligence emerges.&lt;br /&gt;
&lt;br /&gt;
历史上，诸如 Cyc 知识库(1984 -)和大规模的日本第五代计算机系统倡议(1982-1992)等项目试图涵盖人类的所有认知。这些早期的项目未能逃脱非定量符号逻辑模型的限制，现在回过头看，这些项目大大低估了实现跨领域AI的难度。当下绝大多数AI研究人员主要研究易于处理的“狭义AI”应用(如医疗诊断或汽车导航)。许多研究人员预测，不同领域的“狭义AI”工作最终将被整合到一台具有人工通用智能(AGI)的机器中，结合上文提到的大多数狭义功能，甚至在某种程度上在大多数或所有这些领域都超过人类。许多进展具有普遍的、跨领域的意义。一个著名的例子是，21世纪一零年代，DeepMind开发了一种“'''&amp;lt;font color=#ff8000&amp;gt;通用人工智能 Generalized Artificial Intelligence&amp;lt;/font&amp;gt;'''” ，它可以自己学习许多不同的 Atari 游戏，后来又开发了这种系统的升级版，在序贯学习方面取得了成功。除了迁移学习，未来AGI 的突破可能包括开发能够进行决策理论元推理的反射架构，以及从整个非结构化的网页中整合一个全面的知识库。一些人认为，某种(目前尚未发现的)概念简单，但在数学上困难的“终极算法”可以产生AGI。最后，一些“涌现”的方法着眼于尽可能地模拟人类智能，并相信如人工大脑或模拟儿童发展等拟人方案，有一天会达到一个临界点，通用智能在此涌现。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Many of the problems in this article may also require general intelligence, if machines are to solve the problems as well as people do. For example, even specific straightforward tasks, like [[machine translation]], require that a machine read and write in both languages ([[#Natural language processing|NLP]]), follow the author's argument ([[#Deduction, reasoning, problem solving|reason]]), know what is being talked about ([[#Knowledge representation|knowledge]]), and faithfully reproduce the author's original intent ([[#Social intelligence|social intelligence]]). A problem like machine translation is considered &amp;quot;[[AI-complete]]&amp;quot;, because all of these problems need to be solved simultaneously in order to reach human-level machine performance.&lt;br /&gt;
&lt;br /&gt;
Many of the problems in this article may also require general intelligence, if machines are to solve the problems as well as people do. For example, even specific straightforward tasks, like machine translation, require that a machine read and write in both languages (NLP), follow the author's argument (reason), know what is being talked about (knowledge), and faithfully reproduce the author's original intent (social intelligence). A problem like machine translation is considered &amp;quot;AI-complete&amp;quot;, because all of these problems need to be solved simultaneously in order to reach human-level machine performance.&lt;br /&gt;
&lt;br /&gt;
如果机器要像人一样解决问题，那么本文中的许多问题也可能需要通用智能。例如，即使是特定的如机器翻译的直接任务，也要求机器用两种语言进行读写(NLP) ，符合作者的观点(推理) ，知道谈论的内容(知识) ，并忠实地再现作者的原始意图(社会智能)。像机器翻译这样的问题被认为是“AI完备”的，因为需要同时解决所有这些问题，机器性能才能达到人类水平。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== 方法 ==&lt;br /&gt;
&lt;br /&gt;
There is no established unifying theory or [[paradigm]] that guides AI research. Researchers disagree about many issues.&amp;lt;ref&amp;gt;[[Nils Nilsson (researcher)|Nils Nilsson]] writes: &amp;quot;Simply put, there is wide disagreement in the field about what AI is all about&amp;quot; {{Harv|Nilsson|1983|p=10}}.&amp;lt;/ref&amp;gt; A few of the most long standing questions that have remained unanswered are these: should artificial intelligence simulate natural intelligence by studying [[psychology]] or [[Neuroscience|neurobiology]]? Or is [[human biology]] as irrelevant to AI research as bird biology is to [[aeronautical engineering]]?&amp;lt;ref name=&amp;quot;Biological intelligence vs. intelligence in general&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
There is no established unifying theory or paradigm that guides AI research. Researchers disagree about many issues. A few of the most long standing questions that have remained unanswered are these: should artificial intelligence simulate natural intelligence by studying psychology or neurobiology? Or is human biology as irrelevant to AI research as bird biology is to aeronautical engineering?&lt;br /&gt;
&lt;br /&gt;
目前还没有统一的理论或范式来指导AI的研究。研究人员在许多问题上存在分歧。&amp;lt;ref&amp;gt;[[Nils Nilsson (researcher)|Nils Nilsson]] writes: &amp;quot;Simply put, there is wide disagreement in the field about what AI is all about&amp;quot; {{Harv|Nilsson|1983|p=10}}.&amp;lt;/ref&amp;gt;一些长期悬而未决的问题是: AI是否应该通过研究心理学或神经生物学来模拟天然智能？人类生物学和AI研究的关系和鸟类生物学和航空工程学的关系一样吗？&lt;br /&gt;
&lt;br /&gt;
Can intelligent behavior be described using simple, elegant principles (such as [[logic]] or [[optimization (mathematics)|optimization]])? Or does it necessarily require solving a large number of completely unrelated problems?&amp;lt;ref name=&amp;quot;Neats vs. scruffies&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Can intelligent behavior be described using simple, elegant principles (such as logic or optimization)? Or does it necessarily require solving a large number of completely unrelated problems?&lt;br /&gt;
&lt;br /&gt;
智能行为可以用简单、优雅的原则(如逻辑或优化)来描述吗？还是需要去解决大量完全不相关的问题？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===控制论与大脑模拟 ===&lt;br /&gt;
&lt;br /&gt;
{{Main|Cybernetics|Computational neuroscience}}&lt;br /&gt;
&lt;br /&gt;
In the 1940s and 1950s, a number of researchers explored the connection between [[neurobiology]], [[information theory]], and [[cybernetics]]. Some of them built machines that used electronic networks to exhibit rudimentary intelligence, such as [[W. Grey Walter]]'s [[turtle (robot)|turtles]] and the [[Johns Hopkins Beast]]. Many of these researchers gathered for meetings of the Teleological Society at [[Princeton University]] and the [[Ratio Club]] in England.&amp;lt;ref name=&amp;quot;AI's immediate precursors&amp;quot;/&amp;gt; By 1960, this approach was largely abandoned, although elements of it would be revived in the 1980s.&lt;br /&gt;
&lt;br /&gt;
In the 1940s and 1950s, a number of researchers explored the connection between neurobiology, information theory, and cybernetics. Some of them built machines that used electronic networks to exhibit rudimentary intelligence, such as W. Grey Walter's turtles and the Johns Hopkins Beast. Many of these researchers gathered for meetings of the Teleological Society at Princeton University and the Ratio Club in England. By 1960, this approach was largely abandoned, although elements of it would be revived in the 1980s.&lt;br /&gt;
&lt;br /&gt;
在20世纪四五十年代，许多研究人员探索了神经生物学、信息论和控制论之间的联系。他们中的一些人利用电子网络制造机器来表现基本的智能，比如 '''W·格雷·沃尔特 W. Grey Walter'''的乌龟和'''约翰·霍普金斯 Johns Hopkins'''的野兽。这些研究人员中的许多人参加了在普林斯顿大学的'''目的论学社'''和英格兰的'''比率俱乐部'''举办的集会。到了1960年，这种方法基本上被放弃了，直到二十世纪八十年代一些部分又被重新使用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===符号化方法===&lt;br /&gt;
&lt;br /&gt;
{{Main|Symbolic AI}}&lt;br /&gt;
&lt;br /&gt;
When access to digital computers became possible in the mid-1950s, AI research began to explore the possibility that human intelligence could be reduced to symbol manipulation. The research was centered in three institutions: [[Carnegie Mellon University]], [[Stanford]] and [[MIT]], and as described below, each one developed its own style of research. [[John Haugeland]] named these symbolic approaches to AI &amp;quot;good old fashioned AI&amp;quot; or &amp;quot;[[GOFAI]]&amp;quot;.&amp;lt;ref name=&amp;quot;GOFAI&amp;quot;/&amp;gt; During the 1960s, symbolic approaches had achieved great success at simulating high-level &amp;quot;thinking&amp;quot; in small demonstration programs. Approaches based on [[cybernetics]] or [[artificial neural network]]s were abandoned or pushed into the background.&amp;lt;ref&amp;gt;The most dramatic case of sub-symbolic AI being pushed into the background was the devastating critique of [[perceptron]]s by [[Marvin Minsky]] and [[Seymour Papert]] in 1969. See [[History of AI]], [[AI winter]], or [[Frank Rosenblatt]].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
When access to digital computers became possible in the mid-1950s, AI research began to explore the possibility that human intelligence could be reduced to symbol manipulation. The research was centered in three institutions: Carnegie Mellon University, Stanford and MIT, and as described below, each one developed its own style of research. John Haugeland named these symbolic approaches to AI &amp;quot;good old fashioned AI&amp;quot; or &amp;quot;GOFAI&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
20世纪50年代中期，当数字计算机成为可能时，AI研究开始探索把人类智能化归为符号操纵的可能性。这项研究集中在3个机构: 卡内基梅隆大学，斯坦福和麻省理工学院，正如下面所描述的，每个机构都有自己的研究风格。约翰 · 豪格兰德将这些具有象征意义的AI方法命名为“好的老式人工智能 Good Old Fashioned AI”或“ GOFAI”&amp;lt;ref name=&amp;quot;GOFAI&amp;quot;/&amp;gt;。20世纪60年代的时候，符号化方法在模拟高层次“思考”的小型程序中取得了巨大的成就。而基于[[控制论]]和[[人工神经网络]]的方法则被抛弃，或者只作为背景出现。&amp;lt;ref&amp;gt;The most dramatic case of sub-symbolic AI being pushed into the background was the devastating critique of [[perceptron]]s by [[Marvin Minsky]] and [[Seymour Papert]] in 1969. See [[History of AI]], [[AI winter]], or [[Frank Rosenblatt]].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Researchers in the 1960s and the 1970s were convinced that symbolic approaches would eventually succeed in creating a machine with [[artificial general intelligence]] and considered this the goal of their field.&lt;br /&gt;
&lt;br /&gt;
Researchers in the 1960s and the 1970s were convinced that symbolic approaches would eventually succeed in creating a machine with artificial general intelligence and considered this the goal of their field.&lt;br /&gt;
&lt;br /&gt;
20世纪六七十年代的研究人员相信，符号方法最终会成功地创造出一台具有[[通用人工智能]]的机器，并以此作为他们研究领域的目标。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====模拟认知的方法====&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Economist [[Herbert A. Simon|Herbert Simon]] and [[Allen Newell]] studied human problem-solving skills and attempted to formalize them, and their work laid the foundations of the field of artificial intelligence, as well as [[cognitive science]], [[operations research]] and [[management science]]. Their research team used the results of [[psychology|psychological]] experiments to develop programs that simulated the techniques that people used to solve problems. This tradition, centered at [[Carnegie Mellon University]] would eventually culminate in the development of the [[Soar (cognitive architecture)|Soar]] architecture in the middle 1980s.&amp;lt;ref name=&amp;quot;AI at CMU in the 60s&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;Soar&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Economist Herbert Simon and Allen Newell studied human problem-solving skills and attempted to formalize them, and their work laid the foundations of the field of artificial intelligence, as well as cognitive science, operations research and management science. Their research team used the results of psychological experiments to develop programs that simulated the techniques that people used to solve problems. This tradition, centered at Carnegie Mellon University would eventually culminate in the development of the Soar architecture in the middle 1980s.&lt;br /&gt;
&lt;br /&gt;
经济学家[[赫伯特·西蒙]]和[[艾伦·纽厄尔]]研究了人类解决问题的技能，并试图将其形式化。他们的工作为AI、认知科学、运筹学和管理科学奠定了基础。他们的研究团队利用心理学实验的结果来开发程序，模拟人们用来解决问题的方法。以卡内基梅隆大学为中心，这种研究传统最终在20世纪80年代中期的SOAR架构开发过程中达到顶峰。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==== 基于逻辑的方法 ====&lt;br /&gt;
&lt;br /&gt;
Unlike Simon and Newell, [[John McCarthy (computer scientist)|John McCarthy]] felt that machines did not need to simulate human thought, but should instead try to find the essence of abstract reasoning and problem-solving, regardless whether people used the same algorithms.&amp;lt;ref name=&amp;quot;Biological intelligence vs. intelligence in general&amp;quot;/&amp;gt; His laboratory at [[Stanford University|Stanford]] ([[Stanford Artificial Intelligence Laboratory|SAIL]]) focused on using formal [[logic]] to solve a wide variety of problems, including [[knowledge representation]], [[automated planning and scheduling|planning]] and [[machine learning|learning]].&amp;lt;ref name=&amp;quot;AI at Stanford in the 60s&amp;quot;/&amp;gt; Logic was also the focus of the work at the [[University of Edinburgh]] and elsewhere in Europe which led to the development of the programming language [[Prolog]] and the science of [[logic programming]].&amp;lt;ref name=&amp;quot;AI at Edinburgh and France in the 60s&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Unlike Simon and Newell, John McCarthy felt that machines did not need to simulate human thought, but should instead try to find the essence of abstract reasoning and problem-solving, regardless whether people used the same algorithms. His laboratory at Stanford (SAIL) focused on using formal logic to solve a wide variety of problems, including knowledge representation, planning and learning. Logic was also the focus of the work at the University of Edinburgh and elsewhere in Europe which led to the development of the programming language Prolog and the science of logic programming.&lt;br /&gt;
&lt;br /&gt;
与西蒙和纽厄尔不同，约翰·麦卡锡认为机器不需要模拟人类的思维，而是应该尝试寻找抽象推理和解决问题的本质，不管人们是否使用相同的算法。&amp;lt;ref name=&amp;quot;Biological intelligence vs. intelligence in general&amp;quot;/&amp;gt; 他在斯坦福大学的实验室(SAIL)致力于使用形式逻辑来解决各种各样的问题，包括知识表示、规划和学习。逻辑也是爱丁堡大学和欧洲其他地方工作的重点，这促进了编程语言 Prolog 和逻辑编程科学的发展。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====反逻辑的或“邋遢”的方法====&lt;br /&gt;
&lt;br /&gt;
Researchers at [[MIT]] (such as [[Marvin Minsky]] and [[Seymour Papert]])&amp;lt;ref name=&amp;quot;AI at MIT in the 60s&amp;quot;/&amp;gt; found that solving difficult problems in [[computer vision|vision]] and [[natural language processing]] required ad-hoc solutions—they argued that there was no simple and general principle (like [[logic]]) that would capture all the aspects of intelligent behavior. [[Roger Schank]] described their &amp;quot;anti-logic&amp;quot; approaches as &amp;quot;[[Neats vs. scruffies|scruffy]]&amp;quot; (as opposed to the &amp;quot;[[neats vs. scruffies|neat]]&amp;quot; paradigms at [[Carnegie Mellon University|CMU]] and Stanford).&amp;lt;ref name=&amp;quot;Neats vs. scruffies&amp;quot;/&amp;gt; [[Commonsense knowledge bases]] (such as [[Doug Lenat]]'s [[Cyc]]) are an example of &amp;quot;scruffy&amp;quot; AI, since they must be built by hand, one complicated concept at a time.&amp;lt;ref name=&amp;quot;Cyc&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Researchers at MIT (such as Marvin Minsky and Seymour Papert) found that solving difficult problems in vision and natural language processing required ad-hoc solutions—they argued that there was no simple and general principle (like logic) that would capture all the aspects of intelligent behavior. Roger Schank described their &amp;quot;anti-logic&amp;quot; approaches as &amp;quot;scruffy&amp;quot; (as opposed to the &amp;quot;neat&amp;quot; paradigms at CMU and Stanford). Commonsense knowledge bases (such as Doug Lenat's Cyc) are an example of &amp;quot;scruffy&amp;quot; AI, since they must be built by hand, one complicated concept at a time.&lt;br /&gt;
&lt;br /&gt;
麻省理工学院(MIT)的研究人员马文•明斯基和西摩•派珀特等发现&amp;lt;ref name=&amp;quot;AI at MIT in the 60s&amp;quot;/&amp;gt;，视觉和自然语言处理中的难题需要特定的解决方案——他们认为，没有简单而普遍的原则(如逻辑)可以涵盖智能行为。罗杰•尚克将他们的“反逻辑”方法形容为“邋遢的”(相对于卡内基梅隆大学和斯坦福大学的“整洁”范式)。常识库(如常识知识库的 Cyc)是“邋遢”AI的一个例子，因为它们必须人工一个一个地构建复杂概念。&lt;br /&gt;
&lt;br /&gt;
====基于知识的方法====&lt;br /&gt;
&lt;br /&gt;
When computers with large memories became available around 1970, researchers from all three traditions began to build [[knowledge representation|knowledge]] into AI applications.&amp;lt;ref name=&amp;quot;Knowledge revolution&amp;quot;/&amp;gt; This &amp;quot;knowledge revolution&amp;quot; led to the development and deployment of [[expert system]]s (introduced by [[Edward Feigenbaum]]), the first truly successful form of AI software.&amp;lt;ref name=&amp;quot;Expert systems&amp;quot;/&amp;gt; A key component of the system architecture for all expert systems is the knowledge base, which stores facts and rules that illustrate AI.&amp;lt;ref&amp;gt;{{Cite journal |last=Frederick |first=Hayes-Roth |last2=William |first2=Murray |last3=Leonard |first3=Adelman |title=Expert systems|journal=AccessScience |language=en |doi=10.1036/1097-8542.248550}}&amp;lt;/ref&amp;gt; The knowledge revolution was also driven by the realization that enormous amounts of knowledge would be required by many simple AI applications.&lt;br /&gt;
&lt;br /&gt;
When computers with large memories became available around 1970, researchers from all three traditions began to build knowledge into AI applications. The knowledge revolution was also driven by the realization that enormous amounts of knowledge would be required by many simple AI applications.&lt;br /&gt;
&lt;br /&gt;
1970年左右，当拥有大容量存储器的计算机出现时，来自这三个研究方向的研究人员开始将知识应用于AI领域&amp;lt;ref name=&amp;quot;Knowledge revolution&amp;quot;/&amp;gt; 。这一轮“知识革命”的一大成果是开发和部署专家系统，第一个真正成功的AI软件&amp;lt;ref name=&amp;quot;Expert systems&amp;quot;/&amp;gt;。所有专家系统的一个关键部件是存储着事实和规则的知识库&amp;lt;ref&amp;gt;{{Cite journal |last=Frederick |first=Hayes-Roth |last2=William |first2=Murray |last3=Leonard |first3=Adelman |title=Expert systems|journal=AccessScience |language=en |doi=10.1036/1097-8542.248550}}&amp;lt;/ref&amp;gt;。推动知识革命的另一个原因是人们认识到，许多简单的AI应用程序也需要大量的知识。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===亚符号方法 ===&lt;br /&gt;
&lt;br /&gt;
By the 1980s, progress in symbolic AI seemed to stall and many believed that symbolic systems would never be able to imitate all the processes of human cognition, especially [[machine perception|perception]], [[robotics]], [[machine learning|learning]] and [[pattern recognition]]. A number of researchers began to look into &amp;quot;sub-symbolic&amp;quot; approaches to specific AI problems.&amp;lt;ref name=&amp;quot;Symbolic vs. sub-symbolic&amp;quot;/&amp;gt; Sub-symbolic methods manage to approach intelligence without specific representations of knowledge.&lt;br /&gt;
&lt;br /&gt;
By the 1980s, progress in symbolic AI seemed to stall and many believed that symbolic systems would never be able to imitate all the processes of human cognition, especially perception, robotics, learning and pattern recognition. A number of researchers began to look into &amp;quot;sub-symbolic&amp;quot; approaches to specific AI problems. Sub-symbolic methods manage to approach intelligence without specific representations of knowledge.&lt;br /&gt;
&lt;br /&gt;
到了20世纪80年代，符号AI的进步似乎停滞不前，许多人认为符号系统永远无法模仿人类认知的所有过程，尤其在感知、机器人学、学习和模式识别等方面。许多研究人员开始研究针对特定AI问题的“亚符号”方法&amp;lt;ref name=&amp;quot;Symbolic vs. sub-symbolic&amp;quot;/&amp;gt;。亚符号方法能在没有特定知识表示的情况下，做到接近智能。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====具身智慧====&lt;br /&gt;
&lt;br /&gt;
This includes [[embodied agent|embodied]], [[situated]], [[behavior-based AI|behavior-based]], and [[nouvelle AI]]. Researchers from the related field of [[robotics]], such as [[Rodney Brooks]], rejected symbolic AI and focused on the basic engineering problems that would allow robots to move and survive.&amp;lt;ref name=&amp;quot;Embodied AI&amp;quot;/&amp;gt; Their work revived the non-symbolic point of view of the early [[cybernetic]]s researchers of the 1950s and reintroduced the use of [[control theory]] in AI. This coincided with the development of the [[embodied mind thesis]] in the related field of [[cognitive science]]: the idea that aspects of the body (such as movement, perception and visualization) are required for higher intelligence.&lt;br /&gt;
&lt;br /&gt;
This includes embodied, situated, behavior-based, and nouvelle AI. Researchers from the related field of robotics, such as Rodney Brooks, rejected symbolic AI and focused on the basic engineering problems that would allow robots to move and survive. Their work revived the non-symbolic point of view of the early cybernetics researchers of the 1950s and reintroduced the use of control theory in AI. This coincided with the development of the embodied mind thesis in the related field of cognitive science: the idea that aspects of the body (such as movement, perception and visualization) are required for higher intelligence.&lt;br /&gt;
&lt;br /&gt;
'''具身智慧 Embodied Intelligence'''包括具体化的、情境化的、基于行为的新式 AI。来自机器人相关领域的研究人员，如罗德尼·布鲁克斯，放弃了符号化AI的方法，而专注于使机器人能够移动和生存的基本工程问题&amp;lt;ref name=&amp;quot;Embodied AI&amp;quot;/&amp;gt;。他们的工作重启了20世纪50年代早期控制论研究者的非符号观点，并将控制论重新引入到AI的应用中。这与认知科学相关领域的具身理论的发展相吻合: 认为如运动、感知和视觉等身体的各个功能是高智能所必需的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Within [[developmental robotics]], developmental learning approaches are elaborated upon to allow robots to accumulate repertoires of novel skills through autonomous self-exploration, social interaction with human teachers, and the use of guidance mechanisms (active learning, maturation, motor synergies, etc.).{{sfn|Weng|McClelland|Pentland|Sporns|2001}}{{sfn|Lungarella|Metta|Pfeifer|Sandini|2003}}{{sfn|Asada|Hosoda|Kuniyoshi|Ishiguro|2009}}{{sfn|Oudeyer|2010}}&lt;br /&gt;
&lt;br /&gt;
Within developmental robotics, developmental learning approaches are elaborated upon to allow robots to accumulate repertoires of novel skills through autonomous self-exploration, social interaction with human teachers, and the use of guidance mechanisms (active learning, maturation, motor synergies, etc.).&lt;br /&gt;
&lt;br /&gt;
在发展型机器人中，人们开发了发展型学习方法，通过自主的自我探索、与人类教师的社会互动，以及使用主动学习、成熟、协同运动等指导机制 ，使机器人积累新技能的能力。{{sfn|Weng|McClelland|Pentland|Sporns|2001}}{{sfn|Lungarella|Metta|Pfeifer|Sandini|2003}}{{sfn|Asada|Hosoda|Kuniyoshi|Ishiguro|2009}}{{sfn|Oudeyer|2010}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====计算智能与软计算 ====&lt;br /&gt;
&lt;br /&gt;
Interest in [[Artificial neural network|neural networks]] and &amp;quot;[[connectionism]]&amp;quot; was revived by [[David Rumelhart]] and others in the middle of the 1980s.&amp;lt;ref name=&amp;quot;Revival of connectionism&amp;quot;/&amp;gt; [[Artificial neural network]]s are an example of [[soft computing]]—they are solutions to problems which cannot be solved with complete logical certainty, and where an approximate solution is often sufficient. Other [[soft computing]] approaches to AI include [[fuzzy system]]s, [[Grey system theory]], [[evolutionary computation]] and many statistical tools. The application of soft computing to AI is studied collectively by the emerging discipline of [[computational intelligence]].&amp;lt;ref name=&amp;quot;Computational intelligence&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Interest in neural networks and &amp;quot;connectionism&amp;quot; was revived by David Rumelhart and others in the middle of the 1980s. Artificial neural networks are an example of soft computing—they are solutions to problems which cannot be solved with complete logical certainty, and where an approximate solution is often sufficient. Other soft computing approaches to AI include fuzzy systems, Grey system theory, evolutionary computation and many statistical tools. The application of soft computing to AI is studied collectively by the emerging discipline of computational intelligence.&lt;br /&gt;
&lt;br /&gt;
上世纪80年代中期，大卫•鲁梅尔哈特等人重新激发了人们对神经网络和“'''&amp;lt;font color=#ff8000&amp;gt;连接主义 Connectionism&amp;lt;/font&amp;gt;'''”的兴趣。人工神经网络是软计算的一个例子ーー它们解决不能完全用逻辑确定性地解决，但常常只需要近似解的问题。AI的其他软计算方法包括'''&amp;lt;font color=#ff8000&amp;gt;模糊系统 Fuzzy Systems &amp;lt;/font&amp;gt;'''、'''&amp;lt;font color=#ff8000&amp;gt;灰度系统理论 Grey System Theory&amp;lt;/font&amp;gt;'''、'''&amp;lt;font color=#ff8000&amp;gt;演化计算 Evolutionary Computation &amp;lt;/font&amp;gt;'''和许多统计工具。软计算在AI中的应用是计算智能这一新兴学科的集中研究领域。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===统计学习 ===&lt;br /&gt;
&lt;br /&gt;
Much of traditional [[Symbolic artificial intelligence|GOFAI]] got bogged down on ''ad hoc'' patches to [[symbolic computation]] that worked on their own toy models but failed to generalize to real-world results. However, around the 1990s, AI researchers adopted sophisticated mathematical tools, such as [[hidden Markov model]]s (HMM), [[information theory]], and normative Bayesian [[decision theory]] to compare or to unify competing architectures. The shared mathematical language permitted a high level of collaboration with more established fields (like [[mathematics]], economics or [[operations research]]).{{efn|While such a &amp;quot;victory of the neats&amp;quot; may be a consequence of the field becoming more mature, [[Artificial Intelligence: A Modern Approach|AIMA]] states that in practice both [[neats and scruffies|neat and scruffy]] approaches continue to be necessary in AI research.}} Compared with GOFAI, new &amp;quot;statistical learning&amp;quot; techniques such as HMM and neural networks were gaining higher levels of accuracy in many practical domains such as [[data mining]], without necessarily acquiring a semantic understanding of the datasets. The increased successes with real-world data led to increasing emphasis on comparing different approaches against shared test data to see which approach performed best in a broader context than that provided by idiosyncratic toy models; AI research was becoming more [[scientific method|scientific]]. Nowadays results of experiments are often rigorously measurable, and are sometimes (with difficulty) reproducible.&amp;lt;ref name=&amp;quot;Formal methods in AI&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|last1=Hutson|first1=Matthew|title=Artificial intelligence faces reproducibility crisis|url=http://science.sciencemag.org/content/359/6377/725|accessdate=28 April 2018|work=[[Science Magazine|Science]]|date=16 February 2018|pages=725–726|language=en|doi=10.1126/science.359.6377.725|bibcode=2018Sci...359..725H}}&amp;lt;/ref&amp;gt; Different statistical learning techniques have different limitations; for example, basic HMM cannot model the infinite possible combinations of natural language.{{sfn|Norvig|2012}} Critics note that the shift from GOFAI to statistical learning is often also a shift away from [[explainable AI]]. In AGI research, some scholars caution against over-reliance on statistical learning, and argue that continuing research into GOFAI will still be necessary to attain general intelligence.{{sfn|Langley|2011}}{{sfn|Katz|2012}}&lt;br /&gt;
&lt;br /&gt;
Much of traditional GOFAI got bogged down on ad hoc patches to symbolic computation that worked on their own toy models but failed to generalize to real-world results. However, around the 1990s, AI researchers adopted sophisticated mathematical tools, such as hidden Markov models (HMM), information theory, and normative Bayesian decision theory to compare or to unify competing architectures. The shared mathematical language permitted a high level of collaboration with more established fields (like mathematics, economics or operations research). Compared with GOFAI, new &amp;quot;statistical learning&amp;quot; techniques such as HMM and neural networks were gaining higher levels of accuracy in many practical domains such as data mining, without necessarily acquiring a semantic understanding of the datasets. The increased successes with real-world data led to increasing emphasis on comparing different approaches against shared test data to see which approach performed best in a broader context than that provided by idiosyncratic toy models; AI research was becoming more scientific. Nowadays results of experiments are often rigorously measurable, and are sometimes (with difficulty) reproducible. Different statistical learning techniques have different limitations; for example, basic HMM cannot model the infinite possible combinations of natural language. Critics note that the shift from GOFAI to statistical learning is often also a shift away from explainable AI. In AGI research, some scholars caution against over-reliance on statistical learning, and argue that continuing research into GOFAI will still be necessary to attain general intelligence.&lt;br /&gt;
&lt;br /&gt;
许多传统的 GOFAI 在实验模型中行之有效，但不能推广到现实世界，陷入了需要不断给符号计算修补漏洞的困境中。然而，在20世纪90年代前后，AI研究人员采用了复杂的数学工具，如'''&amp;lt;font color=#ff8000&amp;gt;隐马尔可夫模型 Hidden Markov Model,HMM&amp;lt;/font&amp;gt;'''、信息论和'''&amp;lt;font color=#ff8000&amp;gt;标准贝叶斯决策理论 Normative Bayesian Decision Theory&amp;lt;/font&amp;gt;'''来比较或统一各种互相竞争的架构。共通的数学语言允许其与数学、经济学或运筹学等更成熟的领域进行高层次的融合。与 GOFAI 相比，隐马尔可夫模型和神经网络等新的“统计学习”技术在数据挖掘等许多实际领域中不必理解数据集的语义，却能得到更高的精度，随着现实世界数据的日益增加，人们越来越注重用不同的方法测试相同的数据，并进行比较，看哪种方法在比特殊实验室环境更广泛的背景下表现得更好; AI研究正变得更加科学。如今，实验结果一般是严格可测的，有时可以重现（但有难度）。不同的统计学习技术有不同的局限性，例如，基本的 HMM 不能为自然语言的无限可能的组合建模。评论者们指出，从 GOFAI 到统计学习的转变也经常是可解释AI的转变。在 [[通用人工智能]] 的研究中，一些学者警告不要过度依赖统计学习，并认为继续研究 GOFAI 仍然是实现通用智能的必要条件。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== 集成各种方法 ===&lt;br /&gt;
&lt;br /&gt;
;Intelligent agent paradigm: An [[intelligent agent]] is a system that perceives its environment and takes actions that maximize its chances of success. The simplest intelligent agents are programs that solve specific problems. More complicated agents include human beings and organizations of human beings (such as [[firm]]s). The paradigm allows researchers to directly compare or even combine different approaches to isolated problems, by asking which agent is best at maximizing a given &amp;quot;goal function&amp;quot;. An agent that solves a specific problem can use any approach that works—some agents are symbolic and logical, some are sub-symbolic [[artificial neural network]]s and others may use new approaches. The paradigm also gives researchers a common language to communicate with other fields—such as [[decision theory]] and economics—that also use concepts of abstract agents. Building a complete agent requires researchers to address realistic problems of integration; for example, because sensory systems give uncertain information about the environment, planning systems must be able to function in the presence of uncertainty. The intelligent agent paradigm became widely accepted during the 1990s.&amp;lt;ref name=&amp;quot;Intelligent agents&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Intelligent agent paradigm: An intelligent agent is a system that perceives its environment and takes actions that maximize its chances of success. The simplest intelligent agents are programs that solve specific problems. More complicated agents include human beings and organizations of human beings (such as firms). The paradigm allows researchers to directly compare or even combine different approaches to isolated problems, by asking which agent is best at maximizing a given &amp;quot;goal function&amp;quot;. An agent that solves a specific problem can use any approach that works—some agents are symbolic and logical, some are sub-symbolic artificial neural networks and others may use new approaches. The paradigm also gives researchers a common language to communicate with other fields—such as decision theory and economics—that also use concepts of abstract agents. Building a complete agent requires researchers to address realistic problems of integration; for example, because sensory systems give uncertain information about the environment, planning systems must be able to function in the presence of uncertainty. The intelligent agent paradigm became widely accepted during the 1990s.&lt;br /&gt;
&lt;br /&gt;
;智能主体范式: 智能主体是一个感知其环境并采取行动，最大限度地提高其成功机会的系统。最简单的智能主体是解决特定问题的程序。更复杂的智能主体包括人类和人类组织(如公司)。这种范式使得研究人员能通过观察哪一个智能主体能最大化给定的“目标函数”，直接比较甚至结合不同的方法来解决孤立的问题。解决特定问题的智能主体可以使用任何有效的方法——可以是是符号化和逻辑化的，也可以是亚符号化的人工神经网络，还可以是新的方法。这种范式还为研究人员提供了一种与其他领域(如决策理论和经济学)进行交流的共同语言，因为这些领域也使用了抽象智能主体的概念。建立一个完整的智能主体需要研究人员解决现实的整合协调问题; 例如，由于传感系统提供关于环境的信息不确定，决策系统就必须在不确定性的条件下运作。智能体范式在20世纪90年代被广泛接受。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
;[[Agent architecture]]s and [[cognitive architecture]]s:Researchers have designed systems to build intelligent systems out of interacting [[intelligent agent]]s in a [[multi-agent system]].&amp;lt;ref name=&amp;quot;Agent architectures&amp;quot;/&amp;gt; A [[hierarchical control system]] provides a bridge between sub-symbolic AI at its lowest, reactive levels and traditional symbolic AI at its highest levels, where relaxed time constraints permit planning and world modeling.&amp;lt;ref name=&amp;quot;Hierarchical control system&amp;quot;/&amp;gt; Some cognitive architectures are custom-built to solve a narrow problem; others, such as [[Soar (cognitive architecture)|Soar]], are designed to mimic human cognition and to provide insight into general intelligence. Modern extensions of Soar are [[hybrid intelligent system]]s that include both symbolic and sub-symbolic components.&amp;lt;ref&amp;gt;{{cite journal|last1=Laird|first1=John|title=Extending the Soar cognitive architecture|journal=Frontiers in Artificial Intelligence and Applications|date=2008|volume=171|page=224|citeseerx=10.1.1.77.2473}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Lieto|first1=Antonio|last2=Lebiere|first2=Christian|last3=Oltramari|first3=Alessandro|title=The knowledge level in cognitive architectures: Current limitations and possibile developments|journal=Cognitive Systems Research|date=May 2018|volume=48|pages=39–55|doi=10.1016/j.cogsys.2017.05.001|hdl=2318/1665207|hdl-access=free}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Lieto|first1=Antonio|last2=Bhatt|first2=Mehul|last3=Oltramari|first3=Alessandro|last4=Vernon|first4=David|title=The role of cognitive architectures in general artificial intelligence|journal=Cognitive Systems Research|date=May 2018|volume=48|pages=1–3|doi=10.1016/j.cogsys.2017.08.003|hdl=2318/1665249|hdl-access=free}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Agent architectures and cognitive architectures:Researchers have designed systems to build intelligent systems out of interacting intelligent agents in a multi-agent system.&lt;br /&gt;
&lt;br /&gt;
;智能主体体系结构和认知体系结构: 研究人员已经设计了一些在多智能体系统中利用相互作用的智能体构建智能系统的系统&amp;lt;ref name=&amp;quot;Agent architectures&amp;quot;/&amp;gt;。分层控制系统为亚符号AI、反应层和符号AI提供了一座桥梁，亚符号AI在底层、反应层和符号AI在顶层&amp;lt;ref name=&amp;quot;Hierarchical control system&amp;quot;/&amp;gt;。&lt;br /&gt;
一些认知架构是人为构造用来解决特定问题的；其他比如SOAR，是用来模仿人类的认知，向通用智能更进一步。现在SOAR的扩展是含有符号和亚符号部分的混合智能系统。&amp;lt;ref&amp;gt;{{cite journal|last1=Laird|first1=John|title=Extending the Soar cognitive architecture|journal=Frontiers in Artificial Intelligence and Applications|date=2008|volume=171|page=224|citeseerx=10.1.1.77.2473}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Lieto|first1=Antonio|last2=Lebiere|first2=Christian|last3=Oltramari|first3=Alessandro|title=The knowledge level in cognitive architectures: Current limitations and possibile developments|journal=Cognitive Systems Research|date=May 2018|volume=48|pages=39–55|doi=10.1016/j.cogsys.2017.05.001|hdl=2318/1665207|hdl-access=free}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Lieto|first1=Antonio|last2=Bhatt|first2=Mehul|last3=Oltramari|first3=Alessandro|last4=Vernon|first4=David|title=The role of cognitive architectures in general artificial intelligence|journal=Cognitive Systems Research|date=May 2018|volume=48|pages=1–3|doi=10.1016/j.cogsys.2017.08.003|hdl=2318/1665249|hdl-access=free}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==工具 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
AI has developed many tools to solve the most difficult problems in [[computer science]]. A few of the most general of these methods are discussed below.&lt;br /&gt;
&lt;br /&gt;
AI has developed many tools to solve the most difficult problems in computer science. A few of the most general of these methods are discussed below.&lt;br /&gt;
&lt;br /&gt;
AI领域已经开发出许多工具来解决计算机科学中最困难的问题。下面将讨论其中一些最常用的方法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===搜索和优化===&lt;br /&gt;
&lt;br /&gt;
{{Main|Search algorithm|Mathematical optimization|Evolutionary computation}}&lt;br /&gt;
&lt;br /&gt;
Many problems in AI can be solved in theory by intelligently searching through many possible solutions:&amp;lt;ref name=&amp;quot;Search&amp;quot;/&amp;gt; [[#Deduction, reasoning, problem solving|Reasoning]] can be reduced to performing a search. For example, logical proof can be viewed as searching for a path that leads from [[premise]]s to [[Logical consequence|conclusions]], where each step is the application of an [[inference rule]].&amp;lt;ref name=&amp;quot;Logic as search&amp;quot;/&amp;gt; [[Automated planning and scheduling|Planning]] algorithms search through trees of goals and subgoals, attempting to find a path to a target goal, a process called [[means-ends analysis]].&amp;lt;ref name=&amp;quot;Planning as search&amp;quot;/&amp;gt; [[Robotics]] algorithms for moving limbs and grasping objects use [[local search (optimization)|local searches]] in [[Configuration space (physics)|configuration space]].&amp;lt;ref name=&amp;quot;Configuration space&amp;quot;/&amp;gt; Many [[machine learning|learning]] algorithms use search algorithms based on [[optimization (mathematics)|optimization]].&lt;br /&gt;
&lt;br /&gt;
Many problems in AI can be solved in theory by intelligently searching through many possible solutions: Reasoning can be reduced to performing a search. For example, logical proof can be viewed as searching for a path that leads from premises to conclusions, where each step is the application of an inference rule. Planning algorithms search through trees of goals and subgoals, attempting to find a path to a target goal, a process called means-ends analysis. Robotics algorithms for moving limbs and grasping objects use local searches in configuration space. Many learning algorithms use search algorithms based on optimization.&lt;br /&gt;
&lt;br /&gt;
AI中的许多问题可以通过智能地搜索许多可能的解决方案而在理论上得到解决&amp;lt;ref name=&amp;quot;Search&amp;quot;/&amp;gt;: 推理可以简化为执行一次搜索。例如，逻辑证明可以看作是寻找一条从前提到结论的路径，其中每一步都用到了推理规则。规划算法通过搜索目标和子目标的树，试图找到一条通往目标的路径，这个过程称为“目的-手段”分析。机器人学中移动肢体和抓取物体的算法使用的是位形空间的局部搜索。许多学习算法也使用到了基于优化的搜索算法。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Simple exhaustive searches&amp;lt;ref name=&amp;quot;Uninformed search&amp;quot;/&amp;gt; are rarely sufficient for most real-world problems: the [[search algorithm|search space]] (the number of places to search) quickly grows to [[Astronomically large|astronomical numbers]]. The result is a search that is [[Computation time|too slow]] or never completes. The solution, for many problems, is to use &amp;quot;[[heuristics]]&amp;quot; or &amp;quot;rules of thumb&amp;quot; that prioritize choices in favor of those that are more likely to reach a goal and to do so in a shorter number of steps. In some search methodologies heuristics can also serve to entirely eliminate some choices that are unlikely to lead to a goal (called &amp;quot;[[pruning (algorithm)|pruning]] the [[search tree]]&amp;quot;). [[Heuristics]] supply the program with a &amp;quot;best guess&amp;quot; for the path on which the solution lies.&amp;lt;ref name=&amp;quot;Informed search&amp;quot;/&amp;gt; Heuristics limit the search for solutions into a smaller sample size.{{sfn|Tecuci|2012}}&lt;br /&gt;
&lt;br /&gt;
Simple exhaustive searches are rarely sufficient for most real-world problems: the search space (the number of places to search) quickly grows to astronomical numbers. The result is a search that is too slow or never completes. The solution, for many problems, is to use &amp;quot;heuristics&amp;quot; or &amp;quot;rules of thumb&amp;quot; that prioritize choices in favor of those that are more likely to reach a goal and to do so in a shorter number of steps. In some search methodologies heuristics can also serve to entirely eliminate some choices that are unlikely to lead to a goal (called &amp;quot;pruning the search tree&amp;quot;). Heuristics supply the program with a &amp;quot;best guess&amp;quot; for the path on which the solution lies. Heuristics limit the search for solutions into a smaller sample size.&lt;br /&gt;
&lt;br /&gt;
对于大多数真实世界的问题，简单的穷举搜索&amp;lt;ref name=&amp;quot;Uninformed search&amp;quot;/&amp;gt;很难满足要求: 搜索空间(要搜索的位置数)很快就会增加到天文数字。结果就是搜索速度太慢或者永远不能完成。对于许多问题，解决方法是使用“'''&amp;lt;font color=#ff8000&amp;gt;启发式 Heuristics&amp;lt;/font&amp;gt;''' ”或“'''&amp;lt;font color=#ff8000&amp;gt;经验法则 Rules of Thumb&amp;lt;/font&amp;gt;''' ” ，优先考虑那些更有可能达到目标的选择，并且在较短的步骤内完成。在一些搜索方法中，启发式方法还可以完全移去一些不可能通向目标的选择(称为“修剪搜索树”)。启发式为程序提供了解决方案所在路径的“最佳猜测”。启发式把搜索限制在了更小的样本规模里。。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A very different kind of search came to prominence in the 1990s, based on the mathematical theory of [[optimization (mathematics)|optimization]]. For many problems, it is possible to begin the search with some form of a guess and then refine the guess incrementally until no more refinements can be made. These algorithms can be visualized as blind [[hill climbing]]: we begin the search at a random point on the landscape, and then, by jumps or steps, we keep moving our guess uphill, until we reach the top. Other optimization algorithms are [[simulated annealing]], [[beam search]] and [[random optimization]].&amp;lt;ref name=&amp;quot;Optimization search&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A very different kind of search came to prominence in the 1990s, based on the mathematical theory of optimization. For many problems, it is possible to begin the search with some form of a guess and then refine the guess incrementally until no more refinements can be made. These algorithms can be visualized as blind hill climbing: we begin the search at a random point on the landscape, and then, by jumps or steps, we keep moving our guess uphill, until we reach the top. Other optimization algorithms are simulated annealing, beam search and random optimization.&lt;br /&gt;
&lt;br /&gt;
在20世纪90年代，一种非常不同的基于数学最优化理论的搜索引起了人们的注意。对于许多问题，可以从某种形式的猜测开始搜索，然后逐步细化猜测，直到无法进行更多的细化。这些算法可以喻为盲目地爬山: 我们从地形上的一个随机点开始搜索，然后，通过跳跃或登爬，我们把猜测点继续向山上移动，直到我们到达山顶。其他的优化算法有 '''&amp;lt;font color=#ff8000&amp;gt;模拟退火算法&amp;lt;/font&amp;gt;''' 、'''&amp;lt;font color=#ff8000&amp;gt;定向搜索&amp;lt;/font&amp;gt;''' 和'''&amp;lt;font color=#ff8000&amp;gt;随机优化&amp;lt;/font&amp;gt;''' 。&amp;lt;ref name=&amp;quot;Optimization search&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:ParticleSwarmArrowsAnimation.gif|thumb|A [[particle swarm optimization|particle swarm]] seeking the [[global minimum]][粒子群搜索全局最小]]]&lt;br /&gt;
&lt;br /&gt;
particle swarm seeking the global minimum]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Evolutionary computation]] uses a form of optimization search. For example, they may begin with a population of organisms (the guesses) and then allow them to mutate and recombine, [[artificial selection|selecting]] only the fittest to survive each generation (refining the guesses). Classic [[evolutionary algorithms]] include [[genetic algorithms]], [[gene expression programming]], and [[genetic programming]].&amp;lt;ref name=&amp;quot;Genetic programming&amp;quot;/&amp;gt; Alternatively, distributed search processes can coordinate via [[swarm intelligence]] algorithms. Two popular swarm algorithms used in search are [[particle swarm optimization]] (inspired by bird [[flocking (behavior)|flocking]]) and [[ant colony optimization]] (inspired by [[ant trail]]s).&amp;lt;ref name=&amp;quot;Society based learning&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author1=Daniel Merkle|author2=Martin Middendorf|editor1-last=Burke|editor1-first=Edmund K.|editor2-last=Kendall|editor2-first=Graham|title=Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques|date=2013|publisher=Springer Science &amp;amp; Business Media|isbn=978-1-4614-6940-7|language=en|chapter=Swarm Intelligence}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Evolutionary computation uses a form of optimization search. For example, they may begin with a population of organisms (the guesses) and then allow them to mutate and recombine, selecting only the fittest to survive each generation (refining the guesses). Classic evolutionary algorithms include genetic algorithms, gene expression programming, and genetic programming.&lt;br /&gt;
&lt;br /&gt;
[[演化计算]]用到了优化搜索的形式。例如，他们可能从一群有机体(猜测)开始，然后让它们变异和重组，选择适者继续生存 (改进猜测)。经典的演化算法包括遗传算法、基因表达编程和遗传编程。&amp;lt;ref name=&amp;quot;Genetic programming&amp;quot;/&amp;gt; Alternatively, distributed search processes can coordinate via [[swarm intelligence]] algorithms. Two popular swarm algorithms used in search are [[particle swarm optimization]] (inspired by bird [[flocking (behavior)|flocking]]) and [[ant colony optimization]] (inspired by [[ant trail]]s).&amp;lt;ref name=&amp;quot;Society based learning&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author1=Daniel Merkle|author2=Martin Middendorf|editor1-last=Burke|editor1-first=Edmund K.|editor2-last=Kendall|editor2-first=Graham|title=Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques|date=2013|publisher=Springer Science &amp;amp; Business Media|isbn=978-1-4614-6940-7|language=en|chapter=Swarm Intelligence}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===逻辑===&lt;br /&gt;
&lt;br /&gt;
{{Main|Logic programming|Automated reasoning}}&lt;br /&gt;
&lt;br /&gt;
[[Logic]]&amp;lt;ref name=&amp;quot;Logic&amp;quot;/&amp;gt; is used for knowledge representation and problem solving, but it can be applied to other problems as well. For example, the [[satplan]] algorithm uses logic for [[automated planning and scheduling|planning]]&amp;lt;ref name=&amp;quot;Satplan&amp;quot;/&amp;gt; and [[inductive logic programming]] is a method for [[machine learning|learning]].&amp;lt;ref name=&amp;quot;Symbolic learning techniques&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Logic is used for knowledge representation and problem solving, but it can be applied to other problems as well. For example, the satplan algorithm uses logic for planning and inductive logic programming is a method for learning.&lt;br /&gt;
&lt;br /&gt;
逻辑&amp;lt;ref name=&amp;quot;Logic&amp;quot;/&amp;gt;被用来表示知识和解决问题，还可以应用到其他问题上。例如，satplan 算法就使用逻辑进行规划&amp;lt;ref name=&amp;quot;Satplan&amp;quot;/&amp;gt;。另外，归纳逻辑编程是一种学习方法。&lt;br /&gt;
&lt;br /&gt;
Several different forms of logic are used in AI research. [[Propositional logic]]&amp;lt;ref name=&amp;quot;Propositional logic&amp;quot;/&amp;gt; involves [[truth function]]s such as &amp;quot;or&amp;quot; and &amp;quot;not&amp;quot;. [[First-order logic]]&amp;lt;ref name=&amp;quot;First-order logic&amp;quot;/&amp;gt; adds [[quantifier (logic)|quantifiers]] and [[predicate (mathematical logic)|predicates]], and can express facts about objects, their properties, and their relations with each other. [[Fuzzy set theory]] assigns a &amp;quot;degree of truth&amp;quot; (between 0 and 1) to vague statements such as &amp;quot;Alice is old&amp;quot; (or rich, or tall, or hungry) that are too linguistically imprecise to be completely true or false. [[Fuzzy logic]] is successfully used in [[control system]]s to allow experts to contribute vague rules such as &amp;quot;if you are close to the destination station and moving fast, increase the train's brake pressure&amp;quot;; these vague rules can then be numerically refined within the system. Fuzzy logic fails to scale well in knowledge bases; many AI researchers question the validity of chaining fuzzy-logic inferences.{{efn|&amp;quot;There exist many different types of uncertainty, vagueness, and ignorance... [We] independently confirm the inadequacy of systems for reasoning about uncertainty that propagates numerical factors according to only to which connectives appear in assertions.&amp;quot;&amp;lt;ref&amp;gt;{{cite journal|last1=Elkan|first1=Charles|title=The paradoxical success of fuzzy logic|journal=IEEE Expert|date=1994|volume=9|issue=4|pages=3–49|doi=10.1109/64.336150|citeseerx=10.1.1.100.8402}}&amp;lt;/ref&amp;gt;}}&amp;lt;ref name=&amp;quot;Fuzzy logic&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=What is 'fuzzy logic'? Are there computers that are inherently fuzzy and do not apply the usual binary logic?|url=https://www.scientificamerican.com/article/what-is-fuzzy-logic-are-t/|accessdate=5 May 2018|work=Scientific American|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Several different forms of logic are used in AI research. Propositional logic}}&lt;br /&gt;
&lt;br /&gt;
AI研究中使用了多种不同形式的逻辑。命题逻辑&amp;lt;ref name=&amp;quot;Propositional logic&amp;quot;/&amp;gt;包含诸如“或”和“否”这样的真值函数。一阶逻辑&amp;lt;ref name=&amp;quot;First-order logic&amp;quot;/&amp;gt;增加了量词和谓词，可以表达关于对象、对象属性和对象之间的关系。模糊集合论给诸如“爱丽丝老了”(或是富有的、高的、饥饿的)这样模糊的表述赋予了一个“真实程度”(介于0到1之间)，这些表述在语言上很模糊，不能完全判定为正确或错误。模糊逻辑在控制系统中得到了成功应用，使专家能够制定模糊规则，比如“如果你正以较快的速度接近终点站，那么就增加列车的制动压力”;这些模糊的规则可以在系统内用数值细化。但是，模糊逻辑无助于扩展知识库，许多AI研究者质疑把模糊逻辑和推理结合起来的有效性。{{efn|&amp;quot;There exist many different types of uncertainty, vagueness, and ignorance... [We] independently confirm the inadequacy of systems for reasoning about uncertainty that propagates numerical factors according to only to which connectives appear in assertions.&amp;quot;&amp;lt;ref&amp;gt;{{cite journal|last1=Elkan|first1=Charles|title=The paradoxical success of fuzzy logic|journal=IEEE Expert|date=1994|volume=9|issue=4|pages=3–49|doi=10.1109/64.336150|citeseerx=10.1.1.100.8402}}&amp;lt;/ref&amp;gt;}}&amp;lt;ref name=&amp;quot;Fuzzy logic&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=What is 'fuzzy logic'? Are there computers that are inherently fuzzy and do not apply the usual binary logic?|url=https://www.scientificamerican.com/article/what-is-fuzzy-logic-are-t/|accessdate=5 May 2018|work=Scientific American|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Default logic]]s, [[non-monotonic logic]]s and [[circumscription (logic)|circumscription]]&amp;lt;ref name=&amp;quot;Default reasoning and non-monotonic logic&amp;quot;/&amp;gt; are forms of logic designed to help with default reasoning and the [[qualification problem]]. Several extensions of logic have been designed to handle specific domains of [[knowledge representation|knowledge]], such as: [[description logic]]s;&amp;lt;ref name=&amp;quot;Representing categories and relations&amp;quot;/&amp;gt; [[situation calculus]], [[event calculus]] and [[fluent calculus]] (for representing events and time);&amp;lt;ref name=&amp;quot;Representing time&amp;quot;/&amp;gt; [[Causality#Causal calculus|causal calculus]];&amp;lt;ref name=&amp;quot;Representing causation&amp;quot;/&amp;gt; [[Belief revision|belief calculus (belief revision)]];&amp;lt;ref&amp;gt;&amp;quot;The Belief Calculus and Uncertain Reasoning&amp;quot;, Yen-Teh Hsia&amp;lt;/ref&amp;gt; and [[modal logic]]s.&amp;lt;ref name=&amp;quot;Representing knowledge about knowledge&amp;quot;/&amp;gt; Logics to model contradictory or inconsistent statements arising in multi-agent systems have also been designed, such as [[paraconsistent logic]]s.&lt;br /&gt;
&lt;br /&gt;
Default logics, non-monotonic logics and circumscription and modal logics. Logics to model contradictory or inconsistent statements arising in multi-agent systems have also been designed, such as paraconsistent logics.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color=#ff8000&amp;gt;缺省逻辑 Default Logics&amp;lt;/font&amp;gt;'''、'''&amp;lt;font color=#ff8000&amp;gt;非单调逻辑 Non-monotonic Logics&amp;lt;/font&amp;gt;'''、'''&amp;lt;font color=#ff8000&amp;gt;限制逻辑 Circumscription&amp;lt;/font&amp;gt;'''和'''&amp;lt;font color=#ff8000&amp;gt;模态逻辑 Modal Logics&amp;lt;/font&amp;gt;'''&amp;lt;ref name=&amp;quot;Default reasoning and non-monotonic logic&amp;quot;/&amp;gt;，都用逻辑形式来解决缺省推理和限定问题。一些逻辑扩展被用于处理特定的知识领域，例如:'''&amp;lt;font color=#ff8000&amp;gt;描述逻辑 Description Logics&amp;lt;/font&amp;gt;'''&amp;lt;ref name=&amp;quot;Representing categories and relations&amp;quot;/&amp;gt; 、情景演算、事件演算、'''&amp;lt;font color=#ff8000&amp;gt;流态演算 Fluent Calculus&amp;lt;/font&amp;gt;'''（用于表示事件和时间）&amp;lt;ref name=&amp;quot;Representing time&amp;quot;/&amp;gt;、因果演算&amp;lt;ref name=&amp;quot;Representing causation&amp;quot;/&amp;gt;、信念演算(信念修正)&amp;lt;ref&amp;gt;&amp;quot;The Belief Calculus and Uncertain Reasoning&amp;quot;, Yen-Teh Hsia&amp;lt;/ref&amp;gt;、和模态逻辑&amp;lt;ref name=&amp;quot;Representing knowledge about knowledge&amp;quot;/&amp;gt;。人们也设计了对多主体系统中出现的矛盾或不一致陈述进行建模的逻辑，如次协调逻辑。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===不确定推理的概率方法===&lt;br /&gt;
&lt;br /&gt;
{{Main|Bayesian network|Hidden Markov model|Kalman filter|Particle filter|Decision theory|Utility theory}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:EM Clustering of Old Faithful data.gif|right|frame|[[Expectation-maximization]] clustering of [[Old Faithful]] eruption data starts from a random guess but then successfully converges on an accurate clustering of the two physically distinct modes of eruption.[[期望-最大化老实泉喷发数据的聚类从一个随机的猜测开始，然后成功地收敛到两个物理上截然不同的喷发模式的精确聚类]]]]&lt;br /&gt;
&lt;br /&gt;
[[Expectation-maximization clustering of Old Faithful eruption data starts from a random guess but then successfully converges on an accurate clustering of the two physically distinct modes of eruption.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Many problems in AI (in reasoning, planning, learning, perception, and robotics) require the agent to operate with incomplete or uncertain information. AI researchers have devised a number of powerful tools to solve these problems using methods from [[probability]] theory and economics.&amp;lt;ref name=&amp;quot;Stochastic methods for uncertain reasoning&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Many problems in AI (in reasoning, planning, learning, perception, and robotics) require the agent to operate with incomplete or uncertain information. AI researchers have devised a number of powerful tools to solve these problems using methods from probability theory and economics.&lt;br /&gt;
&lt;br /&gt;
AI中的许多问题(在推理、规划、学习、感知和机器人技术方面)要求主体在信息不完整或不确定的情况下进行操作。AI研究人员从概率论和经济学的角度设计了许多强大的工具来解决这些问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Bayesian network]]s&amp;lt;ref name=&amp;quot;Bayesian networks&amp;quot;/&amp;gt; are a very general tool that can be used for various problems: reasoning (using the [[Bayesian inference]] algorithm),&amp;lt;ref name=&amp;quot;Bayesian inference&amp;quot;/&amp;gt; [[Machine learning|learning]] (using the [[expectation-maximization algorithm]]),{{efn|Expectation-maximization, one of the most popular algorithms in machine learning, allows clustering in the presence of unknown [[latent variables]]{{sfn|Domingos|2015|p=210}}}}&amp;lt;ref name=&amp;quot;Bayesian learning&amp;quot;/&amp;gt; [[Automated planning and scheduling|planning]] (using [[decision network]]s)&amp;lt;ref name=&amp;quot;Bayesian decision networks&amp;quot;/&amp;gt; and [[machine perception|perception]] (using [[dynamic Bayesian network]]s).&amp;lt;ref name=&amp;quot;Stochastic temporal models&amp;quot;/&amp;gt; Probabilistic algorithms can also be used for filtering, prediction, smoothing and finding explanations for streams of data, helping [[machine perception|perception]] systems to analyze processes that occur over time (e.g., [[hidden Markov model]]s or [[Kalman filter]]s).&amp;lt;ref name=&amp;quot;Stochastic temporal models&amp;quot;/&amp;gt; Compared with symbolic logic, formal Bayesian inference is computationally expensive. For inference to be tractable, most observations must be [[conditionally independent]] of one another. Complicated graphs with diamonds or other &amp;quot;loops&amp;quot; (undirected [[cycle (graph theory)|cycles]]) can require a sophisticated method such as [[Markov chain Monte Carlo]], which spreads an ensemble of [[random walk]]ers throughout the Bayesian network and attempts to converge to an assessment of the conditional probabilities. Bayesian networks are used on [[Xbox Live]] to rate and match players; wins and losses are &amp;quot;evidence&amp;quot; of how good a player is{{citation needed|date=July 2019}}. [[Google AdSense|AdSense]] uses a Bayesian network with over 300 million edges to learn which ads to serve.{{sfn|Domingos|2015|loc=chapter 6}}&lt;br /&gt;
&lt;br /&gt;
Bayesian networks are a very general tool that can be used for various problems: reasoning (using the Bayesian inference algorithm), learning (using the expectation-maximization algorithm),}} planning (using decision networks) and perception (using dynamic Bayesian networks). Probabilistic algorithms can also be used for filtering, prediction, smoothing and finding explanations for streams of data, helping perception systems to analyze processes that occur over time (e.g., hidden Markov models or Kalman filters). Compared with symbolic logic, formal Bayesian inference is computationally expensive. For inference to be tractable, most observations must be conditionally independent of one another. Complicated graphs with diamonds or other &amp;quot;loops&amp;quot; (undirected cycles) can require a sophisticated method such as Markov chain Monte Carlo, which spreads an ensemble of random walkers throughout the Bayesian network and attempts to converge to an assessment of the conditional probabilities. Bayesian networks are used on Xbox Live to rate and match players; wins and losses are &amp;quot;evidence&amp;quot; of how good a player is. AdSense uses a Bayesian network with over 300 million edges to learn which ads to serve.&lt;br /&gt;
&lt;br /&gt;
'''&amp;lt;font color=#ff8000&amp;gt;[[贝叶斯网络]] Bayesian Networks &amp;lt;/font&amp;gt;''' 是一个非常通用的工具，可用于各种问题: 推理(使用贝叶斯推断算法) ，学习(使用期望最大化算法) ，规划(使用决策网络)和感知(使用动态贝叶斯网络)。概率算法也可以用于滤波、预测、平滑和解释数据流，帮助传感系统分析随时间发生的过程(例如，隐马尔可夫模型或'''&amp;lt;font color=#ff8000&amp;gt;卡尔曼滤波器 Kalman Filters&amp;lt;/font&amp;gt;''')。与符号逻辑相比，形式化的贝叶斯推断逻辑运算量很大。为了使推理易于处理，大多数观察值必须彼此条件独立。含有菱形或其他“圈”(无向循环)的复杂图形可能需要比如马尔科夫-蒙特卡罗图的复杂方法，这种方法将一组随机行走遍布整个贝叶斯网络，并试图收敛到对条件概率的评估。贝叶斯网络在 Xbox Live 上被用来评估和匹配玩家：胜率是证明一个玩家有多有优秀的“证据”。AdSense使用一个有超过3亿条边的贝叶斯网络来学习如何推送广告的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A key concept from the science of economics is &amp;quot;[[utility]]&amp;quot;: a measure of how valuable something is to an intelligent agent. Precise mathematical tools have been developed that analyze how an agent can make choices and plan, using [[decision theory]], [[decision analysis]],&amp;lt;ref name=&amp;quot;Decisions theory and analysis&amp;quot;/&amp;gt; and [[applied information economics|information value theory]].&amp;lt;ref name=&amp;quot;Information value theory&amp;quot;/&amp;gt; These tools include models such as [[Markov decision process]]es,&amp;lt;ref name=&amp;quot;Markov decision process&amp;quot;/&amp;gt; dynamic [[decision network]]s,&amp;lt;ref name=&amp;quot;Stochastic temporal models&amp;quot;/&amp;gt; [[game theory]] and [[mechanism design]].&amp;lt;ref name=&amp;quot;Game theory and mechanism design&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A key concept from the science of economics is &amp;quot;utility&amp;quot;: a measure of how valuable something is to an intelligent agent. Precise mathematical tools have been developed that analyze how an agent can make choices and plan, using decision theory, decision analysis, and information value theory. These tools include models such as Markov decision processes, dynamic decision networks, game theory and mechanism design.&lt;br /&gt;
&lt;br /&gt;
经济学中的一个关键概念是“效用” :这是一种衡量某物对于一个智能主体的价值的方法。人们运用决策理论、决策分析和信息价值理论开发出了精确的数学工具来分析智能主体应该如何选择和计划。这些工具包括马尔可夫决策过程、动态决策网络、博弈论和机制设计等模型。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===分类器与统计学习方法===&lt;br /&gt;
&lt;br /&gt;
{{Main|Classifier (mathematics)|Statistical classification|Machine learning}}&lt;br /&gt;
&lt;br /&gt;
The simplest AI applications can be divided into two types: classifiers (&amp;quot;if shiny then diamond&amp;quot;) and controllers (&amp;quot;if shiny then pick up&amp;quot;). Controllers do, however, also classify conditions before inferring actions, and therefore classification forms a central part of many AI systems. [[Classifier (mathematics)|Classifiers]] are functions that use [[pattern matching]] to determine a closest match. They can be tuned according to examples, making them very attractive for use in AI. These examples are known as observations or patterns. In supervised learning, each pattern belongs to a certain predefined class. A class can be seen as a decision that has to be made. All the observations combined with their class labels are known as a data set. When a new observation is received, that observation is classified based on previous experience.&amp;lt;ref name=&amp;quot;Classifiers&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The simplest AI applications can be divided into two types: classifiers (&amp;quot;if shiny then diamond&amp;quot;) and controllers (&amp;quot;if shiny then pick up&amp;quot;). Controllers do, however, also classify conditions before inferring actions, and therefore classification forms a central part of many AI systems. Classifiers are functions that use pattern matching to determine a closest match. They can be tuned according to examples, making them very attractive for use in AI. These examples are known as observations or patterns. In supervised learning, each pattern belongs to a certain predefined class. A class can be seen as a decision that has to be made. All the observations combined with their class labels are known as a data set. When a new observation is received, that observation is classified based on previous experience.&lt;br /&gt;
&lt;br /&gt;
最简单的AI应用程序可以分为两类: '''&amp;lt;font color=#ff8000&amp;gt;分类器 Classifiers&amp;lt;/font&amp;gt;''' (“若闪光，则为钻石”)和'''&amp;lt;font color=#ff8000&amp;gt;控制器 Controllers&amp;lt;/font&amp;gt;''' (“若闪光，则捡起来”)。然而，控制器在推断前也对条件进行分类，因此分类构成了许多AI系统的核心部分。分类器一组是使用匹配模式来判断最接近的匹配的函数。它们可以根据样例进行性能调优，使它们在AI应用中更有效。这些样例被称为“观察”或“模式”。在监督学习中，每个模式都属于某个预定义的类别。可以把一个类看作是一个必须做出的决定。所有的样例和它们的对应的类别标签被称为数据集。当接收一个新样例时，它会被分类器根据以前的经验进行分类。&lt;br /&gt;
&lt;br /&gt;
  --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]） 分类器(“ if shiny then diamond”)和控制器(“ if shiny then pick up”) 一句不能准确翻译&lt;br /&gt;
&lt;br /&gt;
  --[[用户:Qige96|Ricky]]（[[用户讨论:Qige96|讨论]]）已解决。这里主要是突出分类器的工作是下判断，而控制器的工作是做动作。&lt;br /&gt;
&lt;br /&gt;
A classifier can be trained in various ways; there are many statistical and [[machine learning]] approaches. The [[decision tree learning|decision tree]]&amp;lt;ref name=&amp;quot;Decision tree&amp;quot;/&amp;gt; is perhaps the most widely used machine learning algorithm.{{sfn|Domingos|2015|p=88}} Other widely used classifiers are the [[Artificial neural network|neural network]],&amp;lt;ref name=&amp;quot;Neural networks&amp;quot;/&amp;gt; [[Gaussian mixture model]],&amp;lt;ref name=&amp;quot;Gaussian mixture model&amp;quot;/&amp;gt; and the extremely popular [[naive Bayes classifier]].{{efn|Naive Bayes is reportedly the &amp;quot;most widely used learner&amp;quot; at Google, due in part to its scalability.{{sfn|Domingos|2015|p=152}}}}&amp;lt;ref name=&amp;quot;Naive Bayes classifier&amp;quot;/&amp;gt; Classifier performance depends greatly on the characteristics of the data to be classified, such as the dataset size, distribution of samples across classes, the dimensionality, and the level of noise. Model-based classifiers perform well if the assumed model is an extremely good fit for the actual data. Otherwise, if no matching model is available, and if accuracy (rather than speed or scalability) is the sole concern, conventional wisdom is that discriminative classifiers (especially SVM) tend to be more accurate than model-based classifiers such as &amp;quot;naive Bayes&amp;quot; on most practical data sets.&amp;lt;ref name=&amp;quot;Classifier performance&amp;quot;/&amp;gt;{{sfn|Russell|Norvig|2009|loc=18.12: Learning from Examples: Summary}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
分类器可以通过多种方式进行训练;，比如许多统计学和机器学习方法。决策树可能是应用最广泛的机器学习算法。其他使用广泛的分类器还有神经网络、&amp;lt;ref name=&amp;quot;Neural networks&amp;quot;/&amp;gt;K最近邻算法{{efn|The most widely used analogical AI until the mid-1990s{{sfn|Domingos|2015|p=187}}}}&amp;lt;ref name=&amp;quot;K-nearest neighbor algorithm&amp;quot;/&amp;gt;、核方法（比如支持向量机）{{efn|SVM displaced k-nearest neighbor in the 1990s{{sfn|Domingos|2015|p=188}}}}&amp;lt;ref name=&amp;quot;Kernel methods&amp;quot;/&amp;gt;、'''&amp;lt;font color=#ff8000&amp;gt; 高斯混合模型 Gaussian Mixture Mode&amp;lt;/font&amp;gt;'''&amp;lt;ref name=&amp;quot;Gaussian mixture model&amp;quot;/&amp;gt;，以及非常流行的'''&amp;lt;font color=#ff8000&amp;gt;朴素贝叶斯分类器 Naive Bayes Classifier&amp;lt;/font&amp;gt;'''&amp;lt;ref name=&amp;quot;Naive Bayes classifier&amp;quot;/&amp;gt;。分类器的分类效果在很大程度上取决于待分类数据的特征，如数据集的大小、样本跨类别的分布、维数和噪声水平。如果假设的模型很符合实际数据，则基于这种模型的分类器就能给出很好的结果。否则，传统观点认为如果没有匹配模型可用，而且只关心准确性(而不是速度或可扩展性) ，在大多数实际数据集上鉴别分类器(尤其是支持向量机)往往比基于模型的分类器(如“朴素贝叶斯”)更准确。&amp;lt;ref name=&amp;quot;Classifier performance&amp;quot;/&amp;gt;{{sfn|Russell|Norvig|2009|loc=18.12: Learning from Examples: Summary}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===人工神经网络 ===&lt;br /&gt;
&lt;br /&gt;
{{Main|Artificial neural network|Connectionism}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Artificial neural network.svg|thumb|A neural network is an interconnected group of nodes, akin to the vast network of [[neuron]]s in the [[human brain]].神经网络是一组相互连接的节点，类似于人脑中庞大的神经元网络。]]&lt;br /&gt;
&lt;br /&gt;
A neural network is an interconnected group of nodes, akin to the vast network of [[neurons in the human brain.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Neural networks were inspired by the architecture of neurons in the human brain. A simple &amp;quot;neuron&amp;quot; ''N'' accepts input from other neurons, each of which, when activated (or &amp;quot;fired&amp;quot;), cast a weighted &amp;quot;vote&amp;quot; for or against whether neuron ''N'' should itself activate. Learning requires an algorithm to adjust these weights based on the training data; one simple algorithm (dubbed &amp;quot;[[Hebbian learning|fire together, wire together]]&amp;quot;) is to increase the weight between two connected neurons when the activation of one triggers the successful activation of another. The neural network forms &amp;quot;concepts&amp;quot; that are distributed among a subnetwork of shared{{efn|Each individual neuron is likely to participate in more than one concept.}} neurons that tend to fire together; a concept meaning &amp;quot;leg&amp;quot; might be coupled with a subnetwork meaning &amp;quot;foot&amp;quot; that includes the sound for &amp;quot;foot&amp;quot;. Neurons have a continuous spectrum of activation; in addition, neurons can process inputs in a nonlinear way rather than weighing straightforward votes. Modern neural networks can learn both continuous functions and, surprisingly, digital logical operations. Neural networks' early successes included predicting the stock market and (in 1995) a mostly self-driving car.{{efn|Steering for the 1995 &amp;quot;[[History of autonomous cars#1990s|No Hands Across America]]&amp;quot; required &amp;quot;only a few human assists&amp;quot;.}}{{sfn|Domingos|2015|loc=Chapter 4}} In the 2010s, advances in neural networks using deep learning thrust AI into widespread public consciousness and contributed to an enormous upshift in corporate AI spending; for example, AI-related [[mergers and acquisitions|M&amp;amp;A]] in 2017 was over 25 times as large as in 2015.&amp;lt;ref&amp;gt;{{cite news|title=Why Deep Learning Is Suddenly Changing Your Life|url=http://fortune.com/ai-artificial-intelligence-deep-machine-learning/|accessdate=12 March 2018|work=Fortune|date=2016}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Google leads in the race to dominate artificial intelligence|url=https://www.economist.com/news/business/21732125-tech-giants-are-investing-billions-transformative-technology-google-leads-race|accessdate=12 March 2018|work=The Economist|date=2017|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Neural networks were inspired by the architecture of neurons in the human brain. A simple &amp;quot;neuron&amp;quot; N accepts input from other neurons, each of which, when activated (or &amp;quot;fired&amp;quot;), cast a weighted &amp;quot;vote&amp;quot; for or against whether neuron N should itself activate. Learning requires an algorithm to adjust these weights based on the training data; one simple algorithm (dubbed &amp;quot;fire together, wire together&amp;quot;) is to increase the weight between two connected neurons when the activation of one triggers the successful activation of another. The neural network forms &amp;quot;concepts&amp;quot; that are distributed among a subnetwork of shared neurons that tend to fire together; a concept meaning &amp;quot;leg&amp;quot; might be coupled with a subnetwork meaning &amp;quot;foot&amp;quot; that includes the sound for &amp;quot;foot&amp;quot;. Neurons have a continuous spectrum of activation; in addition, neurons can process inputs in a nonlinear way rather than weighing straightforward votes. Modern neural networks can learn both continuous functions and, surprisingly, digital logical operations. Neural networks' early successes included predicting the stock market and (in 1995) a mostly self-driving car. In the 2010s, advances in neural networks using deep learning thrust AI into widespread public consciousness and contributed to an enormous upshift in corporate AI spending; for example, AI-related M&amp;amp;A in 2017 was over 25 times as large as in 2015.&lt;br /&gt;
&lt;br /&gt;
神经网络的诞生受到人脑神经元结构的启发。一个简单的“神经元”''N'' 接受来自其他神经元的输入，每个神经元在被激活(或者说“放电”)时，都会对''N''是否应该被激活按一定的权重赋上值。学习的过程需要一个根据训练数据调整这些权重的算法：一个被称为“相互放电，彼此联系”简单的算法在一个神经元激活触发另一个神经元的激活时增加两个连接神经元之间的权重。神经网络中形成一种分布在一个共享的神经元子网络中的“概念”，这些神经元往往一起放电。“腿”的概念可能和“脚”概念的子网络相结合，后者包括”脚”的发音。神经元有一个连续的激活频谱; 此外，神经元还可以用非线性的方式处理输入，而不是简单地加权求和。现代神经网络可以学习连续函数甚至的数字逻辑运算。神经网络早期的成功包括预测股票市场和自动驾驶汽车(1995年)。{{efn|Steering for the 1995 &amp;quot;[[History of autonomous cars#1990s|No Hands Across America]]&amp;quot; required &amp;quot;only a few human assists&amp;quot;.}}2010年代，神经网络使用深度学习取得巨大进步，也因此将AI推向了公众视野里，并促使企业对AI投资急速增加; 例如2017年与AI相关的并购交易规模是2015年的25倍多。&amp;lt;ref&amp;gt;{{cite news|title=Why Deep Learning Is Suddenly Changing Your Life|url=http://fortune.com/ai-artificial-intelligence-deep-machine-learning/|accessdate=12 March 2018|work=Fortune|date=2016}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Google leads in the race to dominate artificial intelligence|url=https://www.economist.com/news/business/21732125-tech-giants-are-investing-billions-transformative-technology-google-leads-race|accessdate=12 March 2018|work=The Economist|date=2017|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The study of non-learning [[artificial neural network]]s&amp;lt;ref name=&amp;quot;Neural networks&amp;quot;/&amp;gt; began in the decade before the field of AI research was founded, in the work of [[Walter Pitts]] and [[Warren McCullouch]]. [[Frank Rosenblatt]] invented the [[perceptron]], a learning network with a single layer, similar to the old concept of [[linear regression]]. Early pioneers also include [[Alexey Grigorevich Ivakhnenko]], [[Teuvo Kohonen]], [[Stephen Grossberg]], [[Kunihiko Fukushima]], [[Christoph von der Malsburg]], David Willshaw, [[Shun-Ichi Amari]], [[Bernard Widrow]], [[John Hopfield]], [[Eduardo R. Caianiello]], and others{{citation needed|date=July 2019}}.&lt;br /&gt;
&lt;br /&gt;
The study of non-learning artificial neural networks began in the decade before the field of AI research was founded, in the work of Walter Pitts and Warren McCullouch. Frank Rosenblatt invented the perceptron, a learning network with a single layer, similar to the old concept of linear regression. Early pioneers also include Alexey Grigorevich Ivakhnenko, Teuvo Kohonen, Stephen Grossberg, Kunihiko Fukushima, Christoph von der Malsburg, David Willshaw, Shun-Ichi Amari, Bernard Widrow, John Hopfield, Eduardo R. Caianiello, and others.&lt;br /&gt;
&lt;br /&gt;
沃尔特·皮茨和沃伦·麦克卢奇共同完成的非学习型人工神经网络&amp;lt;ref name=&amp;quot;Neural networks&amp;quot;/&amp;gt;的研究比AI研究领域成立早十年。他们发明了'''&amp;lt;font color=#ff8000&amp;gt;感知机 Perceptron&amp;lt;/font&amp;gt;'''，这是一个单层的学习网络，类似于线性回归的概念。早期的先驱者还包括 Alexey Grigorevich Ivakhnenko，Teuvo Kohonen，Stephen Grossberg，Kunihiko Fukushima，Christoph von der Malsburg，David Willshaw，Shun-Ichi Amari，Bernard Widrow，John Hopfield，Eduardo r. Caianiello 等人。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The main categories of networks are acyclic or [[feedforward neural network]]s (where the signal passes in only one direction) and [[recurrent neural network]]s (which allow feedback and short-term memories of previous input events). Among the most popular feedforward networks are [[perceptron]]s, [[multi-layer perceptron]]s and [[radial basis network]]s.&amp;lt;ref name=&amp;quot;Feedforward neural networks&amp;quot;/&amp;gt; Neural networks can be applied to the problem of [[intelligent control]] (for robotics) or [[machine learning|learning]], using such techniques as [[Hebbian learning]] (&amp;quot;fire together, wire together&amp;quot;), [[GMDH]] or [[competitive learning]].&amp;lt;ref name=&amp;quot;Learning in neural networks&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The main categories of networks are acyclic or feedforward neural networks (where the signal passes in only one direction) and recurrent neural networks (which allow feedback and short-term memories of previous input events). Among the most popular feedforward networks are perceptrons, multi-layer perceptrons and radial basis networks. Neural networks can be applied to the problem of intelligent control (for robotics) or learning, using such techniques as Hebbian learning (&amp;quot;fire together, wire together&amp;quot;), GMDH or competitive learning.&lt;br /&gt;
&lt;br /&gt;
网络主要分为'''&amp;lt;font color=#ff8000&amp;gt; 非循环或前馈神经网络 Acyclic or Feedforward Neural Networks&amp;lt;/font&amp;gt;'''(信号只向一个方向传递)和'''&amp;lt;font color=#ff8000&amp;gt;循环神经网络 Recurrent Neural Network&amp;lt;/font&amp;gt;''' (允许反馈和对以前的输入事件进行短期记忆)。其中最常用的前馈网络.&amp;lt;ref name=&amp;quot;Feedforward neural networks&amp;quot;/&amp;gt;有感知机、'''&amp;lt;font color=#ff8000多层感知机 Multi-layer Perceptrons&amp;gt;&amp;lt;/font&amp;gt;''' 和'''&amp;lt;font color=#ff8000&amp;gt; 径向基网络 Radial Basis Networks&amp;lt;/font&amp;gt;'''。使用'''&amp;lt;font color=#ff8000&amp;gt;赫布型学习 Hebbian Learning &amp;lt;/font&amp;gt;''' (“相互放电，共同链接”) ，GMDH 或竞争学习等技术的神经网络可以被应用于智能控制(机器人)或学习问题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Today, neural networks are often trained by the [[backpropagation]] algorithm, which had been around since 1970 as the reverse mode of [[automatic differentiation]] published by [[Seppo Linnainmaa]],&amp;lt;ref name=&amp;quot;lin1970&amp;quot;&amp;gt;[[Seppo Linnainmaa]] (1970). The representation of the cumulative rounding error of an algorithm as a Taylor expansion of the local rounding errors. Master's Thesis (in Finnish), Univ. Helsinki, 6–7.&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;grie2012&amp;quot;&amp;gt;Griewank, Andreas (2012). Who Invented the Reverse Mode of Differentiation?. Optimization Stories, Documenta Matematica, Extra Volume ISMP (2012), 389–400.&amp;lt;/ref&amp;gt; and was introduced to neural networks by [[Paul Werbos]].&amp;lt;ref name=&amp;quot;WERBOS1974&amp;quot;&amp;gt;[[Paul Werbos]], &amp;quot;Beyond Regression: New Tools for Prediction and Analysis in the Behavioral Sciences&amp;quot;, ''PhD thesis, Harvard University'', 1974.&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;werbos1982&amp;quot;&amp;gt;[[Paul Werbos]] (1982). Applications of advances in nonlinear sensitivity analysis. In System modeling and optimization (pp. 762–770). Springer Berlin Heidelberg. [http://werbos.com/Neural/SensitivityIFIPSeptember1981.pdf Online] {{webarchive|url=https://web.archive.org/web/20160414055503/http://werbos.com/Neural/SensitivityIFIPSeptember1981.pdf |date=14 April 2016 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Backpropagation&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Today, neural networks are often trained by the backpropagation algorithm, which had been around since 1970 as the reverse mode of automatic differentiation published by Seppo Linnainmaa, and was introduced to neural networks by Paul Werbos.&lt;br /&gt;
&lt;br /&gt;
当下神经网络常用'''&amp;lt;font color=#ff8000&amp;gt;反向传播算法&amp;lt;/font&amp;gt;''' 来训练，1970年反向传播算法出现，被认为是 Seppo Linnainmaa提出的自动微分的反向模式出现&amp;lt;ref name=&amp;quot;lin1970&amp;quot;&amp;gt;[[Seppo Linnainmaa]] (1970). The representation of the cumulative rounding error of an algorithm as a Taylor expansion of the local rounding errors. Master's Thesis (in Finnish), Univ. Helsinki, 6–7.&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;grie2012&amp;quot;&amp;gt;Griewank, Andreas (2012). Who Invented the Reverse Mode of Differentiation?. Optimization Stories, Documenta Matematica, Extra Volume ISMP (2012), 389–400.&amp;lt;/ref&amp;gt;，被保罗·韦伯引入神经网络。&amp;lt;ref name=&amp;quot;WERBOS1974&amp;quot;&amp;gt;[[Paul Werbos]], &amp;quot;Beyond Regression: New Tools for Prediction and Analysis in the Behavioral Sciences&amp;quot;, ''PhD thesis, Harvard University'', 1974.&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;werbos1982&amp;quot;&amp;gt;[[Paul Werbos]] (1982). Applications of advances in nonlinear sensitivity analysis. In System modeling and optimization (pp. 762–770). Springer Berlin Heidelberg. [http://werbos.com/Neural/SensitivityIFIPSeptember1981.pdf Online] {{webarchive|url=https://web.archive.org/web/20160414055503/http://werbos.com/Neural/SensitivityIFIPSeptember1981.pdf |date=14 April 2016 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Backpropagation&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Hierarchical temporal memory]] is an approach that models some of the structural and algorithmic properties of the [[neocortex]].&amp;lt;ref name=&amp;quot;Hierarchical temporal memory&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Hierarchical temporal memory is an approach that models some of the structural and algorithmic properties of the neocortex.&lt;br /&gt;
&lt;br /&gt;
层次化暂时性记忆是一种模拟大脑新皮层结构和算法特性的方法。&amp;lt;ref name=&amp;quot;Hierarchical temporal memory&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
To summarize, most neural networks use some form of [[gradient descent]] on a hand-created neural topology. However, some research groups, such as [[Uber]], argue that simple [[neuroevolution]] to mutate new neural network topologies and weights may be competitive with sophisticated gradient descent approaches{{citation needed|date=July 2019}}. One advantage of neuroevolution is that it may be less prone to get caught in &amp;quot;dead ends&amp;quot;.&amp;lt;ref&amp;gt;{{cite news|title=Artificial intelligence can 'evolve' to solve problems|url=http://www.sciencemag.org/news/2018/01/artificial-intelligence-can-evolve-solve-problems|accessdate=7 February 2018|work=Science {{!}} AAAS|date=10 January 2018|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
To summarize, most neural networks use some form of gradient descent on a hand-created neural topology. However, some research groups, such as Uber, argue that simple neuroevolution to mutate new neural network topologies and weights may be competitive with sophisticated gradient descent approaches. One advantage of neuroevolution is that it may be less prone to get caught in &amp;quot;dead ends&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
总之，大多数神经网络都会在人工神经拓扑结构上使用某种形式的'''&amp;lt;font color=#ff8000&amp;gt;梯度下降法 Gradient Descent&amp;lt;/font&amp;gt;'''。然而，一些研究组，比如 Uber的，认为通过简单的神经进化改变新神经网络拓扑结构和神经元间的权重可能比复杂的梯度下降法更适用{{citation needed|date=July 2019}}。神经进化的一个优势是，它不容易陷入“死胡同”。&amp;lt;ref&amp;gt;{{cite news|title=Artificial intelligence can 'evolve' to solve problems|url=http://www.sciencemag.org/news/2018/01/artificial-intelligence-can-evolve-solve-problems|accessdate=7 February 2018|work=Science {{!}} AAAS|date=10 January 2018|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====深层前馈神经网络====&lt;br /&gt;
&lt;br /&gt;
{{Main|Deep learning}}&lt;br /&gt;
&lt;br /&gt;
[[Deep learning]] is any [[artificial neural network]] that can learn a long chain of causal links{{dubious|date=July 2019}}. For example, a feedforward network with six hidden layers can learn a seven-link causal chain (six hidden layers + output layer) and has a [[deep learning#Credit assignment|&amp;quot;credit assignment path&amp;quot;]] (CAP) depth of seven{{citation needed|date=July 2019}}. Many deep learning systems need to be able to learn chains ten or more causal links in length.&amp;lt;ref name=&amp;quot;schmidhuber2015&amp;quot;/&amp;gt; Deep learning has transformed many important subfields of artificial intelligence{{why|date=July 2019}}, including [[computer vision]], [[speech recognition]], [[natural language processing]] and others.&amp;lt;ref name=&amp;quot;goodfellow2016&amp;quot;&amp;gt;Ian Goodfellow, Yoshua Bengio, and Aaron Courville (2016). Deep Learning. MIT Press. [http://www.deeplearningbook.org Online] {{webarchive|url=https://web.archive.org/web/20160416111010/http://www.deeplearningbook.org/ |date=16 April 2016 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;HintonDengYu2012&amp;quot;&amp;gt;{{cite journal | last1 = Hinton | first1 = G. | last2 = Deng | first2 = L. | last3 = Yu | first3 = D. | last4 = Dahl | first4 = G. | last5 = Mohamed | first5 = A. | last6 = Jaitly | first6 = N. | last7 = Senior | first7 = A. | last8 = Vanhoucke | first8 = V. | last9 = Nguyen | first9 = P. | last10 = Sainath | first10 = T. | last11 = Kingsbury | first11 = B. | year = 2012 | title = Deep Neural Networks for Acoustic Modeling in Speech Recognition – The shared views of four research groups | url = | journal = IEEE Signal Processing Magazine | volume = 29 | issue = 6| pages = 82–97 | doi=10.1109/msp.2012.2205597}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;schmidhuber2015&amp;quot;&amp;gt;{{cite journal |last=Schmidhuber |first=J. |year=2015 |title=Deep Learning in Neural Networks: An Overview |journal=Neural Networks |volume=61 |pages=85–117 |arxiv=1404.7828 |doi=10.1016/j.neunet.2014.09.003|pmid=25462637 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Deep learning is any artificial neural network that can learn a long chain of causal links. For example, a feedforward network with six hidden layers can learn a seven-link causal chain (six hidden layers + output layer) and has a &amp;quot;credit assignment path&amp;quot; (CAP) depth of seven. Many deep learning systems need to be able to learn chains ten or more causal links in length.&lt;br /&gt;
&lt;br /&gt;
深度学习是任何可以学习长因果链的人工神经网络。例如，一个具有六个隐藏层的前馈网络可以学习有七个链接的因果链(六个隐藏层 + 一个输出层) ，并且具深度为7的“'''&amp;lt;font color=#ff8000&amp;gt;信用分配路径 Credit Assignment Path，CAP&amp;lt;/font&amp;gt;''' ”。许多深度学习系统需要学习长度在十及以上的因果链。&amp;lt;ref name=&amp;quot;goodfellow2016&amp;quot;&amp;gt;Ian Goodfellow, Yoshua Bengio, and Aaron Courville (2016). Deep Learning. MIT Press. [http://www.deeplearningbook.org Online] {{webarchive|url=https://web.archive.org/web/20160416111010/http://www.deeplearningbook.org/ |date=16 April 2016 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;HintonDengYu2012&amp;quot;&amp;gt;{{cite journal | last1 = Hinton | first1 = G. | last2 = Deng | first2 = L. | last3 = Yu | first3 = D. | last4 = Dahl | first4 = G. | last5 = Mohamed | first5 = A. | last6 = Jaitly | first6 = N. | last7 = Senior | first7 = A. | last8 = Vanhoucke | first8 = V. | last9 = Nguyen | first9 = P. | last10 = Sainath | first10 = T. | last11 = Kingsbury | first11 = B. | year = 2012 | title = Deep Neural Networks for Acoustic Modeling in Speech Recognition – The shared views of four research groups | url = | journal = IEEE Signal Processing Magazine | volume = 29 | issue = 6| pages = 82–97 | doi=10.1109/msp.2012.2205597}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;schmidhuber2015&amp;quot;&amp;gt;{{cite journal |last=Schmidhuber |first=J. |year=2015 |title=Deep Learning in Neural Networks: An Overview |journal=Neural Networks |volume=61 |pages=85–117 |arxiv=1404.7828 |doi=10.1016/j.neunet.2014.09.003|pmid=25462637 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）Credit Assignment Path未找到标准翻译&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Qige96|Ricky]]（[[用户讨论:Qige96|讨论]]）中文的翻译一般来说就是“信用分配路径”，但其实这里的credit指的是贡献、声誉等。整个CAP要解决的是整条链路种每个神经元对最终结果的贡献是多少。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to one overview,&amp;lt;ref name=&amp;quot;scholarpedia&amp;quot;&amp;gt;{{cite journal | last1 = Schmidhuber | first1 = Jürgen | authorlink = Jürgen Schmidhuber | year = 2015 | title = Deep Learning | journal = Scholarpedia | volume = 10 | issue = 11 | page = 32832 | doi = 10.4249/scholarpedia.32832 | df = dmy-all | bibcode = 2015SchpJ..1032832S | doi-access = free }}&amp;lt;/ref&amp;gt; the expression &amp;quot;Deep Learning&amp;quot; was introduced to the [[machine learning]] community by [[Rina Dechter]] in 1986&amp;lt;ref name=&amp;quot;dechter1986&amp;quot;&amp;gt;[[Rina Dechter]] (1986). Learning while searching in constraint-satisfaction problems. University of California, Computer Science Department, Cognitive Systems Laboratory.[https://www.researchgate.net/publication/221605378_Learning_While_Searching_in_Constraint-Satisfaction-Problems Online] {{webarchive|url=https://web.archive.org/web/20160419054654/https://www.researchgate.net/publication/221605378_Learning_While_Searching_in_Constraint-Satisfaction-Problems |date=19 April 2016 }}&amp;lt;/ref&amp;gt; and gained traction after Igor Aizenberg and colleagues introduced it to [[artificial neural network]]s in 2000.&lt;br /&gt;
&lt;br /&gt;
According to one overview, the expression &amp;quot;Deep Learning&amp;quot; was introduced to the machine learning community by Rina Dechter in 1986 and gained traction after Igor Aizenberg and colleagues introduced it to artificial neural networks in 2000.&amp;lt;ref name=&amp;quot;aizenberg2000&amp;quot;&amp;gt;Igor Aizenberg, Naum N. Aizenberg, Joos P.L. Vandewalle (2000). Multi-Valued and Universal Binary Neurons: Theory, Learning and Applications. Springer Science &amp;amp; Business Media.&amp;lt;/ref&amp;gt; The first functional Deep Learning networks were published by [[Alexey Grigorevich Ivakhnenko]] and V. G. Lapa in 1965.&amp;lt;ref&amp;gt;{{Cite book|title=Cybernetic Predicting Devices|last=Ivakhnenko|first=Alexey|publisher=Naukova Dumka|year=1965|isbn=|location=Kiev|pages=}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
根据一篇综述&amp;lt;ref name=&amp;quot;scholarpedia&amp;quot;&amp;gt;{{cite journal | last1 = Schmidhuber | first1 = Jürgen | authorlink = Jürgen Schmidhuber | year = 2015 | title = Deep Learning | journal = Scholarpedia | volume = 10 | issue = 11 | page = 32832 | doi = 10.4249/scholarpedia.32832 | df = dmy-all | bibcode = 2015SchpJ..1032832S | doi-access = free }}&amp;lt;/ref&amp;gt;，“深度学习”这种表述是在1986年&amp;lt;ref name=&amp;quot;dechter1986&amp;quot;&amp;gt;[[Rina Dechter]] (1986). Learning while searching in constraint-satisfaction problems. University of California, Computer Science Department, Cognitive Systems Laboratory.[https://www.researchgate.net/publication/221605378_Learning_While_Searching_in_Constraint-Satisfaction-Problems Online] {{webarchive|url=https://web.archive.org/web/20160419054654/https://www.researchgate.net/publication/221605378_Learning_While_Searching_in_Constraint-Satisfaction-Problems |date=19 April 2016 }}&amp;lt;/ref&amp;gt;被里纳·德克特引入到机器学习领域的，并在2000年伊克尔·艾森贝格和他的同事将其引入人工神经网络后获得了关注。&amp;lt;ref name=&amp;quot;aizenberg2000&amp;quot;&amp;gt;Igor Aizenberg, Naum N. Aizenberg, Joos P.L. Vandewalle (2000). Multi-Valued and Universal Binary Neurons: Theory, Learning and Applications. Springer Science &amp;amp; Business Media.&amp;lt;/ref&amp;gt; The first functional Deep Learning networks were published by [[Alexey Grigorevich Ivakhnenko]] and V. G. Lapa in 1965.&amp;lt;ref&amp;gt;{{Cite book|title=Cybernetic Predicting Devices|last=Ivakhnenko|first=Alexey|publisher=Naukova Dumka|year=1965|isbn=|location=Kiev|pages=}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
These networks are trained one layer at a time. Ivakhnenko's 1971 paper&amp;lt;ref name=&amp;quot;ivak1971&amp;quot;&amp;gt;{{Cite journal |doi = 10.1109/TSMC.1971.4308320|title = Polynomial Theory of Complex Systems|journal = IEEE Transactions on Systems, Man, and Cybernetics|issue = 4|pages = 364–378|year = 1971|last1 = Ivakhnenko|first1 = A. G.|url = https://semanticscholar.org/paper/b7efb6b6f7e9ffa017e970a098665f76d4dfeca2}}&amp;lt;/ref&amp;gt; describes the learning of a deep feedforward multilayer perceptron with eight layers, already much deeper than many later networks. In 2006, a publication by [[Geoffrey Hinton]] and Ruslan Salakhutdinov introduced another way of pre-training many-layered [[feedforward neural network]]s (FNNs) one layer at a time, treating each layer in turn as an [[unsupervised learning|unsupervised]] [[restricted Boltzmann machine]], then using [[supervised learning|supervised]] [[backpropagation]] for fine-tuning.{{sfn|Hinton|2007}} Similar to shallow artificial neural networks, deep neural networks can model complex non-linear relationships. Over the last few years, advances in both machine learning algorithms and computer hardware have led to more efficient methods for training deep neural networks that contain many layers of non-linear hidden units and a very large output layer.&amp;lt;ref&amp;gt;{{cite web|last1=Research|first1=AI|title=Deep Neural Networks for Acoustic Modeling in Speech Recognition|url=http://airesearch.com/ai-research-papers/deep-neural-networks-for-acoustic-modeling-in-speech-recognition/|website=airesearch.com|accessdate=23 October 2015|date=23 October 2015}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The first functional Deep Learning networks were published by Alexey Grigorevich Ivakhnenko and V. G. Lapa in 1965. These networks are trained one layer at a time. Ivakhnenko's 1971 paper describes the learning of a deep feedforward multilayer perceptron with eight layers, already much deeper than many later networks. In 2006, a publication by Geoffrey Hinton and Ruslan Salakhutdinov introduced another way of pre-training many-layered feedforward neural networks (FNNs) one layer at a time, treating each layer in turn as an unsupervised restricted Boltzmann machine, then using supervised backpropagation for fine-tuning. Similar to shallow artificial neural networks, deep neural networks can model complex non-linear relationships. Over the last few years, advances in both machine learning algorithms and computer hardware have led to more efficient methods for training deep neural networks that contain many layers of non-linear hidden units and a very large output layer.&lt;br /&gt;
&lt;br /&gt;
第一个可以用的深度学习网络是由A. G.伊瓦赫年科和V.G.拉帕 在1965年发表的。这些网络每次只训练一层。1971年伊瓦赫年科的论文描述了一个8层的深度前馈多层感知机网络的学习过程，这个网络已经比许多后来的网络要深得多了&amp;lt;ref name=&amp;quot;ivak1971&amp;quot;&amp;gt;{{Cite journal |doi = 10.1109/TSMC.1971.4308320|title = Polynomial Theory of Complex Systems|journal = IEEE Transactions on Systems, Man, and Cybernetics|issue = 4|pages = 364–378|year = 1971|last1 = Ivakhnenko|first1 = A. G.|url = https://semanticscholar.org/paper/b7efb6b6f7e9ffa017e970a098665f76d4dfeca2}}&amp;lt;/ref&amp;gt;。2006年，杰弗里•辛顿和特迪诺夫的文章介绍了另一种预训练'''&amp;lt;font color=#ff8000&amp;gt;多层前馈神经网络 Many-layered Feedforward Neural Networks, FNNs&amp;lt;/font&amp;gt;''' 的方法，一次训练一层，将每一层都视为无监督的[[受限玻尔兹曼机]]，然后使用监督式反向传播进行微调。与浅层人工神经网络类似，深层神经网络可以模拟复杂的非线性关系。在过去的几年里，机器学习算法和计算机硬件的进步催生了更有效的方法，训练包含许多层非线性隐藏单元和一个非常大的输出层的深层神经网络。&amp;lt;ref&amp;gt;{{cite web|last1=Research|first1=AI|title=Deep Neural Networks for Acoustic Modeling in Speech Recognition|url=http://airesearch.com/ai-research-papers/deep-neural-networks-for-acoustic-modeling-in-speech-recognition/|website=airesearch.com|accessdate=23 October 2015|date=23 October 2015}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Deep learning often uses [[convolutional neural network]]s (CNNs), whose origins can be traced back to the [[Neocognitron]] introduced by [[Kunihiko Fukushima]] in 1980.&amp;lt;ref name=&amp;quot;FUKU1980&amp;quot;&amp;gt;{{cite journal | last1 = Fukushima | first1 = K. | year = 1980 | title = Neocognitron: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position | url = | journal = Biological Cybernetics | volume = 36 | issue = 4| pages = 193–202 | doi=10.1007/bf00344251 | pmid=7370364}}&amp;lt;/ref&amp;gt; In 1989, [[Yann LeCun]] and colleagues applied [[backpropagation]] to such an architecture. In the early 2000s, in an industrial application, CNNs already processed an estimated 10% to 20% of all the checks written in the US.&amp;lt;ref name=&amp;quot;lecun2016slides&amp;quot;&amp;gt;[[Yann LeCun]] (2016). Slides on Deep Learning [https://indico.cern.ch/event/510372/ Online] {{webarchive|url=https://web.archive.org/web/20160423021403/https://indico.cern.ch/event/510372/ |date=23 April 2016 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Deep learning often uses convolutional neural networks (CNNs), whose origins can be traced back to the Neocognitron introduced by Kunihiko Fukushima in 1980. In 1989, Yann LeCun and colleagues applied backpropagation to such an architecture. In the early 2000s, in an industrial application, CNNs already processed an estimated 10% to 20% of all the checks written in the US.&lt;br /&gt;
&lt;br /&gt;
深度学习通常使用'&amp;lt;font color=#ff8000&amp;gt;卷积神经网络 ConvolutionalNeural Networks CNNs&amp;lt;/font&amp;gt;''' ，其起源可以追溯到1980年由福岛邦彦引进的新认知机。1989年扬·勒丘恩(Yann LeCun)和他的同事将反向传播算法应用于这样的架构。在21世纪初，在一项工业应用中，CNNs已经处理了美国大约10% 到20%的签发支票。&lt;br /&gt;
&lt;br /&gt;
Since 2011, fast implementations of CNNs on GPUs have won many visual pattern recognition competitions.&amp;lt;ref name=&amp;quot;schmidhuber2015&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Since 2011, fast implementations of CNNs on GPUs have won many visual pattern recognition competitions.&lt;br /&gt;
&lt;br /&gt;
自2011年以来，在 GPUs上快速实现的 CNN 赢得了许多视觉模式识别比赛。&amp;lt;ref name=&amp;quot;schmidhuber2015&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
CNNs with 12 convolutional layers were used in conjunction with [[reinforcement learning]] by Deepmind's &amp;quot;[[AlphaGo]] Lee&amp;quot;, the program that beat a top [[Go (game)|Go]] champion in 2016.&amp;lt;ref name=&amp;quot;Nature2017&amp;quot;&amp;gt;{{cite journal |first1=David |last1=Silver|author-link1=David Silver (programmer)|first2= Julian|last2= Schrittwieser|first3= Karen|last3= Simonyan|first4= Ioannis|last4= Antonoglou|first5= Aja|last5= Huang|author-link5=Aja Huang|first6=Arthur|last6= Guez|first7= Thomas|last7= Hubert|first8= Lucas|last8= Baker|first9= Matthew|last9= Lai|first10= Adrian|last10= Bolton|first11= Yutian|last11= Chen|author-link11=Chen Yutian|first12= Timothy|last12= Lillicrap|first13=Hui|last13= Fan|author-link13=Fan Hui|first14= Laurent|last14= Sifre|first15= George van den|last15= Driessche|first16= Thore|last16= Graepel|first17= Demis|last17= Hassabis |author-link17=Demis Hassabis|title=Mastering the game of Go without human knowledge|journal=[[Nature (journal)|Nature]]|issn= 0028-0836|pages=354–359|volume =550|issue =7676|doi =10.1038/nature24270|pmid=29052630|date=19 October 2017|quote=AlphaGo Lee... 12 convolutional layers|bibcode=2017Natur.550..354S|url=http://discovery.ucl.ac.uk/10045895/1/agz_unformatted_nature.pdf}}{{closed access}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
CNNs with 12 convolutional layers were used in conjunction with reinforcement learning by Deepmind's &amp;quot;AlphaGo Lee&amp;quot;, the program that beat a top Go champion in 2016.&lt;br /&gt;
&lt;br /&gt;
2016年Deepmind 的“AlphaGo Lee”使用了有12个卷积层的 CNNs 和强化学习，击败了一个顶级围棋冠军。&amp;lt;ref name=&amp;quot;Nature2017&amp;quot;&amp;gt;{{cite journal |first1=David |last1=Silver|author-link1=David Silver (programmer)|first2= Julian|last2= Schrittwieser|first3= Karen|last3= Simonyan|first4= Ioannis|last4= Antonoglou|first5= Aja|last5= Huang|author-link5=Aja Huang|first6=Arthur|last6= Guez|first7= Thomas|last7= Hubert|first8= Lucas|last8= Baker|first9= Matthew|last9= Lai|first10= Adrian|last10= Bolton|first11= Yutian|last11= Chen|author-link11=Chen Yutian|first12= Timothy|last12= Lillicrap|first13=Hui|last13= Fan|author-link13=Fan Hui|first14= Laurent|last14= Sifre|first15= George van den|last15= Driessche|first16= Thore|last16= Graepel|first17= Demis|last17= Hassabis |author-link17=Demis Hassabis|title=Mastering the game of Go without human knowledge|journal=[[Nature (journal)|Nature]]|issn= 0028-0836|pages=354–359|volume =550|issue =7676|doi =10.1038/nature24270|pmid=29052630|date=19 October 2017|quote=AlphaGo Lee... 12 convolutional layers|bibcode=2017Natur.550..354S|url=http://discovery.ucl.ac.uk/10045895/1/agz_unformatted_nature.pdf}}{{closed access}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====深层循环（递归）神经网络 ====&lt;br /&gt;
&lt;br /&gt;
{{Main|Recurrent neural networks}}&lt;br /&gt;
&lt;br /&gt;
Early on, deep learning was also applied to sequence learning with [[recurrent neural network]]s (RNNs)&amp;lt;ref name=&amp;quot;Recurrent neural networks&amp;quot;/&amp;gt; which are in theory Turing complete&amp;lt;ref&amp;gt;{{cite journal|last1=Hyötyniemi|first1=Heikki|title=Turing machines are recurrent neural networks|journal=Proceedings of STeP '96/Publications of the Finnish Artificial Intelligence Society|pages=13–24|date=1996}}&amp;lt;/ref&amp;gt; and can run arbitrary programs to process arbitrary sequences of inputs. The depth of an RNN is unlimited and depends on the length of its input sequence; thus, an RNN is an example of deep learning.&amp;lt;ref name=&amp;quot;schmidhuber2015&amp;quot;/&amp;gt; RNNs can be trained by [[gradient descent]]&amp;lt;ref&amp;gt;P. J. Werbos. Generalization of backpropagation with application to a recurrent gas market model&amp;quot; ''Neural Networks'' 1, 1988.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;A. J. Robinson and F. Fallside. The utility driven dynamic error propagation network. Technical Report CUED/F-INFENG/TR.1, Cambridge University Engineering Department, 1987.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;R. J. Williams and D. Zipser. Gradient-based learning algorithms for recurrent networks and their computational complexity. In Back-propagation: Theory, Architectures and Applications. Hillsdale, NJ: Erlbaum, 1994.&amp;lt;/ref&amp;gt; but suffer from the [[vanishing gradient problem]].&amp;lt;ref name=&amp;quot;goodfellow2016&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;hochreiter1991&amp;quot;&amp;gt;[[Sepp Hochreiter]] (1991), [http://people.idsia.ch/~juergen/SeppHochreiter1991ThesisAdvisorSchmidhuber.pdf Untersuchungen zu dynamischen neuronalen Netzen] {{webarchive|url=https://web.archive.org/web/20150306075401/http://people.idsia.ch/~juergen/SeppHochreiter1991ThesisAdvisorSchmidhuber.pdf |date=6 March 2015 }}, Diploma thesis. Institut f. Informatik, Technische Univ. Munich. Advisor: J. Schmidhuber.&amp;lt;/ref&amp;gt; In 1992, it was shown that unsupervised pre-training of a stack of [[recurrent neural network]]s can speed up subsequent supervised learning of deep sequential problems.&amp;lt;ref name=&amp;quot;SCHMID1992&amp;quot;&amp;gt;{{cite journal | last1 = Schmidhuber | first1 = J. | year = 1992 | title = Learning complex, extended sequences using the principle of history compression | url = | journal = Neural Computation | volume = 4 | issue = 2| pages = 234–242 | doi=10.1162/neco.1992.4.2.234| citeseerx = 10.1.1.49.3934}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Early on, deep learning was also applied to sequence learning with recurrent neural networks (RNNs)&amp;lt;ref name=&amp;quot;Recurrent neural networks&amp;quot;/&amp;gt;  and can run arbitrary programs to process arbitrary sequences of inputs. The depth of an RNN is unlimited and depends on the length of its input sequence; thus, an RNN is an example of deep learning. but suffer from the vanishing gradient problem. In 1992, it was shown that unsupervised pre-training of a stack of recurrent neural networks can speed up subsequent supervised learning of deep sequential problems.&lt;br /&gt;
&lt;br /&gt;
早期，深度学习也被用于'''&amp;lt;font color=#ff8000&amp;gt;循环神经网络 Recurrent Neural Networks,RNNs&amp;lt;/font&amp;gt;''' 的序列学习&amp;lt;ref&amp;gt;{{cite journal|last1=Hyötyniemi|first1=Heikki|title=Turing machines are recurrent neural networks|journal=Proceedings of STeP '96/Publications of the Finnish Artificial Intelligence Society|pages=13–24|date=1996}}&amp;lt;/ref&amp;gt;，可以运行任意程序来处理任意的输入序列。一个循环神经网络的深度是无限制的，取决于其输入序列的长度; 因此，循环神经网络是一个深度学习的例子&amp;lt;ref name=&amp;quot;schmidhuber2015&amp;quot;/&amp;gt;，但却存在梯度消失问题。1992年的一项研究表明无监督的预训练循环神经网络可以加速后续的深度序列问题的监督式学习。]&amp;lt;ref&amp;gt;P. J. Werbos. Generalization of backpropagation with application to a recurrent gas market model&amp;quot; ''Neural Networks'' 1, 1988.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;A. J. Robinson and F. Fallside. The utility driven dynamic error propagation network. Technical Report CUED/F-INFENG/TR.1, Cambridge University Engineering Department, 1987.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;R. J. Williams and D. Zipser. Gradient-based learning algorithms for recurrent networks and their computational complexity. In Back-propagation: Theory, Architectures and Applications. Hillsdale, NJ: Erlbaum, 1994.&amp;lt;/ref&amp;gt; but suffer from the [[vanishing gradient problem]].&amp;lt;ref name=&amp;quot;goodfellow2016&amp;quot;/&amp;gt;&amp;lt;ref name=&amp;quot;hochreiter1991&amp;quot;&amp;gt;[[Sepp Hochreiter]] (1991), [http://people.idsia.ch/~juergen/SeppHochreiter1991ThesisAdvisorSchmidhuber.pdf Untersuchungen zu dynamischen neuronalen Netzen] {{webarchive|url=https://web.archive.org/web/20150306075401/http://people.idsia.ch/~juergen/SeppHochreiter1991ThesisAdvisorSchmidhuber.pdf |date=6 March 2015 }}, Diploma thesis. Institut f. Informatik, Technische Univ. Munich. Advisor: J. Schmidhuber.&amp;lt;/ref&amp;gt; In 1992, it was shown that unsupervised pre-training of a stack of [[recurrent neural network]]s can speed up subsequent supervised learning of deep sequential problems.&amp;lt;ref name=&amp;quot;SCHMID1992&amp;quot;&amp;gt;{{cite journal | last1 = Schmidhuber | first1 = J. | year = 1992 | title = Learning complex, extended sequences using the principle of history compression | url = | journal = Neural Computation | volume = 4 | issue = 2| pages = 234–242 | doi=10.1162/neco.1992.4.2.234| citeseerx = 10.1.1.49.3934}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Numerous researchers now use variants of a deep learning recurrent NN called the [[long short-term memory]] (LSTM) network published by Hochreiter &amp;amp; Schmidhuber in 1997.&amp;lt;ref name=lstm&amp;gt;[[Sepp Hochreiter|Hochreiter, Sepp]]; and [[Jürgen Schmidhuber|Schmidhuber, Jürgen]]; ''Long Short-Term Memory'', Neural Computation, 9(8):1735–1780, 1997&amp;lt;/ref&amp;gt; LSTM is often trained by [[Connectionist temporal classification|Connectionist Temporal Classification]] (CTC).&amp;lt;ref name=&amp;quot;graves2006&amp;quot;&amp;gt;Alex Graves, Santiago Fernandez, Faustino Gomez, and [[Jürgen Schmidhuber]] (2006). Connectionist temporal classification: Labelling unsegmented sequence data with recurrent neural nets. Proceedings of ICML'06, pp. 369–376.&amp;lt;/ref&amp;gt; At Google, Microsoft and Baidu this approach has revolutionized [[speech recognition]].&amp;lt;ref name=&amp;quot;hannun2014&amp;quot;&amp;gt;{{cite arXiv&lt;br /&gt;
&lt;br /&gt;
Numerous researchers now use variants of a deep learning recurrent NN called the long short-term memory (LSTM) network published by Hochreiter &amp;amp; Schmidhuber in 1997. LSTM is often trained by Connectionist Temporal Classification (CTC). At Google, Microsoft and Baidu this approach has revolutionized speech recognition.&amp;lt;ref name=&amp;quot;hannun2014&amp;quot;&amp;gt;{{cite arXiv&lt;br /&gt;
&lt;br /&gt;
许多研究人员现在使用着一种被称为 '''&amp;lt;font color=#ff8000&amp;gt;长短期记忆 Long Short-term Memory, LSTM &amp;lt;/font&amp;gt;'''的网络——一种深度学习循环神经网络的变体，由霍克赖特和施米德胡贝在1997年提出。人们通常使用'''&amp;lt;font color=#ff8000&amp;gt;连接时序分类 Connectionist Temporal Classification, CTC&amp;lt;/font&amp;gt;'''训练LSTM&amp;lt;ref name=&amp;quot;graves2006&amp;quot;&amp;gt;Alex Graves, Santiago Fernandez, Faustino Gomez, and [[Jürgen Schmidhuber]] (2006). Connectionist temporal classification: Labelling unsegmented sequence data with recurrent neural nets. Proceedings of ICML'06, pp. 369–376.&amp;lt;/ref&amp;gt;。谷歌，微软和百度用CTC彻底改变了语音识别。例如,2015年谷歌的语音识别性能大幅提升了49%,现在数十亿智能手机用户都可以通过谷歌声音使用这项技术。谷歌也使用LSTM来改进机器翻译，例如2015年，通过训练的LSTM，谷歌的语音识别性能大幅提升了49%，现在通过谷歌语音可以被数十亿的智能手机用户使用。谷歌还使用LSTM来改进机器翻译、语言建模和多语言语言处理。LSTM与CNNs一起使用改进了自动图像字幕的功能等众多应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===评估进度===&lt;br /&gt;
&lt;br /&gt;
{{Further|Progress in artificial intelligence|Competitions and prizes in artificial intelligence}}&lt;br /&gt;
&lt;br /&gt;
AI, like electricity or the steam engine, is a general purpose technology. There is no consensus on how to characterize which tasks AI tends to excel at.&amp;lt;ref&amp;gt;{{cite news|last1=Brynjolfsson|first1=Erik|last2=Mitchell|first2=Tom|title=What can machine learning do? Workforce implications|url=http://science.sciencemag.org/content/358/6370/1530|accessdate=7 May 2018|work=Science|date=22 December 2017|pages=1530–1534|language=en|doi=10.1126/science.aap8062|bibcode=2017Sci...358.1530B}}&amp;lt;/ref&amp;gt; While projects such as [[AlphaZero]] have succeeded in generating their own knowledge from scratch, many other machine learning projects require large training datasets.&amp;lt;ref&amp;gt;{{cite news|last1=Sample|first1=Ian|title='It's able to create knowledge itself': Google unveils AI that learns on its own|url=https://www.theguardian.com/science/2017/oct/18/its-able-to-create-knowledge-itself-google-unveils-ai-learns-all-on-its-own|accessdate=7 May 2018|work=the Guardian|date=18 October 2017|language=en}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=The AI revolution in science|url=http://www.sciencemag.org/news/2017/07/ai-revolution-science|accessdate=7 May 2018|work=Science {{!}} AAAS|date=5 July 2017|language=en}}&amp;lt;/ref&amp;gt; Researcher [[Andrew Ng]] has suggested, as a &amp;quot;highly imperfect rule of thumb&amp;quot;, that &amp;quot;almost anything a typical human can do with less than one second of mental thought, we can probably now or in the near future automate using AI.&amp;quot;&amp;lt;ref&amp;gt;{{cite news|title=Will your job still exist in 10 years when the robots arrive?|url=http://www.scmp.com/tech/innovation/article/2098164/robots-are-coming-here-are-some-jobs-wont-exist-10-years|accessdate=7 May 2018|work=[[South China Morning Post]]|date=2017|language=en}}&amp;lt;/ref&amp;gt; [[Moravec's paradox]] suggests that AI lags humans at many tasks that the human brain has specifically evolved to perform well.&amp;lt;ref name=&amp;quot;The Economist&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
AI, like electricity or the steam engine, is a general purpose technology. There is no consensus on how to characterize which tasks AI tends to excel at. While projects such as AlphaZero have succeeded in generating their own knowledge from scratch, many other machine learning projects require large training datasets. Researcher Andrew Ng has suggested, as a &amp;quot;highly imperfect rule of thumb&amp;quot;, that &amp;quot;almost anything a typical human can do with less than one second of mental thought, we can probably now or in the near future automate using AI.&amp;quot; Moravec's paradox suggests that AI lags humans at many tasks that the human brain has specifically evolved to perform well.&lt;br /&gt;
&lt;br /&gt;
AI和电或蒸汽机一样，是一种通用技术。AI 擅长什么样的任务，这个问题尚未达成共识&amp;lt;ref&amp;gt;{{cite news|last1=Brynjolfsson|first1=Erik|last2=Mitchell|first2=Tom|title=What can machine learning do? Workforce implications|url=http://science.sciencemag.org/content/358/6370/1530|accessdate=7 May 2018|work=Science|date=22 December 2017|pages=1530–1534|language=en|doi=10.1126/science.aap8062|bibcode=2017Sci...358.1530B}}&amp;lt;/ref&amp;gt;。虽然像 AlphaZero 这样的项目已经能做到从零开始产生知识，但是许多其他的机器学习项目仍需要大量的训练数据集&amp;lt;ref&amp;gt;{{cite news|last1=Sample|first1=Ian|title='It's able to create knowledge itself': Google unveils AI that learns on its own|url=https://www.theguardian.com/science/2017/oct/18/its-able-to-create-knowledge-itself-google-unveils-ai-learns-all-on-its-own|accessdate=7 May 2018|work=the Guardian|date=18 October 2017|language=en}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=The AI revolution in science|url=http://www.sciencemag.org/news/2017/07/ai-revolution-science|accessdate=7 May 2018|work=Science {{!}} AAAS|date=5 July 2017|language=en}}&amp;lt;/ref&amp;gt;。研究人员吴恩达认为，作为一个“极不完美的经验法则”，“几乎任何普通人只需要不到一秒钟的思考就能做到的事情，我们现在或者在不久的将来都可以使用AI做到。”莫拉维克悖论表明，AI在执行许多人类大脑专门进化出来的、能够很好完成的任务时表现不如人类。&amp;lt;ref&amp;gt;{{cite news|title=Will your job still exist in 10 years when the robots arrive?|url=http://www.scmp.com/tech/innovation/article/2098164/robots-are-coming-here-are-some-jobs-wont-exist-10-years|accessdate=7 May 2018|work=[[South China Morning Post]]|date=2017|language=en}}&amp;lt;/ref&amp;gt; [[Moravec's paradox]] suggests that AI lags humans at many tasks that the human brain has specifically evolved to perform well.&amp;lt;ref name=&amp;quot;The Economist&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Games provide a well-publicized benchmark for assessing rates of progress. [[AlphaGo]] around 2016 brought the era of classical board-game benchmarks to a close. Games of imperfect knowledge provide new challenges to AI in the area of [[game theory]].&amp;lt;ref&amp;gt;{{cite news|last1=Borowiec|first1=Tracey Lien, Steven|title=AlphaGo beats human Go champ in milestone for artificial intelligence|url=https://www.latimes.com/world/asia/la-fg-korea-alphago-20160312-story.html|accessdate=7 May 2018|work=latimes.com|date=2016}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|last1=Brown|first1=Noam|last2=Sandholm|first2=Tuomas|title=Superhuman AI for heads-up no-limit poker: Libratus beats top professionals|url=http://science.sciencemag.org/content/359/6374/418|accessdate=7 May 2018|work=Science|date=26 January 2018|pages=418–424|language=en|doi=10.1126/science.aao1733}}&amp;lt;/ref&amp;gt; [[Esports|E-sports]] such as [[StarCraft]] continue to provide additional public benchmarks.&amp;lt;ref&amp;gt;{{cite journal|last1=Ontanon|first1=Santiago|last2=Synnaeve|first2=Gabriel|last3=Uriarte|first3=Alberto|last4=Richoux|first4=Florian|last5=Churchill|first5=David|last6=Preuss|first6=Mike|title=A Survey of Real-Time Strategy Game AI Research and Competition in StarCraft|journal=IEEE Transactions on Computational Intelligence and AI in Games|date=December 2013|volume=5|issue=4|pages=293–311|doi=10.1109/TCIAIG.2013.2286295|citeseerx=10.1.1.406.2524}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|title=Facebook Quietly Enters StarCraft War for AI Bots, and Loses|url=https://www.wired.com/story/facebook-quietly-enters-starcraft-war-for-ai-bots-and-loses/|accessdate=7 May 2018|work=WIRED|date=2017}}&amp;lt;/ref&amp;gt; There are many competitions and prizes, such as the [[ImageNet|Imagenet Challenge]], to promote research in artificial intelligence. The most common areas of competition include general machine intelligence, conversational behavior, data-mining, [[autonomous car|robotic cars]], and robot soccer as well as conventional games.&amp;lt;ref&amp;gt;{{Cite web|url=http://image-net.org/challenges/LSVRC/2017/|title=ILSVRC2017|website=image-net.org|language=en|access-date=2018-11-06}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Games provide a well-publicized benchmark for assessing rates of progress. AlphaGo around 2016 brought the era of classical board-game benchmarks to a close. Games of imperfect knowledge provide new challenges to AI in the area of game theory. E-sports such as StarCraft continue to provide additional public benchmarks. There are many competitions and prizes, such as the Imagenet Challenge, to promote research in artificial intelligence. The most common areas of competition include general machine intelligence, conversational behavior, data-mining, robotic cars, and robot soccer as well as conventional games.&lt;br /&gt;
&lt;br /&gt;
游戏是评估进步率用的一个广泛认可的基准。2016年前后，AlphaGo 为传统棋类基准的时代的拉下终幕。不过，不完全知识的游戏给AI在博弈论领域提出了新的挑战。星际争霸等电子竞技现在仍然是一项的公众基准。现在出现了设立了有许多如 Imagenet 挑战赛的比赛和奖项以促进AI研究。最常见的比赛内容包括通用机器智能、对话行为、数据挖掘、机器人汽车、机器人足球以及传统游戏。 &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;imitation game&amp;quot; (an interpretation of the 1950 [[Turing test]] that assesses whether a computer can imitate a human) is nowadays considered too exploitable to be a meaningful benchmark.&amp;lt;ref&amp;gt;{{cite journal|last1=Schoenick|first1=Carissa|last2=Clark|first2=Peter|last3=Tafjord|first3=Oyvind|last4=Turney|first4=Peter|last5=Etzioni|first5=Oren|title=Moving beyond the Turing Test with the Allen AI Science Challenge|journal=Communications of the ACM|date=23 August 2017|volume=60|issue=9|pages=60–64|doi=10.1145/3122814|arxiv=1604.04315}}&amp;lt;/ref&amp;gt; A derivative of the Turing test is the Completely Automated Public Turing test to tell Computers and Humans Apart ([[CAPTCHA]]). As the name implies, this helps to determine that a user is an actual person and not a computer posing as a human. In contrast to the standard Turing test, CAPTCHA is administered by a machine and targeted to a human as opposed to being administered by a human and targeted to a machine. A computer asks a user to complete a simple test then generates a grade for that test. Computers are unable to solve the problem, so correct solutions are deemed to be the result of a person taking the test. A common type of CAPTCHA is the test that requires the typing of distorted letters, numbers or symbols that appear in an image undecipherable by a computer.{{sfn|O'Brien|Marakas|2011}}&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;imitation game&amp;quot; (an interpretation of the 1950 Turing test that assesses whether a computer can imitate a human) is nowadays considered too exploitable to be a meaningful benchmark. A derivative of the Turing test is the Completely Automated Public Turing test to tell Computers and Humans Apart (CAPTCHA). As the name implies, this helps to determine that a user is an actual person and not a computer posing as a human. In contrast to the standard Turing test, CAPTCHA is administered by a machine and targeted to a human as opposed to being administered by a human and targeted to a machine. A computer asks a user to complete a simple test then generates a grade for that test. Computers are unable to solve the problem, so correct solutions are deemed to be the result of a person taking the test. A common type of CAPTCHA is the test that requires the typing of distorted letters, numbers or symbols that appear in an image undecipherable by a computer.&lt;br /&gt;
&lt;br /&gt;
“模仿游戏”(对1950年图灵测试的一种解释，用来评估计算机是否可以模仿人类)如今被认为过于灵活，所以不能成为有一项意义的基准。图灵测试衍生出了'''&amp;lt;font color=#ff8000&amp;gt;验证码 Completely Automated Public Turing test to tell Computers and Humans Apart,CAPTCHA&amp;lt;/font&amp;gt;'''(即全自动区分计算机和人类的图灵测试)，顾名思义，这有助于确定用户是一个真实的人，而不是一台伪装成人的计算机。与标准的图灵测试不同，CAPTCHA 是由机器控制，面向人测试，而不是由人控制的，面向机器测试的。计算机要求用户完成一个简单的测试，然后给测试评出一个等级。计算机无法解决这个问题，所以一般认为只有人参加测试才能得出正确答案。验证码的一个常见类型是要求输入一幅计算机无法破译的图中扭曲的字母，数字或符号测试。 &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Proposed &amp;quot;universal intelligence&amp;quot; tests aim to compare how well machines, humans, and even non-human animals perform on problem sets that are generic as possible. At an extreme, the test suite can contain every possible problem, weighted by [[Kolmogorov complexity]]; unfortunately, these problem sets tend to be dominated by impoverished pattern-matching exercises where a tuned AI can easily exceed human performance levels.&amp;lt;ref name=&amp;quot;Mathematical definitions of intelligence&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Hernández-Orallo|first1=José|last2=Dowe|first2=David L.|last3=Hernández-Lloreda|first3=M.Victoria|title=Universal psychometrics: Measuring cognitive abilities in the machine kingdom|journal=Cognitive Systems Research|date=March 2014|volume=27|pages=50–74|doi=10.1016/j.cogsys.2013.06.001|hdl=10251/50244|hdl-access=free}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Proposed &amp;quot;universal intelligence&amp;quot; tests aim to compare how well machines, humans, and even non-human animals perform on problem sets that are generic as possible. At an extreme, the test suite can contain every possible problem, weighted by Kolmogorov complexity; unfortunately, these problem sets tend to be dominated by impoverished pattern-matching exercises where a tuned AI can easily exceed human performance levels.&lt;br /&gt;
&lt;br /&gt;
“通用智能”测试旨在比较机器、人类甚至非人类动物在尽可能通用的问题集上的表现。在极端情况下，测试集可以包含所有可能出现的问题，再通过柯尔莫哥洛夫复杂度赋予权重；可是这些问题集里大多数问题都是不怎么难的模式匹配练习，在这些练习中，优化过的AI可以轻易地超过人类。&amp;lt;ref name=&amp;quot;Mathematical definitions of intelligence&amp;quot;/&amp;gt;&amp;lt;ref&amp;gt;{{cite journal|last1=Hernández-Orallo|first1=José|last2=Dowe|first2=David L.|last3=Hernández-Lloreda|first3=M.Victoria|title=Universal psychometrics: Measuring cognitive abilities in the machine kingdom|journal=Cognitive Systems Research|date=March 2014|volume=27|pages=50–74|doi=10.1016/j.cogsys.2013.06.001|hdl=10251/50244|hdl-access=free}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== 应用 Applications{{anchor|Goals}} ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Automated online assistant.png|thumb|An [[automated online assistant]] providing customer service on a web page – one of many very primitive applications of artificial intelligence]AI的初级应用之一：提供客户服务的网页自动化助理] ]&lt;br /&gt;
&lt;br /&gt;
An [[automated online assistant providing customer service on a web page – one of many very primitive applications of artificial intelligence]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Applications of artificial intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
AI is relevant to any intellectual task.{{sfn|Russell|Norvig|2009|p=1}} Modern artificial intelligence techniques are pervasive&amp;lt;ref name=&amp;quot;:1&amp;quot;&amp;gt;{{Cite book|last=|first=|url=https://ec.europa.eu/info/sites/info/files/commission-white-paper-artificial-intelligence-feb2020_en.pdf|title=White Paper: On Artificial Intelligence - A European approach to excellence and trust|publisher=European Commission|year=2020|isbn=|location=Brussels|pages=1}}&amp;lt;/ref&amp;gt; and are too numerous to list here. Frequently, when a technique reaches mainstream use, it is no longer considered artificial intelligence; this phenomenon is described as the [[AI effect]].{{sfn|''CNN''|2006}}&lt;br /&gt;
&lt;br /&gt;
AI is relevant to any intellectual task. Modern artificial intelligence techniques are pervasive and are too numerous to list here. Frequently, when a technique reaches mainstream use, it is no longer considered artificial intelligence; this phenomenon is described as the AI effect.&lt;br /&gt;
&lt;br /&gt;
AI与任何智力任务都息息相关。现代AI技术无处不在，数量众多，无法在此列举。通常，当一种技术变成主流应用时，它就不再被认为是AI; 这种现象被称为AI效应。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
High-profile examples of AI include autonomous vehicles (such as [[Unmanned aerial vehicle|drones]] and [[self-driving cars]]), medical diagnosis, creating art (such as poetry), proving mathematical theorems, playing games (such as Chess or Go), search engines (such as [[Google search]]), online assistants (such as [[Siri]]), image recognition in photographs, spam filtering, predicting flight delays,&amp;lt;ref&amp;gt;[https://ishti.org/2018/11/19/using-artificial-intelligence-to-predict-flight-delays/ Using AI to predict flight delays], Ishti.org.&amp;lt;/ref&amp;gt; prediction of judicial decisions,&amp;lt;ref name=&amp;quot;ecthr2016&amp;quot;&amp;gt;{{cite journal |author1=N. Aletras |author2=D. Tsarapatsanis |author3=D. Preotiuc-Pietro |author4=V. Lampos |title=Predicting judicial decisions of the European Court of Human Rights: a Natural Language Processing perspective |journal=PeerJ Computer Science |volume=2 |pages=e93 |year=2016 |df=dmy-all |doi=10.7717/peerj-cs.93 |doi-access=free }}&amp;lt;/ref&amp;gt; targeting online advertisements, {{sfn|Russell|Norvig|2009|p=1}}&amp;lt;ref&amp;gt;{{cite news|title=The Economist Explains: Why firms are piling into artificial intelligence|url=https://www.economist.com/blogs/economist-explains/2016/04/economist-explains|accessdate=19 May 2016|work=[[The Economist]]|date=31 March 2016|url-status=live|archiveurl=https://web.archive.org/web/20160508010311/http://www.economist.com/blogs/economist-explains/2016/04/economist-explains|archivedate=8 May 2016|df=dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite news|url=https://www.nytimes.com/2016/02/29/technology/the-promise-of-artificial-intelligence-unfolds-in-small-steps.html|title=The Promise of Artificial Intelligence Unfolds in Small Steps|last=Lohr|first=Steve|work=[[The New York Times]]|date=28 February 2016|accessdate=29 February 2016|url-status=live|archiveurl=https://web.archive.org/web/20160229171843/http://www.nytimes.com/2016/02/29/technology/the-promise-of-artificial-intelligence-unfolds-in-small-steps.html|archivedate=29 February 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; and [[energy storage]]&amp;lt;ref&amp;gt;{{Cite web|url=https://www.cnbc.com/2019/06/14/the-business-using-ai-to-change-how-we-think-about-energy-storage.html|title=A Californian business is using A.I. to change the way we think about energy storage|last=Frangoul|first=Anmar|date=2019-06-14|website=CNBC|language=en|access-date=2019-11-05}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
High-profile examples of AI include autonomous vehicles (such as drones and self-driving cars), medical diagnosis, creating art (such as poetry), proving mathematical theorems, playing games (such as Chess or Go), search engines (such as Google search), online assistants (such as Siri), image recognition in photographs, spam filtering, predicting flight delays, prediction of judicial decisions, targeting online advertisements,  and energy storage&lt;br /&gt;
&lt;br /&gt;
大众常见的AI包括自动驾驶(如无人机和自动驾驶汽车)、医疗诊断、艺术创作(如诗歌)、证明数学定理、玩游戏(如国际象棋或围棋)、搜索引擎(如谷歌搜索)、在线助手(如 Siri)、图像识别、垃圾邮件过滤、航班延误预测、司法判决预测、投放在线广告和能源储存。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
With social media sites overtaking TV as a source for news for young people and news organizations increasingly reliant on social media platforms for generating distribution,&amp;lt;ref&amp;gt;{{cite web|url=https://www.bbc.co.uk/news/uk-36528256|title=Social media 'outstrips TV' as news source for young people|date=15 June 2016|author=Wakefield, Jane|work=BBC News|url-status=live|archiveurl=https://web.archive.org/web/20160624000744/http://www.bbc.co.uk/news/uk-36528256|archivedate=24 June 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; major publishers now use artificial intelligence (AI) technology to post stories more effectively and generate higher volumes of traffic.&amp;lt;ref&amp;gt;{{cite web|url=https://www.bbc.co.uk/news/business-36837824|title=So you think you chose to read this article?|date=22 July 2016|author=Smith, Mark|work=BBC News|url-status=live|archiveurl=https://web.archive.org/web/20160725205007/http://www.bbc.co.uk/news/business-36837824|archivedate=25 July 2016|df=dmy-all}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
With social media sites overtaking TV as a source for news for young people and news organizations increasingly reliant on social media platforms for generating distribution, major publishers now use artificial intelligence (AI) technology to post stories more effectively and generate higher volumes of traffic.&lt;br /&gt;
&lt;br /&gt;
随着社交媒体网站取代电视成为年轻人获取新闻的来源，以及新闻机构越来越依赖社交媒体平台来发布新闻，大型出版商现在使用AI技术发布新闻，这样做效率更高且能带来更多的流量。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
AI can also produce [[Deepfake]]s, a content-altering technology. ZDNet reports, &amp;quot;It presents something that did not actually occur,&amp;quot; Though 88% of Americans believe Deepfakes can cause more harm than good, only 47% of them believe they can be targeted. The boom of election year also opens public discourse to threats of videos of falsified politician media.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.zdnet.com/article/half-of-americans-do-not-believe-deepfake-news-could-target-them-online/|title=Half of Americans do not believe deepfake news could target them online|last=Brown|first=Eileen|website=ZDNet|language=en|access-date=2019-12-03}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
AI can also produce Deepfakes, a content-altering technology. ZDNet reports, &amp;quot;It presents something that did not actually occur,&amp;quot; Though 88% of Americans believe Deepfakes can cause more harm than good, only 47% of them believe they can be targeted. The boom of election year also opens public discourse to threats of videos of falsified politician media.&lt;br /&gt;
&lt;br /&gt;
AI还可以用来换脸 ，这是一种改变内容的技术。至顶网报道说，“它展示出一些并没有真正发生的事情。”尽管88% 的美国人认为换脸弊大于利，但只有47%的人认为自己会成为换脸对象。选举年的盛况也让公众开始讨论起虚假政治视频的害处。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===医疗 Healthcare ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Artificial intelligence in healthcare}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Laproscopic Surgery Robot.jpg|thumb| A patient-side surgical arm of [[Da Vinci Surgical System]]]]AI in healthcare is often used for classification, whether to automate initial evaluation of a CT scan or EKG or to identify high-risk patients for population health. The breadth of applications is rapidly increasing.在医疗保健中， AI通常被用于分类，它既可以自动对 CT 扫描或心电图EKG进行初步评估，又可以在人口健康调查中识别高风险患者。AI的应用范围正在迅速扩大。&lt;br /&gt;
&lt;br /&gt;
 A patient-side surgical arm of [[Da Vinci Surgical System]]AI in healthcare is often used for classification, whether to automate initial evaluation of a CT scan or EKG or to identify high-risk patients for population health. The breadth of applications is rapidly increasing.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
As an example, AI is being applied to the high-cost problem of dosage issues—where findings suggested that AI could save $16 billion. In 2016, a groundbreaking study in California found that a mathematical formula developed with the help of AI correctly determined the accurate dose of immunosuppressant drugs to give to organ patients.&amp;lt;ref&amp;gt;{{Cite news|url=https://hbr.org/2018/05/10-promising-ai-applications-in-health-care|title=10 Promising AI Applications in Health Care|date=2018-05-10|work=Harvard Business Review|access-date=2018-08-28|archive-url=https://web.archive.org/web/20181215015645/https://hbr.org/2018/05/10-promising-ai-applications-in-health-care|archive-date=15 December 2018|url-status=dead}}&amp;lt;/ref&amp;gt; [[File:X-ray of a hand with automatic bone age calculation.jpg|thumb|[[Projectional radiography|X-ray]] of a hand, with automatic calculation of [[bone age]] by computer software，一只手的X光射线图，自动计算了骨龄]]&lt;br /&gt;
&lt;br /&gt;
As an example, AI is being applied to the high-cost problem of dosage issues—where findings suggested that AI could save $16 billion. In 2016, a groundbreaking study in California found that a mathematical formula developed with the help of AI correctly determined the accurate dose of immunosuppressant drugs to give to organ patients. X-ray of a hand, with automatic calculation of bone age by computer software]]&lt;br /&gt;
&lt;br /&gt;
例如研究结果表明，AI在高成本的剂量问题上可以节省160亿美元。2016年，加利福尼亚州的一项开创性研究发现，在AI的辅助下得到的一个数学公式给出了器官患者免疫抑制药的准确剂量。&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]） 例如研究结果表明，AI在高成本的剂量问题上可以节省160亿美元。 为省译&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Artificial intelligence is assisting doctors. According to Bloomberg Technology, Microsoft has developed AI to help doctors find the right treatments for cancer.&amp;lt;ref&amp;gt;{{cite news | author=Dina Bass | title=Microsoft Develops AI to Help Cancer Doctors Find the Right Treatments | url=https://www.bloomberg.com/news/articles/2016-09-20/microsoft-develops-ai-to-help-cancer-doctors-find-the-right-treatments | date=20 September 2016 | publisher=Bloomberg | url-status=live | archiveurl=https://web.archive.org/web/20170511103625/https://www.bloomberg.com/news/articles/2016-09-20/microsoft-develops-ai-to-help-cancer-doctors-find-the-right-treatments | archivedate=11 May 2017 | df=dmy-all | newspaper=Bloomberg.com }}&amp;lt;/ref&amp;gt; There is a great amount of research and drugs developed relating to cancer. In detail, there are more than 800 medicines and vaccines to treat cancer. This negatively affects the doctors, because there are too many options to choose from, making it more difficult to choose the right drugs for the patients. Microsoft is working on a project to develop a machine called &amp;quot;Hanover&amp;quot;{{citation needed|date=July 2019}}. Its goal is to memorize all the papers necessary to cancer and help predict which combinations of drugs will be most effective for each patient. One project that is being worked on at the moment is fighting [[acute myeloid leukemia|myeloid leukemia]], a fatal cancer where the treatment has not improved in decades. Another study was reported to have found that artificial intelligence was as good as trained doctors in identifying skin cancers.&amp;lt;ref&amp;gt;{{Cite news|url=https://www.bbc.co.uk/news/health-38717928|title=Artificial intelligence 'as good as cancer doctors'|last=Gallagher|first=James|date=26 January 2017|work=BBC News|language=en-GB|access-date=26 January 2017|url-status=live|archiveurl=https://web.archive.org/web/20170126133849/http://www.bbc.co.uk/news/health-38717928|archivedate=26 January 2017|df=dmy-all}}&amp;lt;/ref&amp;gt; Another study is using artificial intelligence to try to monitor multiple high-risk patients, and this is done by asking each patient numerous questions based on data acquired from live doctor to patient interactions.&amp;lt;ref&amp;gt;{{Citation|title=Remote monitoring of high-risk patients using artificial intelligence|date=18 Oct 1994|url=https://www.google.com/patents/US5357427|editor-last=Langen|editor2-last=Katz|editor3-last=Dempsey|editor-first=Pauline A.|editor2-first=Jeffrey S.|editor3-first=Gayle|issue=US5357427 A|accessdate=27 February 2017|url-status=live|archiveurl=https://web.archive.org/web/20170228090520/https://www.google.com/patents/US5357427|archivedate=28 February 2017|df=dmy-all}}&amp;lt;/ref&amp;gt; One study was done with transfer learning, the machine performed a diagnosis similarly to a well-trained ophthalmologist, and could generate a decision within 30 seconds on whether or not the patient should be referred for treatment, with more than 95% accuracy.&amp;lt;ref&amp;gt;{{Cite journal|url=https://www.cell.com/action/captchaChallenge?redirectUri=%2Fcell%2Fpdf%2FS0092-8674%2818%2930154-5.pdf|title=Identifying Medical Diagnoses and Treatable Diseases by Image-Based Deep Learning|last=Kermany|first=D|last2=Goldbaum|first2=M|journal=Cell|access-date=2018-12-18|last3=Zhang|first3=Kang|volume=172|issue=5|pages=1122–1131.e9|pmid=29474911|year=2018|doi=10.1016/j.cell.2018.02.010}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Artificial intelligence is assisting doctors. According to Bloomberg Technology, Microsoft has developed AI to help doctors find the right treatments for cancer. There is a great amount of research and drugs developed relating to cancer. In detail, there are more than 800 medicines and vaccines to treat cancer. This negatively affects the doctors, because there are too many options to choose from, making it more difficult to choose the right drugs for the patients. Microsoft is working on a project to develop a machine called &amp;quot;Hanover&amp;quot;. Its goal is to memorize all the papers necessary to cancer and help predict which combinations of drugs will be most effective for each patient. One project that is being worked on at the moment is fighting myeloid leukemia, a fatal cancer where the treatment has not improved in decades. Another study was reported to have found that artificial intelligence was as good as trained doctors in identifying skin cancers. Another study is using artificial intelligence to try to monitor multiple high-risk patients, and this is done by asking each patient numerous questions based on data acquired from live doctor to patient interactions. One study was done with transfer learning, the machine performed a diagnosis similarly to a well-trained ophthalmologist, and could generate a decision within 30 seconds on whether or not the patient should be referred for treatment, with more than 95% accuracy.&lt;br /&gt;
&lt;br /&gt;
AI还能协助医生。据彭博科技报道，微软已经开发出帮助医生找到正确的癌症治疗方法的AI。如今有大量的研究和药物开发与癌症有关，准确来说有800多种可以治疗癌症的药物和疫苗。这对医生来说并不是一件好事，因为选项太多，使得为病人选择合适的药物变得更难。微软正在开发一种名为“汉诺威”的机器。它的目标是记住所有与癌症有关的论文，并帮助预测哪些药物的组合对病人最有效。目前正在进行的一个项目是抗击髓系白血病，这是一种致命的癌症，几十年来治疗水平一直没有提高。据报道，另一项研究发现，AI在识别皮肤癌方面与训练有素的医生一样优秀。另一项研究是使用AI通过询问每个高风险患者多个问题监测他们，这些问题是基于从医生与患者的互动中获得的数据产生的。其中一项研究是通过转移学习完成的，机器进行的诊断类似于训练有素的眼科医生，可以在30秒内做出是否应该转诊治疗的决定，准确率超过95% 。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
According to [[CNN]], a recent study by surgeons at the Children's National Medical Center in Washington successfully demonstrated surgery with an autonomous robot. The team supervised the robot while it performed soft-tissue surgery, stitching together a pig's bowel during open surgery, and doing so better than a human surgeon, the team claimed.&amp;lt;ref&amp;gt;{{cite news|author=Senthilingam, Meera|title=Are Autonomous Robots Your next Surgeons?|work=CNN|publisher=Cable News Network|date=12 May 2016|accessdate=4 December 2016|url=http://www.cnn.com/2016/05/12/health/robot-surgeon-bowel-operation/|url-status=live|archiveurl=https://web.archive.org/web/20161203154119/http://www.cnn.com/2016/05/12/health/robot-surgeon-bowel-operation|archivedate=3 December 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; IBM has created its own artificial intelligence computer, the [[IBM Watson]], which has beaten human intelligence (at some levels). Watson has struggled to achieve success and adoption in healthcare.&amp;lt;ref&amp;gt;{{Cite web|url=https://spectrum.ieee.org/biomedical/diagnostics/how-ibm-watson-overpromised-and-underdelivered-on-ai-health-care|title=Full Page Reload|website=IEEE Spectrum: Technology, Engineering, and Science News|language=en|access-date=2019-09-03}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
According to CNN, a recent study by surgeons at the Children's National Medical Center in Washington successfully demonstrated surgery with an autonomous robot. The team supervised the robot while it performed soft-tissue surgery, stitching together a pig's bowel during open surgery, and doing so better than a human surgeon, the team claimed. IBM has created its own artificial intelligence computer, the IBM Watson, which has beaten human intelligence (at some levels). Watson has struggled to achieve success and adoption in healthcare.&lt;br /&gt;
&lt;br /&gt;
据 CNN 报道，华盛顿国家儿童医疗中心的外科医生最近的一项研究成功演示了一台自主机器人手术。研究组观看了机器人做软组织手术、在开放手术中缝合猪肠的整个过程，并认为比人类外科医生做得更好。IBM已经创造了自己的AI计算机——IBM 沃森，它在某种程度上已经超越了人类智能。沃森一直在努力实现医疗保健领域的应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===汽车 Automotive ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|driverless cars}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Advancements in AI have contributed to the growth of the automotive industry through the creation and evolution of self-driving vehicles. {{as of|2016}}, there are over 30 companies utilizing AI into the creation of [[self-driving car]]s. A few companies involved with AI include [[Tesla Motors|Tesla]], [[Google]], and [[Apple Inc.|Apple]].&amp;lt;ref&amp;gt;&amp;quot;33 Corporations Working On Autonomous Vehicles&amp;quot;. CB Insights. N.p., 11 August 2016. 12 November 2016.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Advancements in AI have contributed to the growth of the automotive industry through the creation and evolution of self-driving vehicles. , there are over 30 companies utilizing AI into the creation of self-driving cars. A few companies involved with AI include Tesla, Google, and Apple.&lt;br /&gt;
&lt;br /&gt;
在AI领域自动驾驶汽车的创造和发展促进了汽车行业的发展。目前有超过30家公司利用AI开发自动驾驶汽车，包括特斯拉、谷歌和苹果等 。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Many components contribute to the functioning of self-driving cars. These vehicles incorporate systems such as braking, lane changing, collision prevention, navigation and mapping. Together, these systems, as well as high-performance computers, are integrated into one complex vehicle.&amp;lt;ref&amp;gt;West, Darrell M. &amp;quot;Moving forward: Self-driving vehicles in China, Europe, Japan, Korea, and the United States&amp;quot;. Center for Technology Innovation at Brookings. N.p., September 2016. 12 November 2016.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Many components contribute to the functioning of self-driving cars. These vehicles incorporate systems such as braking, lane changing, collision prevention, navigation and mapping. Together, these systems, as well as high-performance computers, are integrated into one complex vehicle.&lt;br /&gt;
&lt;br /&gt;
自动驾驶汽车的功能的实现需要很多组件。这些车辆集成了诸如刹车、换车道、防撞、导航和测绘等系统。这些系统以及高性能计算机被装配到一辆复杂的车中。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Recent developments in autonomous automobiles have made the innovation of self-driving trucks possible, though they are still in the testing phase. The UK government has passed legislation to begin testing of self-driving truck platoons in 2018.&amp;lt;ref&amp;gt;{{cite journal|last1=Burgess|first1=Matt|title=The UK is about to Start Testing Self-Driving Truck Platoons|url=https://www.wired.co.uk/article/uk-trial-self-driving-trucks-platoons-roads|journal=Wired UK|accessdate=20 September 2017|url-status=live|archiveurl=https://web.archive.org/web/20170922055917/http://www.wired.co.uk/article/uk-trial-self-driving-trucks-platoons-roads|archivedate=22 September 2017|df=dmy-all|date=2017-08-24}}&amp;lt;/ref&amp;gt; Self-driving truck platoons are a fleet of self-driving trucks following the lead of one non-self-driving truck, so the truck platoons aren't entirely autonomous yet. Meanwhile, the Daimler, a German automobile corporation, is testing the Freightliner Inspiration which is a semi-autonomous truck that will only be used on the highway.&amp;lt;ref&amp;gt;{{cite journal|last1=Davies|first1=Alex|title=World's First Self-Driving Semi-Truck Hits the Road|url=https://www.wired.com/2015/05/worlds-first-self-driving-semi-truck-hits-road/|journal=WIRED|accessdate=20 September 2017|url-status=live|archiveurl=https://web.archive.org/web/20171028222802/https://www.wired.com/2015/05/worlds-first-self-driving-semi-truck-hits-road/|archivedate=28 October 2017|df=dmy-all|date=2015-05-05}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Recent developments in autonomous automobiles have made the innovation of self-driving trucks possible, though they are still in the testing phase. The UK government has passed legislation to begin testing of self-driving truck platoons in 2018. Self-driving truck platoons are a fleet of self-driving trucks following the lead of one non-self-driving truck, so the truck platoons aren't entirely autonomous yet. Meanwhile, the Daimler, a German automobile corporation, is testing the Freightliner Inspiration which is a semi-autonomous truck that will only be used on the highway.&lt;br /&gt;
&lt;br /&gt;
自动驾驶汽车的最新发展使自动驾驶卡车的创新成为可能，尽管它们仍处于测试阶段。英国政府已通过立法，将于2018年开始测试自动驾驶卡车列队行驶。自动驾驶卡车列队是指一排自动驾驶卡车跟随一辆非自动驾驶卡车，所以卡车排还不是完全自动的。与此同时，德国汽车公司戴姆勒正在测试Freightliner Inspiration，这是一种只在高速公路上行驶的半自动卡车。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
One main factor that influences the ability for a driver-less automobile to function is mapping. In general, the vehicle would be pre-programmed with a map of the area being driven. This map would include data on the approximations of street light and curb heights in order for the vehicle to be aware of its surroundings. However, Google has been working on an algorithm with the purpose of eliminating the need for pre-programmed maps and instead, creating a device that would be able to adjust to a variety of new surroundings.&amp;lt;ref&amp;gt;McFarland, Matt. &amp;quot;Google's artificial intelligence breakthrough may have a huge impact on self-driving cars and much more&amp;quot;. ''The Washington Post'' 25 February 2015. Infotrac Newsstand. 24 October 2016&amp;lt;/ref&amp;gt; Some self-driving cars are not equipped with steering wheels or brake pedals, so there has also been research focused on creating an algorithm that is capable of maintaining a safe environment for the passengers in the vehicle through awareness of speed and driving conditions.&amp;lt;ref&amp;gt;&amp;quot;Programming safety into self-driving cars&amp;quot;. National Science Foundation. N.p., 2 February 2015. 24 October 2016.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
One main factor that influences the ability for a driver-less automobile to function is mapping. In general, the vehicle would be pre-programmed with a map of the area being driven. This map would include data on the approximations of street light and curb heights in order for the vehicle to be aware of its surroundings. However, Google has been working on an algorithm with the purpose of eliminating the need for pre-programmed maps and instead, creating a device that would be able to adjust to a variety of new surroundings. Some self-driving cars are not equipped with steering wheels or brake pedals, so there has also been research focused on creating an algorithm that is capable of maintaining a safe environment for the passengers in the vehicle through awareness of speed and driving conditions.&lt;br /&gt;
&lt;br /&gt;
影响无人驾驶汽车性能的一个主要因素是地图。一般来说，车辆将预先编程行驶区域的地图。这张地图将包括街灯和路缘高度的近似数据，让车辆能够感知周围环境。然而谷歌一直在研究一种不需要预编程地图的算法，创造一种能够适应各种新环境的设备。一些自动驾驶汽车没有配备方向盘或刹车踏板，因此也有研究致力于创建感知速度和驾驶条件的算法，为车内乘客提供一个安全的环境。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Another factor that is influencing the ability of a driver-less automobile is the safety of the passenger. To make a driver-less automobile, engineers must program it to handle high-risk situations. These situations could include a head-on collision with pedestrians. The car's main goal should be to make a decision that would avoid hitting the pedestrians and saving the passengers in the car. But there is a possibility the car would need to make a decision that would put someone in danger. In other words, the car would need to decide to save the pedestrians or the passengers.&amp;lt;ref&amp;gt;ArXiv, E. T. (26 October 2015). Why Self-Driving Cars Must Be Programmed to Kill. Retrieved 17 November 2017, from https://www.technologyreview.com/s/542626/why-self-driving-cars-must-be-programmed-to-kill/{{Dead link|date=October 2019 |bot=InternetArchiveBot |fix-attempted=yes }}&amp;lt;/ref&amp;gt; The programming of the car in these situations is crucial to a successful driver-less automobile.&lt;br /&gt;
&lt;br /&gt;
Another factor that is influencing the ability of a driver-less automobile is the safety of the passenger. To make a driver-less automobile, engineers must program it to handle high-risk situations. These situations could include a head-on collision with pedestrians. The car's main goal should be to make a decision that would avoid hitting the pedestrians and saving the passengers in the car. But there is a possibility the car would need to make a decision that would put someone in danger. In other words, the car would need to decide to save the pedestrians or the passengers. The programming of the car in these situations is crucial to a successful driver-less automobile.&lt;br /&gt;
&lt;br /&gt;
衡量无人驾驶汽车能力的另一个因素是乘客的安全。工程师们必须对无人驾驶汽车进行编程，使其能够处理比如与行人正面相撞的高风险的情况。这辆车的主要目标应该是做出一个避免撞到行人，保护车内的乘客的决定。但是有时汽车有可能也会将某人置于危险之中。也就是，汽车需要决定是拯救行人还是乘客。汽车在这些情况下的编程对于一辆成功的无人驾驶汽车是至关重要的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===金融和经济 Finance and economics ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Financial institution]]s have long used [[artificial neural network]] systems to detect charges or claims outside of the norm, flagging these for human investigation. The use of AI in [[banking]] can be traced back to 1987 when [[Security Pacific National Bank]] in US set-up a Fraud Prevention Task force to counter the unauthorized use of debit cards.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.latimes.com/archives/la-xpm-1990-01-17-fi-233-story.html|title=Impact of Artificial Intelligence on Banking|last=Christy|first=Charles A.|website=latimes.com|access-date=2019-09-10|date=17 January 1990}}&amp;lt;/ref&amp;gt; Programs like Kasisto and Moneystream are using AI in financial services.&lt;br /&gt;
&lt;br /&gt;
Financial institutions have long used artificial neural network systems to detect charges or claims outside of the norm, flagging these for human investigation. The use of AI in banking can be traced back to 1987 when Security Pacific National Bank in US set-up a Fraud Prevention Task force to counter the unauthorized use of debit cards. Programs like Kasisto and Moneystream are using AI in financial services.&lt;br /&gt;
&lt;br /&gt;
长期以来，金融机构一直使用人工神经网络系统来检测超出常规的费用或索赔，并将其标记起来等待人工调查。AI在银行业的应用可以追溯到1987年，当时美国国家安全太平洋银行成立了一个防防诈特别小组，以打击未经授权使用借记卡的行为。金融服务领域的如Kasisto 和 Moneystream等程序正在使用AI技术。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Banks use artificial intelligence systems today to organize operations, maintain book-keeping, invest in stocks, and manage properties. AI can react to changes overnight or when business is not taking place.&amp;lt;ref name=&amp;quot;Eleanor&amp;quot;&amp;gt;{{cite web|url=https://www.icas.com/ca-today-news/how-accountancy-and-finance-are-using-artificial-intelligence|title=Accounting, automation and AI|first=Eleanor|last=O'Neill|website=icas.com|language=English|date=31 July 2016|access-date=18 November 2016|url-status=live|archiveurl=https://web.archive.org/web/20161118165901/https://www.icas.com/ca-today-news/how-accountancy-and-finance-are-using-artificial-intelligence|archivedate=18 November 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; In August 2001, robots beat humans in a simulated [[stock trader|financial trading]] competition.&amp;lt;ref&amp;gt;[http://news.bbc.co.uk/2/hi/business/1481339.stm Robots Beat Humans in Trading Battle.] {{webarchive|url=https://web.archive.org/web/20090909001249/http://news.bbc.co.uk/2/hi/business/1481339.stm |date=9 September 2009 }} BBC.com (8 August 2001)&amp;lt;/ref&amp;gt; AI has also reduced fraud and financial crimes by [[Statistical software|monitoring]] [[behavioral pattern]]s of users for any abnormal changes or anomalies.&amp;lt;ref name=&amp;quot;fsroundtable.org&amp;quot;&amp;gt;{{Cite news|url=http://fsroundtable.org/cto-corner-artificial-intelligence-use-in-financial-services/|title=CTO Corner: Artificial Intelligence Use in Financial Services – Financial Services Roundtable|date=2 April 2015|work=Financial Services Roundtable|language=en-US|access-date=18 November 2016|url-status=dead|archiveurl=https://web.archive.org/web/20161118165842/http://fsroundtable.org/cto-corner-artificial-intelligence-use-in-financial-services/|archivedate=18 November 2016|df=dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=https://www.sas.com/en_ae/solutions/ai.html|title=Artificial Intelligence Solutions, AI Solutions|website=www.sas.com}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=https://www.latimes.com/business/la-fi-palantir-sales-ipo-20190107-story.html|title=Palantir once mocked the idea of salespeople. Now it's hiring them|last=Chapman|first=Lizette|website=latimes.com|access-date=2019-02-28|date=7 January 2019}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Banks use artificial intelligence systems today to organize operations, maintain book-keeping, invest in stocks, and manage properties. AI can react to changes overnight or when business is not taking place. In August 2001, robots beat humans in a simulated financial trading competition. AI has also reduced fraud and financial crimes by monitoring behavioral patterns of users for any abnormal changes or anomalies.&lt;br /&gt;
&lt;br /&gt;
如今，银行使用AI系统来组织业务、记账、投资股票和管理房地产。AI可以对突然的变化和没有业务的情况做出反应。2001年8月，机器人在一场模拟金融交易竞赛中击败了人类。AI还通过监测用户的行为模式发现异常变化或异常现象，减少了欺诈和金融犯罪。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
AI is increasingly being used by [[Corporate finance|corporations]]. [[Jack Ma]] has controversially predicted that AI [[CEO]]'s are 30 years away.&amp;lt;ref&amp;gt;{{Cite web|url=https://money.cnn.com/2017/04/24/technology/alibaba-jack-ma-30-years-pain-robot-ceo/index.html|title=Jack Ma: In 30 years, the best CEO could be a robot|first=Sherisse|last=Pham|date=24 April 2017|website=CNNMoney}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=https://venturebeat.com/2016/10/22/cant-find-a-perfect-ceo-create-an-ai-one-yourself/|title=Can't find a perfect CEO? Create an AI one yourself|date=22 October 2016}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
AI is increasingly being used by corporations. Jack Ma has controversially predicted that AI CEO's are 30 years away.&lt;br /&gt;
&lt;br /&gt;
人AI正越来越多地被企业所使用。马云发表过一个有争议的预测：距离AI当上CEO还有30年的时间。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The use of AI machines in the market in applications such as online trading and decision making has changed major economic theories.&amp;lt;ref&amp;gt;{{cite book |last1=Marwala |first1= Tshilidzi| last2=Hurwitz |first2= Evan |title=Artificial Intelligence and Economic Theory: Skynet in the Market |year=2017 |publisher=[[Springer Science+Business Media|Springer]] |location=London |isbn=978-3-319-66104-9}}&amp;lt;/ref&amp;gt; For example, AI-based buying and selling platforms have changed the law of [[supply and demand]] in that it is now possible to easily estimate individualized demand and supply curves and thus individualized pricing. Furthermore, AI machines reduce [[information asymmetry]] in the market and thus making markets more efficient while reducing the volume of trades{{citation needed|date=July 2019}}. Furthermore, AI in the markets limits the consequences of behavior in the markets again making markets more efficient{{citation needed|date=July 2019}}. Other theories where AI has had impact include in [[rational choice]], [[rational expectations]], [[game theory]], [[Lewis turning point]], [[portfolio optimization]] and [[counterfactual thinking]]{{citation needed|date=July 2019}}.. In August 2019, the [[American Institute of Certified Public Accountants|AICPA]] introduced AI training course for accounting professionals.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.mileseducation.com/finance/artificial_intelligence|title=Miles Education {{!}} Future Of Finance {{!}} Blockchain Fundamentals for F&amp;amp;A Professionals Certificate|website=www.mileseducation.com|access-date=2019-09-26|archive-url=https://web.archive.org/web/20190926102133/https://www.mileseducation.com/finance/artificial_intelligence|archive-date=26 September 2019|url-status=dead}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The use of AI machines in the market in applications such as online trading and decision making has changed major economic theories. For example, AI-based buying and selling platforms have changed the law of supply and demand in that it is now possible to easily estimate individualized demand and supply curves and thus individualized pricing. Furthermore, AI machines reduce information asymmetry in the market and thus making markets more efficient while reducing the volume of trades. Furthermore, AI in the markets limits the consequences of behavior in the markets again making markets more efficient. Other theories where AI has had impact include in rational choice, rational expectations, game theory, Lewis turning point, portfolio optimization and counterfactual thinking.. In August 2019, the AICPA introduced AI training course for accounting professionals.&lt;br /&gt;
&lt;br /&gt;
AI机器在市场上如在线交易和决策的应用改变了主流经济理论。例如，基于AI的买卖平台改变了供求规律，因为现在可以通过AI很容易地估计个性化需求和供给曲线，从而实现个性化的定价。此外，AI减少了交易的信息不对称，在使市场更有效率的同时也减少了交易量。此外，AI限定了市场行为的后果，再次提高了交易效率。AI影响的其他理论包括理性选择、理性预期、博弈论、刘易斯转折点、投资组合优化和反事实思维。2019年8月，AICPA 为会计专业人员开设了 AI 培训课程。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===网络安全 Cybersecurity ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{More citations needed section|date=January 2020}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The [[cybersecurity]] arena faces significant challenges in the form of large-scale hacking attacks of different types that harm organizations of all kinds and create billions of dollars in business damage. Artificial intelligence and Natural Language Processing (NLP) has begun to be used by security companies - for example, SIEM (Security Information and Event Management) solutions.  The more advanced of these solutions use AI and NLP to automatically sort the data in networks into high risk and low-risk information.  This enables security teams to focus on the attacks that have the potential to do real harm to the organization, and not become victims of attacks such as [[Denial-of-service attack|Denial of Service (DoS)]], [[Malware]] and others.&lt;br /&gt;
&lt;br /&gt;
The cybersecurity arena faces significant challenges in the form of large-scale hacking attacks of different types that harm organizations of all kinds and create billions of dollars in business damage. Artificial intelligence and Natural Language Processing (NLP) has begun to be used by security companies - for example, SIEM (Security Information and Event Management) solutions.  The more advanced of these solutions use AI and NLP to automatically sort the data in networks into high risk and low-risk information.  This enables security teams to focus on the attacks that have the potential to do real harm to the organization, and not become victims of attacks such as Denial of Service (DoS), Malware and others.&lt;br /&gt;
&lt;br /&gt;
网络安全领域面临着各种大规模黑客攻击的重大挑战，这些攻击损害到了很多组织，造成了数十亿美元的商业损失。网络安全公司已经开始使用AI和自然语言处理(NLP) ，例如，SIEM (Security Information and Event Management,安全信息和事件管理)解决方案。更高级的解决方案使用AI和自然语言处理将网络中的数据划分为高风险和低风险两类信息。这使得安全团队能够专注于对付那些有可能对组织造成真正伤害的攻击，不沦为分布式拒绝服务攻击、恶意软件和其他攻击的受害者。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===政府 Government ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Artificial intelligence in government}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Artificial intelligence in government consists of applications and regulation. Artificial intelligence paired with [[facial recognition system]]s may be used for [[mass surveillance]]. This is already the case in some parts of China.&amp;lt;ref&amp;gt;{{Cite news|url=https://www.nytimes.com/2019/05/22/world/asia/china-surveillance-xinjiang.html|title=How China Uses High-Tech Surveillance to Subdue Minorities|first1=Chris|last1=Buckley|first2=Paul|last2=Mozur|date=22 May 2019|work=The New York Times}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite web|url=http://social.techcrunch.com/2019/05/03/china-smart-city-exposed/|title=Security lapse exposed a Chinese smart city surveillance system}}&amp;lt;/ref&amp;gt; An artificial intelligence has also competed in the Tama City [[AI mayor|mayoral elections]] in 2018.&lt;br /&gt;
&lt;br /&gt;
Artificial intelligence in government consists of applications and regulation. Artificial intelligence paired with facial recognition systems may be used for mass surveillance. This is already the case in some parts of China. An artificial intelligence has also competed in the Tama City mayoral elections in 2018.&lt;br /&gt;
&lt;br /&gt;
政府AI包括应用和管理。AI与人脸识别系统相结合可用于大规模监控。在中国的一些地区已经开始使用这种技术。一个AI还参与了2018年关都地区市长选举的角逐。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In 2019, the tech city of Bengaluru in India is set to deploy AI managed traffic signal systems across the 387 traffic signals in the city. This system will involve use of cameras to ascertain traffic density and accordingly calculate the time needed to clear the traffic volume which will determine the signal duration for vehicular traffic across streets.&amp;lt;ref&amp;gt;{{Cite web|url=https://nextbigwhat.com/ai-traffic-signals-to-be-installed-in-bengaluru-soon/|title=AI traffic signals to be installed in Bengaluru soon|date=2019-09-24|website=NextBigWhat|language=en-US|access-date=2019-10-01}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In 2019, the tech city of Bengaluru in India is set to deploy AI managed traffic signal systems across the 387 traffic signals in the city. This system will involve use of cameras to ascertain traffic density and accordingly calculate the time needed to clear the traffic volume which will determine the signal duration for vehicular traffic across streets.&lt;br /&gt;
&lt;br /&gt;
2019年，印度硅谷班加罗尔将在该市的387个交通信号灯上部署AI控制的交通信号系统。这个系统将使用摄像头来确定交通密度，并据此计算清除交通量所需的时间，决定街道上的车辆交通灯的持续时间。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===与法律有关的专业 Law-related professions ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Legal informatics#Artificial intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Artificial intelligence (AI) is becoming a mainstay component of law-related professions. In some circumstances, this analytics-crunching technology is using algorithms and machine learning to do work that was previously done by entry-level lawyers.{{Citation needed|date=December 2019}}&lt;br /&gt;
&lt;br /&gt;
Artificial intelligence (AI) is becoming a mainstay component of law-related professions. In some circumstances, this analytics-crunching technology is using algorithms and machine learning to do work that was previously done by entry-level lawyers.&lt;br /&gt;
&lt;br /&gt;
AI正在成为法律相关专业的主要组成部分。有时人们通过AI分析处理技术使用算法和机器学习来完成以前由初级律师完成的工作。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In [[Electronic discovery|Electronic Discovery (eDiscovery)]], the industry has been focused on machine learning (predictive coding/technology assisted review), which is a subset of AI. To add to the soup of applications, Natural Language Processing (NLP) and Automated Speech Recognition (ASR) are also in vogue in the industry.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.ft.com/content/fef40df0-4a6a-11e9-bde6-79eaea5acb64|title=AI learns to read Korean, so you don't have to|last=Croft|first=Jane|date=2019-05-02|website=Financial Times|language=en-GB|access-date=2019-12-19}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In Electronic Discovery (eDiscovery), the industry has been focused on machine learning (predictive coding/technology assisted review), which is a subset of AI. To add to the soup of applications, Natural Language Processing (NLP) and Automated Speech Recognition (ASR) are also in vogue in the industry.&lt;br /&gt;
&lt;br /&gt;
电子资料档案查询(eDiscovery)产业一直侧重机器学习(预测编码 / 技术辅助评审) ，这是AI的一个子领域。自然语言处理(NLP)和自动语音识别(ASR)也正在这个行业流行起来。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===电子游戏 Video games ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Artificial intelligence (video games)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In video games, artificial intelligence is routinely used to generate dynamic purposeful behavior in [[non-player character]]s (NPCs). In addition, well-understood AI techniques are routinely used for [[pathfinding]]. Some researchers consider NPC AI in games to be a &amp;quot;solved problem&amp;quot; for most production tasks. Games with more atypical AI include the AI director of ''[[Left 4 Dead]]'' (2008) and the neuroevolutionary training of platoons in ''[[Supreme Commander 2]]'' (2010).&amp;lt;ref&amp;gt;{{cite news|url=https://www.economist.com/news/science-and-technology/21721890-games-help-them-understand-reality-why-ai-researchers-video-games|title=Why AI researchers like video games|website=The Economist|url-status=live|archiveurl=https://web.archive.org/web/20171005051028/https://www.economist.com/news/science-and-technology/21721890-games-help-them-understand-reality-why-ai-researchers-video-games|archivedate=5 October 2017|df=dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Yannakakis, G. N. (2012, May). Game AI revisited. In Proceedings of the 9th conference on Computing Frontiers (pp. 285–292). ACM.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In video games, artificial intelligence is routinely used to generate dynamic purposeful behavior in non-player characters (NPCs). In addition, well-understood AI techniques are routinely used for pathfinding. Some researchers consider NPC AI in games to be a &amp;quot;solved problem&amp;quot; for most production tasks. Games with more atypical AI include the AI director of Left 4 Dead (2008) and the neuroevolutionary training of platoons in Supreme Commander 2 (2010).&lt;br /&gt;
&lt;br /&gt;
在视频游戏中，AI通常被用来让非玩家角色( non-player characters，NPCs)中做出动态的目的性行为。此外，还常用简单的AI技术寻路。一些研究人员认为，对于大多数生产任务来说，游戏中的 NPC AI 是一个“解决了的问题”。含更多非典型 AI 的游戏有《求生之路》（Left 4 Dead,2008)中的 AI 导演和《最高指挥官2》(Supreme Commander 2,2010)中的 '''&amp;lt;font color=#32cd32&amp;gt;对排神经进化训练&amp;lt;/font&amp;gt;'''。&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]） neuroevolutionary training of platoons 未找到标准翻译&lt;br /&gt;
&lt;br /&gt;
===军事 Military ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Further|Artificial intelligence arms race|Lethal autonomous weapon|Unmanned combat aerial vehicle}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The United States and other nations are developing AI applications for a range of military functions.&amp;lt;ref name=&amp;quot;:2&amp;quot;&amp;gt;{{Cite book|last=Congressional Research Service|first=|url=https://fas.org/sgp/crs/natsec/R45178.pdf|title=Artificial Intelligence and National Security|publisher=Congressional Research Service|year=2019|isbn=|location=Washington, DC|pages=}}[[Template:PD-notice|PD-notice]]&amp;lt;/ref&amp;gt; The main military applications of Artificial Intelligence and Machine Learning are to enhance C2, Communications, Sensors, Integration and Interoperability.&amp;lt;ref name=&amp;quot;AI&amp;quot;&amp;gt;{{cite web|title=Artificial intelligence as the basis of future control networks.|url=https://www.researchgate.net/publication/334573170|last=Slyusar|first=Vadym|date=2019|work=Preprint}}&amp;lt;/ref&amp;gt; AI research is underway in the fields of intelligence collection and analysis, logistics, cyber operations, information operations, command and control, and in a variety of semiautonomous and autonomous vehicles.&amp;lt;ref name=&amp;quot;:2&amp;quot; /&amp;gt; Artificial Intelligence technologies enable coordination of sensors and effectors, threat detection and identification, marking of enemy positions, target acquisition, coordination and deconfliction of distributed Join Fires between networked combat vehicles and tanks also inside Manned and Unmanned Teams (MUM-T).&amp;lt;ref name=AI /&amp;gt; AI has been incorporated into military operations in Iraq and Syria.&amp;lt;ref name=&amp;quot;:2&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The United States and other nations are developing AI applications for a range of military functions. The main military applications of Artificial Intelligence and Machine Learning are to enhance C2, Communications, Sensors, Integration and Interoperability. AI research is underway in the fields of intelligence collection and analysis, logistics, cyber operations, information operations, command and control, and in a variety of semiautonomous and autonomous vehicles. Artificial Intelligence technologies enable coordination of sensors and effectors, threat detection and identification, marking of enemy positions, target acquisition, coordination and deconfliction of distributed Join Fires between networked combat vehicles and tanks also inside Manned and Unmanned Teams (MUM-T). AI has been incorporated into military operations in Iraq and Syria.&lt;br /&gt;
&lt;br /&gt;
美国和其他国家正在为一系列军事功能开发AI应用程序。AI和机器学习的主要军事应用是增强 C2、通信、传感器、集成和互操作性。情报收集和分析、后勤、网络操作、信息操作、指挥和控制以及各种半自动和自动车辆等领域正在进行AI研究。AI技术能够协调传感器和效应器、探测威胁和识别、标记敌人阵地、目标获取、协调和消除有人和无人小组(MUM-T)、联网作战车辆和坦克内部的分布式联合火力。伊拉克和叙利亚的军事行动采用了AI。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Worldwide annual military spending on robotics rose from US$5.1 billion in 2010 to US$7.5 billion in 2015.&amp;lt;ref&amp;gt;{{cite news|title=Getting to grips with military robotics|url=https://www.economist.com/news/special-report/21735478-autonomous-robots-and-swarms-will-change-nature-warfare-getting-grips|accessdate=7 February 2018|work=The Economist|date=25 January 2018|language=en}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite web|title=Autonomous Systems: Infographic|url=https://www.siemens.com/innovation/en/home/pictures-of-the-future/digitalization-and-software/autonomous-systems-infographic.html|website=siemens.com|accessdate=7 February 2018|language=en}}&amp;lt;/ref&amp;gt; Military drones capable of autonomous action are widely considered a useful asset.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.cnas.org/publications/reports/understanding-chinas-ai-strategy|title=Understanding China's AI Strategy|last=Allen|first=Gregory|date=February 6, 2019|website=www.cnas.org/publications/reports/understanding-chinas-ai-strategy|publisher=Center for a New American Security|archive-url=https://web.archive.org/web/20190317004017/https://www.cnas.org/publications/reports/understanding-chinas-ai-strategy|archive-date=March 17, 2019|url-status=|access-date=March 17, 2019}}&amp;lt;/ref&amp;gt; Many artificial intelligence researchers seek to distance themselves from military applications of AI.&amp;lt;ref&amp;gt;{{cite news|last1=Metz|first1=Cade|title=Pentagon Wants Silicon Valley's Help on A.I.|url=https://www.nytimes.com/2018/03/15/technology/military-artificial-intelligence.html|accessdate=19 March 2018|work=The New York Times|date=15 March 2018}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Worldwide annual military spending on robotics rose from US$5.1 billion in 2010 to US$7.5 billion in 2015. Military drones capable of autonomous action are widely considered a useful asset. Many artificial intelligence researchers seek to distance themselves from military applications of AI.&lt;br /&gt;
&lt;br /&gt;
全球每年在机器人方面的军费开支从2010年的51亿美元增加到2015年的75亿美元。人们都认为具有自主行动能力的军用无人机是价值的。许多AI研究人员试图远离AI的军事应用。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===服务 Hospitality ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In the hospitality industry, Artificial Intelligence based solutions are used to reduce staff load and increase efficiency&amp;lt;ref&amp;gt;{{cite web|title=Role of AI in travel and Hospitality Industry|url=https://www.infosys.com/industries/travel-hospitality/documents/ai-travel-hospitality.pdf|accessdate=14 January 2020|work=Infosys|date=2018}}&amp;lt;/ref&amp;gt; by cutting repetitive tasks frequency, trends analysis, guest interaction, and customer needs prediction.&amp;lt;ref&amp;gt;{{cite web|title=Advanced analytics in hospitality|url=https://www.mckinsey.com/business-functions/mckinsey-digital/our-insights/advanced-analytics-in-hospitality|accessdate=14 January 2020|work=McKinsey &amp;amp; Company|date=2017}}&amp;lt;/ref&amp;gt; Hotel services backed by Artificial Intelligence are represented in the form of a chatbot,&amp;lt;ref&amp;gt;{{cite web|title=Current applications of Artificial Intelligence in tourism and hospitality|url=https://www.researchgate.net/publication/333242550|accessdate=14 January 2020|work=Sinteza|date=2019}}&amp;lt;/ref&amp;gt; application, virtual voice assistant and service robots.&lt;br /&gt;
&lt;br /&gt;
In the hospitality industry, Artificial Intelligence based solutions are used to reduce staff load and increase efficiency by cutting repetitive tasks frequency, trends analysis, guest interaction, and customer needs prediction. Hotel services backed by Artificial Intelligence are represented in the form of a chatbot, application, virtual voice assistant and service robots.&lt;br /&gt;
&lt;br /&gt;
在服务业，基于AI的解决方案通过减少重复性任务的频率、分析趋势、与客户活动和预测客户需求来减少员工负担和提高效率。使用AI的酒店服务以聊天机器人、应用程序、虚拟语音助手和服务机器人的形式呈现。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===审计 Audit ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
For financial statements audit, AI makes continuous audit possible. AI tools could analyze many sets of different information immediately. The potential benefit would be the overall audit risk will be reduced, the level of assurance will be increased and the time duration of audit will be reduced.&amp;lt;ref&amp;gt;{{cite journal|last1=Chang|first1=Hsihui|last2=Kao|first2=Yi-Ching|last3=Mashruwala|first3=Raj|last4=Sorensen|first4=Susan M.|title=Technical Inefficiency, Allocative Inefficiency, and Audit Pricing|journal=Journal of Accounting, Auditing &amp;amp; Finance|volume=33|issue=4|date=10 April 2017|pages=580–600|doi=10.1177/0148558X17696760}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For financial statements audit, AI makes continuous audit possible. AI tools could analyze many sets of different information immediately. The potential benefit would be the overall audit risk will be reduced, the level of assurance will be increased and the time duration of audit will be reduced.&lt;br /&gt;
&lt;br /&gt;
在财务报表审计这方面，AI 可以做到持续审计。AI工具可以迅速分析多组不同的信息。可能的好处是减少了总体审计风险，提高审计水平，缩短审计时间。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===广告 Advertising ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
It is possible to use AI to predict or generalize the behavior of customers from their [[digital footprints]] in order to target them with personalized promotions or build customer personas automatically.&amp;lt;ref name=&amp;quot;Matz et al 2017&amp;quot;&amp;gt;Matz, S. C., et al. &amp;quot;Psychological targeting as an effective approach to digital mass persuasion.&amp;quot; Proceedings of the National Academy of Sciences (2017): 201710966.&amp;lt;/ref&amp;gt; A documented case reports that online gambling companies were using AI to improve customer targeting.&amp;lt;ref&amp;gt;{{cite web |last1=Busby |first1=Mattha |title=Revealed: how bookies use AI to keep gamblers hooked |url=https://www.theguardian.com/technology/2018/apr/30/bookies-using-ai-to-keep-gamblers-hooked-insiders-say |website=the Guardian |language=en |date=30 April 2018}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
It is possible to use AI to predict or generalize the behavior of customers from their digital footprints in order to target them with personalized promotions or build customer personas automatically. A documented case reports that online gambling companies were using AI to improve customer targeting.&lt;br /&gt;
&lt;br /&gt;
AI通过客户的数字足迹预测或归纳客户的行为，投放定制广告或者自动构建顾客角色。有记录报告称，线上赌博公司正在使用AI来改善客户定位功能。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Moreover, the application of [[Personality computing]] AI models can help reducing the cost of advertising campaigns by adding psychological targeting to more traditional sociodemographic or behavioral targeting.&amp;lt;ref name=&amp;quot;Celli et al. 2017&amp;quot;&amp;gt;Celli, Fabio, Pietro Zani Massani, and Bruno Lepri. &amp;quot;Profilio: Psychometric Profiling to Boost Social Media Advertising.&amp;quot; Proceedings of the 2017 ACM on Multimedia Conference. ACM, 2017  [https://www.researchgate.net/publication/320542489_Profilio_Psychometric_Profiling_to_Boost_Social_Media_Advertising]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Moreover, the application of Personality computing AI models can help reducing the cost of advertising campaigns by adding psychological targeting to more traditional sociodemographic or behavioral targeting.&lt;br /&gt;
&lt;br /&gt;
此外，个性计算AI模型通过结合心理定位和传统的社会人口学或行为定位方法，帮助降低广告投放的成本。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===艺术 Art ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Further|Computer art}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Artificial Intelligence has inspired numerous creative applications including its usage to produce visual art. The exhibition &amp;quot;Thinking Machines: Art and Design in the Computer Age, 1959–1989&amp;quot; at MoMA&amp;lt;ref name=&amp;quot;moma&amp;quot;&amp;gt;{{Cite web|url=https://www.moma.org/calendar/exhibitions/3863|title=Thinking Machines: Art and Design in the Computer Age, 1959–1989|website=The Museum of Modern Art|language=en|access-date=2019-07-23}}&amp;lt;/ref&amp;gt; provides a good overview of the historical applications of AI for art, architecture, and design. Recent exhibitions showcasing the usage of AI to produce art include the Google-sponsored benefit and auction at the Gray Area Foundation in San Francisco, where artists experimented with the [[DeepDream]] algorithm&amp;lt;ref name = wp1&amp;gt;[https://www.washingtonpost.com/news/innovations/wp/2016/03/10/googles-psychedelic-paint-brush-raises-the-oldest-question-in-art/ Retrieved July 29]&amp;lt;/ref&amp;gt; and the exhibition &amp;quot;Unhuman: Art in the Age of AI,&amp;quot; which took place in Los Angeles and Frankfurt in the fall of 2017.&amp;lt;ref name = sf&amp;gt;{{cite web|url=https://www.statefestival.org/program/2017/unhuman-art-in-the-age-of-ai |title=Unhuman: Art in the Age of AI – State Festival |publisher=Statefestival.org |date= |accessdate=2018-09-13}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;artsy&amp;quot;&amp;gt;{{Cite web|url=https://www.artsy.net/article/artsy-editorial-hard-painting-made-computer-human|title=It's Getting Hard to Tell If a Painting Was Made by a Computer or a Human|last=Chun|first=Rene|date=2017-09-21|website=Artsy|language=en|access-date=2019-07-23}}&amp;lt;/ref&amp;gt; In the spring of 2018, the Association of Computing Machinery dedicated a special magazine issue to the subject of computers and art highlighting the role of machine learning in the arts.&amp;lt;ref name = acm&amp;gt;[https://dl.acm.org/citation.cfm?id=3204480.3186697 Retrieved July 29]&amp;lt;/ref&amp;gt; The Austrian [[Ars Electronica]] and [[Museum of Applied Arts, Vienna]] opened exhibitions on AI in 2019.&amp;lt;ref name=&amp;quot;Ars Electronica Exhibition ''Understanding AI''&amp;quot;&amp;gt;{{Cite web|url=https://ars.electronica.art/center/en/exhibitions/ai/ |access-date=September 2019}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Museum of Applied Arts Exhibition ''Uncanny Values''&amp;quot;&amp;gt;{{Cite web|url=https://www.mak.at/en/program/exhibitions/uncanny_values |access-date=October 2019|title=MAK Wien - MAK Museum Wien}}&amp;lt;/ref&amp;gt; The Ars Electronica's 2019 festival &amp;quot;Out of the box&amp;quot; extensively thematized the role of arts for a sustainable societal transformation with AI.&amp;lt;ref name=&amp;quot;European Platform for Digital Humanism&amp;quot;&amp;gt;{{Cite web|url=https://ars.electronica.art/outofthebox/en/digital-humanism-conf/ |access-date=September 2019}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Artificial Intelligence has inspired numerous creative applications including its usage to produce visual art. The exhibition &amp;quot;Thinking Machines: Art and Design in the Computer Age, 1959–1989&amp;quot; at MoMA provides a good overview of the historical applications of AI for art, architecture, and design. Recent exhibitions showcasing the usage of AI to produce art include the Google-sponsored benefit and auction at the Gray Area Foundation in San Francisco, where artists experimented with the DeepDream algorithm and the exhibition &amp;quot;Unhuman: Art in the Age of AI,&amp;quot; which took place in Los Angeles and Frankfurt in the fall of 2017. In the spring of 2018, the Association of Computing Machinery dedicated a special magazine issue to the subject of computers and art highlighting the role of machine learning in the arts. The Austrian Ars Electronica and Museum of Applied Arts, Vienna opened exhibitions on AI in 2019. The Ars Electronica's 2019 festival &amp;quot;Out of the box&amp;quot; extensively thematized the role of arts for a sustainable societal transformation with AI.&lt;br /&gt;
&lt;br /&gt;
AI催生了许多在如视觉艺术等领域的创造性应用。在纽约现代艺术博物馆举办的“思考机器: 计算机时代的艺术与设计，1959-1989”展览概述了艺术、建筑和设计的历史中AI的应用。最近的展览展示了AI在艺术创作中的应用，包括谷歌赞助的旧金山灰色地带基金会(Gray Area Foundation)的慈善拍卖会，艺术家们在拍卖会中尝试了 DeepDream 算法，以及2017年秋天在洛杉矶和法兰克福举办的“非人类: AI时代的艺术”展览。2018年春天，计算机协会发行了一期主题为计算机和艺术的特刊，着重展示了机器学习在艺术中的作用。奥地利电子艺术博物馆和维也纳应用艺术博物馆于2019年开设了AI展览。2019年的电子艺术节 “Out of the box”将AI艺术在可持续社会转型中的作用变成了一个主题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== 哲学和伦理学 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Philosophy of artificial intelligence|Ethics of artificial intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
There are three philosophical questions related to AI:&lt;br /&gt;
&lt;br /&gt;
There are three philosophical questions related to AI:&lt;br /&gt;
&lt;br /&gt;
有三个与人工智能相关的哲学问题:&lt;br /&gt;
&lt;br /&gt;
# Is [[artificial general intelligence]] possible? Can a machine solve any problem that a human being can solve using intelligence? Or are there hard limits to what a machine can accomplish?&lt;br /&gt;
# Are intelligent machines dangerous? How can we ensure that machines behave ethically and that they are used ethically?&lt;br /&gt;
# Can a machine have a [[mind]], [[consciousness]] and [[philosophy of mind|mental states]] in exactly the same sense that human beings do? Can a machine be [[Sentience|sentient]], and thus deserve certain rights? Can a machine [[intention]]ally cause harm?&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
# 通用人工智能可能实现吗？机器能解决任何人类使用智能就能解决的问题吗？或者一台机器所能完成的事情是否有严格的界限？&lt;br /&gt;
# 智能机器危险吗？我们怎样才能确保机器的行为和使用机器的过程符合道德规范？&lt;br /&gt;
# 机器能否拥有与人类完全相同的思维、意识和精神状态？一台机器是否能拥有直觉，因此得到某些权利？机器会做出刻意伤害吗？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===人工智能的局限性===&lt;br /&gt;
&lt;br /&gt;
{{Main|Philosophy of AI|Turing test|Physical symbol systems hypothesis|Dreyfus' critique of AI|The Emperor's New Mind|AI effect}}&lt;br /&gt;
&lt;br /&gt;
Can a machine be intelligent? Can it &amp;quot;think&amp;quot;?&lt;br /&gt;
&lt;br /&gt;
Can a machine be intelligent? Can it &amp;quot;think&amp;quot;?&lt;br /&gt;
&lt;br /&gt;
机器是智能的吗？它能“思考”吗？&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
;''[[Computing Machinery and Intelligence|Alan Turing's &amp;quot;polite convention&amp;quot;]]'': We need not decide if a machine can &amp;quot;think&amp;quot;; we need only decide if a machine can act as intelligently as a human being. This approach to the philosophical problems associated with artificial intelligence forms the basis of the [[Turing test]].&amp;lt;ref name=&amp;quot;Turing test&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Alan Turing's &amp;quot;polite convention&amp;quot;: We need not decide if a machine can &amp;quot;think&amp;quot;; we need only decide if a machine can act as intelligently as a human being. This approach to the philosophical problems associated with artificial intelligence forms the basis of the Turing test.&lt;br /&gt;
&lt;br /&gt;
;''阿兰 · 图灵的“礼貌惯例'': 阿兰 · 图灵的'''&amp;lt;font color=#32cd32&amp;gt;“礼貌惯例”&amp;lt;/font&amp;gt;'''  : 我们不需要决定一台机器是否可以“思考”；我们只需要决定一台机器是否可以像人一样聪明地行动。这个对AI相关哲学问题的回应成为了图灵测试的基础。&lt;br /&gt;
&lt;br /&gt;
  --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）polite convention未找到标准翻译&lt;br /&gt;
&lt;br /&gt;
;''The [[Dartmouth Workshop|Dartmouth proposal]]'': &amp;quot;Every aspect of learning or any other feature of intelligence can be so precisely described that a machine can be made to simulate it.&amp;quot; This conjecture was printed in the proposal for the Dartmouth Conference of 1956.&amp;lt;ref name=&amp;quot;Dartmouth proposal&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The Dartmouth proposal: &amp;quot;Every aspect of learning or any other feature of intelligence can be so precisely described that a machine can be made to simulate it.&amp;quot; This conjecture was printed in the proposal for the Dartmouth Conference of 1956.&lt;br /&gt;
&lt;br /&gt;
;''达特茅斯提案'':达特茅斯会议提出: “可以通过准确地描述学习的每个方面或智能的任何特征，使得一台机器模拟学习和智能。”这个猜想被写在了1956年达特茅斯学院会议的提案中。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
;''[[Physical symbol system|Newell and Simon's physical symbol system hypothesis]]'': &amp;quot;A physical symbol system has the necessary and sufficient means of general intelligent action.&amp;quot; Newell and Simon argue that intelligence consists of formal operations on symbols.&amp;lt;ref name=&amp;quot;Physical symbol system hypothesis&amp;quot;/&amp;gt; [[Hubert Dreyfus]] argued that, on the contrary, human expertise depends on unconscious instinct rather than conscious symbol manipulation and on having a &amp;quot;feel&amp;quot; for the situation rather than explicit symbolic knowledge. (See [[Dreyfus' critique of AI]].)&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Newell and Simon's physical symbol system hypothesis: &amp;quot;A physical symbol system has the necessary and sufficient means of general intelligent action.&amp;quot; Newell and Simon argue that intelligence consists of formal operations on symbols. Hubert Dreyfus argued that, on the contrary, human expertise depends on unconscious instinct rather than conscious symbol manipulation and on having a &amp;quot;feel&amp;quot; for the situation rather than explicit symbolic knowledge. (See Dreyfus' critique of AI.)&lt;br /&gt;
&lt;br /&gt;
;纽厄尔和西蒙的物理符号系统假说: 物理符号系统是通往通用智能行为的充分必要途径。纽厄尔和西蒙认为智能由符号形式的运算组成。&amp;lt;ref name=&amp;quot;Physical symbol system hypothesis&amp;quot;/&amp;gt; 休伯特·德雷福斯则相反地认为，人类的知识依赖于无意识的本能，而不是有意识的符号运算；依赖于对情境的“感觉”，而不是明确的符号知识。(参见德雷福斯对人工智能的批评。)&amp;lt;ref&amp;gt;Dreyfus criticized the [[necessary and sufficient|necessary]] condition of the [[physical symbol system]] hypothesis, which he called the &amp;quot;psychological assumption&amp;quot;: &amp;quot;The mind can be viewed as a device operating on bits of information according to formal rules.&amp;quot; {{Harv|Dreyfus|1992|p=156}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Dreyfus' critique&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
;''Gödelian arguments'': [[Gödel]] himself,&amp;lt;ref name=&amp;quot;Gödel himself&amp;quot;/&amp;gt; [[John Lucas (philosopher)|John Lucas]] (in 1961) and [[Roger Penrose]] (in a more detailed argument from 1989 onwards) made highly technical arguments that human mathematicians can consistently see the truth of their own &amp;quot;Gödel statements&amp;quot; and therefore have computational abilities beyond that of mechanical Turing machines.&amp;lt;ref name=&amp;quot;The mathematical objection&amp;quot;/&amp;gt; However, some people do not agree with the &amp;quot;Gödelian arguments&amp;quot;.&amp;lt;ref&amp;gt;{{cite web|author1=Graham Oppy|title=Gödel's Incompleteness Theorems|url=http://plato.stanford.edu/entries/goedel-incompleteness/#GdeArgAgaMec|website=[[Stanford Encyclopedia of Philosophy]]|accessdate=27 April 2016|date=20 January 2015|quote=These Gödelian anti-mechanist arguments are, however, problematic, and there is wide consensus that they fail.|author1-link=Graham Oppy}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author1=Stuart J. Russell|author2-link=Peter Norvig|author2=Peter Norvig|title=Artificial Intelligence: A Modern Approach|date=2010|publisher=[[Prentice Hall]]|location=Upper Saddle River, NJ|isbn=978-0-13-604259-4|edition=3rd|chapter=26.1.2: Philosophical Foundations/Weak AI: Can Machines Act Intelligently?/The mathematical objection|quote=even if we grant that computers have limitations on what they can prove, there is no evidence that humans are immune from those limitations.|title-link=Artificial Intelligence: A Modern Approach|author1-link=Stuart J. Russell}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Mark Colyvan. An introduction to the philosophy of mathematics. [[Cambridge University Press]], 2012. From 2.2.2, 'Philosophical significance of Gödel's incompleteness results': &amp;quot;The accepted wisdom (with which I concur) is that the Lucas-Penrose arguments fail.&amp;quot;&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
;''哥德尔的论点'':哥德尔本人&amp;lt;ref name=&amp;quot;Gödel himself&amp;quot;/&amp;gt; 、约翰·卢卡斯(在1961年)和罗杰·彭罗斯(在1989年以后的一个更详细的争论中)提出了高度技术性的观点，认为人类数学家可以看到他们自己的“'''&amp;lt;font color=#ff8000&amp;gt;哥德尔不完备定理 Gödel Satements&amp;lt;/font&amp;gt;'''”的真实性，因此计算能力超过机械图灵机&amp;lt;ref name=&amp;quot;The mathematical objection&amp;quot;/&amp;gt;。然而，也有一些人不同意“哥德尔不完备定理”。&amp;lt;ref&amp;gt;{{cite web|author1=Graham Oppy|title=Gödel's Incompleteness Theorems|url=http://plato.stanford.edu/entries/goedel-incompleteness/#GdeArgAgaMec|website=[[Stanford Encyclopedia of Philosophy]]|accessdate=27 April 2016|date=20 January 2015|quote=These Gödelian anti-mechanist arguments are, however, problematic, and there is wide consensus that they fail.|author1-link=Graham Oppy}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|author1=Stuart J. Russell|author2-link=Peter Norvig|author2=Peter Norvig|title=Artificial Intelligence: A Modern Approach|date=2010|publisher=[[Prentice Hall]]|location=Upper Saddle River, NJ|isbn=978-0-13-604259-4|edition=3rd|chapter=26.1.2: Philosophical Foundations/Weak AI: Can Machines Act Intelligently?/The mathematical objection|quote=even if we grant that computers have limitations on what they can prove, there is no evidence that humans are immune from those limitations.|title-link=Artificial Intelligence: A Modern Approach|author1-link=Stuart J. Russell}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Mark Colyvan. An introduction to the philosophy of mathematics. [[Cambridge University Press]], 2012. From 2.2.2, 'Philosophical significance of Gödel's incompleteness results': &amp;quot;The accepted wisdom (with which I concur) is that the Lucas-Penrose arguments fail.&amp;quot;&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
;''The [[artificial brain]] argument'': The brain can be simulated by machines and because brains are intelligent, simulated brains must also be intelligent; thus machines can be intelligent. [[Hans Moravec]], [[Ray Kurzweil]] and others have argued that it is technologically feasible to copy the brain directly into hardware and software and that such a simulation will be essentially identical to the original.&amp;lt;ref name=&amp;quot;Brain simulation&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The artificial brain argument: The brain can be simulated by machines and because brains are intelligent, simulated brains must also be intelligent; thus machines can be intelligent. Hans Moravec, Ray Kurzweil and others have argued that it is technologically feasible to copy the brain directly into hardware and software and that such a simulation will be essentially identical to the original.&lt;br /&gt;
&lt;br /&gt;
;''人工大脑的观点'': 因为大脑可以被机器模拟，且大脑是智能的，模拟的大脑也必须是智能的；因此机器可以是智能的。汉斯·莫拉维克、雷·库兹韦尔和其他人认为，技术层面直接将大脑复制到硬件和软件上是可行的，而且这些拷贝在本质上和原来的大脑是没有区别的。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
;''The [[AI effect]]'': Machines are ''already'' intelligent, but observers have failed to recognize it. When [[Deep Blue (chess computer)|Deep Blue]] beat [[Garry Kasparov]] in chess, the machine was acting intelligently. However, onlookers commonly discount the behavior of an artificial intelligence program by arguing that it is not &amp;quot;real&amp;quot; intelligence after all; thus &amp;quot;real&amp;quot; intelligence is whatever intelligent behavior people can do that machines still cannot. This is known as the AI Effect: &amp;quot;AI is whatever hasn't been done yet.&amp;quot;&amp;lt;!--&amp;lt;ref name=&amp;quot;AI Effect&amp;quot;/&amp;gt;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The AI effect: Machines are already intelligent, but observers have failed to recognize it. When Deep Blue beat Garry Kasparov in chess, the machine was acting intelligently. However, onlookers commonly discount the behavior of an artificial intelligence program by arguing that it is not &amp;quot;real&amp;quot; intelligence after all; thus &amp;quot;real&amp;quot; intelligence is whatever intelligent behavior people can do that machines still cannot. This is known as the AI Effect: &amp;quot;AI is whatever hasn't been done yet.&amp;quot;&amp;lt;!----&amp;gt;&lt;br /&gt;
&lt;br /&gt;
;''AI效应'': 机器本来就是智能的，但是观察者却没有意识到这一点。当深蓝在国际象棋比赛中击败加里 · 卡斯帕罗夫时，机器就在做出智能行为。然而，旁观者通常对AI程序的行为不屑一顾，认为它根本不是“真正的”智能; 因此，“真正的”智能就是人任何类能够做到但机器仍然做不到的智能行为。这就是众所周知的AI效应: “AI就是一切尚未完成的事情&amp;quot;。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===潜在危害===&lt;br /&gt;
&lt;br /&gt;
Widespread use of artificial intelligence could have [[unintended consequences]] that are dangerous or undesirable. Scientists from the [[Future of Life Institute]], among others, described some short-term research goals to see how AI influences the economy, the laws and ethics that are involved with AI and how to minimize AI security risks. In the long-term, the scientists have proposed to continue optimizing function while minimizing possible security risks that come along with new technologies.&amp;lt;ref&amp;gt;Russel, Stuart., Daniel Dewey, and Max Tegmark. Research Priorities for Robust and Beneficial Artificial Intelligence. AI Magazine 36:4 (2015). 8 December 2016.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Widespread use of artificial intelligence could have unintended consequences that are dangerous or undesirable. Scientists from the Future of Life Institute, among others, described some short-term research goals to see how AI influences the economy, the laws and ethics that are involved with AI and how to minimize AI security risks. In the long-term, the scientists have proposed to continue optimizing function while minimizing possible security risks that come along with new technologies.&lt;br /&gt;
&lt;br /&gt;
AI的广泛使用可能会产生危险或导致意外后果。生命未来研究所(Future of Life Institute)等机构的科学家提出了一些短期研究目标，以此了解AI如何影响经济、与AI相关的法律和道德规范，以及如何将AI的安全风险降到最低。从长远来看，科学家们建议继续优化功能，同时最小化新技术带来的可能的安全风险。&amp;lt;ref&amp;gt;Russel, Stuart., Daniel Dewey, and Max Tegmark. Research Priorities for Robust and Beneficial Artificial Intelligence. AI Magazine 36:4 (2015). 8 December 2016.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The potential negative effects of AI and automation were a major issue for [[Andrew Yang]]'s [[Andrew Yang 2020 presidential campaign|2020 presidential campaign]] in the United States.&amp;lt;ref&amp;gt;{{Cite journal|url=https://www.wired.com/story/andrew-yangs-presidential-bid-is-so-very-21st-century/|title=Andrew Yang's Presidential Bid Is So Very 21st Century|journal=Wired|first=Matt|last=Simon|date=1 April 2019|via=www.wired.com}}&amp;lt;/ref&amp;gt; Irakli Beridze, Head of the Centre for Artificial Intelligence and Robotics at UNICRI, United Nations, has expressed that &amp;quot;I think the dangerous applications for AI, from my point of view, would be criminals or large terrorist organizations using it to disrupt large processes or simply do pure harm. [Terrorists could cause harm] via digital warfare, or it could be a combination of robotics, drones, with AI and other things as well that could be really dangerous. And, of course, other risks come from things like job losses. If we have massive numbers of people losing jobs and don't find a solution, it will be extremely dangerous. Things like lethal autonomous weapons systems should be properly governed — otherwise there's massive potential of misuse.&amp;quot;&amp;lt;ref&amp;gt;{{Cite web | url=https://futurism.com/artificial-intelligence-experts-fear/amp |title = Five experts share what scares them the most about AI|date = 5 September 2018}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The potential negative effects of AI and automation were a major issue for Andrew Yang's 2020 presidential campaign in the United States. Irakli Beridze, Head of the Centre for Artificial Intelligence and Robotics at UNICRI, United Nations, has expressed that &amp;quot;I think the dangerous applications for AI, from my point of view, would be criminals or large terrorist organizations using it to disrupt large processes or simply do pure harm. [Terrorists could cause harm] via digital warfare, or it could be a combination of robotics, drones, with AI and other things as well that could be really dangerous. And, of course, other risks come from things like job losses. If we have massive numbers of people losing jobs and don't find a solution, it will be extremely dangerous. Things like lethal autonomous weapons systems should be properly governed — otherwise there's massive potential of misuse.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
AI和自动化潜在的负面影响在安德鲁·杨2020年竞选美国总统的过程中体现了出来。联合国人工智能与机器人中心主任伊拉克利·贝瑞德兹表示: ”我认为AI危害会体现在犯罪分子或大型恐怖组织利用AI破坏大型流程或通过数字战争造成损失，也可能是机器人、无人机、AI以及其他可能非常危险的东西的结合。当然，其还有失业等风险。如果大量的人失去工作，而且没有解决方案，这将是极其危险的。另外，致命的自动化武器系统之类的东西应该得到合适的控制，否则就可能会被大量滥用。”&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
====存在风险====&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Existential risk from artificial general intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Physicist [[Stephen Hawking]], [[Microsoft]] founder [[Bill Gates]], and [[SpaceX]] founder [[Elon Musk]] have expressed concerns about the possibility that AI could evolve to the point that humans could not control it, with Hawking theorizing that this could &amp;quot;[[Global catastrophic risk|spell the end of the human race]]&amp;quot;.&amp;lt;ref&amp;gt;{{cite news|last1=Rawlinson|first1=Kevin|title=Microsoft's Bill Gates insists AI is a threat|url=https://www.bbc.co.uk/news/31047780|work=BBC News|accessdate=30 January 2015|url-status=live|archiveurl=https://web.archive.org/web/20150129183607/http://www.bbc.co.uk/news/31047780|archivedate=29 January 2015|df=dmy-all|date=2015-01-29}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Holley&amp;quot;&amp;gt;{{Cite news|title = Bill Gates on dangers of artificial intelligence: 'I don't understand why some people are not concerned'|url = https://www.washingtonpost.com/news/the-switch/wp/2015/01/28/bill-gates-on-dangers-of-artificial-intelligence-dont-understand-why-some-people-are-not-concerned/|work= The Washington Post|date = 28 January 2015|access-date = 30 October 2015|issn = 0190-8286|first = Peter|last = Holley|url-status=live|archiveurl = https://web.archive.org/web/20151030054330/https://www.washingtonpost.com/news/the-switch/wp/2015/01/28/bill-gates-on-dangers-of-artificial-intelligence-dont-understand-why-some-people-are-not-concerned/|archivedate = 30 October 2015|df = dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite news|title = Elon Musk: artificial intelligence is our biggest existential threat|url = https://www.theguardian.com/technology/2014/oct/27/elon-musk-artificial-intelligence-ai-biggest-existential-threat|work= The Guardian|accessdate = 30 October 2015|first = Samuel|last = Gibbs|url-status=live|archiveurl = https://web.archive.org/web/20151030054330/http://www.theguardian.com/technology/2014/oct/27/elon-musk-artificial-intelligence-ai-biggest-existential-threat|archivedate = 30 October 2015|df = dmy-all|date = 2014-10-27}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Physicist Stephen Hawking, Microsoft founder Bill Gates, and SpaceX founder Elon Musk have expressed concerns about the possibility that AI could evolve to the point that humans could not control it, with Hawking theorizing that this could &amp;quot;spell the end of the human race&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
物理学家斯蒂芬·霍金、微软创始人比尔·盖茨和 SpaceX 公司创始人埃隆·马斯克对AI进化到人类无法控制的程度表示担忧，霍金认为这可能“会导致人类末日”。&amp;lt;ref&amp;gt;{{cite news|last1=Rawlinson|first1=Kevin|title=Microsoft's Bill Gates insists AI is a threat|url=https://www.bbc.co.uk/news/31047780|work=BBC News|accessdate=30 January 2015|url-status=live|archiveurl=https://web.archive.org/web/20150129183607/http://www.bbc.co.uk/news/31047780|archivedate=29 January 2015|df=dmy-all|date=2015-01-29}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Holley&amp;quot;&amp;gt;{{Cite news|title = Bill Gates on dangers of artificial intelligence: 'I don't understand why some people are not concerned'|url = https://www.washingtonpost.com/news/the-switch/wp/2015/01/28/bill-gates-on-dangers-of-artificial-intelligence-dont-understand-why-some-people-are-not-concerned/|work= The Washington Post|date = 28 January 2015|access-date = 30 October 2015|issn = 0190-8286|first = Peter|last = Holley|url-status=live|archiveurl = https://web.archive.org/web/20151030054330/https://www.washingtonpost.com/news/the-switch/wp/2015/01/28/bill-gates-on-dangers-of-artificial-intelligence-dont-understand-why-some-people-are-not-concerned/|archivedate = 30 October 2015|df = dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite news|title = Elon Musk: artificial intelligence is our biggest existential threat|url = https://www.theguardian.com/technology/2014/oct/27/elon-musk-artificial-intelligence-ai-biggest-existential-threat|work= The Guardian|accessdate = 30 October 2015|first = Samuel|last = Gibbs|url-status=live|archiveurl = https://web.archive.org/web/20151030054330/http://www.theguardian.com/technology/2014/oct/27/elon-musk-artificial-intelligence-ai-biggest-existential-threat|archivedate = 30 October 2015|df = dmy-all|date = 2014-10-27}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In his book ''[[Superintelligence: Paths, Dangers, Strategies|Superintelligence]]'', philosopher [[Nick Bostrom]] provides an argument that artificial intelligence will pose a threat to humankind. He argues that sufficiently intelligent AI, if it chooses actions based on achieving some goal, will exhibit [[Instrumental convergence|convergent]] behavior such as acquiring resources or protecting itself from being shut down. If this AI's goals do not fully reflect humanity's—one example is an AI told to compute as many digits of pi as possible—it might harm humanity in order to acquire more resources or prevent itself from being shut down, ultimately to better achieve its goal.  Bostrom also emphasizes the difficulty of fully conveying humanity's values to an advanced AI.  He uses the hypothetical example of giving an AI the goal to make humans smile to illustrate a misguided attempt.  If the AI in that scenario were to become superintelligent, Bostrom argues, it may resort to methods that most humans would find horrifying, such as inserting &amp;quot;electrodes into the facial muscles of humans to cause constant, beaming grins&amp;quot; because that would be an efficient way to achieve its goal of making humans smile.&amp;lt;ref&amp;gt;{{cite web|url=https://www.ted.com/talks/nick_bostrom_what_happens_when_our_computers_get_smarter_than_we_are/transcript|title=What happens when our computers get smarter than we are?|first=Nick|last=Bostrom|publisher=[[TED (conference)]]|date=2015}}&amp;lt;/ref&amp;gt;  In his book ''[[Human Compatible]]'', AI researcher [[Stuart J. Russell]] echoes some of Bostrom's concerns while also proposing [[Human Compatible#Russell's three principles|an approach]] to developing provably beneficial machines focused on uncertainty and deference to humans,&amp;lt;ref name=&amp;quot;HC&amp;quot;&amp;gt;{{cite book |last=Russell |first=Stuart |date=October 8, 2019 |title=Human Compatible: Artificial Intelligence and the Problem of Control |url= |location=United States |publisher=Viking |page= |isbn=978-0-525-55861-3 |author-link=Stuart J. Russell |oclc=1083694322|title-link=Human Compatible }}&amp;lt;/ref&amp;gt;{{rp|173}} possibly involving [[Reinforcement learning#Inverse reinforcement learning|inverse reinforcement learning]].&amp;lt;ref name=&amp;quot;HC&amp;quot;/&amp;gt;{{rp|191–193}}&lt;br /&gt;
&lt;br /&gt;
In his book Superintelligence, philosopher Nick Bostrom provides an argument that artificial intelligence will pose a threat to humankind. He argues that sufficiently intelligent AI, if it chooses actions based on achieving some goal, will exhibit convergent behavior such as acquiring resources or protecting itself from being shut down. If this AI's goals do not fully reflect humanity's—one example is an AI told to compute as many digits of pi as possible—it might harm humanity in order to acquire more resources or prevent itself from being shut down, ultimately to better achieve its goal.  Bostrom also emphasizes the difficulty of fully conveying humanity's values to an advanced AI.  He uses the hypothetical example of giving an AI the goal to make humans smile to illustrate a misguided attempt.  If the AI in that scenario were to become superintelligent, Bostrom argues, it may resort to methods that most humans would find horrifying, such as inserting &amp;quot;electrodes into the facial muscles of humans to cause constant, beaming grins&amp;quot; because that would be an efficient way to achieve its goal of making humans smile.  In his book Human Compatible, AI researcher Stuart J. Russell echoes some of Bostrom's concerns while also proposing an approach to developing provably beneficial machines focused on uncertainty and deference to humans, possibly involving inverse reinforcement learning.&lt;br /&gt;
&lt;br /&gt;
在《超级智能》一书中，哲学家尼克·博斯特罗姆提出了一个AI将对人类构成威胁的论点。他认为，如果足够智能的AI选择有目标地行动，它将表现出收敛的行为，如获取资源或保护自己不被关机。如果这个AI的目标没有人性，比如一个AI被告知要尽可能多地计算圆周率的位数，那么它可能会伤害人类，以便获得更多的资源或者防止自身被关闭，最终更好地实现目标。博斯特罗姆还强调了向高级AI充分传达人类价值观存在的困难。他假设了一个例子来说明一种南辕北辙的尝试: 给AI一个让人类微笑的目标。博斯特罗姆认为，如果这种情况下的AI变得非常聪明，它可能会采用大多数人类都会感到恐怖的方法，比如“在人类面部肌肉中插入电极，使其产生持续的笑容” ，因为这将是实现让人类微笑的目标的有效方法。&amp;lt;ref&amp;gt;{{cite web|url=https://www.ted.com/talks/nick_bostrom_what_happens_when_our_computers_get_smarter_than_we_are/transcript|title=What happens when our computers get smarter than we are?|first=Nick|last=Bostrom|publisher=[[TED (conference)]]|date=2015}}&amp;lt;/ref&amp;gt;AI研究人员斯图亚特.J.罗素在他的《人类相容》一书中回应了博斯特罗姆的一些担忧，同时也提出了一种开发可证明有益的机器可能涉及逆强化学习的方法&amp;lt;ref name=&amp;quot;HC&amp;quot;/&amp;gt;{{rp|191–193}}，这种机器侧重解决不确定性和顺从人类的问题。&amp;lt;ref name=&amp;quot;HC&amp;quot;&amp;gt;{{cite book |last=Russell |first=Stuart |date=October 8, 2019 |title=Human Compatible: Artificial Intelligence and the Problem of Control |url= |location=United States |publisher=Viking |page= |isbn=978-0-525-55861-3 |author-link=Stuart J. Russell |oclc=1083694322|title-link=Human Compatible }}&amp;lt;/ref&amp;gt;{{rp|173}}&lt;br /&gt;
&lt;br /&gt;
Concern over risk from artificial intelligence has led to some high-profile donations and investments. A group of prominent tech titans including [[Peter Thiel]], Amazon Web Services and Musk have committed $1 billion to [[OpenAI]], a nonprofit company aimed at championing responsible AI development.&amp;lt;ref&amp;gt;{{cite web|url=https://www.chicagotribune.com/bluesky/technology/ct-tech-titans-against-terminators-20151214-story.html|title=Tech titans like Elon Musk are spending $1 billion to save you from terminators|first=Washington|last=Post|url-status=live|archiveurl=https://web.archive.org/web/20160607121118/http://www.chicagotribune.com/bluesky/technology/ct-tech-titans-against-terminators-20151214-story.html|archivedate=7 June 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; 人工智能领域内专家们的意见是混杂的，担忧和不担忧超越人类能力的AI的观点都占有很大的分额。&amp;lt;ref&amp;gt;{{cite journal}}&amp;lt;/ref&amp;gt;  Facebook CEO [[Mark Zuckerberg]] believes AI will &amp;quot;unlock a huge amount of positive things,&amp;quot; such as curing disease and increasing the safety of autonomous cars.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.businessinsider.com/mark-zuckerberg-shares-thoughts-elon-musks-ai-2018-5|title=Mark Zuckerberg responds to Elon Musk's paranoia about AI: 'AI is going to... help keep our communities safe.'|last=|first=|date=25 May 2018|website=Business Insider|access-date=2019-05-06}}&amp;lt;/ref&amp;gt; In January 2015, Musk donated $10 million to the [[Future of Life Institute]] to fund research on understanding AI decision making. The goal of the institute is to &amp;quot;grow wisdom with which we manage&amp;quot; the growing power of technology. Musk also funds companies developing artificial intelligence such as [[DeepMind]] and [[Vicarious (company)|Vicarious]] to &amp;quot;just keep an eye on what's going on with artificial intelligence.&amp;lt;ref&amp;gt;{{cite web|title = The mysterious artificial intelligence company Elon Musk invested in is developing game-changing smart computers|url = http://www.techinsider.io/mysterious-artificial-intelligence-company-elon-musk-investment-2015-10|website = Tech Insider|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030165333/http://www.techinsider.io/mysterious-artificial-intelligence-company-elon-musk-investment-2015-10|archivedate = 30 October 2015|df = dmy-all}}&amp;lt;/ref&amp;gt; I think there is potentially a dangerous outcome there.&amp;quot;&amp;lt;ref&amp;gt;{{cite web|title = Musk-Backed Group Probes Risks Behind Artificial Intelligence|url = https://www.bloomberg.com/news/articles/2015-07-01/musk-backed-group-probes-risks-behind-artificial-intelligence|website = Bloomberg.com|accessdate = 30 October 2015|first = Jack|last = Clark|url-status=live|archiveurl = https://web.archive.org/web/20151030202356/http://www.bloomberg.com/news/articles/2015-07-01/musk-backed-group-probes-risks-behind-artificial-intelligence|archivedate = 30 October 2015|df = dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite web|title = Elon Musk Is Donating $10M Of His Own Money To Artificial Intelligence Research|url = http://www.fastcompany.com/3041007/fast-feed/elon-musk-is-donating-10m-of-his-own-money-to-artificial-intelligence-research|website = Fast Company|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030202356/http://www.fastcompany.com/3041007/fast-feed/elon-musk-is-donating-10m-of-his-own-money-to-artificial-intelligence-research|archivedate = 30 October 2015|df = dmy-all|date = 2015-01-15}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
对人工智能潜在风险的担忧引来了一些大额的捐献和投资。一些科技巨头，如彼得·蒂尔、亚马逊云服务、以及马斯克已经把10亿美金给了OpenAI，一个拥护和聚焦于开发可靠的AI的非盈利公司。&amp;lt;ref&amp;gt;{{cite web|url=https://www.chicagotribune.com/bluesky/technology/ct-tech-titans-against-terminators-20151214-story.html|title=Tech titans like Elon Musk are spending $1 billion to save you from terminators|first=Washington|last=Post|url-status=live|archiveurl=https://web.archive.org/web/20160607121118/http://www.chicagotribune.com/bluesky/technology/ct-tech-titans-against-terminators-20151214-story.html|archivedate=7 June 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; 人工智能领域内专家们的观点是混杂的，担忧和不担忧超人类AI的意见都占有很大的份额。其他技术行业的领导者相信AI在目前的形式下是有益的，并将继续帮助人类。甲骨文首席执行官马克·赫德表示，AI“实际上将创造更多的就业机会，而不是减少就业机会” ，因为管理AI系统需要人力&amp;lt;ref&amp;gt;{{Cite web|url=https://searcherp.techtarget.com/news/252460208/Oracle-CEO-Mark-Hurd-sees-no-reason-to-fear-ERP-AI|title=Oracle CEO Mark Hurd sees no reason to fear ERP AI|website=SearchERP|language=en|access-date=2019-05-06}}&amp;lt;/ref&amp;gt; 。Facebook 首席执行官马克·扎克伯格相信AI将“解锁大量正面的东西” ，比如治愈疾病和提高自动驾驶汽车的安全性&amp;lt;ref&amp;gt;{{Cite web|url=https://www.businessinsider.com/mark-zuckerberg-shares-thoughts-elon-musks-ai-2018-5|title=Mark Zuckerberg responds to Elon Musk's paranoia about AI: 'AI is going to... help keep our communities safe.'|last=|first=|date=25 May 2018|website=Business Insider|access-date=2019-05-06}}&amp;lt;/ref&amp;gt;。2015年1月，马斯克向未来生命研究所捐赠了1000万美元，用于研究AI决策。该研究所的目标是“用智能管理”日益增长的技术力量。马斯克还为 DeepMind 和 Vicarious 等开发AI的公司提供资金，以“跟进AI的发展”&amp;lt;ref&amp;gt;{{cite web|title = The mysterious artificial intelligence company Elon Musk invested in is developing game-changing smart computers|url = http://www.techinsider.io/mysterious-artificial-intelligence-company-elon-musk-investment-2015-10|website = Tech Insider|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030165333/http://www.techinsider.io/mysterious-artificial-intelligence-company-elon-musk-investment-2015-10|archivedate = 30 October 2015|df = dmy-all}}&amp;lt;/ref&amp;gt;因为认为这个领域“可能会产生危险的后果”&amp;lt;ref&amp;gt;{{cite web|title = Musk-Backed Group Probes Risks Behind Artificial Intelligence|url = https://www.bloomberg.com/news/articles/2015-07-01/musk-backed-group-probes-risks-behind-artificial-intelligence|website = Bloomberg.com|accessdate = 30 October 2015|first = Jack|last = Clark|url-status=live|archiveurl = https://web.archive.org/web/20151030202356/http://www.bloomberg.com/news/articles/2015-07-01/musk-backed-group-probes-risks-behind-artificial-intelligence|archivedate = 30 October 2015|df = dmy-all}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite web|title = Elon Musk Is Donating $10M Of His Own Money To Artificial Intelligence Research|url = http://www.fastcompany.com/3041007/fast-feed/elon-musk-is-donating-10m-of-his-own-money-to-artificial-intelligence-research|website = Fast Company|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030202356/http://www.fastcompany.com/3041007/fast-feed/elon-musk-is-donating-10m-of-his-own-money-to-artificial-intelligence-research|archivedate = 30 October 2015|df = dmy-all|date = 2015-01-15}}&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
For the danger of uncontrolled advanced AI to be realized, the hypothetical AI would have to overpower or out-think all of humanity, which a minority of experts argue is a possibility far enough in the future to not be worth researching.&amp;lt;ref&amp;gt;{{cite web|title = Is artificial intelligence really an existential threat to humanity?|url = http://thebulletin.org/artificial-intelligence-really-existential-threat-humanity8577|website = Bulletin of the Atomic Scientists|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030054330/http://thebulletin.org/artificial-intelligence-really-existential-threat-humanity8577|archivedate = 30 October 2015|df = dmy-all|date = 2015-08-09}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite web|title = The case against killer robots, from a guy actually working on artificial intelligence|url = http://fusion.net/story/54583/the-case-against-killer-robots-from-a-guy-actually-building-ai/|website = Fusion.net|accessdate = 31 January 2016|url-status=live|archiveurl = https://web.archive.org/web/20160204175716/http://fusion.net/story/54583/the-case-against-killer-robots-from-a-guy-actually-building-ai/|archivedate = 4 February 2016|df = dmy-all}}&amp;lt;/ref&amp;gt; Other counterarguments revolve around humans being either intrinsically or convergently valuable from the perspective of an artificial intelligence.&amp;lt;ref&amp;gt;{{cite web|title = Will artificial intelligence destroy humanity? Here are 5 reasons not to worry.|url = https://www.vox.com/2014/8/22/6043635/5-reasons-we-shouldnt-worry-about-super-intelligent-computers-taking|website = Vox|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030092203/http://www.vox.com/2014/8/22/6043635/5-reasons-we-shouldnt-worry-about-super-intelligent-computers-taking|archivedate = 30 October 2015|df = dmy-all|date = 2014-08-22}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For the danger of uncontrolled advanced AI to be realized, the hypothetical AI would have to overpower or out-think all of humanity, which a minority of experts argue is a possibility far enough in the future to not be worth researching. Other counterarguments revolve around humans being either intrinsically or convergently valuable from the perspective of an artificial intelligence.&lt;br /&gt;
&lt;br /&gt;
为了实现不受控制的先进人工智能的危险，假设的人工智能必须超越或超越整个人类，一小部分专家认为这种可能性在未来足够遥远，不值得研究。其他反对意见则围绕着从人工智能的角度来看， '''&amp;lt;font color=#32cd32&amp;gt; 人类有内在或可聚合的价值。&amp;lt;/font&amp;gt;'''&lt;br /&gt;
&lt;br /&gt;
如果要实现不受控制的高级AI，这个假想中的AI必须超越或者说在思想上超越全人类，一小部分专家认为这种可能性在足够遥远未来才会出现，不值得研究。其他反对意见则认为，从AI的角度来看，人类或者具有内在价值，或者具有可交流的价值。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]） 不太能翻译 Other counterarguments revolve around humans being either intrinsically or convergently valuable from the perspective of an artificial intelligence.一句&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====人性贬值 ====&lt;br /&gt;
&lt;br /&gt;
{{Main|Computer Power and Human Reason}}&lt;br /&gt;
&lt;br /&gt;
[[Joseph Weizenbaum]] wrote that AI applications cannot, by definition, successfully simulate genuine human empathy and that the use of AI technology in fields such as [[customer service]] or [[psychotherapy]]&amp;lt;ref&amp;gt;In the early 1970s, [[Kenneth Colby]] presented a version of Weizenbaum's [[ELIZA]] known as DOCTOR which he promoted as a serious therapeutic tool. {{Harv|Crevier|1993|pp=132–144}}&amp;lt;/ref&amp;gt; was deeply misguided. Weizenbaum was also bothered that AI researchers (and some philosophers) were willing to view the human mind as nothing more than a computer program (a position now known as [[computationalism]]). To Weizenbaum these points suggest that AI research devalues human life.&amp;lt;ref name=&amp;quot;Weizenbaum's critique&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Joseph Weizenbaum wrote that AI applications cannot, by definition, successfully simulate genuine human empathy and that the use of AI technology in fields such as customer service or psychotherapy was deeply misguided. Weizenbaum was also bothered that AI researchers (and some philosophers) were willing to view the human mind as nothing more than a computer program (a position now known as computationalism). To Weizenbaum these points suggest that AI research devalues human life.&lt;br /&gt;
&lt;br /&gt;
约瑟夫·维森鲍姆写道，根据定义，AI应用程序不能模拟人类的同理心，并且在诸如客户服务或心理治疗等领域使用AI技术是严重错误&amp;lt;ref&amp;gt;In the early 1970s, [[Kenneth Colby]] presented a version of Weizenbaum's [[ELIZA]] known as DOCTOR which he promoted as a serious therapeutic tool. {{Harv|Crevier|1993|pp=132–144}}&amp;lt;/ref&amp;gt; 。维森鲍姆还对AI研究人员(以及一些哲学家)将人类思维视为一个计算机程序(现在称为计算主义)而感到困扰。对维森鲍姆来说，这些观点表明AI研究贬低了人类的生命价值。&amp;lt;ref name=&amp;quot;Weizenbaum's critique&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====社会正义====&lt;br /&gt;
&lt;br /&gt;
{{further|Algorithmic bias}}&lt;br /&gt;
&lt;br /&gt;
One concern is that AI programs may be programmed to be biased against certain groups, such as women and minorities, because most of the developers are wealthy Caucasian men.&amp;lt;ref&amp;gt;{{Cite web|url=https://www.channelnewsasia.com/news/commentary/artificial-intelligence-big-data-bias-hiring-loans-key-challenge-11097374|title=Commentary: Bad news. Artificial intelligence is biased|website=CNA}}&amp;lt;/ref&amp;gt; Support for artificial intelligence is higher among men (with 47% approving) than women (35% approving).&lt;br /&gt;
&lt;br /&gt;
One concern is that AI programs may be programmed to be biased against certain groups, such as women and minorities, because most of the developers are wealthy Caucasian men. Support for artificial intelligence is higher among men (with 47% approving) than women (35% approving).&lt;br /&gt;
&lt;br /&gt;
人们担心的一个问题是，AI程序可能会对某些群体存在偏见，比如女性和少数族裔，因为大多数开发者都是富有的白人男性&amp;lt;ref&amp;gt;{{Cite web|url=https://www.channelnewsasia.com/news/commentary/artificial-intelligence-big-data-bias-hiring-loans-key-challenge-11097374|title=Commentary: Bad news. Artificial intelligence is biased|website=CNA}}&amp;lt;/ref&amp;gt;。男性对AI的支持率(47%)高于女性(35%)。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Algorithms have a host of applications in today's legal system already, assisting officials ranging from judges to parole officers and public defenders in gauging the predicted likelihood of recidivism of defendants.&amp;lt;ref name=&amp;quot;propublica.org&amp;quot;&amp;gt;{{Cite web|url=https://www.propublica.org/article/how-we-analyzed-the-compas-recidivism-algorithm|title=How We Analyzed the COMPAS Recidivism Algorithm|last=Jeff Larson|first=Julia Angwin|date=2016-05-23|website=ProPublica|language=en|access-date=2019-07-23}}&amp;lt;/ref&amp;gt; COMPAS (an acronym for Correctional Offender Management Profiling for Alternative Sanctions) counts among the most widely utilized commercially available solutions.&amp;lt;ref name=&amp;quot;propublica.org&amp;quot;/&amp;gt; It has been suggested that COMPAS assigns an exceptionally elevated risk of recidivism to black defendants while, conversely, ascribing low risk estimate to white defendants significantly more often than statistically expected.&amp;lt;ref name=&amp;quot;propublica.org&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Algorithms have a host of applications in today's legal system already, assisting officials ranging from judges to parole officers and public defenders in gauging the predicted likelihood of recidivism of defendants. COMPAS (an acronym for Correctional Offender Management Profiling for Alternative Sanctions) counts among the most widely utilized commercially available solutions. It has been suggested that COMPAS assigns an exceptionally elevated risk of recidivism to black defendants while, conversely, ascribing low risk estimate to white defendants significantly more often than statistically expected.&lt;br /&gt;
&lt;br /&gt;
算法在今天的法律体系中已经有了大量的应用，它能协助法官以及假释官员，以及哪些负责评估被告再次犯罪可能性的公设辩护人&amp;lt;ref name=&amp;quot;propublica.org&amp;quot;&amp;gt;{{Cite web|url=https://www.propublica.org/article/how-we-analyzed-the-compas-recidivism-algorithm|title=How We Analyzed the COMPAS Recidivism Algorithm|last=Jeff Larson|first=Julia Angwin|date=2016-05-23|website=ProPublica|language=en|access-date=2019-07-23}}&amp;lt;/ref&amp;gt;。COMPAS（Correctional Offender Management Profiling for Alternative Sanctions，即“替代性制裁的惩罚性罪犯管理分析”的首字母缩写)是商业上使用最广泛的解决方案之一&amp;lt;ref name=&amp;quot;propublica.org&amp;quot;/&amp;gt;。有人指出，COMPAS 对黑人被告累犯风险的评估数值非常高，而相反的，白人被告低风险估计的频率明显高于统计学期望。&amp;lt;ref name=&amp;quot;propublica.org&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==== 劳动力需求降低====&lt;br /&gt;
&lt;br /&gt;
{{Further|Technological unemployment#21st century}}&lt;br /&gt;
&lt;br /&gt;
The relationship between automation and employment is complicated. While automation eliminates old jobs, it also creates new jobs through micro-economic and macro-economic effects.&amp;lt;ref&amp;gt;E McGaughey, 'Will Robots Automate Your Job Away? Full Employment, Basic Income, and Economic Democracy' (2018) [https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3044448 SSRN, part 2(3)]&amp;lt;/ref&amp;gt; Unlike previous waves of automation, many middle-class jobs may be eliminated by artificial intelligence; ''[[The Economist]]'' states that &amp;quot;the worry that AI could do to white-collar jobs what steam power did to blue-collar ones during the Industrial Revolution&amp;quot; is &amp;quot;worth taking seriously&amp;quot;.&amp;lt;ref&amp;gt;{{cite news|title=Automation and anxiety|url=https://www.economist.com/news/special-report/21700758-will-smarter-machines-cause-mass-unemployment-automation-and-anxiety|accessdate=13 January 2018|work=The Economist|date=9 May 2015}}&amp;lt;/ref&amp;gt; Subjective estimates of the risk vary widely; for example, Michael Osborne and [[Carl Benedikt Frey]] estimate 47% of U.S. jobs are at &amp;quot;high risk&amp;quot; of potential automation, while an OECD report classifies only 9% of U.S.&amp;lt;!-- see report p. 33 table 4; 9% is both the OECD average and the US average --&amp;gt; jobs as &amp;quot;high risk&amp;quot;.&amp;lt;ref&amp;gt;{{cite news|last1=Lohr|first1=Steve|title=Robots Will Take Jobs, but Not as Fast as Some Fear, New Report Says|url=https://www.nytimes.com/2017/01/12/technology/robots-will-take-jobs-but-not-as-fast-as-some-fear-new-report-says.html|accessdate=13 January 2018|work=The New York Times|date=2017}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite journal|date=1 January 2017|title=The future of employment: How susceptible are jobs to computerisation?|journal=Technological Forecasting and Social Change|volume=114|pages=254–280|doi=10.1016/j.techfore.2016.08.019|issn=0040-1625|last1=Frey|first1=Carl Benedikt|last2=Osborne|first2=Michael A|citeseerx=10.1.1.395.416}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Arntz, Melanie, Terry Gregory, and Ulrich Zierahn. &amp;quot;The risk of automation for jobs in OECD countries: A comparative analysis.&amp;quot; OECD Social, Employment, and Migration Working Papers 189 (2016). p. 33.&amp;lt;/ref&amp;gt; Jobs at extreme risk range from paralegals to fast food cooks, while job demand is likely to increase for care-related professions ranging from personal healthcare to the clergy.&amp;lt;ref&amp;gt;{{cite news|last1=Mahdawi|first1=Arwa|title=What jobs will still be around in 20 years? Read this to prepare your future|url=https://www.theguardian.com/us-news/2017/jun/26/jobs-future-automation-robots-skills-creative-health|accessdate=13 January 2018|work=The Guardian|date=26 June 2017}}&amp;lt;/ref&amp;gt; Author [[Martin Ford (author)|Martin Ford]] and others go further and argue that many jobs are routine, repetitive and (to an AI) predictable; Ford warns that these jobs may be automated in the next couple of decades, and that many of the new jobs may not be &amp;quot;accessible to people with average capability&amp;quot;, even with retraining. Economists point out that in the past technology has tended to increase rather than reduce total employment, but acknowledge that &amp;quot;we're in uncharted territory&amp;quot; with AI.&amp;lt;ref name=&amp;quot;guardian jobs debate&amp;quot;&amp;gt;{{cite news|last1=Ford|first1=Martin|last2=Colvin|first2=Geoff|title=Will robots create more jobs than they destroy?|url=https://www.theguardian.com/technology/2015/sep/06/will-robots-create-destroy-jobs|accessdate=13 January 2018|work=The Guardian|date=6 September 2015}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The relationship between automation and employment is complicated. While automation eliminates old jobs, it also creates new jobs through micro-economic and macro-economic effects. Unlike previous waves of automation, many middle-class jobs may be eliminated by artificial intelligence; The Economist states that &amp;quot;the worry that AI could do to white-collar jobs what steam power did to blue-collar ones during the Industrial Revolution&amp;quot; is &amp;quot;worth taking seriously&amp;quot;. Subjective estimates of the risk vary widely; for example, Michael Osborne and Carl Benedikt Frey estimate 47% of U.S. jobs are at &amp;quot;high risk&amp;quot; of potential automation, while an OECD report classifies only 9% of U.S.&amp;lt;!-- see report p. 33 table 4; 9% is both the OECD average and the US average --&amp;gt; jobs as &amp;quot;high risk&amp;quot;. Jobs at extreme risk range from paralegals to fast food cooks, while job demand is likely to increase for care-related professions ranging from personal healthcare to the clergy. Author Martin Ford and others go further and argue that many jobs are routine, repetitive and (to an AI) predictable; Ford warns that these jobs may be automated in the next couple of decades, and that many of the new jobs may not be &amp;quot;accessible to people with average capability&amp;quot;, even with retraining. Economists point out that in the past technology has tended to increase rather than reduce total employment, but acknowledge that &amp;quot;we're in uncharted territory&amp;quot; with AI.&lt;br /&gt;
&lt;br /&gt;
自动化与就业的关系是复杂的。自动化在减少过时工作的同时，也通过微观经济和宏观经济效应创造了新的就业机会&amp;lt;ref&amp;gt;E McGaughey, 'Will Robots Automate Your Job Away? Full Employment, Basic Income, and Economic Democracy' (2018) [https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3044448 SSRN, part 2(3)]&amp;lt;/ref&amp;gt;。与以往的自动化浪潮不同，许多中产阶级的工作可能会被AI淘汰。《经济学人》杂志指出，“AI对白领工作的影响，就像工业革命时期蒸汽动力对蓝领工作的影响一样，需要我们正视”&amp;lt;ref&amp;gt;{{cite news|title=Automation and anxiety|url=https://www.economist.com/news/special-report/21700758-will-smarter-machines-cause-mass-unemployment-automation-and-anxiety|accessdate=13 January 2018|work=The Economist|date=9 May 2015}}&amp;lt;/ref&amp;gt;。对风险的主观估计差别很大，例如，迈克尔·奥斯本和卡尔·贝内迪克特·弗雷估计，美国47% 的工作有较高风险被自动化取代 ，而经合组织的报告认为美国仅有9% 的工作处于“高风险”状态&amp;lt;ref&amp;gt;{{cite news|last1=Lohr|first1=Steve|title=Robots Will Take Jobs, but Not as Fast as Some Fear, New Report Says|url=https://www.nytimes.com/2017/01/12/technology/robots-will-take-jobs-but-not-as-fast-as-some-fear-new-report-says.html|accessdate=13 January 2018|work=The New York Times|date=2017}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite journal|date=1 January 2017|title=The future of employment: How susceptible are jobs to computerisation?|journal=Technological Forecasting and Social Change|volume=114|pages=254–280|doi=10.1016/j.techfore.2016.08.019|issn=0040-1625|last1=Frey|first1=Carl Benedikt|last2=Osborne|first2=Michael A|citeseerx=10.1.1.395.416}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Arntz, Melanie, Terry Gregory, and Ulrich Zierahn. &amp;quot;The risk of automation for jobs in OECD countries: A comparative analysis.&amp;quot; OECD Social, Employment, and Migration Working Papers 189 (2016). p. 33.&amp;lt;/ref&amp;gt;。从律师助理到快餐厨师等职业都面临着极大的风险，而个人医疗保健、神职人员等护理相关职业的就业需求可能会增加&amp;lt;ref&amp;gt;{{cite news|last1=Mahdawi|first1=Arwa|title=What jobs will still be around in 20 years? Read this to prepare your future|url=https://www.theguardian.com/us-news/2017/jun/26/jobs-future-automation-robots-skills-creative-health|accessdate=13 January 2018|work=The Guardian|date=26 June 2017}}&amp;lt;/ref&amp;gt;。作家马丁•福特和其他人进一步指出，许多工作都是常规、重复的，对AI而言是可以预测的。福特警告道，这些工作可能在未来几十年内实现自动化，而且即便对失业人员进行再培训，许多能力一般的人也不能获得新工作。经济学家指出，在过去技术往往会增加而不是减少总就业人数，但他们承认，AI“正处于未知领域”&amp;lt;ref name=&amp;quot;guardian jobs debate&amp;quot;&amp;gt;{{cite news|last1=Ford|first1=Martin|last2=Colvin|first2=Geoff|title=Will robots create more jobs than they destroy?|url=https://www.theguardian.com/technology/2015/sep/06/will-robots-create-destroy-jobs|accessdate=13 January 2018|work=The Guardian|date=6 September 2015}}&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====自动化武器====&lt;br /&gt;
&lt;br /&gt;
{{See also|Lethal autonomous weapon}}&lt;br /&gt;
&lt;br /&gt;
Currently, 50+ countries are researching battlefield robots, including the United States, China, Russia, and the United Kingdom. Many people concerned about risk from superintelligent AI also want to limit the use of artificial soldiers and drones.&amp;lt;ref&amp;gt;{{cite web|title = Stephen Hawking, Elon Musk, and Bill Gates Warn About Artificial Intelligence|url = http://observer.com/2015/08/stephen-hawking-elon-musk-and-bill-gates-warn-about-artificial-intelligence/|website = Observer|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030053323/http://observer.com/2015/08/stephen-hawking-elon-musk-and-bill-gates-warn-about-artificial-intelligence/|archivedate = 30 October 2015|df = dmy-all|date = 2015-08-19}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Currently, 50+ countries are researching battlefield robots, including the United States, China, Russia, and the United Kingdom. Many people concerned about risk from superintelligent AI also want to limit the use of artificial soldiers and drones.&lt;br /&gt;
&lt;br /&gt;
目前，包括美国、中国、俄罗斯和英国在内的50多个国家正在研究战场机器人。许多人在担心来自超级智能AI的风险的同时，也希望限制人造士兵和无人机的使用。&amp;lt;ref&amp;gt;{{cite web|title = Stephen Hawking, Elon Musk, and Bill Gates Warn About Artificial Intelligence|url = http://observer.com/2015/08/stephen-hawking-elon-musk-and-bill-gates-warn-about-artificial-intelligence/|website = Observer|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030053323/http://observer.com/2015/08/stephen-hawking-elon-musk-and-bill-gates-warn-about-artificial-intelligence/|archivedate = 30 October 2015|df = dmy-all|date = 2015-08-19}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===道德机器===&lt;br /&gt;
&lt;br /&gt;
Machines with intelligence have the potential to use their intelligence to prevent harm and minimize the risks; they may have the ability to use [[ethics|ethical reasoning]] to better choose their actions in the world. As such, there is a need for policy making to devise policies for and regulate artificial intelligence and robotics.&amp;lt;ref&amp;gt;{{Cite journal|last=Iphofen|first=Ron|last2=Kritikos|first2=Mihalis|date=2019-01-03|title=Regulating artificial intelligence and robotics: ethics by design in a digital society|journal=Contemporary Social Science|pages=1–15|doi=10.1080/21582041.2018.1563803|issn=2158-2041}}&amp;lt;/ref&amp;gt; Research in this area includes [[machine ethics]], [[artificial moral agents]], [[friendly AI]] and discussion towards building a [[human rights]] framework is also in talks.&amp;lt;ref&amp;gt;{{cite_web|url=https://www.voanews.com/episode/ethical-ai-learns-human-rights-framework-4087171|title=Ethical AI Learns Human Rights Framework|accessdate=10 November 2019|website=Voice of America}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Machines with intelligence have the potential to use their intelligence to prevent harm and minimize the risks; they may have the ability to use ethical reasoning to better choose their actions in the world. As such, there is a need for policy making to devise policies for and regulate artificial intelligence and robotics. Research in this area includes machine ethics, artificial moral agents, friendly AI and discussion towards building a human rights framework is also in talks.&lt;br /&gt;
&lt;br /&gt;
具有智能的机器有潜力使用它们的智能来防止伤害和减少风险；它们也有能力利用伦理推理来更好地做出它们在世界上的行动。因此，有必要为AI和机器人制定和规范政策&amp;lt;ref&amp;gt;{{Cite journal|last=Iphofen|first=Ron|last2=Kritikos|first2=Mihalis|date=2019-01-03|title=Regulating artificial intelligence and robotics: ethics by design in a digital society|journal=Contemporary Social Science|pages=1–15|doi=10.1080/21582041.2018.1563803|issn=2158-2041}}&amp;lt;/ref&amp;gt;。这一领域的研究包括机器伦理学、人工道德主题、友好AI以及关于建立人权框架的讨论&amp;lt;ref&amp;gt;{{cite_web|url=https://www.voanews.com/episode/ethical-ai-learns-human-rights-framework-4087171|title=Ethical AI Learns Human Rights Framework|accessdate=10 November 2019|website=Voice of America}}&amp;lt;/ref&amp;gt;。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====人工道德智能主体 ====&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Wendell Wallach introduced the concept of [[artificial moral agents]] (AMA) in his book ''Moral Machines''&amp;lt;ref&amp;gt;Wendell Wallach (2010). ''Moral Machines'', Oxford University Press.&amp;lt;/ref&amp;gt; For Wallach, AMAs have become a part of the research landscape of artificial intelligence as guided by its two central questions which he identifies as &amp;quot;Does Humanity Want Computers Making Moral Decisions&amp;quot;&amp;lt;ref&amp;gt;Wallach, pp 37–54.&amp;lt;/ref&amp;gt; and &amp;quot;Can (Ro)bots Really Be Moral&amp;quot;.&amp;lt;ref&amp;gt;Wallach, pp 55–73.&amp;lt;/ref&amp;gt; For Wallach, the question is not centered on the issue of ''whether'' machines can demonstrate the equivalent of moral behavior in contrast to the ''constraints'' which society may place on the development of AMAs.&amp;lt;ref&amp;gt;Wallach, Introduction chapter.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Wendell Wallach introduced the concept of artificial moral agents (AMA) in his book Moral Machines For Wallach, AMAs have become a part of the research landscape of artificial intelligence as guided by its two central questions which he identifies as &amp;quot;Does Humanity Want Computers Making Moral Decisions&amp;quot; and &amp;quot;Can (Ro)bots Really Be Moral&amp;quot;. For Wallach, the question is not centered on the issue of whether machines can demonstrate the equivalent of moral behavior in contrast to the constraints which society may place on the development of AMAs.&lt;br /&gt;
&lt;br /&gt;
温德尔•沃勒克在他的著作《道德机器》(Moral Machines)&amp;lt;ref&amp;gt;Wendell Wallach (2010). ''Moral Machines'', Oxford University Press.&amp;lt;/ref&amp;gt;中提出了人工道德智能主体(AMA)的概念。在两个核心问题的指导下，AMA 已经成为AI研究领域的一部分。他将这两个核心问题定义为“人类是否希望计算机做出道德决策”和“机器人真的可以拥有道德吗”。对于沃勒克来说，这个问题的重点并不是机器能否适应社会，表现与社会对AMA发展所施加的限制相对应的道德行为。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==== 机器伦理学====&lt;br /&gt;
&lt;br /&gt;
{{Main|Machine ethics}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The field of machine ethics is concerned with giving machines ethical principles, or a procedure for discovering a way to resolve the ethical dilemmas they might encounter, enabling them to function in an ethically responsible manner through their own ethical decision making.&amp;lt;ref name=&amp;quot;autogenerated1&amp;quot;&amp;gt;Michael Anderson and Susan Leigh Anderson (2011), Machine Ethics, Cambridge University Press.&amp;lt;/ref&amp;gt; The field was delineated in the AAAI Fall 2005 Symposium on Machine Ethics: &amp;quot;Past research concerning the relationship between technology and ethics has largely focused on responsible and irresponsible use of technology by human beings, with a few people being interested in how human beings ought to treat machines. In all cases, only human beings have engaged in ethical reasoning. The time has come for adding an ethical dimension to at least some machines. Recognition of the ethical ramifications of behavior involving machines, as well as recent and potential developments in machine autonomy, necessitate this. In contrast to computer hacking, software property issues, privacy issues and other topics normally ascribed to computer ethics, machine ethics is concerned with the behavior of machines towards human users and other machines. Research in machine ethics is key to alleviating concerns with autonomous systems—it could be argued that the notion of autonomous machines without such a dimension is at the root of all fear concerning machine intelligence. Further, investigation of machine ethics could enable the discovery of problems with current ethical theories, advancing our thinking about Ethics.&amp;quot;&amp;lt;ref name=&amp;quot;autogenerated2&amp;quot;&amp;gt;{{cite web|url=http://www.aaai.org/Library/Symposia/Fall/fs05-06 |title=Machine Ethics |work=aaai.org |url-status=dead |archiveurl=https://web.archive.org/web/20141129044821/http://www.aaai.org/Library/Symposia/Fall/fs05-06 |archivedate=29 November 2014 }}&amp;lt;/ref&amp;gt; Machine ethics is sometimes referred to as machine morality, computational ethics or computational morality. A variety of perspectives of this nascent field can be found in the collected edition &amp;quot;Machine Ethics&amp;quot;&amp;lt;ref name=&amp;quot;autogenerated1&amp;quot;/&amp;gt; that stems from the AAAI Fall 2005 Symposium on Machine Ethics.&amp;lt;ref name=&amp;quot;autogenerated2&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The field of machine ethics is concerned with giving machines ethical principles, or a procedure for discovering a way to resolve the ethical dilemmas they might encounter, enabling them to function in an ethically responsible manner through their own ethical decision making. The field was delineated in the AAAI Fall 2005 Symposium on Machine Ethics: &amp;quot;Past research concerning the relationship between technology and ethics has largely focused on responsible and irresponsible use of technology by human beings, with a few people being interested in how human beings ought to treat machines. In all cases, only human beings have engaged in ethical reasoning. The time has come for adding an ethical dimension to at least some machines. Recognition of the ethical ramifications of behavior involving machines, as well as recent and potential developments in machine autonomy, necessitate this. In contrast to computer hacking, software property issues, privacy issues and other topics normally ascribed to computer ethics, machine ethics is concerned with the behavior of machines towards human users and other machines. Research in machine ethics is key to alleviating concerns with autonomous systems—it could be argued that the notion of autonomous machines without such a dimension is at the root of all fear concerning machine intelligence. Further, investigation of machine ethics could enable the discovery of problems with current ethical theories, advancing our thinking about Ethics.&amp;quot; Machine ethics is sometimes referred to as machine morality, computational ethics or computational morality. A variety of perspectives of this nascent field can be found in the collected edition &amp;quot;Machine Ethics&amp;quot; that stems from the AAAI Fall 2005 Symposium on Machine Ethics.&lt;br /&gt;
&lt;br /&gt;
机器伦理学领域关注的是给予机器伦理原则，或者一种用于解决它们可能遇到的伦理困境的方法，使它们能够通过自己的伦理决策以一种符合伦理的方式运作.&amp;lt;ref name=&amp;quot;autogenerated1&amp;quot;&amp;gt;Michael Anderson and Susan Leigh Anderson (2011), Machine Ethics, Cambridge University Press.&amp;lt;/ref&amp;gt;。2005年秋季AAAI机器伦理研讨会描述了这一领域: ”过去关于技术与伦理学之间关系的研究主要侧重于人类是否应该对技术的使用负责，只有少数人对人类应当如何对待机器感兴趣。任何时候都只有人类会参与伦理推理。现在是时候给至少一些机器增加道德层面的考虑了。这势必要的，因为我们认识到了机器行为的道德后果，以及机器自主性领域最新和潜在的发展。与计算机黑客行为、软件产权问题、隐私问题和其他通常归因于计算机道德的主题不同，机器道德关注的是机器对人类用户和其他机器的行为。机器伦理学的研究是减轻人们对自主系统担忧的关键——可以说，人们对机器智能担忧的根源是自主机器概念没有道德维度。此外，在机器伦理学的研究中可以发现当前伦理学理论存在的问题，加深我们对伦理学的思考。”&amp;lt;ref name=&amp;quot;autogenerated2&amp;quot;&amp;gt;{{cite web|url=http://www.aaai.org/Library/Symposia/Fall/fs05-06 |title=Machine Ethics |work=aaai.org |url-status=dead |archiveurl=https://web.archive.org/web/20141129044821/http://www.aaai.org/Library/Symposia/Fall/fs05-06 |archivedate=29 November 2014 }}&amp;lt;/ref&amp;gt; 机器伦理学有时被称为机器道德、计算伦理学或计算伦理学&amp;lt;ref name=&amp;quot;autogenerated1&amp;quot;/&amp;gt;。这个新兴领域的各种观点可以在 AAAI 秋季2005年机器伦理学研讨会上收集的“机器伦理学”版本中找到。&amp;lt;ref name=&amp;quot;autogenerated2&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====善AI与恶AI Malevolent and friendly AI ====&lt;br /&gt;
&lt;br /&gt;
{{Main|Friendly AI}}&lt;br /&gt;
&lt;br /&gt;
Political scientist [[Charles T. Rubin]] believes that AI can be neither designed nor guaranteed to be benevolent.&amp;lt;ref&amp;gt;{{cite journal|last=Rubin |first=Charles |authorlink=Charles T. Rubin |date=Spring 2003 |title=Artificial Intelligence and Human Nature|journal=The New Atlantis |volume=1 |pages=88–100 |url=http://www.thenewatlantis.com/publications/artificial-intelligence-and-human-nature |url-status=dead |archiveurl=https://web.archive.org/web/20120611115223/http://www.thenewatlantis.com/publications/artificial-intelligence-and-human-nature |archivedate=11 June 2012 |df=dmy}}&amp;lt;/ref&amp;gt; He argues that &amp;quot;any sufficiently advanced benevolence may be indistinguishable from malevolence.&amp;quot; Humans should not assume machines or robots would treat us favorably because there is no ''a priori'' reason to believe that they would be sympathetic to our system of morality, which has evolved along with our particular biology (which AIs would not share). Hyper-intelligent software may not necessarily decide to support the continued existence of humanity and would be extremely difficult to stop. This topic has also recently begun to be discussed in academic publications as a real source of risks to civilization, humans, and planet Earth.&lt;br /&gt;
&lt;br /&gt;
Political scientist Charles T. Rubin believes that AI can be neither designed nor guaranteed to be benevolent. He argues that &amp;quot;any sufficiently advanced benevolence may be indistinguishable from malevolence.&amp;quot; Humans should not assume machines or robots would treat us favorably because there is no a priori reason to believe that they would be sympathetic to our system of morality, which has evolved along with our particular biology (which AIs would not share). Hyper-intelligent software may not necessarily decide to support the continued existence of humanity and would be extremely difficult to stop. This topic has also recently begun to be discussed in academic publications as a real source of risks to civilization, humans, and planet Earth.&lt;br /&gt;
&lt;br /&gt;
政治科学家查尔斯 · 鲁宾认为，AI既不可能被设计成是友好的，也不能保证会是友好的&amp;lt;ref&amp;gt;{{cite journal|last=Rubin |first=Charles |authorlink=Charles T. Rubin |date=Spring 2003 |title=Artificial Intelligence and Human Nature|journal=The New Atlantis |volume=1 |pages=88–100 |url=http://www.thenewatlantis.com/publications/artificial-intelligence-and-human-nature |url-status=dead |archiveurl=https://web.archive.org/web/20120611115223/http://www.thenewatlantis.com/publications/artificial-intelligence-and-human-nature |archivedate=11 June 2012 |df=dmy}}&amp;lt;/ref&amp;gt;。他认为“任何足够的友善都可能难以与邪恶区分。”人类不应该假设机器或机器人会对我们友好，因为没有先验理由认为他们会对我们的道德体系有共鸣。这个体系是在我们特定的生物进化过程中产生的(AI没有这个过程)。超智能软件不一定会认同人类的继续存在，且我们将极难停止超级AI的运转。最近一些学术出版物也开始讨论这个话题，认为它是对文明、人类和地球造成风险的真正来源。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
One proposal to deal with this is to ensure that the first generally intelligent AI is '[[Friendly AI]]' and will be able to control subsequently developed AIs. Some question whether this kind of check could actually remain in place.&lt;br /&gt;
&lt;br /&gt;
One proposal to deal with this is to ensure that the first generally intelligent AI is 'Friendly AI' and will be able to control subsequently developed AIs. Some question whether this kind of check could actually remain in place.&lt;br /&gt;
&lt;br /&gt;
解决这个问题的一个建议是确保第一个具有通用智能的AI是“友好的AI”，并能够控制后面研发的AI。一些人质疑这种“友好”是否真的能够保持不变。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Leading AI researcher [[Rodney Brooks]] writes, &amp;quot;I think it is a mistake to be worrying about us developing malevolent AI anytime in the next few hundred years. I think the worry stems from a fundamental error in not distinguishing the difference between the very real recent advances in a particular aspect of AI and the enormity and complexity of building sentient volitional intelligence.&amp;quot;&amp;lt;ref&amp;gt;{{cite web|last=Brooks|first=Rodney|title=artificial intelligence is a tool, not a threat|date=10 November 2014|url=http://www.rethinkrobotics.com/artificial-intelligence-tool-threat/|url-status=dead|archiveurl=https://web.archive.org/web/20141112130954/http://www.rethinkrobotics.com/artificial-intelligence-tool-threat/|archivedate=12 November 2014|df=dmy-all}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Leading AI researcher Rodney Brooks writes, &amp;quot;I think it is a mistake to be worrying about us developing malevolent AI anytime in the next few hundred years. I think the worry stems from a fundamental error in not distinguishing the difference between the very real recent advances in a particular aspect of AI and the enormity and complexity of building sentient volitional intelligence.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
首席AI研究员罗德尼 · 布鲁克斯写道: “我认为担心我们在未来几百年的研发出邪恶AI是无稽之谈。我觉得这种担忧源于一个根本性的错误，即没有认识到AI在某些领域进展可以很快，但构建有意识有感情的智能则是件庞杂且艰巨的任务。”&amp;lt;ref&amp;gt;{{cite web|last=Brooks|first=Rodney|title=artificial intelligence is a tool, not a threat|date=10 November 2014|url=http://www.rethinkrobotics.com/artificial-intelligence-tool-threat/|url-status=dead|archiveurl=https://web.archive.org/web/20141112130954/http://www.rethinkrobotics.com/artificial-intelligence-tool-threat/|archivedate=12 November 2014|df=dmy-all}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  --[[用户:Thingamabob|Thingamabob]]（[[用户讨论:Thingamabob|讨论]]）“我认为担心我们在未来几百年的研发出邪恶AI是无稽之谈。我认为，这种担忧源于一个根本性的错误，即没有认识到AI在某些领域进展可以很快但构建有意识有感情的智能是件庞杂且艰巨的任务。”该句为意译&lt;br /&gt;
  --[[用户:Qige96|Ricky]]（[[用户讨论:Qige96|讨论]]）干得漂亮&lt;br /&gt;
&lt;br /&gt;
===机器意识、知觉和思维 ===&lt;br /&gt;
&lt;br /&gt;
{{Main|Artificial consciousness}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
If an AI system replicates all key aspects of human intelligence, will that system also be [[Sentience|sentient]]—will it have a [[mind]] which has [[consciousness|conscious experiences]]? This question is closely related to the philosophical problem as to the nature of human consciousness, generally referred to as the [[hard problem of consciousness]].&lt;br /&gt;
&lt;br /&gt;
If an AI system replicates all key aspects of human intelligence, will that system also be sentient—will it have a mind which has conscious experiences? This question is closely related to the philosophical problem as to the nature of human consciousness, generally referred to as the hard problem of consciousness.&lt;br /&gt;
&lt;br /&gt;
如果一个AI系统复制了人类智能的所有关键部分，那么这个系统是否也能有意识——它是否能拥有一个有知觉的头脑？这个问题与人类意识本质的哲学问题密切相关，一般称之为意识难题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====意识 ====&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Hard problem of consciousness|Theory of mind}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[David Chalmers]] identified two problems in understanding the mind, which he named the &amp;quot;hard&amp;quot; and &amp;quot;easy&amp;quot; problems of consciousness.&amp;lt;ref name=Chalmers&amp;gt;{{cite journal |url=http://www.imprint.co.uk/chalmers.html |title=Facing up to the problem of consciousness |last=Chalmers |first=David |authorlink=David Chalmers |journal=[[Journal of Consciousness Studies]] |volume= 2 |issue=3 |year=1995 |pages=200–219}} See also [http://consc.net/papers/facing.html this link]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
大卫 · 查尔默斯在理解心智方面提出了两个问题，他称之为意识的“困难”和“容易”问题。 &amp;lt;ref name=Chalmers&amp;gt;{{cite journal |url=http://www.imprint.co.uk/chalmers.html |title=Facing up to the problem of consciousness |last=Chalmers |first=David |authorlink=David Chalmers |journal=[[Journal of Consciousness Studies]] |volume= 2 |issue=3 |year=1995 |pages=200–219}} See also [http://consc.net/papers/facing.html this link]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The easy problem is understanding how the brain processes signals, makes plans and controls behavior. The hard problem is explaining how this ''feels'' or why it should feel like anything at all. Human [[information processing]] is easy to explain, however human [[subjective experience]] is difficult to explain.&lt;br /&gt;
&lt;br /&gt;
The easy problem is understanding how the brain processes signals, makes plans and controls behavior. The hard problem is explaining how this feels or why it should feel like anything at all. Human information processing is easy to explain, however human subjective experience is difficult to explain.&lt;br /&gt;
&lt;br /&gt;
“容易”的问题是理解大脑如何处理信号，制定计划和控制行为。“困难”的问题是如何解释这种感觉或者为什么它会有这种感觉。人类的信息处理过程很容易解释，然而人类的主观体验却很难解释。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
For example, consider what happens when a person is shown a color swatch and identifies it, saying &amp;quot;it's red&amp;quot;. The easy problem only requires understanding the machinery in the brain that makes it possible for a person to know that the color swatch is red. The hard problem is that people also know something else—they also know ''what red looks like''. (Consider that a person born blind can know that something is red without knowing what red looks like.){{efn|This is based on [[Mary's Room]], a thought experiment first proposed by [[Frank Cameron Jackson|Frank Jackson]] in 1982}} Everyone knows subjective experience exists, because they do it every day (e.g., all sighted people know what red looks like). The hard problem is explaining how the brain creates it, why it exists, and how it is different from knowledge and other aspects of the brain.&lt;br /&gt;
&lt;br /&gt;
For example, consider what happens when a person is shown a color swatch and identifies it, saying &amp;quot;it's red&amp;quot;. The easy problem only requires understanding the machinery in the brain that makes it possible for a person to know that the color swatch is red. The hard problem is that people also know something else—they also know what red looks like. (Consider that a person born blind can know that something is red without knowing what red looks like.) Everyone knows subjective experience exists, because they do it every day (e.g., all sighted people know what red looks like). The hard problem is explaining how the brain creates it, why it exists, and how it is different from knowledge and other aspects of the brain.&lt;br /&gt;
&lt;br /&gt;
例如当一个人看到一张色卡并识别它，说“它是红色的”时会发生什么。这个简单的问题只需要知道这个人大脑中认出色卡是红色的机制。困难的问题是，人们还知道其他一些东西——他们还知道红色长什么样。(一个天生失明的人也能知道什么是红色，即使不知道红色是什么样子。)每个人都知道主观体验的存在，因为他们每天都有主观体验(例如，所有视力正常的人都知道红色是什么样子)。困难的问题是解释大脑如何创造它，为什么它存在，以及它如何区别于知识和大脑的其他方面。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====计算主义和功能主义====&lt;br /&gt;
&lt;br /&gt;
{{Main|Computationalism|Functionalism (philosophy of mind)}}&lt;br /&gt;
&lt;br /&gt;
Computationalism is the position in the [[philosophy of mind]] that the human mind or the human brain (or both) is an information processing system and that thinking is a form of computing.&amp;lt;ref&amp;gt;[[Steven Horst|Horst, Steven]], (2005) [http://plato.stanford.edu/entries/computational-mind/ &amp;quot;The Computational Theory of Mind&amp;quot;] in ''The Stanford Encyclopedia of Philosophy''&amp;lt;/ref&amp;gt; Computationalism argues that the relationship between mind and body is similar or identical to the relationship between software and hardware and thus may be a solution to the [[mind-body problem]]. This philosophical position was inspired by the work of AI researchers and cognitive scientists in the 1960s and was originally proposed by philosophers [[Jerry Fodor]] and [[Hilary Putnam]].&lt;br /&gt;
&lt;br /&gt;
Computationalism is the position in the philosophy of mind that the human mind or the human brain (or both) is an information processing system and that thinking is a form of computing. Computationalism argues that the relationship between mind and body is similar or identical to the relationship between software and hardware and thus may be a solution to the mind-body problem. This philosophical position was inspired by the work of AI researchers and cognitive scientists in the 1960s and was originally proposed by philosophers Jerry Fodor and Hilary Putnam.&lt;br /&gt;
&lt;br /&gt;
计算主义站在心智哲学的立场，认为人类心智或人类大脑(都)是一个信息处理系统，思维是一种计算形式。计算主义认为，思想和身体之间的关系与软件和硬件之间的关系是相似或相同的，因此这也许能帮助解决“意识和身体问题”。这一哲学立场受20世纪60年代AI研究人员和认知科学家的工作的启发，最初由哲学家杰里·福多和希拉里·普特南提出。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====强人工智能假说 ====&lt;br /&gt;
&lt;br /&gt;
{{Main|Chinese room}}&lt;br /&gt;
&lt;br /&gt;
The philosophical position that [[John Searle]] has named [[strong AI hypothesis|&amp;quot;strong AI&amp;quot;]] states: &amp;quot;The appropriately programmed computer with the right inputs and outputs would thereby have a mind in exactly the same sense human beings have minds.&amp;quot;&amp;lt;ref name=&amp;quot;Searle's strong AI&amp;quot;/&amp;gt; Searle counters this assertion with his [[Chinese room]] argument, which asks us to look ''inside'' the computer and try to find where the &amp;quot;mind&amp;quot; might be.&amp;lt;ref name=&amp;quot;Chinese room&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The philosophical position that John Searle has named &amp;quot;strong AI&amp;quot; states: &amp;quot;The appropriately programmed computer with the right inputs and outputs would thereby have a mind in exactly the same sense human beings have minds.&amp;quot; Searle counters this assertion with his Chinese room argument, which asks us to look inside the computer and try to find where the &amp;quot;mind&amp;quot; might be.&lt;br /&gt;
&lt;br /&gt;
“具有正确输入和输出程序的计算机，将因此拥有与人脑意义完全相同的头脑。”约翰·塞尔称这种哲学立场为“强人工智能”，然后用他的中文屋论点反驳了这种说法，他让人们看看电脑内部，并试图找出“思维”可能在哪里。&lt;br /&gt;
 --[[用户:Qige96|Ricky]]([[用户讨论:Qige96讨论]])其实我不认同中文屋，我觉得这就是对系统论（总体大于部分之和）的无视。&lt;br /&gt;
&lt;br /&gt;
====机器人的权利====&lt;br /&gt;
&lt;br /&gt;
{{Main|Robot rights}}&lt;br /&gt;
&lt;br /&gt;
If a machine can be created that has intelligence, could it also ''[[sentience|feel]]''? If it can feel, does it have the same rights as a human? This issue, now known as &amp;quot;[[robot rights]]&amp;quot;, is currently being considered by, for example, California's [[Institute for the Future]], although many critics believe that the discussion is premature.&amp;lt;ref name=&amp;quot;Robot rights&amp;quot;/&amp;gt; Some critics of [[transhumanism]] argue that any hypothetical robot rights would lie on a spectrum with [[animal rights]] and human rights. &amp;lt;ref Name=&amp;quot;Evans 2015&amp;quot;&amp;gt;{{cite journal | last = Evans | first = Woody | authorlink = Woody Evans | title = Posthuman Rights: Dimensions of Transhuman Worlds | journal = Teknokultura | volume = 12 | issue = 2 | date = 2015 | df = dmy-all | doi = 10.5209/rev_TK.2015.v12.n2.49072 | doi-access = free }}&amp;lt;/ref&amp;gt; The subject is profoundly discussed in the 2010 documentary film ''[[Plug &amp;amp; Pray]]'',&amp;lt;ref&amp;gt;{{cite web|url=http://www.plugandpray-film.de/en/content.html|title=Content: Plug &amp;amp; Pray Film – Artificial Intelligence – Robots -|author=maschafilm|work=plugandpray-film.de|url-status=live|archiveurl=https://web.archive.org/web/20160212040134/http://www.plugandpray-film.de/en/content.html|archivedate=12 February 2016|df=dmy-all}}&amp;lt;/ref&amp;gt; and many sci fi media such as [[Star Trek]] Next Generation, with the character of [[Commander Data]], who fought being disassembled for research, and wanted to &amp;quot;become human&amp;quot;, and the robotic holograms in Voyager.&lt;br /&gt;
&lt;br /&gt;
If a machine can be created that has intelligence, could it also feel? If it can feel, does it have the same rights as a human? This issue, now known as &amp;quot;robot rights&amp;quot;, is currently being considered by, for example, California's Institute for the Future, although many critics believe that the discussion is premature. The subject is profoundly discussed in the 2010 documentary film Plug &amp;amp; Pray, and many sci fi media such as Star Trek Next Generation, with the character of Commander Data, who fought being disassembled for research, and wanted to &amp;quot;become human&amp;quot;, and the robotic holograms in Voyager.&lt;br /&gt;
&lt;br /&gt;
如果可以创造出一台有智能的机器，那么它是否也有感觉呢？如果它有感觉，它是否拥有与人类同样的权利？这个目前被称为“机器人权利”的问题正在被人们考虑&amp;lt;ref name=&amp;quot;Robot rights&amp;quot;/&amp;gt;，例如，加利福尼亚的未来研究所就在从事相关研究，尽管许多批评论家认为这种讨论为时过早&amp;lt;ref Name=&amp;quot;Evans 2015&amp;quot;&amp;gt;{{cite journal | last = Evans | first = Woody | authorlink = Woody Evans | title = Posthuman Rights: Dimensions of Transhuman Worlds | journal = Teknokultura | volume = 12 | issue = 2 | date = 2015 | df = dmy-all | doi = 10.5209/rev_TK.2015.v12.n2.49072 | doi-access = free }}&amp;lt;/ref&amp;gt;。2010年的纪录片《插头与祷告》(Plug &amp;amp; Pray)&amp;lt;ref&amp;gt;{{cite web|url=http://www.plugandpray-film.de/en/content.html|title=Content: Plug &amp;amp; Pray Film – Artificial Intelligence – Robots -|author=maschafilm|work=plugandpray-film.de|url-status=live|archiveurl=https://web.archive.org/web/20160212040134/http://www.plugandpray-film.de/en/content.html|archivedate=12 February 2016|df=dmy-all}}&amp;lt;/ref&amp;gt;以及《星际迷航: 下一代》(Star Trek Next Generation)等许多科幻媒体都对这个主题进行了深入讨论。《星际迷航》中有个指挥官角色叫戴塔(Data) ，他希望“变成人类”，和为了不被拆解而抗争。&lt;br /&gt;
&lt;br /&gt;
===超级智能 ===&lt;br /&gt;
&lt;br /&gt;
{{Main|Superintelligence}}&lt;br /&gt;
&lt;br /&gt;
Are there limits to how intelligent machines—or human-machine hybrids—can be? A superintelligence, hyperintelligence, or superhuman intelligence is a hypothetical agent that would possess intelligence far surpassing that of the brightest and most gifted human mind. ''Superintelligence'' may also refer to the form or degree of intelligence possessed by such an agent.&amp;lt;ref name=&amp;quot;Roberts&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Are there limits to how intelligent machines—or human-machine hybrids—can be? A superintelligence, hyperintelligence, or superhuman intelligence is a hypothetical agent that would possess intelligence far surpassing that of the brightest and most gifted human mind. Superintelligence may also refer to the form or degree of intelligence possessed by such an agent.&lt;br /&gt;
&lt;br /&gt;
智能机器——或者说人机混合体——能达到的怎样的程度有限吗？超级智能、超智能或者超人智能是一种假想的智能主体，它拥有的智能远远超过最聪明、最有天赋的人类智慧。超级智能也可以指这种智能体所拥有的智能的形式或程度。&amp;lt;ref name=&amp;quot;Roberts&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====技术奇点====&lt;br /&gt;
&lt;br /&gt;
{{Main|Technological singularity|Moore's law}}&lt;br /&gt;
&lt;br /&gt;
If research into [[artificial general intelligence|Strong AI]] produced sufficiently intelligent software, it might be able to reprogram and improve itself. The improved software would be even better at improving itself, leading to [[Intelligence explosion|recursive self-improvement]].&amp;lt;ref name=&amp;quot;recurse&amp;quot;/&amp;gt; The new intelligence could thus increase exponentially and dramatically surpass humans. Science fiction writer [[Vernor Vinge]] named this scenario &amp;quot;[[technological singularity|singularity]]&amp;quot;.&amp;lt;ref name=Singularity/&amp;gt; Technological singularity is when accelerating progress in technologies will cause a runaway effect wherein artificial intelligence will exceed human intellectual capacity and control, thus radically changing or even ending civilization. Because the capabilities of such an intelligence may be impossible to comprehend, the technological singularity is an occurrence beyond which events are unpredictable or even unfathomable.&amp;lt;ref name=Singularity/&amp;gt;&amp;lt;ref name=&amp;quot;Roberts&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If research into Strong AI produced sufficiently intelligent software, it might be able to reprogram and improve itself. The improved software would be even better at improving itself, leading to recursive self-improvement. The new intelligence could thus increase exponentially and dramatically surpass humans. Science fiction writer Vernor Vinge named this scenario &amp;quot;singularity&amp;quot;. Technological singularity is when accelerating progress in technologies will cause a runaway effect wherein artificial intelligence will exceed human intellectual capacity and control, thus radically changing or even ending civilization. Because the capabilities of such an intelligence may be impossible to comprehend, the technological singularity is an occurrence beyond which events are unpredictable or even unfathomable.&lt;br /&gt;
&lt;br /&gt;
如果对强人工智能的研究造出了足够智能的软件，那么它也许能做到重新编程并改进自己。改进后的软件甚至可以更好地改进自己，从而实现递归的自我改进。这种新的智能因此可以呈指数增长，并大大超过人类&amp;lt;ref name=&amp;quot;recurse&amp;quot;/&amp;gt;。科幻作家弗诺·文奇将这种情况命名为“奇点”&amp;lt;ref name=Singularity/&amp;gt; ：技术的加速发展将导致AI超越人类智力和控制能力的失控局面，从而彻底改变甚至终结人类文明。因为这样的智能人类难以理解，所有技术奇点出现后发生的事是不可预测，或者说深不可测的。&amp;lt;ref name=Singularity/&amp;gt;&amp;lt;ref name=&amp;quot;Roberts&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Ray Kurzweil]] has used [[Moore's law]] (which describes the relentless exponential improvement in digital technology) to calculate that [[desktop computer]]s will have the same processing power as human brains by the year 2029, and predicts that the singularity will occur in 2045.&amp;lt;ref name=Singularity/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Ray Kurzweil has used Moore's law (which describes the relentless exponential improvement in digital technology) to calculate that desktop computers will have the same processing power as human brains by the year 2029, and predicts that the singularity will occur in 2045.&lt;br /&gt;
&lt;br /&gt;
雷·库兹韦尔利用摩尔定律(描述了数字技术指数增长的现象)计算出，到2029年，台式电脑的处理能力将与人类大脑相当，并预测奇点将出现在2045年。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
====超人类主义 ====&lt;br /&gt;
&lt;br /&gt;
{{Main|Transhumanism}}&lt;br /&gt;
&lt;br /&gt;
Robot designer [[Hans Moravec]], cyberneticist [[Kevin Warwick]] and inventor [[Ray Kurzweil]] have predicted that humans and machines will merge in the future into [[cyborg]]s that are more capable and powerful than either.&amp;lt;ref name=&amp;quot;Transhumanism&amp;quot;/&amp;gt; This idea, called [[transhumanism]], has roots in [[Aldous Huxley]] and [[Robert Ettinger]].&lt;br /&gt;
&lt;br /&gt;
Robot designer Hans Moravec, cyberneticist Kevin Warwick and inventor Ray Kurzweil have predicted that humans and machines will merge in the future into cyborgs that are more capable and powerful than either. This idea, called transhumanism, has roots in Aldous Huxley and Robert Ettinger.&lt;br /&gt;
&lt;br /&gt;
机器人设计师汉斯·莫拉维克、控制论专家凯文·沃里克和发明家雷·库兹韦尔预言，人类和机器将在未来融合成为比两者都更强的半机器人&amp;lt;ref name=&amp;quot;Transhumanism&amp;quot;/&amp;gt;。这种观点被称为“超人类主义”，这种观点起源于阿道司·赫胥黎和罗伯特•艾廷格。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Edward Fredkin]] argues that &amp;quot;artificial intelligence is the next stage in evolution&amp;quot;, an idea first proposed by [[Samuel Butler (novelist)|Samuel Butler]]'s &amp;quot;[[Darwin among the Machines]]&amp;quot; as far back as 1863, and expanded upon by [[George Dyson (science historian)|George Dyson]] in his book of the same name in 1998.&amp;lt;ref name=&amp;quot;AI as evolution&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Edward Fredkin argues that &amp;quot;artificial intelligence is the next stage in evolution&amp;quot;, an idea first proposed by Samuel Butler's &amp;quot;Darwin among the Machines&amp;quot; as far back as 1863, and expanded upon by George Dyson in his book of the same name in 1998.&lt;br /&gt;
&lt;br /&gt;
爱德华•弗雷德金认为，“人工智能是进化的下一个阶段”。早在1863年，塞缪尔•巴特勒的《机器中的达尔文》(Darwin among the Machines)就首次提出了这一观点，乔治•戴森在1998年的同名著作中对其进行了延伸。&lt;br /&gt;
&lt;br /&gt;
== 经济学 Economics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The long-term economic effects of AI are uncertain. A survey of economists showed disagreement about whether the increasing use of robots and AI will cause a substantial increase in long-term [[unemployment]], but they generally agree that it could be a net benefit, if [[productivity]] gains are [[Redistribution of income and wealth|redistributed]].&amp;lt;ref&amp;gt;{{Cite web|url=http://www.igmchicago.org/surveys/robots-and-artificial-intelligence|title=Robots and Artificial Intelligence|last=|first=|date=|website=www.igmchicago.org|access-date=2019-07-03}}&amp;lt;/ref&amp;gt; A February 2020 European Union white paper on artificial intelligence advocated for artificial intelligence for economic benefits, including &amp;quot;improving healthcare (e.g. making diagnosis more  precise,  enabling  better  prevention  of  diseases), increasing  the  efficiency  of  farming, contributing  to climate  change mitigation  and  adaptation, [and] improving  the  efficiency  of production systems through predictive maintenance&amp;quot;, while acknowledging potential risks.&amp;lt;ref name=&amp;quot;:1&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The long-term economic effects of AI are uncertain. A survey of economists showed disagreement about whether the increasing use of robots and AI will cause a substantial increase in long-term unemployment, but they generally agree that it could be a net benefit, if productivity gains are redistributed. A February 2020 European Union white paper on artificial intelligence advocated for artificial intelligence for economic benefits, including &amp;quot;improving healthcare (e.g. making diagnosis more  precise,  enabling  better  prevention  of  diseases), increasing  the  efficiency  of  farming, contributing  to climate  change mitigation  and  adaptation, [and] improving  the  efficiency  of production systems through predictive maintenance&amp;quot;, while acknowledging potential risks.&lt;br /&gt;
&lt;br /&gt;
人工智能的长期经济效应是不确定的。一项对经济学家的调查显示，在机器人和AI的使用的日益增加是否会导致长期失业率大幅上升的问题上，人们的意见存在分歧。但他们普遍认为，如果生产力提高的成果得到重新分配，也许这也不是一件坏事。2020年2月，欧盟发表了一份关于AI的白皮书，主张为了增加经济利益而使用AI，其中包括“改善医疗保健(例如：使诊断更加精确，能够更好地预防疾病) ，提高耕作效率，为缓解和适应气候变化做出贡献，以及通过预测性维护提高生产系统的效率”，同时也承认AI有潜在风险。&lt;br /&gt;
&lt;br /&gt;
== 规范 Regulation ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Regulation of artificial intelligence|Regulation of algorithms}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The development of public sector policies for promoting and regulating artificial intelligence (AI) is considered necessary to both encourage AI and manage associated risks, but challenging.&amp;lt;ref&amp;gt;{{Cite journal|last=Wirtz|first=Bernd W.|last2=Weyerer|first2=Jan C.|last3=Geyer|first3=Carolin|date=2018-07-24|title=Artificial Intelligence and the Public Sector—Applications and Challenges|journal=International Journal of Public Administration|volume=42|issue=7|pages=596–615|doi=10.1080/01900692.2018.1498103|issn=0190-0692}}&amp;lt;/ref&amp;gt; In 2017 [[Elon Musk]] called for regulation of AI development.&amp;lt;ref&amp;gt;{{cite news|url=https://www.npr.org/sections/thetwo-way/2017/07/17/537686649/elon-musk-warns-governors-artificial-intelligence-poses-existential-risk|title=Elon Musk Warns Governors: Artificial Intelligence Poses 'Existential Risk'|work=NPR.org|accessdate=27 November 2017|language=en}}&amp;lt;/ref&amp;gt; Multiple states now have national policies under development or in place,&amp;lt;ref&amp;gt;{{Cite book|last=Campbell|first=Thomas A.|url=http://www.unicri.it/in_focus/files/Report_AI-An_Overview_of_State_Initiatives_FutureGrasp_7-23-19.pdf|title=Artificial Intelligence: An Overview of State Initiatives|publisher=FutureGrasp, LLC|year=2019|isbn=|location=Evergreen, CO|pages=}}&amp;lt;/ref&amp;gt; and in February 2020, the European Union published its draft strategy paper for promoting and regulating AI.&amp;lt;ref name=&amp;quot;:12&amp;quot;&amp;gt;{{Cite book|last=|first=|url=https://ec.europa.eu/info/sites/info/files/commission-white-paper-artificial-intelligence-feb2020_en.pdf|title=White Paper: On Artificial Intelligence - A European approach to excellence and trust|publisher=European Commission|year=2020|isbn=|location=Brussels|pages=1}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The development of public sector policies for promoting and regulating artificial intelligence (AI) is considered necessary to both encourage AI and manage associated risks, but challenging. In 2017 Elon Musk called for regulation of AI development. Multiple states now have national policies under development or in place, and in February 2020, the European Union published its draft strategy paper for promoting and regulating AI.&lt;br /&gt;
&lt;br /&gt;
促进和规范AI的公共部门政策被认为对鼓励人工智能和控制相关风险是必要的，但具有挑战性。2017年，埃隆 · 马斯克呼吁监管AI的发展。多个国家现在正在制定或实施国家性政策，2020年2月，欧盟公布了促进和管理AI的战略文件草案。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== 小说 In fiction ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Main|Artificial intelligence in fiction}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Capek play.jpg|thumb|The word &amp;quot;robot&amp;quot; itself was coined by [[Karel Čapek]] in his 1921 play ''[[R.U.R.]]'', the title standing for &amp;quot;[[Rossum's Universal Robots]]&amp;quot;“机器人”这个词本身是由[[ 卡雷尔·恰佩克 在他1921年的戏剧《R.U.R》中创造的，剧名代表“Rossum 的万能机器人”(Rossum's Universal Robots)]]]&lt;br /&gt;
&lt;br /&gt;
The word &amp;quot;robot&amp;quot; itself was coined by [[Karel Čapek in his 1921 play R.U.R., the title standing for &amp;quot;Rossum's Universal Robots&amp;quot;]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Thought-capable artificial beings appeared as storytelling devices since antiquity,&amp;lt;ref name=&amp;quot;AI in myth&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Thought-capable artificial beings appeared as storytelling devices since antiquity,&lt;br /&gt;
&lt;br /&gt;
具有思维能力的人造生命在古代故事中出现，在小说中也很常见&lt;br /&gt;
&lt;br /&gt;
and have been a persistent theme in [[science fiction]].&lt;br /&gt;
&lt;br /&gt;
and have been a persistent theme in science fiction.&lt;br /&gt;
&lt;br /&gt;
一直是科幻小说中的一个永恒主题。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A common [[Trope (literature)|trope]] in these works began with [[Mary Shelley]]'s ''[[Frankenstein]]'', where a human creation becomes a threat to its masters. This includes such works as [[2001: A Space Odyssey (novel)|Arthur C. Clarke's]] and [[2001: A Space Odyssey (film)|Stanley Kubrick's]] ''[[2001: A Space Odyssey]]'' (both 1968), with [[HAL 9000]], the murderous computer in charge of the ''[[Discovery One]]'' spaceship, as well as ''[[The Terminator]]'' (1984) and ''[[The Matrix]]'' (1999). In contrast, the rare loyal robots such as Gort from ''[[The Day the Earth Stood Still]]'' (1951) and Bishop from ''[[Aliens (film)|Aliens]]'' (1986) are less prominent in popular culture.&amp;lt;ref&amp;gt;{{cite journal|last1=Buttazzo|first1=G.|title=Artificial consciousness: Utopia or real possibility?|journal=[[Computer (magazine)|Computer]]|date=July 2001|volume=34|issue=7|pages=24–30|doi=10.1109/2.933500|df=dmy-all}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A common trope in these works began with Mary Shelley's Frankenstein, where a human creation becomes a threat to its masters. This includes such works as Arthur C. Clarke's and Stanley Kubrick's 2001: A Space Odyssey (both 1968), with HAL 9000, the murderous computer in charge of the Discovery One spaceship, as well as The Terminator (1984) and The Matrix (1999). In contrast, the rare loyal robots such as Gort from The Day the Earth Stood Still (1951) and Bishop from Aliens (1986) are less prominent in popular culture.&lt;br /&gt;
&lt;br /&gt;
在这些作品中，玛丽 · 雪莱的《弗兰肯斯坦》最先使用了这种常见的比喻 ，在这部作品中，人造物对其主人产生了威胁。这些作品包括亚瑟·查理斯·克拉克斯坦利 · 库布里克的《2001: 太空漫游》(2001: a Space Odyssey，都是1968年出品) ，包括哈尔9000(HAL 9000) ，负责发现一号飞船的凶残计算机，以及《终结者》(The Terminator，1984)和《黑客帝国》(The Matrix，1999)。相比之下，像《地球停止转动的日子》(1951)中的格特和《异形》(1986)中的主教这样罕见的忠诚机器人在流行文化中就不那么突出了。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Isaac Asimov]] introduced the [[Three Laws of Robotics]] in many books and stories, most notably the &amp;quot;Multivac&amp;quot; series about a super-intelligent computer of the same name. Asimov's laws are often brought up during lay discussions of machine ethics;&amp;lt;ref&amp;gt;Anderson, Susan Leigh. &amp;quot;Asimov's &amp;quot;three laws of robotics&amp;quot; and machine metaethics.&amp;quot; AI &amp;amp; Society 22.4 (2008): 477–493.&amp;lt;/ref&amp;gt; while almost all artificial intelligence researchers are familiar with Asimov's laws through popular culture, they generally consider the laws useless for many reasons, one of which is their ambiguity.&amp;lt;ref&amp;gt;{{cite journal | last1 = McCauley | first1 = Lee | year = 2007 | title = AI armageddon and the three laws of robotics | url = | journal = Ethics and Information Technology | volume = 9 | issue = 2| pages = 153–164 | doi=10.1007/s10676-007-9138-2| citeseerx = 10.1.1.85.8904}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Isaac Asimov introduced the Three Laws of Robotics in many books and stories, most notably the &amp;quot;Multivac&amp;quot; series about a super-intelligent computer of the same name. Asimov's laws are often brought up during lay discussions of machine ethics; while almost all artificial intelligence researchers are familiar with Asimov's laws through popular culture, they generally consider the laws useless for many reasons, one of which is their ambiguity.&lt;br /&gt;
&lt;br /&gt;
艾萨克 · 阿西莫夫在许多书籍和故事中介绍了机器人三定律，最著名的是关于同名的“Multitvac”超级智能计算机系列。阿西莫夫定律经常在茶余饭后对机器伦理的讨论中被提起。几乎所有的AI研究人员都通过流行文化熟悉阿西莫夫定律，但他们通常认为这些定律因为许多原因而无用，其中一个原因就是它们的描述过于模糊。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Transhumanism]] (the merging of humans and machines) is explored in the [[manga]] ''[[Ghost in the Shell]]'' and the science-fiction series ''[[Dune (novel)|Dune]]''. In the 1980s, artist [[Hajime Sorayama]]'s Sexy Robots series were painted and published in Japan depicting the actual organic human form with lifelike muscular metallic skins and later &amp;quot;the Gynoids&amp;quot; book followed that was used by or influenced movie makers including [[George Lucas]] and other creatives. Sorayama never considered these organic robots to be real part of nature but always unnatural product of the human mind, a fantasy existing in the mind even when realized in actual form.&lt;br /&gt;
&lt;br /&gt;
Transhumanism (the merging of humans and machines) is explored in the manga Ghost in the Shell and the science-fiction series Dune. In the 1980s, artist Hajime Sorayama's Sexy Robots series were painted and published in Japan depicting the actual organic human form with lifelike muscular metallic skins and later &amp;quot;the Gynoids&amp;quot; book followed that was used by or influenced movie makers including George Lucas and other creatives. Sorayama never considered these organic robots to be real part of nature but always unnatural product of the human mind, a fantasy existing in the mind even when realized in actual form.&lt;br /&gt;
&lt;br /&gt;
漫画《攻壳机动队》(manga Ghost in the Shell)和科幻小说《沙丘》(Dune)探讨了超人类主义(人类和机器的结合)。20世纪80年代，艺术家空山基的性感机器人系列在日本绘制并出版，描绘了真实的有机人类形体，拥有栩栩如生的金属肌肉皮肤，后来又出版了《雌蕊》一书，该书被乔治 · 卢卡斯等电影制作人使用。空山基从来不认为这些有机机器人是自然的一部分，而是非自然的人类心智的产品，一个存在于头脑中，也许能以实体形式实现的幻想。&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Several works use AI to force us to confront the fundamental question of what makes us human, showing us artificial beings that have [[sentience|the ability to feel]], and thus to suffer. This appears in [[Karel Čapek]]'s ''[[R.U.R.]]'', the films ''[[A.I. Artificial Intelligence]]'' and ''[[Ex Machina (film)|Ex Machina]]'', as well as the novel ''[[Do Androids Dream of Electric Sheep?]]'', by [[Philip K. Dick]]. Dick considers the idea that our understanding of human subjectivity is altered by technology created with artificial intelligence.&amp;lt;ref&amp;gt;{{Cite journal|last=Galvan|first=Jill|date=1 January 1997|title=Entering the Posthuman Collective in Philip K. Dick's &amp;quot;Do Androids Dream of Electric Sheep?&amp;quot;|journal=Science Fiction Studies|volume=24|issue=3|pages=413–429|jstor=4240644}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Several works use AI to force us to confront the fundamental question of what makes us human, showing us artificial beings that have the ability to feel, and thus to suffer. This appears in Karel Čapek's R.U.R., the films A.I. Artificial Intelligence and Ex Machina, as well as the novel Do Androids Dream of Electric Sheep?, by Philip K. Dick. Dick considers the idea that our understanding of human subjectivity is altered by technology created with artificial intelligence.&lt;br /&gt;
&lt;br /&gt;
一些作品向我们展示了有感知的能力，因此也有遭受苦难的能力的AI，迫使我们面对是什么让我们成为人类这一根本问题。这些都在卡雷尔 · 阿佩克的电影《AI》、AI和机器人，以及菲利普·K·迪克的小说《机器人会梦见电子羊吗?》中都有出现。迪克认为，AI创造的技术改变了我们对人类主观性的理解。&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==参见 See also==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{portal|Computer programming}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{col div|colwidth=20em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
* [[溯因推理 Abductive reasoning]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* ''[[爱,死亡,机器人 A.I. Rising]]''&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[人工智能武器装备竞赛 Artificial intelligence arms race]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[行为选择算法 Behavior selection algorithm]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[交易处理自动机 Business process automation]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[基于案例的推理 Case-based reasoning]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[常识推理 Commonsense reasoning]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[涌现算法 Emergent algorithm]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[进化计算 Evolutionary computation]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[人工智能技术的女性 Female gendering of AI technologies]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[人工智能术语表 Glossary of artificial intelligence]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[机器学习 Machine learning]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[数学优化 Mathematical optimization]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[多主体系统 Multi-agent system]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[个性化计算 Personality computing]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[人工智能规范 Regulation of artificial intelligence]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[机器处理自动机 Robotic process automation]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[通用基础收入 Universal basic income]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[弱人工智能Weak AI]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{colend}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==解释说明 Explanatory notes ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{notelist}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==参考资料 References ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{reflist|30em|refs=&lt;br /&gt;
&lt;br /&gt;
{{reflist|30em|refs=&lt;br /&gt;
&lt;br /&gt;
{通货再膨胀 | 30em | 参考文献&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- INTRODUCTION ------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- INTRODUCTION ------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-- 引言——————————————————————————————————————————————————————————————————————————————&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Definition of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Definition of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”人工智能的定义”&lt;br /&gt;
&lt;br /&gt;
Definition of AI as the study of [[intelligent agents]]:&lt;br /&gt;
&lt;br /&gt;
Definition of AI as the study of intelligent agents:&lt;br /&gt;
&lt;br /&gt;
将人工智能定义为对智能体的研究:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|loc=[http://people.cs.ubc.ca/~poole/ci/ch1.pdf p. 1]}}, which provides the version that is used in this article. Note that they use the term &amp;quot;computational intelligence&amp;quot; as a synonym for artificial intelligence.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvtxt|Russell|Norvig|2003}} (who prefer the term &amp;quot;rational agent&amp;quot;) and write &amp;quot;The whole-agent view is now widely accepted in the field&amp;quot; {{Harv|Russell|Norvig|2003|p=55}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--These textbooks are the most widely used in academic AI.--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--These textbooks are the most widely used in academic AI.--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
这些教科书是学术上使用最广泛的&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Legg|Hutter|2007}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &amp;lt;ref name=&amp;quot;Coining of the term AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &amp;lt;ref name=&amp;quot;Coining of the term AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
!-参考名称“ ai”一词的创造力&lt;br /&gt;
&lt;br /&gt;
Although there is some controversy on this point (see {{Harvtxt|Crevier|1993|p=50}}), [[John McCarthy (computer scientist)|McCarthy]] states unequivocally &amp;quot;I came up with the term&amp;quot; in a c|net interview. {{Harv|Skillings|2006}} McCarthy first used the term in the proposal for the Dartmouth conference, which appeared in 1955. {{Harv|McCarthy|Minsky|Rochester|Shannon|1955}}&lt;br /&gt;
&lt;br /&gt;
Although there is some controversy on this point (see ), McCarthy states unequivocally &amp;quot;I came up with the term&amp;quot; in a c|net interview.  McCarthy first used the term in the proposal for the Dartmouth conference, which appeared in 1955. &lt;br /&gt;
&lt;br /&gt;
虽然在这一点上有一些争议(见) ，麦卡锡明确声明“我想出了这个词”在 c | net 采访。麦卡锡在1955年达特茅斯会议的提案中首次使用了这个词。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ ref --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &amp;lt;ref name=&amp;quot;McCarthy's definition of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &amp;lt;ref name=&amp;quot;McCarthy's definition of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
!-参考名称“麦卡锡的 ai”的定义&lt;br /&gt;
&lt;br /&gt;
[[John McCarthy (computer scientist)|McCarthy]]'s definition of AI:&lt;br /&gt;
&lt;br /&gt;
McCarthy's definition of AI:&lt;br /&gt;
&lt;br /&gt;
麦卡锡对人工智能的定义是:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCarthy|2007}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ ref --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;McCorduck's thesis&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;McCorduck's thesis&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
「麦考达克的论文」&lt;br /&gt;
&lt;br /&gt;
This is a central idea of [[Pamela McCorduck]]'s ''Machines Who Think''. She writes: &amp;quot;I like to think of artificial intelligence as the scientific apotheosis of a venerable cultural tradition.&amp;quot; {{Harv|McCorduck|2004|p=34}} &amp;quot;Artificial intelligence in one form or another is an idea that has pervaded Western intellectual history, a dream in urgent need of being realized.&amp;quot; {{Harv|McCorduck|2004|p=xviii}} &amp;quot;Our history is full of attempts—nutty, eerie, comical, earnest, legendary and real—to make artificial intelligences, to reproduce what is the essential us—bypassing the ordinary means. Back and forth between myth and reality, our imaginations supplying what our workshops couldn't, we have engaged for a long time in this odd form of self-reproduction.&amp;quot; {{Harv|McCorduck|2004|p=3}} She traces the desire back to its [[Hellenistic]] roots and calls it the urge to &amp;quot;forge the Gods.&amp;quot; {{Harv|McCorduck|2004|pp=340–400}}&lt;br /&gt;
&lt;br /&gt;
This is a central idea of Pamela McCorduck's Machines Who Think. She writes: &amp;quot;I like to think of artificial intelligence as the scientific apotheosis of a venerable cultural tradition.&amp;quot;  &amp;quot;Artificial intelligence in one form or another is an idea that has pervaded Western intellectual history, a dream in urgent need of being realized.&amp;quot;  &amp;quot;Our history is full of attempts—nutty, eerie, comical, earnest, legendary and real—to make artificial intelligences, to reproduce what is the essential us—bypassing the ordinary means. Back and forth between myth and reality, our imaginations supplying what our workshops couldn't, we have engaged for a long time in this odd form of self-reproduction.&amp;quot;  She traces the desire back to its Hellenistic roots and calls it the urge to &amp;quot;forge the Gods.&amp;quot; &lt;br /&gt;
&lt;br /&gt;
这是帕梅拉 · 麦考达克的《会思考的机器》的中心思想。她写道: “我喜欢把人工智能看作是古老文化传统的科学典范。”“以这样或那样的形式出现的人工智能是一个弥漫在西方思想史上的思想，一个急需实现的梦想。”“我们的历史充满了各种各样的尝试——疯狂的、怪诞的、滑稽的、严肃的、传奇的和真实的——创造人工智能，复制本质上的我们，绕过普通的手段。在神话和现实之间来回穿梭，我们的想象力提供了我们的工作室所不能提供的东西，我们长期以来一直致力于这种奇怪的自我复制形式。”她将这种欲望追溯到希腊化的根源，并称之为“锻造上帝”的冲动&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Fragmentation of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Fragmentation of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Ai 碎片化运动&lt;br /&gt;
&lt;br /&gt;
Pamela {{Harvtxt|McCorduck|2004|p=424}} writes of &amp;quot;the rough shattering of AI in subfields—vision, natural language, decision theory, genetic algorithms, robotics&amp;amp;nbsp;... and these with own sub-subfield—that would hardly have anything to say to each other.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Pamela  writes of &amp;quot;the rough shattering of AI in subfields—vision, natural language, decision theory, genetic algorithms, robotics&amp;amp;nbsp;... and these with own sub-subfield—that would hardly have anything to say to each other.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
帕梅拉写道，“人工智能在子领域——视觉、自然语言、决策理论、遗传算法、机器人... ... 以及这些有自己子领域的领域——受到了粗暴的打击，彼此之间几乎没有什么可说的。”&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Problems of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Problems of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Ai 的问题&lt;br /&gt;
&lt;br /&gt;
This list of intelligent traits is based on the topics covered by the major AI textbooks, including:&lt;br /&gt;
&lt;br /&gt;
This list of intelligent traits is based on the topics covered by the major AI textbooks, including:&lt;br /&gt;
&lt;br /&gt;
这个智能特征列表是基于主要的人工智能教科书所涉及的主题，包括:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;General intelligence&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;General intelligence&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
通用情报局&lt;br /&gt;
&lt;br /&gt;
General intelligence ([[artificial general intelligence|strong AI]]) is discussed in popular introductions to AI:&lt;br /&gt;
&lt;br /&gt;
General intelligence (strong AI) is discussed in popular introductions to AI:&lt;br /&gt;
&lt;br /&gt;
一般智能(强人工智能)在人工智能的常见介绍中被讨论:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Kurzweil|1999}} and {{Harvnb|Kurzweil|2005}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- History ---------------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- History ---------------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-- 历史——————————————————————————————————————————————————————————————————————————————————————————————&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in myth&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in myth&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
神话中的人工智能&lt;br /&gt;
&lt;br /&gt;
AI in myth:&lt;br /&gt;
&lt;br /&gt;
AI in myth:&lt;br /&gt;
&lt;br /&gt;
神话中的人工智能:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=4–5}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=939}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in early science fiction&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in early science fiction&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
早期科幻小说中的人工智能&lt;br /&gt;
&lt;br /&gt;
AI in early science fiction.&lt;br /&gt;
&lt;br /&gt;
AI in early science fiction.&lt;br /&gt;
&lt;br /&gt;
早期科幻小说中的人工智能。&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=17–25}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Formal reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Formal reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”正式推理”&lt;br /&gt;
&lt;br /&gt;
Formal reasoning:&lt;br /&gt;
&lt;br /&gt;
Formal reasoning:&lt;br /&gt;
&lt;br /&gt;
正式推理:&lt;br /&gt;
&lt;br /&gt;
* {{cite book | first = David | last = Berlinski | year = 2000 | title = The Advent of the Algorithm | publisher = Harcourt Books | author-link = David Berlinski | isbn = 978-0-15-601391-8 | oclc = 46890682 | url = https://archive.org/details/adventofalgorith0000berl }}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;{{page needed|date=December 2016}}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI's immediate precursors&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI's immediate precursors&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
人工智能的直接前兆&lt;br /&gt;
&lt;br /&gt;
AI's immediate precursors:&lt;br /&gt;
&lt;br /&gt;
AI's immediate precursors:&lt;br /&gt;
&lt;br /&gt;
大赦国际的直接前身是:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=51–107}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=27–32}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=15, 940}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Moravec|1988|p=3}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
See also {{slink|History of artificial intelligence|Cybernetics and early neural networks}}. Among the researchers who laid the foundations of AI were [[Alan Turing]], [[John von Neumann]], [[Norbert Wiener]], [[Claude Shannon]], [[Warren McCullough]], [[Walter Pitts]] and [[Donald Hebb]].&amp;lt;ref name=&amp;quot;Dartmouth conference&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
See also . Among the researchers who laid the foundations of AI were Alan Turing, John von Neumann, Norbert Wiener, Claude Shannon, Warren McCullough, Walter Pitts and Donald Hebb.&amp;lt;ref name=&amp;quot;Dartmouth conference&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
参见。在奠定人工智能基础的研究人员中，有 Alan Turing，约翰·冯·诺伊曼，Norbert Wiener，Claude Shannon，Warren McCullough，Walter Pitts 和 Donald Hebb。 达特茅斯会议」&lt;br /&gt;
&lt;br /&gt;
[[Dartmouth Workshop|Dartmouth conference]]:&lt;br /&gt;
&lt;br /&gt;
Dartmouth conference:&lt;br /&gt;
&lt;br /&gt;
返回文章页面达特茅斯大会:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=111–136}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=47–49}}, who writes &amp;quot;the conference is generally recognized as the official birthdate of the new science.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=17}}, who call the conference &amp;quot;the birth of artificial intelligence.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|NRC|1999|pp=200–201}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Hegemony of the Dartmouth conference attendees&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Hegemony of the Dartmouth conference attendees&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
达特茅斯会议与会者的霸权&lt;br /&gt;
&lt;br /&gt;
Hegemony of the Dartmouth conference attendees:&lt;br /&gt;
&lt;br /&gt;
Hegemony of the Dartmouth conference attendees:&lt;br /&gt;
&lt;br /&gt;
达特茅斯大会与会者的霸权:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=17}}, who write &amp;quot;for the next 20 years the field would be dominated by these people and their students.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=129–130}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Golden years of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Golden years of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
黄金人工智能时代&lt;br /&gt;
&lt;br /&gt;
&amp;quot;[[History of AI#The golden years 1956–1974|Golden years]]&amp;quot; of AI (successful symbolic reasoning programs 1956–1973):&lt;br /&gt;
&lt;br /&gt;
&amp;quot;Golden years&amp;quot; of AI (successful symbolic reasoning programs 1956–1973):&lt;br /&gt;
&lt;br /&gt;
人工智能的“黄金年代”(1956-1973年成功的符号推理程序) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=243–252}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=52–107}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Moravec|1988|p=9}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=18–21}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The programs described are [[Arthur Samuel]]'s checkers program for the [[IBM 701]], [[Daniel Bobrow]]'s [[STUDENT (computer program)|STUDENT]], [[Allen Newell|Newell]] and [[Herbert A. Simon|Simon]]'s [[Logic Theorist]] and [[Terry Winograd]]'s [[SHRDLU]].&lt;br /&gt;
&lt;br /&gt;
The programs described are Arthur Samuel's checkers program for the IBM 701, Daniel Bobrow's STUDENT, Newell and Simon's Logic Theorist and Terry Winograd's SHRDLU.&lt;br /&gt;
&lt;br /&gt;
所描述的程序有: Arthur Samuel 为 IBM 701设计的检查程序，Daniel Bobrow 的学生，Newell 和 Simon 的逻辑理论家，以及 Terry Winograd 的 SHRDLU。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI funding in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI funding in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
60年代的人工智能资金&lt;br /&gt;
&lt;br /&gt;
[[DARPA]] pours money into undirected pure research into AI during the 1960s:&lt;br /&gt;
&lt;br /&gt;
DARPA pours money into undirected pure research into AI during the 1960s:&lt;br /&gt;
&lt;br /&gt;
20世纪60年代，美国国防部高级研究计划局(DARPA)将资金投入到对人工智能的无目的的纯粹研究中:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|p=131}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=51, 64–65}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|NRC|1999|pp=204–205}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in England&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in England&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在英国的「 ai 」&lt;br /&gt;
&lt;br /&gt;
AI in England:&lt;br /&gt;
&lt;br /&gt;
AI in England:&lt;br /&gt;
&lt;br /&gt;
英国的人工智能:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Howe|1994}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Optimism of early AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Optimism of early AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
早期 ai 的乐观主义&lt;br /&gt;
&lt;br /&gt;
Optimism of early AI:&lt;br /&gt;
&lt;br /&gt;
Optimism of early AI:&lt;br /&gt;
&lt;br /&gt;
早期人工智能的乐观主义:&lt;br /&gt;
&lt;br /&gt;
* [[Herbert A. Simon|Herbert Simon]] quote: {{Harvnb|Simon|1965|p=96}} quoted in {{Harvnb|Crevier|1993|p=109}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[Marvin Minsky]] quote: {{Harvnb|Minsky|1967|p=2}} quoted in {{Harvnb|Crevier|1993|p=109}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;First AI winter&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;First AI winter&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
第一 ai 温特”&lt;br /&gt;
&lt;br /&gt;
First [[AI Winter]], [[Mansfield Amendment]], [[Lighthill report]]&lt;br /&gt;
&lt;br /&gt;
First AI Winter, Mansfield Amendment, Lighthill report&lt;br /&gt;
&lt;br /&gt;
第一人工智能冬季，曼斯菲尔德修正案，莱特希尔报告&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=115–117}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=22}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|NRC|1999|pp=212–213}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Howe|1994}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Newquist|1994|pp=189–201}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Expert systems&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Expert systems&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
专家系统”&lt;br /&gt;
&lt;br /&gt;
Expert systems:&lt;br /&gt;
&lt;br /&gt;
Expert systems:&lt;br /&gt;
&lt;br /&gt;
专家系统:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=I.2.1}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=22–24}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=227–331}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 17.4}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=327–335, 434–435}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=145–62, 197–203}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Newquist|1994|pp=155–183}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in the 80s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in the 80s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
80年代的「人工智能」&lt;br /&gt;
&lt;br /&gt;
Boom of the 1980s: rise of [[expert systems]], [[Fifth generation computer|Fifth Generation Project]], [[Alvey]], [[Microelectronics and Computer Technology Corporation|MCC]], [[Strategic Computing Initiative|SCI]]:&lt;br /&gt;
&lt;br /&gt;
Boom of the 1980s: rise of expert systems, Fifth Generation Project, Alvey, MCC, SCI:&lt;br /&gt;
&lt;br /&gt;
20世纪80年代的繁荣: 专家系统的兴起，第五代计划，Alvey，MCC，SCI:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=426–441}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=161–162,197–203, 211, 240}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=24}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|NRC|1999|pp=210–211}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Newquist|1994|pp=235–248}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Second AI winter&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Second AI winter&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
二 ai 温特”&lt;br /&gt;
&lt;br /&gt;
Second [[AI winter]]:&lt;br /&gt;
&lt;br /&gt;
Second AI winter:&lt;br /&gt;
&lt;br /&gt;
第二个 AI 冬天:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=430–435}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=209–210}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|NRC|1999|pp=214–216}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Newquist|1994|pp=301–318}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Formal methods in AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Formal methods in AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
正式的方法在 ai&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Formal methods are now preferred (&amp;quot;Victory of the [[neats vs. scruffies|neats]]&amp;quot;):&lt;br /&gt;
&lt;br /&gt;
Formal methods are now preferred (&amp;quot;Victory of the neats&amp;quot;):&lt;br /&gt;
&lt;br /&gt;
现在更倾向于使用正式的方法(“近亲的胜利”) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=25–26}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=486–487}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI widely used&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI widely used&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
广泛使用的人工智能&lt;br /&gt;
&lt;br /&gt;
AI applications widely used behind the scenes:&lt;br /&gt;
&lt;br /&gt;
AI applications widely used behind the scenes:&lt;br /&gt;
&lt;br /&gt;
在幕后广泛使用的人工智能应用:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=28}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Kurzweil|2005|p=265}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|NRC|1999|pp=216–222}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Newquist|1994|pp=189–201}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in 2000s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI in 2000s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2000年代的人工智能&lt;br /&gt;
&lt;br /&gt;
AI becomes hugely successful in the early 21st century&lt;br /&gt;
&lt;br /&gt;
AI becomes hugely successful in the early 21st century&lt;br /&gt;
&lt;br /&gt;
人工智能在21世纪初取得了巨大的成功&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Clark|2015}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- PROBLEMS ------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- PROBLEMS ------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——问题——————————————————————————————————————————————————————————————————————————————————————&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
推理推理&lt;br /&gt;
&lt;br /&gt;
Problem solving, puzzle solving, game playing and deduction:&lt;br /&gt;
&lt;br /&gt;
Problem solving, puzzle solving, game playing and deduction:&lt;br /&gt;
&lt;br /&gt;
解决问题，解决难题，玩游戏和演绎:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|loc=chpt. 3–9}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|loc=chpt. 2,3,7,9}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|loc=chpt. 3,4,6,8}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 7–12}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Uncertain reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Uncertain reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
不确定推理“&lt;br /&gt;
&lt;br /&gt;
Uncertain reasoning:&lt;br /&gt;
&lt;br /&gt;
Uncertain reasoning:&lt;br /&gt;
&lt;br /&gt;
不确定的推理:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=452–644}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=345–395}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=333–381}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 19}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Intractability&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Intractability&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反对者名字“棘手”&lt;br /&gt;
&lt;br /&gt;
[[Intractably|Intractability and efficiency]] and the [[combinatorial explosion]]:&lt;br /&gt;
&lt;br /&gt;
Intractability and efficiency and the combinatorial explosion:&lt;br /&gt;
&lt;br /&gt;
难以驾驭的效率和组合爆炸:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=9, 21–22}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Psychological evidence of sub-symbolic reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Psychological evidence of sub-symbolic reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
亚符号推理的心理学证据”&lt;br /&gt;
&lt;br /&gt;
Psychological evidence of sub-symbolic reasoning:&lt;br /&gt;
&lt;br /&gt;
Psychological evidence of sub-symbolic reasoning:&lt;br /&gt;
&lt;br /&gt;
子符号推理的心理学证据:&lt;br /&gt;
&lt;br /&gt;
* {{Harvtxt|Wason|Shapiro|1966}} showed that people do poorly on completely abstract problems, but if the problem is restated to allow the use of intuitive [[social intelligence]], performance dramatically improves. (See [[Wason selection task]])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvtxt|Kahneman|Slovic|Tversky|1982}} have shown that people are terrible at elementary problems that involve uncertain reasoning. (See [[list of cognitive biases]] for several examples).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvtxt|Lakoff|Núñez|2000}} have controversially argued that even our skills at mathematics depend on knowledge and skills that come from &amp;quot;the body&amp;quot;, i.e. sensorimotor and perceptual skills. (See [[Where Mathematics Comes From]])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Knowledge representation&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Knowledge representation&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
知识表达&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Knowledge representation]]:&lt;br /&gt;
&lt;br /&gt;
Knowledge representation:&lt;br /&gt;
&lt;br /&gt;
知识表示:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=I.2.4}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=320–363}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=23–46, 69–81, 169–196, 235–277, 281–298, 319–345}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=227–243}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 18}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Knowledge engineering&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Knowledge engineering&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
知识工程学&lt;br /&gt;
&lt;br /&gt;
[[Knowledge engineering]]:&lt;br /&gt;
&lt;br /&gt;
Knowledge engineering:&lt;br /&gt;
&lt;br /&gt;
知识工程:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=260–266}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=199–233}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. ≈17.1–17.4}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Representing categories and relations&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Representing categories and relations&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
代表类别和关系&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Representing categories and relations: [[Semantic network]]s, [[description logic]]s, [[inheritance (computer science)|inheritance]] (including [[frame (artificial intelligence)|frames]] and [[scripts (artificial intelligence)|scripts]]):&lt;br /&gt;
&lt;br /&gt;
Representing categories and relations: Semantic networks, description logics, inheritance (including frames and scripts):&lt;br /&gt;
&lt;br /&gt;
表示类别和关系: 语义网络，描述逻辑，继承(包括框架和脚本) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=349–354}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=174–177}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=248–258}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 18.3}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Representing time&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Representing time&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
代表时间”&lt;br /&gt;
&lt;br /&gt;
Representing events and time:[[Situation calculus]], [[event calculus]], [[fluent calculus]] (including solving the [[frame problem]]):&lt;br /&gt;
&lt;br /&gt;
Representing events and time:Situation calculus, event calculus, fluent calculus (including solving the frame problem):&lt;br /&gt;
&lt;br /&gt;
表示事件和时间: 情境演算、事件演算、流演算(包括解决框架问题) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=328–341}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=281–298}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 18.2}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Representing causation&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Representing causation&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
代表因果关系”&lt;br /&gt;
&lt;br /&gt;
[[Causality#Causal calculus|Causal calculus]]:&lt;br /&gt;
&lt;br /&gt;
Causal calculus:&lt;br /&gt;
&lt;br /&gt;
因果演算:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=335–337}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Representing knowledge about knowledge&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Representing knowledge about knowledge&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
代表知识的知识”&lt;br /&gt;
&lt;br /&gt;
Representing knowledge about knowledge: Belief calculus, [[modal logic]]s:&lt;br /&gt;
&lt;br /&gt;
Representing knowledge about knowledge: Belief calculus, modal logics:&lt;br /&gt;
&lt;br /&gt;
代表知识的知识: 信念演算，模态逻辑:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=341–344}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=275–277}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Ontology&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Ontology&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Ref name&amp;quot;ontology&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Ontology (computer science)|Ontology]]:&lt;br /&gt;
&lt;br /&gt;
Ontology:&lt;br /&gt;
&lt;br /&gt;
本体论:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=320–328}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Qualification problem&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Qualification problem&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
资格问题&lt;br /&gt;
&lt;br /&gt;
[[Qualification problem]]:&lt;br /&gt;
&lt;br /&gt;
Qualification problem:&lt;br /&gt;
&lt;br /&gt;
资格问题:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCarthy|Hayes|1969}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003}}{{Page needed|date=February 2011}}&amp;lt;!-- We really need to know where they say this, because it's kind of wrong --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
While McCarthy was primarily concerned with issues in the logical representation of actions, {{Harvnb|Russell|Norvig|2003}} apply the term to the more general issue of default reasoning in the vast network of assumptions underlying all our commonsense knowledge.&lt;br /&gt;
&lt;br /&gt;
While McCarthy was primarily concerned with issues in the logical representation of actions,  apply the term to the more general issue of default reasoning in the vast network of assumptions underlying all our commonsense knowledge.&lt;br /&gt;
&lt;br /&gt;
麦卡锡主要关注的是行为的逻辑表达问题，而把这个术语应用到我们所有常识知识背后庞大的假设网络中更为普遍的缺省推理问题上。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Default reasoning and non-monotonic logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Default reasoning and non-monotonic logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
违约推理和非单调逻辑&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Default reasoning and [[default logic]], [[non-monotonic logic]]s, [[circumscription (logic)|circumscription]], [[closed world assumption]], [[abductive reasoning|abduction]] (Poole ''et al.'' places abduction under &amp;quot;default reasoning&amp;quot;. Luger ''et al.'' places this under &amp;quot;uncertain reasoning&amp;quot;):&lt;br /&gt;
&lt;br /&gt;
Default reasoning and default logic, non-monotonic logics, circumscription, closed world assumption, abduction (Poole et al. places abduction under &amp;quot;default reasoning&amp;quot;. Luger et al. places this under &amp;quot;uncertain reasoning&amp;quot;):&lt;br /&gt;
&lt;br /&gt;
缺省推理和缺省逻辑，非单调逻辑，界限，封闭世界假设，溯因(Poole 等。把绑架放在”缺省推理”下。鲁格尔等人。将其归类为“不确定推理”) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=354–360}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=248–256, 323–335}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=335–363}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=~18.3.3}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Breadth of commonsense knowledge&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Breadth of commonsense knowledge&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
常识的广度知识”&lt;br /&gt;
&lt;br /&gt;
Breadth of commonsense knowledge:&lt;br /&gt;
&lt;br /&gt;
Breadth of commonsense knowledge:&lt;br /&gt;
&lt;br /&gt;
常识知识的广度:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=21}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=113–114}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Moravec|1988|p=13}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Lenat|Guha|1989}} (Introduction)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Intuition&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Intuition&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
直觉&lt;br /&gt;
&lt;br /&gt;
Expert knowledge as [[embodied cognition|embodied]] intuition:&lt;br /&gt;
&lt;br /&gt;
Expert knowledge as embodied intuition:&lt;br /&gt;
&lt;br /&gt;
体现直觉的专业知识:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Dreyfus|Dreyfus|1986}} ([[Hubert Dreyfus]] is a philosopher and critic of AI who was among the first to argue that most useful human knowledge was encoded sub-symbolically. See [[Dreyfus' critique of AI]])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Gladwell|2005}} (Gladwell's ''[[Blink (book)|Blink]]'' is a popular introduction to sub-symbolic reasoning and knowledge.)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Hawkins|Blakeslee|2005}} (Hawkins argues that sub-symbolic knowledge should be the primary focus of AI research.)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Planning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Planning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”计划”组织&lt;br /&gt;
&lt;br /&gt;
[[automated planning and scheduling|Planning]]:&lt;br /&gt;
&lt;br /&gt;
Planning:&lt;br /&gt;
&lt;br /&gt;
规划:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=~I.2.8}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp= 375–459}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=281–316}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=314–329}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 10.1–2, 22}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Information value theory&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Information value theory&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
信息价值理论”&lt;br /&gt;
&lt;br /&gt;
[[Applied information economics|Information value theory]]:&lt;br /&gt;
&lt;br /&gt;
Information value theory:&lt;br /&gt;
&lt;br /&gt;
信息价值理论:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=600–604}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Classical planning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Classical planning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”古典计划”&lt;br /&gt;
&lt;br /&gt;
Classical planning:&lt;br /&gt;
&lt;br /&gt;
Classical planning:&lt;br /&gt;
&lt;br /&gt;
经典的规划:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=375–430}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=281–315}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=314–329}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 10.1–2, 22}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Non-deterministic planning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Non-deterministic planning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
非确定性计划”&lt;br /&gt;
&lt;br /&gt;
Planning and acting in non-deterministic domains: conditional planning, execution monitoring, replanning and continuous planning:&lt;br /&gt;
&lt;br /&gt;
Planning and acting in non-deterministic domains: conditional planning, execution monitoring, replanning and continuous planning:&lt;br /&gt;
&lt;br /&gt;
计划和行动在非确定性领域: 有条件的计划，执行监控，重新计划和持续计划:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=430–449}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Multi-agent planning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Multi-agent planning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
多智能体计划&lt;br /&gt;
&lt;br /&gt;
Multi-agent planning and emergent behavior:&lt;br /&gt;
&lt;br /&gt;
Multi-agent planning and emergent behavior:&lt;br /&gt;
&lt;br /&gt;
多智能体计划与应急行为:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=449–455}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Machine learning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Machine learning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
机器学习“&lt;br /&gt;
&lt;br /&gt;
[[machine learning|Learning]]:&lt;br /&gt;
&lt;br /&gt;
Learning:&lt;br /&gt;
&lt;br /&gt;
学习:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=I.2.6}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=649–788}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=397–438}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=385–542}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 3.3, 10.3, 17.5, 20}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Reinforcement learning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Reinforcement learning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
强化学习&lt;br /&gt;
&lt;br /&gt;
[[Reinforcement learning]]:&lt;br /&gt;
&lt;br /&gt;
Reinforcement learning:&lt;br /&gt;
&lt;br /&gt;
强化学习&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=763–788}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=442–449}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Natural language processing&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Natural language processing&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
自然语言处理&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Natural language processing]]:&lt;br /&gt;
&lt;br /&gt;
Natural language processing:&lt;br /&gt;
&lt;br /&gt;
自然语言处理:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=I.2.7}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=790–831}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=91–104}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=591–632}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Applications of natural language processing&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Applications of natural language processing&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
自然语言处理应用程序”&lt;br /&gt;
&lt;br /&gt;
Applications of natural language processing, including [[information retrieval]] (i.e. [[text mining]]) and [[machine translation]]:&lt;br /&gt;
&lt;br /&gt;
Applications of natural language processing, including information retrieval (i.e. text mining) and machine translation:&lt;br /&gt;
&lt;br /&gt;
自然语言处理的应用，包括信息检索(即。文本挖掘和机器翻译:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=840–857}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=623–630}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Robotics&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Robotics&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
机器人公司”&lt;br /&gt;
&lt;br /&gt;
[[Robotic]]s:&lt;br /&gt;
&lt;br /&gt;
Robotics:&lt;br /&gt;
&lt;br /&gt;
Robotics:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=I.2.9}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=901–942}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=443–460}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Configuration space&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Configuration space&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
配置空间”&lt;br /&gt;
&lt;br /&gt;
Moving and [[Configuration space (physics)|configuration space]]:&lt;br /&gt;
&lt;br /&gt;
Moving and configuration space:&lt;br /&gt;
&lt;br /&gt;
移动和位形空间:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=916–932}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Robotic mapping&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Robotic mapping&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
机器人测绘网&lt;br /&gt;
&lt;br /&gt;
[[Robotic mapping]] (localization, etc):&lt;br /&gt;
&lt;br /&gt;
Robotic mapping (localization, etc):&lt;br /&gt;
&lt;br /&gt;
机器人绘图(本地化等) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=908–915}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Machine perception&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Machine perception&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”机器感知”&lt;br /&gt;
&lt;br /&gt;
[[Machine perception]]:&lt;br /&gt;
&lt;br /&gt;
Machine perception:&lt;br /&gt;
&lt;br /&gt;
机器感知:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=537–581, 863–898}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=~chpt. 6}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Computer vision&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Computer vision&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”计算机视觉”&lt;br /&gt;
&lt;br /&gt;
[[Computer vision]]:&lt;br /&gt;
&lt;br /&gt;
Computer vision:&lt;br /&gt;
&lt;br /&gt;
电脑视觉:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=I.2.10}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=863–898}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 6}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Speech recognition&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Speech recognition&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”语音识别”&lt;br /&gt;
&lt;br /&gt;
[[Speech recognition]]:&lt;br /&gt;
&lt;br /&gt;
Speech recognition:&lt;br /&gt;
&lt;br /&gt;
语音识别:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=~I.2.7}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=568–578}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Object recognition&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Object recognition&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
对象识别”&lt;br /&gt;
&lt;br /&gt;
[[Object recognition]]:&lt;br /&gt;
&lt;br /&gt;
Object recognition:&lt;br /&gt;
&lt;br /&gt;
物体识别:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=885–892}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Emotion and affective computing&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Emotion and affective computing&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
情感与情感计算”&lt;br /&gt;
&lt;br /&gt;
Emotion and [[affective computing]]:&lt;br /&gt;
&lt;br /&gt;
Emotion and affective computing:&lt;br /&gt;
&lt;br /&gt;
情感与情感计算:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Minsky|2006}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&amp;lt;ref name=&amp;quot;Artificial consciousness&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&amp;lt;ref name=&amp;quot;Artificial consciousness&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
!-参考名称“人工意识”&lt;br /&gt;
&lt;br /&gt;
[[Gerald Edelman]], [[Igor Aleksander]] and others have argued that [[artificial consciousness]] is required for strong AI. ({{Harvnb|Aleksander|1995}}; {{Harvnb|Edelman|2007}})&lt;br /&gt;
&lt;br /&gt;
Gerald Edelman, Igor Aleksander and others have argued that artificial consciousness is required for strong AI. (; )&lt;br /&gt;
&lt;br /&gt;
杰拉尔德埃德尔曼，伊戈尔亚历山大和其他人认为，人工意识是强大的人工智能所必需的。(; )&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;ref name=&amp;quot;Brain simulation&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;&amp;lt;ref name=&amp;quot;Brain simulation&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”大脑模拟”&lt;br /&gt;
&lt;br /&gt;
[[Artificial brain]] arguments: AI requires a simulation of the operation of the human brain&lt;br /&gt;
&lt;br /&gt;
Artificial brain arguments: AI requires a simulation of the operation of the human brain&lt;br /&gt;
&lt;br /&gt;
人工大脑的论点: 人工智能需要模拟人脑的运作&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=957}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=271 and 279}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A few of the people who make some form of the argument:&lt;br /&gt;
&lt;br /&gt;
A few of the people who make some form of the argument:&lt;br /&gt;
&lt;br /&gt;
一些提出某种论点的人:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Moravec|1988}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Kurzweil|2005|p=262}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Hawkins|Blakeslee|2005}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The most extreme form of this argument (the brain replacement scenario) was put forward by [[Clark Glymour]] in the mid-1970s and was touched on by [[Zenon Pylyshyn]] and [[John Searle]] in 1980.&lt;br /&gt;
&lt;br /&gt;
The most extreme form of this argument (the brain replacement scenario) was put forward by Clark Glymour in the mid-1970s and was touched on by Zenon Pylyshyn and John Searle in 1980.&lt;br /&gt;
&lt;br /&gt;
这种观点(大脑替代情景)最极端的形式是克拉克•格莱莫尔(Clark Glymour)在上世纪70年代中期提出的，泽农•派利辛(Zenon Pylyshyn)和约翰•塞尔(John Searle)在1980年提出了这一观点。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- unused ref&amp;lt;ref name=&amp;quot;AI complete&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- unused ref&amp;lt;ref name=&amp;quot;AI complete&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! -- 未使用的 ref name&amp;quot;ai complete&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[AI complete]]: {{Harvnb|Shapiro|1992|p=9}}&lt;br /&gt;
&lt;br /&gt;
AI complete: &lt;br /&gt;
&lt;br /&gt;
人工智能完成:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ ref --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- APPROACHES -----------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- APPROACHES -----------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
——方法—————————————————————————————————————————————————————————————————————————————————— --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Biological intelligence vs. intelligence in general&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Biological intelligence vs. intelligence in general&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
生物智能对抗一般智能&lt;br /&gt;
&lt;br /&gt;
Biological intelligence vs. intelligence in general:&lt;br /&gt;
&lt;br /&gt;
Biological intelligence vs. intelligence in general:&lt;br /&gt;
&lt;br /&gt;
生物智能 vs 一般智能:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=2–3}}, who make the analogy with [[aeronautical engineering]].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=100–101}}, who writes that there are &amp;quot;two major branches of artificial intelligence: one aimed at producing intelligent behavior regardless of how it was accomplished, and the other aimed at modeling intelligent processes found in nature, particularly human ones.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Kolata|1982}}, a paper in ''[[Science (journal)|Science]]'', which describes [[John McCarthy (computer scientist)|McCarthy's]] indifference to biological models. Kolata quotes McCarthy as writing: &amp;quot;This is AI, so we don't care if it's psychologically real&amp;quot;{{cite web |url=https://books.google.com/books?id=PEkqAAAAMAAJ|title=Science|date=August 1982}}. McCarthy recently reiterated his position at the [[AI@50]] conference where he said &amp;quot;Artificial intelligence is not, by definition, simulation of human intelligence&amp;quot; {{Harv|Maker|2006}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Neats vs. scruffies&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Neats vs. scruffies&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
裁判名称“ neats vs. scruffies”&lt;br /&gt;
&lt;br /&gt;
[[Neats vs. scruffies]]:&lt;br /&gt;
&lt;br /&gt;
Neats vs. scruffies:&lt;br /&gt;
&lt;br /&gt;
Neats vs. scruffies:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=421–424, 486–489}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|p=168}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1983|pp=10–11}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Symbolic vs. sub-symbolic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Symbolic vs. sub-symbolic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”象征对抗子象征”&lt;br /&gt;
&lt;br /&gt;
Symbolic vs. sub-symbolic AI:&lt;br /&gt;
&lt;br /&gt;
Symbolic vs. sub-symbolic AI:&lt;br /&gt;
&lt;br /&gt;
符号人工智能 vs 子符号人工智能:&lt;br /&gt;
&lt;br /&gt;
* {{Harvtxt|Nilsson|1998|p=7}}, who uses the term &amp;quot;sub-symbolic&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;GOFAI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;GOFAI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反对者名字「 gofai 」&lt;br /&gt;
&lt;br /&gt;
{{Harvnb|Haugeland|1985|pp=112–117}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI at CMU in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI at CMU in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
60年代，卡内基梅隆大学的人工智能&lt;br /&gt;
&lt;br /&gt;
Cognitive simulation, [[Allen Newell|Newell]] and [[Herbert A. Simon|Simon]], AI at [[Carnegie Mellon University|CMU]] (then called [[Carnegie Tech]]):&lt;br /&gt;
&lt;br /&gt;
Cognitive simulation, Newell and Simon, AI at CMU (then called Carnegie Tech):&lt;br /&gt;
&lt;br /&gt;
认知模拟，纽威尔和西蒙，卡内基大学(当时称为卡内基技术学院)的人工智能:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=139–179, 245–250, 322–323 (EPAM)}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=145–149}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Soar&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Soar&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反战组织「翱翔」&lt;br /&gt;
&lt;br /&gt;
[[Soar (cognitive architecture)|Soar]] (history):&lt;br /&gt;
&lt;br /&gt;
Soar (history):&lt;br /&gt;
&lt;br /&gt;
翱翔(历史) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=450–451}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=258–263}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI at Stanford in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI at Stanford in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
60年代斯坦福大学的人工智能研究&lt;br /&gt;
&lt;br /&gt;
[[John McCarthy (computer scientist)|McCarthy]] and AI research at [[Stanford Artificial Intelligence Laboratory|SAIL]] and [[SRI International]]:&lt;br /&gt;
&lt;br /&gt;
McCarthy and AI research at SAIL and SRI International:&lt;br /&gt;
&lt;br /&gt;
麦卡锡和人工智能研究机构 SAIL 和 SRI International:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=251–259}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993}}&amp;lt;!-- Page number needed --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI at Edinburgh and France in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI at Edinburgh and France in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在60年代的爱丁堡和法国&lt;br /&gt;
&lt;br /&gt;
AI research at [[University of Edinburgh|Edinburgh]] and in France, birth of [[Prolog]]:&lt;br /&gt;
&lt;br /&gt;
AI research at Edinburgh and in France, birth of Prolog:&lt;br /&gt;
&lt;br /&gt;
爱丁堡和法国的人工智能研究，Prolog 的诞生:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=193–196}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Howe|1994}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI at MIT in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI at MIT in the 60s&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
60年代麻省理工学院的人工智能&lt;br /&gt;
&lt;br /&gt;
AI at [[MIT]] under [[Marvin Minsky]] in the 1960s :&lt;br /&gt;
&lt;br /&gt;
AI at MIT under Marvin Minsky in the 1960s :&lt;br /&gt;
&lt;br /&gt;
上世纪60年代，马文•明斯基(Marvin Minsky)领导下的麻省理工学院(MIT)人工智能课程:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=259–305}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=83–102, 163–176}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=19}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Cyc&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Cyc&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
他们的名字叫“ cyc”&lt;br /&gt;
&lt;br /&gt;
[[Cyc]]:&lt;br /&gt;
&lt;br /&gt;
Cyc:&lt;br /&gt;
&lt;br /&gt;
Cyc:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|p=489}}, who calls it &amp;quot;a determinedly scruffy enterprise&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=239–243}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=363−365}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Lenat|Guha|1989}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Knowledge revolution&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Knowledge revolution&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
知识革命&lt;br /&gt;
&lt;br /&gt;
Knowledge revolution:&lt;br /&gt;
&lt;br /&gt;
Knowledge revolution:&lt;br /&gt;
&lt;br /&gt;
返回文章页面知识革命:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=266–276, 298–300, 314, 421}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=22–23}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Embodied AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Embodied AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反对者名字“ empressive ai”&lt;br /&gt;
&lt;br /&gt;
[[Embodied agent|Embodied]] approaches to AI:&lt;br /&gt;
&lt;br /&gt;
Embodied approaches to AI:&lt;br /&gt;
&lt;br /&gt;
人工智能的具身化方法:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=454–462}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Brooks|1990}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Moravec|1988}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Revival of connectionism&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Revival of connectionism&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
联结主义的复兴&lt;br /&gt;
&lt;br /&gt;
Revival of [[connectionism]]:&lt;br /&gt;
&lt;br /&gt;
Revival of connectionism:&lt;br /&gt;
&lt;br /&gt;
返回文章页面连接主义的复兴:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=214–215}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=25}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Computational intelligence&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Computational intelligence&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
计算机情报网&lt;br /&gt;
&lt;br /&gt;
[[Computational intelligence]]&lt;br /&gt;
&lt;br /&gt;
Computational intelligence&lt;br /&gt;
&lt;br /&gt;
计算智能&lt;br /&gt;
&lt;br /&gt;
* [http://www.ieee-cis.org/ IEEE Computational Intelligence Society] {{webarchive|url=https://web.archive.org/web/20080509191840/http://www.ieee-cis.org/ |date=9 May 2008 }}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Intelligent agents&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Intelligent agents&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
智能特工组织&lt;br /&gt;
&lt;br /&gt;
The [[intelligent agent]] paradigm:&lt;br /&gt;
&lt;br /&gt;
The intelligent agent paradigm:&lt;br /&gt;
&lt;br /&gt;
智能代理范式:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=27, 32–58, 968–972}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=7–21}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=235–240}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Hutter|2005|pp=125–126}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The definition used in this article, in terms of goals, actions, perception and environment, is due to {{Harvtxt|Russell|Norvig|2003}}. Other definitions also include knowledge and learning as additional criteria.&lt;br /&gt;
&lt;br /&gt;
The definition used in this article, in terms of goals, actions, perception and environment, is due to . Other definitions also include knowledge and learning as additional criteria.&lt;br /&gt;
&lt;br /&gt;
本文使用的定义，在目标，行动，感知和环境方面，是由于。其他定义还包括知识和学习作为附加标准。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Agent architectures&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Agent architectures&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
引用名称&amp;quot;代理建筑&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Agent architecture]]s, [[hybrid intelligent system]]s:&lt;br /&gt;
&lt;br /&gt;
Agent architectures, hybrid intelligent systems:&lt;br /&gt;
&lt;br /&gt;
代理体系结构，混合智能系统:&lt;br /&gt;
&lt;br /&gt;
* {{Harvtxt|Russell|Norvig|2003|pp=27, 932, 970–972}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvtxt|Nilsson|1998|loc=chpt. 25}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Hierarchical control system&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Hierarchical control system&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
分级控制系统&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Hierarchical control system]]:&lt;br /&gt;
&lt;br /&gt;
Hierarchical control system:&lt;br /&gt;
&lt;br /&gt;
分层控制系统:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Albus|2002}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- TOOLS ---------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- TOOLS ---------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
——工具———————————————————————————————————————————————————————————————————————————————— --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
搜索引擎&lt;br /&gt;
&lt;br /&gt;
[[Search algorithm]]s:&lt;br /&gt;
&lt;br /&gt;
Search algorithms:&lt;br /&gt;
&lt;br /&gt;
搜索算法:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=59–189}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=113–163}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=79–164, 193–219}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 7–12}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Logic as search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Logic as search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
推理作为搜索”&lt;br /&gt;
&lt;br /&gt;
[[Forward chaining]], [[backward chaining]], [[Horn clause]]s, and logical deduction as search:&lt;br /&gt;
&lt;br /&gt;
Forward chaining, backward chaining, Horn clauses, and logical deduction as search:&lt;br /&gt;
&lt;br /&gt;
正向链接、反向链接、 Horn 子句和逻辑推理作为搜索:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=217–225, 280–294}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=~46–52}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=62–73}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 4.2, 7.2}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Planning as search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Planning as search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
计划作为搜索”&lt;br /&gt;
&lt;br /&gt;
[[State space search]] and [[automated planning and scheduling|planning]]:&lt;br /&gt;
&lt;br /&gt;
State space search and planning:&lt;br /&gt;
&lt;br /&gt;
国家空间搜索和规划:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=382–387}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=298–305}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 10.1–2}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Uninformed search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Uninformed search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
无知搜索”&lt;br /&gt;
&lt;br /&gt;
Uninformed searches ([[breadth first search]], [[depth first search]] and general [[state space search]]):&lt;br /&gt;
&lt;br /&gt;
Uninformed searches (breadth first search, depth first search and general state space search):&lt;br /&gt;
&lt;br /&gt;
不知情的搜索(广度优先搜索搜索、深度优先搜索和一般状态空间搜索) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=59–93}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=113–132}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=79–121}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 8}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Informed search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Informed search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
通知搜索&lt;br /&gt;
&lt;br /&gt;
[[Heuristic]] or informed searches (e.g., greedy [[best-first search|best first]] and [[A* search algorithm|A*]]):&lt;br /&gt;
&lt;br /&gt;
Heuristic or informed searches (e.g., greedy best first and A*):&lt;br /&gt;
&lt;br /&gt;
启发式或知情搜索(例如，贪婪最优先和 a *) :&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp= 94–109}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=pp. 132–147}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp= 133–150}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 9}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|2017|loc=Section 3.6}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Optimization search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Optimization search&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
最优化搜索&lt;br /&gt;
&lt;br /&gt;
[[optimization (mathematics)|Optimization]] searches:&lt;br /&gt;
&lt;br /&gt;
Optimization searches:&lt;br /&gt;
&lt;br /&gt;
优化搜索:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=110–116,120–129}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=56–163}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp= 127–133}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Society based learning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Society based learning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
以学习为基础的社会&lt;br /&gt;
&lt;br /&gt;
[[Artificial life]] and society based learning:&lt;br /&gt;
&lt;br /&gt;
Artificial life and society based learning:&lt;br /&gt;
&lt;br /&gt;
基于人工生命和社会的学习:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=530–541}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Genetic programming&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Genetic programming&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
“基因编程”&lt;br /&gt;
&lt;br /&gt;
[[Genetic programming]] and [[genetic algorithms]]:&lt;br /&gt;
&lt;br /&gt;
Genetic programming and genetic algorithms:&lt;br /&gt;
&lt;br /&gt;
遗传程序设计和遗传算法:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=509–530}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 4.2}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Holland|1975}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Koza|1992}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poli|Langdon|McPhee|2008}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”逻辑”组织&lt;br /&gt;
&lt;br /&gt;
[[Logic]]:&lt;br /&gt;
&lt;br /&gt;
Logic:&lt;br /&gt;
&lt;br /&gt;
逻辑:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=~I.2.3}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=194–310}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=35–77}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 13–16}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Satplan&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Satplan&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反对者名字「 satplan 」&lt;br /&gt;
&lt;br /&gt;
[[Satplan]]:&lt;br /&gt;
&lt;br /&gt;
Satplan:&lt;br /&gt;
&lt;br /&gt;
Satplan:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=402–407}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=300–301}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 21}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Symbolic learning techniques&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Symbolic learning techniques&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
象征学习技巧&lt;br /&gt;
&lt;br /&gt;
[[Explanation based learning]], relevance based learning, [[inductive logic programming]], [[case based reasoning]]:&lt;br /&gt;
&lt;br /&gt;
Explanation based learning, relevance based learning, inductive logic programming, case based reasoning:&lt;br /&gt;
&lt;br /&gt;
基于解释的学习，基于关联的学习，归纳逻辑程序设计，基于案例推理:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=678–710}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=414–416}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=~422–442}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 10.3, 17.5}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Propositional logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Propositional logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
推理逻辑&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Propositional logic]]:&lt;br /&gt;
&lt;br /&gt;
Propositional logic:&lt;br /&gt;
&lt;br /&gt;
命题逻辑&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=204–233}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=45–50}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 13}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;First-order logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;First-order logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
一阶逻辑&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[First-order logic]] and features such as [[equality (mathematics)|equality]]:&lt;br /&gt;
&lt;br /&gt;
First-order logic and features such as equality:&lt;br /&gt;
&lt;br /&gt;
一阶逻辑和功能，如平等:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=~I.2.4}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=240–310}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=268–275}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=50–62}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 15}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Fuzzy logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Fuzzy logic&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”模糊逻辑”&lt;br /&gt;
&lt;br /&gt;
[[Fuzzy logic]]:&lt;br /&gt;
&lt;br /&gt;
Fuzzy logic:&lt;br /&gt;
&lt;br /&gt;
Fuzzy logic:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=526–527}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Stochastic methods for uncertain reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Stochastic methods for uncertain reasoning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
不确定推理的随机方法&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Stochastic methods for uncertain reasoning:&lt;br /&gt;
&lt;br /&gt;
Stochastic methods for uncertain reasoning:&lt;br /&gt;
&lt;br /&gt;
不确定推理的随机方法:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=~I.2.3}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=462–644}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=345–395}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=165–191, 333–381}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 19}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Bayesian networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Bayesian networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
贝叶斯网络&lt;br /&gt;
&lt;br /&gt;
[[Bayesian network]]s:&lt;br /&gt;
&lt;br /&gt;
Bayesian networks:&lt;br /&gt;
&lt;br /&gt;
贝叶斯网络:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=492–523}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=361–381}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=~182–190, ≈363–379}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 19.3–4}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Bayesian inference&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Bayesian inference&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
引用名称”贝叶斯推断”&lt;br /&gt;
&lt;br /&gt;
[[Bayesian inference]] algorithm:&lt;br /&gt;
&lt;br /&gt;
Bayesian inference algorithm:&lt;br /&gt;
&lt;br /&gt;
贝叶斯推断算法:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=504–519}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=361–381}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=~363–379}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 19.4 &amp;amp; 7}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Bayesian learning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Bayesian learning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
贝叶斯学习&lt;br /&gt;
&lt;br /&gt;
[[Bayesian learning]] and the [[expectation-maximization algorithm]]:&lt;br /&gt;
&lt;br /&gt;
Bayesian learning and the expectation-maximization algorithm:&lt;br /&gt;
&lt;br /&gt;
贝叶斯学习和期望最大化算法:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=712–724}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=424–433}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 20}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Bayesian decision networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Bayesian decision networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
贝叶斯决策网络&lt;br /&gt;
&lt;br /&gt;
[[Bayesian decision theory]] and Bayesian [[decision network]]s:&lt;br /&gt;
&lt;br /&gt;
Bayesian decision theory and Bayesian decision networks:&lt;br /&gt;
&lt;br /&gt;
贝叶斯决策理论和贝叶斯决策网络:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=597–600}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Stochastic temporal models&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Stochastic temporal models&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
随机时间模型”&lt;br /&gt;
&lt;br /&gt;
Stochastic temporal models:&lt;br /&gt;
&lt;br /&gt;
Stochastic temporal models:&lt;br /&gt;
&lt;br /&gt;
随机时间模型:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=537–581}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Dynamic Bayesian network]]s:&lt;br /&gt;
&lt;br /&gt;
Dynamic Bayesian networks:&lt;br /&gt;
&lt;br /&gt;
动态贝叶斯网络:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=551–557}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Hidden Markov model]]:&lt;br /&gt;
&lt;br /&gt;
Hidden Markov model:&lt;br /&gt;
&lt;br /&gt;
隐马尔可夫模型&lt;br /&gt;
&lt;br /&gt;
* {{Harv|Russell|Norvig|2003|pp=549–551}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Kalman filter]]s:&lt;br /&gt;
&lt;br /&gt;
Kalman filters:&lt;br /&gt;
&lt;br /&gt;
卡尔曼滤波器:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=551–557}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Decisions theory and analysis&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Decisions theory and analysis&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
决策理论和分析&lt;br /&gt;
&lt;br /&gt;
[[decision theory]] and [[decision analysis]]:&lt;br /&gt;
&lt;br /&gt;
decision theory and decision analysis:&lt;br /&gt;
&lt;br /&gt;
决策理论和决策分析:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=584–597}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=381–394}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Markov decision process&amp;quot; &amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Markov decision process&amp;quot; &amp;gt;&lt;br /&gt;
&lt;br /&gt;
马尔科夫决策过程&lt;br /&gt;
&lt;br /&gt;
[[Markov decision process]]es and dynamic [[decision network]]s:&lt;br /&gt;
&lt;br /&gt;
Markov decision processes and dynamic decision networks:&lt;br /&gt;
&lt;br /&gt;
马尔可夫决策过程和动态决策网络:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=613–631}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Game theory and mechanism design&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Game theory and mechanism design&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
博弈论与机制设计”&lt;br /&gt;
&lt;br /&gt;
[[Game theory]] and [[mechanism design]]:&lt;br /&gt;
&lt;br /&gt;
Game theory and mechanism design:&lt;br /&gt;
&lt;br /&gt;
博弈论与机制设计:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=631–643}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Classifiers&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Classifiers&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”分类器”&lt;br /&gt;
&lt;br /&gt;
Statistical learning methods and [[classifier (mathematics)|classifiers]]:&lt;br /&gt;
&lt;br /&gt;
Statistical learning methods and classifiers:&lt;br /&gt;
&lt;br /&gt;
统计学习方法和分类器:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=712–754}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=453–541}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Kernel methods&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Kernel methods&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
内核方法&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[kernel methods]] such as the [[support vector machine]]:&lt;br /&gt;
&lt;br /&gt;
kernel methods such as the support vector machine:&lt;br /&gt;
&lt;br /&gt;
内核方法，比如支持向量机:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=749–752}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;K-nearest neighbor algorithm&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;K-nearest neighbor algorithm&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
最近邻算法”&lt;br /&gt;
&lt;br /&gt;
[[K-nearest neighbor algorithm]]:&lt;br /&gt;
&lt;br /&gt;
K-nearest neighbor algorithm:&lt;br /&gt;
&lt;br /&gt;
最近邻居法:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=733–736}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Gaussian mixture model&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Gaussian mixture model&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”高斯混合模型”&lt;br /&gt;
&lt;br /&gt;
[[Gaussian mixture model]]:&lt;br /&gt;
&lt;br /&gt;
Gaussian mixture model:&lt;br /&gt;
&lt;br /&gt;
高斯混合模型:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=725–727}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Naive Bayes classifier&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Naive Bayes classifier&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
自然分类器&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Naive Bayes classifier]]:&lt;br /&gt;
&lt;br /&gt;
Naive Bayes classifier:&lt;br /&gt;
&lt;br /&gt;
朴素贝叶斯分类器&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=718}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Decision tree&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Decision tree&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
决策树&lt;br /&gt;
&lt;br /&gt;
[[Alternating decision tree|Decision tree]]:&lt;br /&gt;
&lt;br /&gt;
Decision tree:&lt;br /&gt;
&lt;br /&gt;
决策树:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=653–664}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=403–408}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=408–417}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Classifier performance&amp;quot; &amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Classifier performance&amp;quot; &amp;gt;&lt;br /&gt;
&lt;br /&gt;
分类器性能&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Classifier performance:&lt;br /&gt;
&lt;br /&gt;
Classifier performance:&lt;br /&gt;
&lt;br /&gt;
分类器性能:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|van der Walt|Bernard|2006}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Neural networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Neural networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
“神经网络”&lt;br /&gt;
&lt;br /&gt;
Neural networks and connectionism:&lt;br /&gt;
&lt;br /&gt;
Neural networks and connectionism:&lt;br /&gt;
&lt;br /&gt;
神经网络与连接主义:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=736–748}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=408–414}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=453–505}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 3}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Backpropagation&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Backpropagation&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反向传播法&lt;br /&gt;
&lt;br /&gt;
[[Backpropagation]]:&lt;br /&gt;
&lt;br /&gt;
Backpropagation:&lt;br /&gt;
&lt;br /&gt;
返回文章页面反向传播:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=744–748}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=467–474}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Nilsson|1998|loc=chpt. 3.3}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Feedforward neural networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Feedforward neural networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反馈名称“前馈神经网络”&lt;br /&gt;
&lt;br /&gt;
[[Feedforward neural network]]s, [[perceptron]]s and [[radial basis network]]s:&lt;br /&gt;
&lt;br /&gt;
Feedforward neural networks, perceptrons and radial basis networks:&lt;br /&gt;
&lt;br /&gt;
前馈神经网络，感知器和径向基网络:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=739–748, 758}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=458–467}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Recurrent neural networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Recurrent neural networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反馈神经网络&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Recurrent neural networks]], [[Hopfield nets]]:&lt;br /&gt;
&lt;br /&gt;
Recurrent neural networks, Hopfield nets:&lt;br /&gt;
&lt;br /&gt;
回归神经网络 Hopfield 网络:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=758}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=474–505}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Learning in neural networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Learning in neural networks&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
在神经网络中学习&lt;br /&gt;
&lt;br /&gt;
[[Competitive learning]], [[Hebbian theory|Hebbian]] coincidence learning, [[Hopfield network]]s and attractor networks:&lt;br /&gt;
&lt;br /&gt;
Competitive learning, Hebbian coincidence learning, Hopfield networks and attractor networks:&lt;br /&gt;
&lt;br /&gt;
竞争学习，Hebbian 巧合学习，Hopfield 网络和吸引子网络:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Luger|Stubblefield|2004|pp=474–505}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Hierarchical temporal memory&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Hierarchical temporal memory&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
层级暂时记忆”&lt;br /&gt;
&lt;br /&gt;
[[Hierarchical temporal memory]]:&lt;br /&gt;
&lt;br /&gt;
Hierarchical temporal memory:&lt;br /&gt;
&lt;br /&gt;
分级暂存记忆:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Hawkins|Blakeslee|2005}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- unused ref&amp;lt;ref name=&amp;quot;Control theory&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- unused ref&amp;lt;ref name=&amp;quot;Control theory&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
!-未使用的参考名称“控制理论”&lt;br /&gt;
&lt;br /&gt;
[[Control theory]]:&lt;br /&gt;
&lt;br /&gt;
Control theory:&lt;br /&gt;
&lt;br /&gt;
控制理论:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|ACM|1998|loc=~I.2.8}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=926–932}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ ref --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- PROGRESS -----------------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- PROGRESS -----------------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! ——进展——————————————————————————————————————————————————————————————————————————————————————————————&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Turing test&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Turing test&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
文档名称“图灵测试”&lt;br /&gt;
&lt;br /&gt;
The [[Turing test]]:&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The Turing test:&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
图灵测试: br / &lt;br /&gt;
&lt;br /&gt;
Turing's original publication:&lt;br /&gt;
&lt;br /&gt;
Turing's original publication:&lt;br /&gt;
&lt;br /&gt;
图灵的原始出版物:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Turing|1950}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Historical influence and philosophical implications:&lt;br /&gt;
&lt;br /&gt;
Historical influence and philosophical implications:&lt;br /&gt;
&lt;br /&gt;
历史影响和哲学含义:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Haugeland|1985|pp=6–9}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|p=24}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=70–71}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=2–3 and 948}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &amp;lt;ref name=&amp;quot;Intrusion detection&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &amp;lt;ref name=&amp;quot;Intrusion detection&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
!-ref name&amp;quot;入侵检测&amp;quot;&lt;br /&gt;
&lt;br /&gt;
[[Intrusion detection system|Intrusion detection]]:&lt;br /&gt;
&lt;br /&gt;
Intrusion detection:&lt;br /&gt;
&lt;br /&gt;
入侵侦测:&lt;br /&gt;
&lt;br /&gt;
* {{harvnb|Kumar|Kumar|2012}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt; --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ ref --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Mathematical definitions of intelligence&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Mathematical definitions of intelligence&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
情报的数学定义&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Mathematical definitions of intelligence:&lt;br /&gt;
&lt;br /&gt;
Mathematical definitions of intelligence:&lt;br /&gt;
&lt;br /&gt;
智力的数学定义:&lt;br /&gt;
&lt;br /&gt;
* {{harvnb|Hernandez-Orallo|2000}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{harvnb|Dowe|Hajek|1997}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{harvnb|Hernandez-Orallo|Dowe|2010}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!------ PHILOSOPHY -----------------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!------ PHILOSOPHY -----------------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
——哲学———————————————————————————————————————————————————————————————————————————————————————————————— --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--not used&amp;lt;ref name=&amp;quot;Philosophy of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--not used&amp;lt;ref name=&amp;quot;Philosophy of AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
!-不用引用名“ ai 的哲学”&lt;br /&gt;
&lt;br /&gt;
[[Philosophy of AI]]. All of these positions in this section are mentioned in standard discussions of the subject, such as:&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Philosophy of AI. All of these positions in this section are mentioned in standard discussions of the subject, such as:&amp;lt;ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
人工智能哲学。本节中的所有这些立场都在主题的标准讨论中提到，例如: ref&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=947–960}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Fearn|2007|pp=38–55}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ ref --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Dartmouth proposal&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Dartmouth proposal&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
达特茅斯建议书&lt;br /&gt;
&lt;br /&gt;
Dartmouth proposal:&lt;br /&gt;
&lt;br /&gt;
Dartmouth proposal:&lt;br /&gt;
&lt;br /&gt;
返回文章页面达特茅斯求婚:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCarthy|Minsky|Rochester|Shannon|1955}} (the original proposal)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|p=49}} (historical significance)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Physical symbol system hypothesis&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Physical symbol system hypothesis&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
”物理符号系统假说”&lt;br /&gt;
&lt;br /&gt;
The [[physical symbol system]]s hypothesis:&lt;br /&gt;
&lt;br /&gt;
The physical symbol systems hypothesis:&lt;br /&gt;
&lt;br /&gt;
物理符号系统假说:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Newell|Simon|1976|p=116}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|p=153}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=18}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Dreyfus' critique&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Dreyfus' critique&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反对者名字“德雷福斯批评”&lt;br /&gt;
&lt;br /&gt;
[[Dreyfus' critique of artificial intelligence]]:&lt;br /&gt;
&lt;br /&gt;
Dreyfus' critique of artificial intelligence:&lt;br /&gt;
&lt;br /&gt;
德雷福斯对人工智能的批判:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Dreyfus|1972}}, {{Harvnb|Dreyfus|Dreyfus|1986}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=120–132}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=211–239}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=950–952}},&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Gödel himself&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Gödel himself&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Gödel himself&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{{Harvnb|Gödel|1951}}: in this lecture, [[Kurt Gödel]] uses the incompleteness theorem to arrive at the following disjunction: (a) the human mind is not a consistent finite machine, or (b) there exist [[Diophantine equations]] for which it cannot decide whether solutions exist. Gödel finds (b) implausible, and thus seems to have believed the human mind was not equivalent to a finite machine, i.e., its power exceeded that of any finite machine. He recognized that this was only a conjecture, since one could never disprove (b). Yet he considered the disjunctive conclusion to be a &amp;quot;certain fact&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
: in this lecture, Kurt Gödel uses the incompleteness theorem to arrive at the following disjunction: (a) the human mind is not a consistent finite machine, or (b) there exist Diophantine equations for which it cannot decide whether solutions exist. Gödel finds (b) implausible, and thus seems to have believed the human mind was not equivalent to a finite machine, i.e., its power exceeded that of any finite machine. He recognized that this was only a conjecture, since one could never disprove (b). Yet he considered the disjunctive conclusion to be a &amp;quot;certain fact&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
在这个演讲中，Kurt g del 使用不完备性定理得出以下结论: (a)人类的思维不是一致的有限机器，或者(b)存在不能决定是否存在解的丢番图方程。德尔认为(b)是不可信的，因此似乎相信人类的大脑并不等同于一个有限的机器，也就是说，它的力量超过任何有限的机器。他认识到这只是一个猜想，因为人们永远无法反驳(b)。然而，他认为这个选言式的结论是一个“确定的事实”。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;The mathematical objection&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;The mathematical objection&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
数学异议”&lt;br /&gt;
&lt;br /&gt;
The Mathematical Objection:&lt;br /&gt;
&lt;br /&gt;
The Mathematical Objection:&lt;br /&gt;
&lt;br /&gt;
数学上的异议:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=949}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=448–449}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Making the Mathematical Objection:&lt;br /&gt;
&lt;br /&gt;
Making the Mathematical Objection:&lt;br /&gt;
&lt;br /&gt;
提出数学异议:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Lucas|1961}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Penrose|1989}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Refuting Mathematical Objection:&lt;br /&gt;
&lt;br /&gt;
Refuting Mathematical Objection:&lt;br /&gt;
&lt;br /&gt;
驳斥数学异议:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Turing|1950}} under &amp;quot;(2) The Mathematical Objection&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Hofstadter|1979}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Background:&lt;br /&gt;
&lt;br /&gt;
Background:&lt;br /&gt;
&lt;br /&gt;
背景:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Ref=none|Gödel|1931}}, {{Harvnb|Ref=none|Church|1936}}, {{Harvnb|Ref=none|Kleene|1935}}, {{Harvnb|Ref=none|Turing|1937}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Searle's strong AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Searle's strong AI&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
沙尔强大的人工智能&lt;br /&gt;
&lt;br /&gt;
This version is from {{Harvtxt|Searle|1999}}, and is also quoted in {{Harvnb|Dennett|1991|p=435}}. Searle's original formulation was &amp;quot;The appropriately programmed computer really is a mind, in the sense that computers given the right programs can be literally said to understand and have other cognitive states.&amp;quot; {{Harv|Searle|1980|p=1}}. Strong AI is defined similarly by {{Harvtxt|Russell|Norvig|2003|p=947}}: &amp;quot;The assertion that machines could possibly act intelligently (or, perhaps better, act as if they were intelligent) is called the 'weak AI' hypothesis by philosophers, and the assertion that machines that do so are actually thinking (as opposed to simulating thinking) is called the 'strong AI' hypothesis.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
This version is from , and is also quoted in . Searle's original formulation was &amp;quot;The appropriately programmed computer really is a mind, in the sense that computers given the right programs can be literally said to understand and have other cognitive states.&amp;quot; . Strong AI is defined similarly by : &amp;quot;The assertion that machines could possibly act intelligently (or, perhaps better, act as if they were intelligent) is called the 'weak AI' hypothesis by philosophers, and the assertion that machines that do so are actually thinking (as opposed to simulating thinking) is called the 'strong AI' hypothesis.&amp;quot;&lt;br /&gt;
&lt;br /&gt;
这个版本是从，也是在引用。Searle 最初的构想是“经过适当编程的计算机实际上是一种思维，从这个意义上说，只要编写了正确的程序，计算机就可以理解并拥有其他认知状态。”.强人工智能的定义与此类似: “认为机器可以智能地行动(或者更好地说，仿佛它们是智能的)的断言被哲学家称为‘弱人工智能’假说，而认为机器这样做实际上是在思考(而不是模拟思考)的断言则被称为‘强人工智能’假说。”&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Chinese room&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Chinese room&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
「中文房间」&lt;br /&gt;
&lt;br /&gt;
Searle's [[Chinese room]] argument:&lt;br /&gt;
&lt;br /&gt;
Searle's Chinese room argument:&lt;br /&gt;
&lt;br /&gt;
塞尔的中文房间论点:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Searle|1980}}. Searle's original presentation of the thought experiment.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Searle|1999}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Discussion:&lt;br /&gt;
&lt;br /&gt;
Discussion:&lt;br /&gt;
&lt;br /&gt;
讨论:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|pp=958–960}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=443–445}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=269–271}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- PREDICTIONS --------------------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---- PREDICTIONS --------------------------------------------------------------------------------------------------------&amp;gt;&lt;br /&gt;
&lt;br /&gt;
——预测———————————————————————————————————————————————————————————————————————————————————————————————— --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Robot rights&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Robot rights&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
机器人版权“&lt;br /&gt;
&lt;br /&gt;
[[Robot rights]]:&lt;br /&gt;
&lt;br /&gt;
Robot rights:&lt;br /&gt;
&lt;br /&gt;
返回文章页面机器人版权:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=964}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|''BBC News''|2006}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Prematurity of:&lt;br /&gt;
&lt;br /&gt;
Prematurity of:&lt;br /&gt;
&lt;br /&gt;
早产儿:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Henderson|2007}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In fiction:&lt;br /&gt;
&lt;br /&gt;
In fiction:&lt;br /&gt;
&lt;br /&gt;
在小说中:&lt;br /&gt;
&lt;br /&gt;
* {{Harvtxt|McCorduck|2004|pp=190–25}} discusses ''[[Frankenstein]]'' and identifies the key ethical issues as scientific hubris and the suffering of the monster, i.e. [[robot rights]].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&amp;lt;ref name=&amp;quot;Replaced by machines&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&amp;lt;ref name=&amp;quot;Replaced by machines&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
! -- ref name&amp;quot;replaced by machines&amp;quot;&lt;br /&gt;
&lt;br /&gt;
AI could decrease the demand for human labor:&lt;br /&gt;
&lt;br /&gt;
AI could decrease the demand for human labor:&lt;br /&gt;
&lt;br /&gt;
人工智能可以减少对人类劳动力的需求:&lt;br /&gt;
&lt;br /&gt;
* {{harvnb|Russell|Norvig|2003|pp=960–961}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite book | last=Ford | first=Martin | title=The Lights in the Tunnel: Automation, Accelerating Technology and the Economy of the Future | publisher=Acculant Publishing | year=2009 | isbn=978-1-4486-5981-4 | url=http://www.thelightsinthetunnel.com | url-status=live | archiveurl=https://web.archive.org/web/20100906023409/http://www.thelightsinthetunnel.com/ | archivedate=6 September 2010 | df=dmy-all }}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;{{page needed|date=December 2016}}--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ ref --&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Weizenbaum's critique&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Weizenbaum's critique&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
裁判员名字「魏岑鲍姆批评」&lt;br /&gt;
&lt;br /&gt;
[[Joseph Weizenbaum]]'s critique of AI:&lt;br /&gt;
&lt;br /&gt;
Joseph Weizenbaum's critique of AI:&lt;br /&gt;
&lt;br /&gt;
约瑟夫·维森鲍姆对人工智能的批判:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Weizenbaum|1976}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Crevier|1993|pp=132–144}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|McCorduck|2004|pp=356–373}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=961}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Weizenbaum (the AI researcher who developed the first [[chatterbot]] program, [[ELIZA]]) argued in 1976 that the misuse of artificial intelligence has the potential to devalue human life.&lt;br /&gt;
&lt;br /&gt;
Weizenbaum (the AI researcher who developed the first chatterbot program, ELIZA) argued in 1976 that the misuse of artificial intelligence has the potential to devalue human life.&lt;br /&gt;
&lt;br /&gt;
1976年，Weizenbaum (开发了第一个聊天机器人程序 ELIZA 的人工智能研究员)认为，人工智能的滥用有可能使人的生命贬值。&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=Singularity&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=Singularity&amp;gt;&lt;br /&gt;
&lt;br /&gt;
引用名称 singularity&lt;br /&gt;
&lt;br /&gt;
[[Technological singularity]]:&lt;br /&gt;
&lt;br /&gt;
Technological singularity:&lt;br /&gt;
&lt;br /&gt;
技术奇异点:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Vinge|1993}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Kurzweil|2005}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=963}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;recurse&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;recurse&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Recurse&amp;quot;&lt;br /&gt;
&lt;br /&gt;
{{Cite conference | last = Omohundro|first= Steve| author-link= Steve Omohundro | year = 2008| title= The Nature of Self-Improving Artificial Intelligence| publisher=presented and distributed at the 2007 Singularity Summit, San Francisco, CA.}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Transhumanism&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Transhumanism&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
反对者名字“超人主义”&lt;br /&gt;
&lt;br /&gt;
[[Transhumanism]]:&lt;br /&gt;
&lt;br /&gt;
Transhumanism:&lt;br /&gt;
&lt;br /&gt;
返回文章页面超人主义:&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Moravec|1988}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Kurzweil|2005}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Russell|Norvig|2003|p=963}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI as evolution&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;AI as evolution&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
进化论，人工智能&lt;br /&gt;
&lt;br /&gt;
AI as evolution:&lt;br /&gt;
&lt;br /&gt;
AI as evolution:&lt;br /&gt;
&lt;br /&gt;
人工智能与进化:&lt;br /&gt;
&lt;br /&gt;
* [[Edward Fredkin]] is quoted in {{Harvtxt|McCorduck|2004|p=401}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Butler|1863}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Harvnb|Dyson|1998}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
/ 参考&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===人工智能教材 AI textbooks ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{refbegin|30em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Hutter |first=Marcus |author-link=Marcus Hutter |year=2005&lt;br /&gt;
&lt;br /&gt;
| last=Hutter |first=Marcus |author-link=Marcus Hutter |year=2005&lt;br /&gt;
&lt;br /&gt;
作者链接: 马库斯 · 哈特2005&lt;br /&gt;
&lt;br /&gt;
| title=Universal Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
| title=Universal Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
通用人工智能&lt;br /&gt;
&lt;br /&gt;
| isbn=978-3-540-22139-5&lt;br /&gt;
&lt;br /&gt;
| isbn=978-3-540-22139-5&lt;br /&gt;
&lt;br /&gt;
| isbn 978-3-540-22139-5&lt;br /&gt;
&lt;br /&gt;
| publisher=Springer&lt;br /&gt;
&lt;br /&gt;
| publisher=Springer&lt;br /&gt;
&lt;br /&gt;
出版商斯普林格&lt;br /&gt;
&lt;br /&gt;
| location=Berlin&lt;br /&gt;
&lt;br /&gt;
| location=Berlin&lt;br /&gt;
&lt;br /&gt;
| 地点: 柏林&lt;br /&gt;
&lt;br /&gt;
| title-link=AIXI }}&lt;br /&gt;
&lt;br /&gt;
| title-link=AIXI }}&lt;br /&gt;
&lt;br /&gt;
| title-link AIXI }&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
|last=Jackson&lt;br /&gt;
&lt;br /&gt;
|last=Jackson&lt;br /&gt;
&lt;br /&gt;
杰克逊&lt;br /&gt;
&lt;br /&gt;
|first=Philip&lt;br /&gt;
&lt;br /&gt;
|first=Philip&lt;br /&gt;
&lt;br /&gt;
第一个菲利普&lt;br /&gt;
&lt;br /&gt;
|author-link=Philip C. Jackson, Jr.&lt;br /&gt;
&lt;br /&gt;
|author-link=Philip C. Jackson, Jr.&lt;br /&gt;
&lt;br /&gt;
作者链接小菲利普 · c · 杰克逊。&lt;br /&gt;
&lt;br /&gt;
|year=1985&lt;br /&gt;
&lt;br /&gt;
|year=1985&lt;br /&gt;
&lt;br /&gt;
1985年&lt;br /&gt;
&lt;br /&gt;
|title=Introduction to Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
|title=Introduction to Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
人工智能简介&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-486-24864-6&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-486-24864-6&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-486-24864-6]&lt;br /&gt;
&lt;br /&gt;
|publisher=Dover&lt;br /&gt;
&lt;br /&gt;
|publisher=Dover&lt;br /&gt;
&lt;br /&gt;
| 出版商 / Dover&lt;br /&gt;
&lt;br /&gt;
|edition=2nd&lt;br /&gt;
&lt;br /&gt;
|edition=2nd&lt;br /&gt;
&lt;br /&gt;
第二版&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/introductiontoar1985jack&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/introductiontoar1985jack&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/introductiontoar1985jack&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
|last1=Luger&lt;br /&gt;
&lt;br /&gt;
|last1=Luger&lt;br /&gt;
&lt;br /&gt;
1 Luger&lt;br /&gt;
&lt;br /&gt;
|first1=George&lt;br /&gt;
&lt;br /&gt;
|first1=George&lt;br /&gt;
&lt;br /&gt;
首先，乔治&lt;br /&gt;
&lt;br /&gt;
|author-link=George Luger&lt;br /&gt;
&lt;br /&gt;
|author-link=George Luger&lt;br /&gt;
&lt;br /&gt;
| 作者链接: George Luger&lt;br /&gt;
&lt;br /&gt;
|last2=Stubblefield&lt;br /&gt;
&lt;br /&gt;
|last2=Stubblefield&lt;br /&gt;
&lt;br /&gt;
2 Stubblefield&lt;br /&gt;
&lt;br /&gt;
|first2=William&lt;br /&gt;
&lt;br /&gt;
|first2=William&lt;br /&gt;
&lt;br /&gt;
| first2威廉&lt;br /&gt;
&lt;br /&gt;
|author2-link=William Stubblefield&lt;br /&gt;
&lt;br /&gt;
|author2-link=William Stubblefield&lt;br /&gt;
&lt;br /&gt;
威廉 · 斯塔布尔菲尔德&lt;br /&gt;
&lt;br /&gt;
|year=2004&lt;br /&gt;
&lt;br /&gt;
|year=2004&lt;br /&gt;
&lt;br /&gt;
2004年&lt;br /&gt;
&lt;br /&gt;
|title=Artificial Intelligence: Structures and Strategies for Complex Problem Solving&lt;br /&gt;
&lt;br /&gt;
|title=Artificial Intelligence: Structures and Strategies for Complex Problem Solving&lt;br /&gt;
&lt;br /&gt;
人工智能: 复杂问题解决的结构和策略&lt;br /&gt;
&lt;br /&gt;
|publisher=Benjamin/Cummings&lt;br /&gt;
&lt;br /&gt;
|publisher=Benjamin/Cummings&lt;br /&gt;
&lt;br /&gt;
出版商 benjamin / cummings&lt;br /&gt;
&lt;br /&gt;
|edition=5th&lt;br /&gt;
&lt;br /&gt;
|edition=5th&lt;br /&gt;
&lt;br /&gt;
第五版&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-8053-4780-7&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-8053-4780-7&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-8053-4780-7]&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/artificialintell0000luge&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/artificialintell0000luge&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/artificialintell0000luge&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Neapolitan |first=Richard |last2=Jiang |first2=Xia |year=2018|authorlink1=Richard Neapolitan&lt;br /&gt;
&lt;br /&gt;
| last=Neapolitan |first=Richard |last2=Jiang |first2=Xia |year=2018|authorlink1=Richard Neapolitan&lt;br /&gt;
&lt;br /&gt;
那不勒斯人 | 第一个 Richard | 最后2个 Jiang | 第一个2个 Xia | 2018年 | 作者: Richard Neapolitan&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence: With an Introduction to Machine Learning&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence: With an Introduction to Machine Learning&lt;br /&gt;
&lt;br /&gt;
人工智能: 机器学习入门&lt;br /&gt;
&lt;br /&gt;
| publisher=Chapman &amp;amp; Hall/CRC&lt;br /&gt;
&lt;br /&gt;
| publisher=Chapman &amp;amp; Hall/CRC&lt;br /&gt;
&lt;br /&gt;
| 出版商 Chapman &amp;amp; hall / crc&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-1-138-50238-3&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-1-138-50238-3&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-1-138-50238-3]&lt;br /&gt;
&lt;br /&gt;
| url=https://www.crcpress.com/Contemporary-Artificial-Intelligence-Second-Edition/Neapolitan-Jiang/p/book/9781138502383&lt;br /&gt;
&lt;br /&gt;
| url=https://www.crcpress.com/Contemporary-Artificial-Intelligence-Second-Edition/Neapolitan-Jiang/p/book/9781138502383&lt;br /&gt;
&lt;br /&gt;
Https://www.crcpress.com/contemporary-artificial-intelligence-second-edition/neapolitan-jiang/p/book/9781138502383&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Nilsson |first=Nils |author-link=Nils Nilsson (researcher) |year=1998&lt;br /&gt;
&lt;br /&gt;
| last=Nilsson |first=Nils |author-link=Nils Nilsson (researcher) |year=1998&lt;br /&gt;
&lt;br /&gt;
Nils Nilsson (研究员) | 1998年&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence: A New Synthesis&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence: A New Synthesis&lt;br /&gt;
&lt;br /&gt;
人工智能: 一种新的综合&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/artificialintell0000nils&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/artificialintell0000nils&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/artificialintell0000nils&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
| publisher=Morgan Kaufmann&lt;br /&gt;
&lt;br /&gt;
| publisher=Morgan Kaufmann&lt;br /&gt;
&lt;br /&gt;
出版商摩根 · 考夫曼&lt;br /&gt;
&lt;br /&gt;
| isbn=978-1-55860-467-4&lt;br /&gt;
&lt;br /&gt;
| isbn=978-1-55860-467-4&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-1-55860-467-4]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{Russell Norvig 2003}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| first = Stuart J.&lt;br /&gt;
&lt;br /&gt;
| first = Stuart J.&lt;br /&gt;
&lt;br /&gt;
首先是斯图尔特 · j。&lt;br /&gt;
&lt;br /&gt;
| last = Russell&lt;br /&gt;
&lt;br /&gt;
| last = Russell&lt;br /&gt;
&lt;br /&gt;
拉塞尔&lt;br /&gt;
&lt;br /&gt;
| first2 = Peter&lt;br /&gt;
&lt;br /&gt;
| first2 = Peter&lt;br /&gt;
&lt;br /&gt;
第二名: 彼得&lt;br /&gt;
&lt;br /&gt;
| last2 = Norvig&lt;br /&gt;
&lt;br /&gt;
| last2 = Norvig&lt;br /&gt;
&lt;br /&gt;
2 Norvig&lt;br /&gt;
&lt;br /&gt;
| title = [[Artificial Intelligence: A Modern Approach]] &amp;lt;!-- | url = http://aima.cs.berkeley.edu/ --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
| title = Artificial Intelligence: A Modern Approach &amp;lt;!-- | url = http://aima.cs.berkeley.edu/ --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
人工智能: 一种现代的方法&lt;br /&gt;
&lt;br /&gt;
| year = 2009&lt;br /&gt;
&lt;br /&gt;
| year = 2009&lt;br /&gt;
&lt;br /&gt;
2009年&lt;br /&gt;
&lt;br /&gt;
| edition = 3rd&lt;br /&gt;
&lt;br /&gt;
| edition = 3rd&lt;br /&gt;
&lt;br /&gt;
第三版&lt;br /&gt;
&lt;br /&gt;
| publisher = Prentice Hall&lt;br /&gt;
&lt;br /&gt;
| publisher = Prentice Hall&lt;br /&gt;
&lt;br /&gt;
出版商 Prentice Hall&lt;br /&gt;
&lt;br /&gt;
| location = Upper Saddle River, New Jersey&lt;br /&gt;
&lt;br /&gt;
| location = Upper Saddle River, New Jersey&lt;br /&gt;
&lt;br /&gt;
| 位置: 新泽西州上萨德尔河&lt;br /&gt;
&lt;br /&gt;
| isbn = 978-0-13-604259-4&lt;br /&gt;
&lt;br /&gt;
| isbn = 978-0-13-604259-4&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-13-604259-4]&lt;br /&gt;
&lt;br /&gt;
| author-link=Stuart J. Russell&lt;br /&gt;
&lt;br /&gt;
| author-link=Stuart J. Russell&lt;br /&gt;
&lt;br /&gt;
作者链接斯图尔特 · j · 拉塞尔&lt;br /&gt;
&lt;br /&gt;
| author2-link=Peter Norvig&lt;br /&gt;
&lt;br /&gt;
| author2-link=Peter Norvig&lt;br /&gt;
&lt;br /&gt;
| author2-link Peter Norvig&lt;br /&gt;
&lt;br /&gt;
| pages=&lt;br /&gt;
&lt;br /&gt;
| pages=&lt;br /&gt;
&lt;br /&gt;
页数&lt;br /&gt;
&lt;br /&gt;
}}.&lt;br /&gt;
&lt;br /&gt;
}}.&lt;br /&gt;
&lt;br /&gt;
}}.&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref          = harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |first1       = David&lt;br /&gt;
&lt;br /&gt;
 |first1       = David&lt;br /&gt;
&lt;br /&gt;
第一名: 大卫&lt;br /&gt;
&lt;br /&gt;
 |last1        = Poole&lt;br /&gt;
&lt;br /&gt;
 |last1        = Poole&lt;br /&gt;
&lt;br /&gt;
最后1个普尔&lt;br /&gt;
&lt;br /&gt;
 |author-link  = David Poole (researcher)&lt;br /&gt;
&lt;br /&gt;
 |author-link  = David Poole (researcher)&lt;br /&gt;
&lt;br /&gt;
作者链接大卫 · 普尔(研究员)&lt;br /&gt;
&lt;br /&gt;
 |first2       = Alan&lt;br /&gt;
&lt;br /&gt;
 |first2       = Alan&lt;br /&gt;
&lt;br /&gt;
第二名: 艾伦&lt;br /&gt;
&lt;br /&gt;
 |last2        = Mackworth&lt;br /&gt;
&lt;br /&gt;
 |last2        = Mackworth&lt;br /&gt;
&lt;br /&gt;
麦克沃斯&lt;br /&gt;
&lt;br /&gt;
 |author2-link = Alan Mackworth&lt;br /&gt;
&lt;br /&gt;
 |author2-link = Alan Mackworth&lt;br /&gt;
&lt;br /&gt;
| author2-link 艾伦 · 麦克沃思&lt;br /&gt;
&lt;br /&gt;
 |first3       = Randy&lt;br /&gt;
&lt;br /&gt;
 |first3       = Randy&lt;br /&gt;
&lt;br /&gt;
第三名: 兰迪&lt;br /&gt;
&lt;br /&gt;
 |last3        = Goebel&lt;br /&gt;
&lt;br /&gt;
 |last3        = Goebel&lt;br /&gt;
&lt;br /&gt;
最后3格贝尔&lt;br /&gt;
&lt;br /&gt;
 |author3-link = Randy Goebel&lt;br /&gt;
&lt;br /&gt;
 |author3-link = Randy Goebel&lt;br /&gt;
&lt;br /&gt;
| author3-link Randy Goebel&lt;br /&gt;
&lt;br /&gt;
 |year         = 1998&lt;br /&gt;
&lt;br /&gt;
 |year         = 1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
 |title        = Computational Intelligence: A Logical Approach&lt;br /&gt;
&lt;br /&gt;
 |title        = Computational Intelligence: A Logical Approach&lt;br /&gt;
&lt;br /&gt;
计算智能: 逻辑方法&lt;br /&gt;
&lt;br /&gt;
 |publisher    = Oxford University Press&lt;br /&gt;
&lt;br /&gt;
 |publisher    = Oxford University Press&lt;br /&gt;
&lt;br /&gt;
牛津大学出版社&lt;br /&gt;
&lt;br /&gt;
 |location     = New York&lt;br /&gt;
&lt;br /&gt;
 |location     = New York&lt;br /&gt;
&lt;br /&gt;
| 地点: 纽约&lt;br /&gt;
&lt;br /&gt;
 |isbn         = 978-0-19-510270-3&lt;br /&gt;
&lt;br /&gt;
 |isbn         = 978-0-19-510270-3&lt;br /&gt;
&lt;br /&gt;
| isbn 978-0-19-510270-3&lt;br /&gt;
&lt;br /&gt;
 |url          = https://archive.org/details/computationalint00pool&lt;br /&gt;
&lt;br /&gt;
 |url          = https://archive.org/details/computationalint00pool&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/computationalint00pool&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book | last=Winston | first=Patrick Henry | author-link=Patrick Winston | year=1984 | title=Artificial Intelligence | publisher=Addison-Wesley | location=Reading, MA | isbn=978-0-201-08259-3 | url=https://archive.org/details/artificialintell00wins }}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite book |last=Rich |first=Elaine |author-link=Elaine Rich |year=1983 |title=Artificial Intelligence |publisher=McGraw-Hill |isbn=978-0-07-052261-9 |url-access=registration |url=https://archive.org/details/ine0000unse }}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Bundy |first=Alan |author-link=Alan Bundy |year=1980&lt;br /&gt;
&lt;br /&gt;
| last=Bundy |first=Alan |author-link=Alan Bundy |year=1980&lt;br /&gt;
&lt;br /&gt;
1980年&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence: An Introductory Course&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence: An Introductory Course&lt;br /&gt;
&lt;br /&gt;
人工智能: 入门课程&lt;br /&gt;
&lt;br /&gt;
| publisher = Edinburgh University Press|edition=2nd&lt;br /&gt;
&lt;br /&gt;
| publisher = Edinburgh University Press|edition=2nd&lt;br /&gt;
&lt;br /&gt;
| 出版商爱丁堡大学出版社 | 第二版&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-85224-410-4&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-85224-410-4&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-85224-410-4]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|first1=David |last1=Poole |author-link=David Poole (researcher)&lt;br /&gt;
&lt;br /&gt;
|first1=David |last1=Poole |author-link=David Poole (researcher)&lt;br /&gt;
&lt;br /&gt;
作者链接大卫 · 普尔(研究员)&lt;br /&gt;
&lt;br /&gt;
|first2=Alan |last2=Mackworth |author2-link=Alan Mackworth&lt;br /&gt;
&lt;br /&gt;
|first2=Alan |last2=Mackworth |author2-link=Alan Mackworth&lt;br /&gt;
&lt;br /&gt;
作者: 艾伦 · 麦克沃思&lt;br /&gt;
&lt;br /&gt;
|year=2017&lt;br /&gt;
&lt;br /&gt;
|year=2017&lt;br /&gt;
&lt;br /&gt;
2017年&lt;br /&gt;
&lt;br /&gt;
|title=Artificial Intelligence: Foundations of Computational Agents&lt;br /&gt;
&lt;br /&gt;
|title=Artificial Intelligence: Foundations of Computational Agents&lt;br /&gt;
&lt;br /&gt;
人工智能: 计算机代理的基础&lt;br /&gt;
&lt;br /&gt;
|publisher = Cambridge University Press|edition=2nd&lt;br /&gt;
&lt;br /&gt;
|publisher = Cambridge University Press|edition=2nd&lt;br /&gt;
&lt;br /&gt;
出版商: 剑桥大学出版社&lt;br /&gt;
&lt;br /&gt;
|isbn=978-1-107-19539-4&lt;br /&gt;
&lt;br /&gt;
|isbn=978-1-107-19539-4&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-1-107-19539-4]&lt;br /&gt;
&lt;br /&gt;
|url=http://artint.info/index.html&lt;br /&gt;
&lt;br /&gt;
|url=http://artint.info/index.html&lt;br /&gt;
&lt;br /&gt;
Http://artint.info/index.html&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
{{refend}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===人工智能的历史 History of AI ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{refbegin|30em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Crevier 1993}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{McCorduck 2004}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Newquist |first=HP |author-link=HP Newquist |year=1994&lt;br /&gt;
&lt;br /&gt;
| last=Newquist |first=HP |author-link=HP Newquist |year=1994&lt;br /&gt;
&lt;br /&gt;
纽奎斯特 | 第一惠普 | 作者林克 · 纽奎斯特 | 1994年&lt;br /&gt;
&lt;br /&gt;
| title=The Brain Makers: Genius, Ego, And Greed In The Quest For Machines That Think&lt;br /&gt;
&lt;br /&gt;
| title=The Brain Makers: Genius, Ego, And Greed In The Quest For Machines That Think&lt;br /&gt;
&lt;br /&gt;
大脑制造者: 寻找思考机器的天才、自我和贪婪&lt;br /&gt;
&lt;br /&gt;
| publisher=Macmillan/SAMS |location=New York&lt;br /&gt;
&lt;br /&gt;
| publisher=Macmillan/SAMS |location=New York&lt;br /&gt;
&lt;br /&gt;
| 出版商 macmillan / sams | 位置: 纽约&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-672-30412-5 |ref=harv&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-672-30412-5 |ref=harv&lt;br /&gt;
&lt;br /&gt;
| isbn 978-0-672-30412-5 | ref harv&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Nilsson |first=Nils |author-link=Nils Nilsson (researcher) |year=2009&lt;br /&gt;
&lt;br /&gt;
| last=Nilsson |first=Nils |author-link=Nils Nilsson (researcher) |year=2009&lt;br /&gt;
&lt;br /&gt;
作者链接 Nils Nilsson (研究员) | 2009年&lt;br /&gt;
&lt;br /&gt;
| title=The Quest for Artificial Intelligence: A History of Ideas and Achievements&lt;br /&gt;
&lt;br /&gt;
| title=The Quest for Artificial Intelligence: A History of Ideas and Achievements&lt;br /&gt;
&lt;br /&gt;
人工智能的探索: 思想和成就的历史&lt;br /&gt;
&lt;br /&gt;
| publisher=Cambridge University Press |location=New York&lt;br /&gt;
&lt;br /&gt;
| publisher=Cambridge University Press |location=New York&lt;br /&gt;
&lt;br /&gt;
出版商剑桥大学出版社 | 位置纽约&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-521-12293-1&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-521-12293-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-521-12293-1]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
{{refend}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===其他资源 Other sources ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{refbegin|30em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite journal|ref=harv |last1=Asada |first1=M. |last2=Hosoda |first2=K. |last3=Kuniyoshi |first3=Y. |last4=Ishiguro |first4=H. |last5=Inui |first5=T. |last6=Yoshikawa |first6=Y. |last7=Ogino |first7=M. |last8=Yoshida |first8=C. |year=2009 |title=Cognitive developmental robotics: a survey |journal=IEEE Transactions on Autonomous Mental Development |volume=1 |issue=1 |pages=12–34 |doi=10.1109/tamd.2009.2021702 }}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite web&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |ref         = {{harvid|ACM|1998}}&lt;br /&gt;
&lt;br /&gt;
 |ref         = &lt;br /&gt;
&lt;br /&gt;
不会&lt;br /&gt;
&lt;br /&gt;
 |publisher   = [[Association for Computing Machinery|ACM]]&lt;br /&gt;
&lt;br /&gt;
 |publisher   = ACM&lt;br /&gt;
&lt;br /&gt;
| 出版商 ACM&lt;br /&gt;
&lt;br /&gt;
 |year        = 1998&lt;br /&gt;
&lt;br /&gt;
 |year        = 1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
 |title       = ACM Computing Classification System: Artificial intelligence&lt;br /&gt;
&lt;br /&gt;
 |title       = ACM Computing Classification System: Artificial intelligence&lt;br /&gt;
&lt;br /&gt;
ACM 电脑分类系统: 人工智能&lt;br /&gt;
&lt;br /&gt;
 |url         = http://www.acm.org/class/1998/I.2.html&lt;br /&gt;
&lt;br /&gt;
 |url         = http://www.acm.org/class/1998/I.2.html&lt;br /&gt;
&lt;br /&gt;
Http://www.acm.org/class/1998/i.2.html&lt;br /&gt;
&lt;br /&gt;
 |accessdate  = 30 August 2007&lt;br /&gt;
&lt;br /&gt;
 |accessdate  = 30 August 2007&lt;br /&gt;
&lt;br /&gt;
2007年8月30日&lt;br /&gt;
&lt;br /&gt;
 |url-status     = dead&lt;br /&gt;
&lt;br /&gt;
 |url-status     = dead&lt;br /&gt;
&lt;br /&gt;
状态死机&lt;br /&gt;
&lt;br /&gt;
 |archiveurl  = https://web.archive.org/web/20071012025921/http://www.acm.org/class/1998/I.2.html&lt;br /&gt;
&lt;br /&gt;
 |archiveurl  = https://web.archive.org/web/20071012025921/http://www.acm.org/class/1998/I.2.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20071012025921/http://www.acm.org/class/1998/i.2.html&lt;br /&gt;
&lt;br /&gt;
 |archivedate = 12 October 2007&lt;br /&gt;
&lt;br /&gt;
 |archivedate = 12 October 2007&lt;br /&gt;
&lt;br /&gt;
2007年10月12日&lt;br /&gt;
&lt;br /&gt;
 |df          = dmy-all&lt;br /&gt;
&lt;br /&gt;
 |df          = dmy-all&lt;br /&gt;
&lt;br /&gt;
我不会放过你的&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=Goodman |first1=Joanna |author-link=Joanna Goodman&lt;br /&gt;
&lt;br /&gt;
| last1=Goodman |first1=Joanna |author-link=Joanna Goodman&lt;br /&gt;
&lt;br /&gt;
乔安娜作者链接: 乔安娜 · 古德曼&lt;br /&gt;
&lt;br /&gt;
| year=2016&lt;br /&gt;
&lt;br /&gt;
| year=2016&lt;br /&gt;
&lt;br /&gt;
2016年&lt;br /&gt;
&lt;br /&gt;
| title=Robots in Law: How Artificial Intelligence is Transforming Legal Services&lt;br /&gt;
&lt;br /&gt;
| title=Robots in Law: How Artificial Intelligence is Transforming Legal Services&lt;br /&gt;
&lt;br /&gt;
法律中的机器人: 人工智能如何改变法律服务&lt;br /&gt;
&lt;br /&gt;
| publisher=Ark Group |edition=1st&lt;br /&gt;
&lt;br /&gt;
| publisher=Ark Group |edition=1st&lt;br /&gt;
&lt;br /&gt;
| 出版商方舟集团 | 第一版&lt;br /&gt;
&lt;br /&gt;
| isbn=978-1-78358-264-8&lt;br /&gt;
&lt;br /&gt;
| isbn=978-1-78358-264-8&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-1-78358-264-8]&lt;br /&gt;
&lt;br /&gt;
| url=https://www.ark-group.com/product/robots-law-how-artificial-intelligence-transforming-legal-services&lt;br /&gt;
&lt;br /&gt;
| url=https://www.ark-group.com/product/robots-law-how-artificial-intelligence-transforming-legal-services&lt;br /&gt;
&lt;br /&gt;
Https://www.ark-group.com/product/robots-law-how-artificial-intelligence-transforming-legal-services&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite encyclopedia&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
 |last=Albus&lt;br /&gt;
&lt;br /&gt;
 |last=Albus&lt;br /&gt;
&lt;br /&gt;
最后的阿不思&lt;br /&gt;
&lt;br /&gt;
 |first=J. S.&lt;br /&gt;
&lt;br /&gt;
 |first=J. S.&lt;br /&gt;
&lt;br /&gt;
首先是 j。美国。&lt;br /&gt;
&lt;br /&gt;
 |year=2002&lt;br /&gt;
&lt;br /&gt;
 |year=2002&lt;br /&gt;
&lt;br /&gt;
2002年&lt;br /&gt;
&lt;br /&gt;
 |pages=11–20&lt;br /&gt;
&lt;br /&gt;
 |pages=11–20&lt;br /&gt;
&lt;br /&gt;
第11-20页&lt;br /&gt;
&lt;br /&gt;
 |title=4-D/RCS: A Reference Model Architecture for Intelligent Unmanned Ground Vehicles&lt;br /&gt;
&lt;br /&gt;
 |title=4-D/RCS: A Reference Model Architecture for Intelligent Unmanned Ground Vehicles&lt;br /&gt;
&lt;br /&gt;
| title 4-d / rcs: 智能无人地面车辆参考模型体系结构&lt;br /&gt;
&lt;br /&gt;
 |editor1-last=Gerhart&lt;br /&gt;
&lt;br /&gt;
 |editor1-last=Gerhart&lt;br /&gt;
&lt;br /&gt;
| 编辑1-last Gerhart&lt;br /&gt;
&lt;br /&gt;
 |editor-first=G.&lt;br /&gt;
&lt;br /&gt;
 |editor-first=G.&lt;br /&gt;
&lt;br /&gt;
| 编辑-第一个 g。&lt;br /&gt;
&lt;br /&gt;
 |editor2-last=Gunderson&lt;br /&gt;
&lt;br /&gt;
 |editor2-last=Gunderson&lt;br /&gt;
&lt;br /&gt;
| 编辑2-last Gunderson&lt;br /&gt;
&lt;br /&gt;
 |editor2-first=R.&lt;br /&gt;
&lt;br /&gt;
 |editor2-first=R.&lt;br /&gt;
&lt;br /&gt;
| 编辑2-first r。&lt;br /&gt;
&lt;br /&gt;
 |editor3-last=Shoemaker&lt;br /&gt;
&lt;br /&gt;
 |editor3-last=Shoemaker&lt;br /&gt;
&lt;br /&gt;
最后一个鞋匠&lt;br /&gt;
&lt;br /&gt;
 |editor3-first=C.&lt;br /&gt;
&lt;br /&gt;
 |editor3-first=C.&lt;br /&gt;
&lt;br /&gt;
3-first c.&lt;br /&gt;
&lt;br /&gt;
 |encyclopedia=Proceedings of the SPIE AeroSense Session on Unmanned Ground Vehicle Technology&lt;br /&gt;
&lt;br /&gt;
 |encyclopedia=Proceedings of the SPIE AeroSense Session on Unmanned Ground Vehicle Technology&lt;br /&gt;
&lt;br /&gt;
美国国家科学院院刊航空感应会议关于无人地面载具技术&lt;br /&gt;
&lt;br /&gt;
 |volume=3693&lt;br /&gt;
&lt;br /&gt;
 |volume=3693&lt;br /&gt;
&lt;br /&gt;
第3693卷&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.isd.mel.nist.gov/documents/albus/4DRCS.pdf&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.isd.mel.nist.gov/documents/albus/4DRCS.pdf&lt;br /&gt;
&lt;br /&gt;
Http://www.isd.mel.nist.gov/documents/albus/4drcs.pdf&lt;br /&gt;
&lt;br /&gt;
 |archive-url=https://web.archive.org/web/20040725051856/http://www.isd.mel.nist.gov/documents/albus/4DRCS.pdf&lt;br /&gt;
&lt;br /&gt;
 |archive-url=https://web.archive.org/web/20040725051856/http://www.isd.mel.nist.gov/documents/albus/4DRCS.pdf&lt;br /&gt;
&lt;br /&gt;
| 档案-网址 https://web.archive.org/web/20040725051856/http://www.isd.mel.nist.gov/documents/albus/4drcs.pdf&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
状态死机&lt;br /&gt;
&lt;br /&gt;
 |archive-date=25 July 2004&lt;br /&gt;
&lt;br /&gt;
 |archive-date=25 July 2004&lt;br /&gt;
&lt;br /&gt;
| 档案-日期2004年7月25日&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
我不会让你失望的&lt;br /&gt;
&lt;br /&gt;
|bibcode=2002SPIE.4715..303A&lt;br /&gt;
&lt;br /&gt;
|bibcode=2002SPIE.4715..303A&lt;br /&gt;
&lt;br /&gt;
| bibcode 2002SPIE. 4715. . 303 a&lt;br /&gt;
&lt;br /&gt;
 |doi=10.1117/12.474462&lt;br /&gt;
&lt;br /&gt;
 |doi=10.1117/12.474462&lt;br /&gt;
&lt;br /&gt;
10.1117 / 12.474462&lt;br /&gt;
&lt;br /&gt;
 |citeseerx=10.1.1.15.14&lt;br /&gt;
&lt;br /&gt;
 |citeseerx=10.1.1.15.14&lt;br /&gt;
&lt;br /&gt;
10.1.1.15.14&lt;br /&gt;
&lt;br /&gt;
 |chapter=4D/RCS: A reference model architecture for intelligent unmanned ground vehicles&lt;br /&gt;
&lt;br /&gt;
 |chapter=4D/RCS: A reference model architecture for intelligent unmanned ground vehicles&lt;br /&gt;
&lt;br /&gt;
| 第4d / rcs: 智能无人地面车辆参考模型体系结构&lt;br /&gt;
&lt;br /&gt;
 |series=Unmanned Ground Vehicle Technology IV&lt;br /&gt;
&lt;br /&gt;
 |series=Unmanned Ground Vehicle Technology IV&lt;br /&gt;
&lt;br /&gt;
系列无人地面载具&lt;br /&gt;
&lt;br /&gt;
 }}&lt;br /&gt;
&lt;br /&gt;
 }}&lt;br /&gt;
&lt;br /&gt;
 }}&lt;br /&gt;
&lt;br /&gt;
* {{Cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last = Aleksander | first= Igor | authorlink = Igor Aleksander&lt;br /&gt;
&lt;br /&gt;
| last = Aleksander | first= Igor | authorlink = Igor Aleksander&lt;br /&gt;
&lt;br /&gt;
最后 | 第一个 Igor | 作者链接 Igor Aleksander&lt;br /&gt;
&lt;br /&gt;
| year=1995&lt;br /&gt;
&lt;br /&gt;
| year=1995&lt;br /&gt;
&lt;br /&gt;
1995年&lt;br /&gt;
&lt;br /&gt;
| title= Artificial Neuroconsciousness: An Update&lt;br /&gt;
&lt;br /&gt;
| title= Artificial Neuroconsciousness: An Update&lt;br /&gt;
&lt;br /&gt;
人工神经意识: 更新&lt;br /&gt;
&lt;br /&gt;
| publisher=IWANN&lt;br /&gt;
&lt;br /&gt;
| publisher=IWANN&lt;br /&gt;
&lt;br /&gt;
出版商 IWANN&lt;br /&gt;
&lt;br /&gt;
| url = http://www.ee.ic.ac.uk/research/neural/publications/iwann.html&lt;br /&gt;
&lt;br /&gt;
| url = http://www.ee.ic.ac.uk/research/neural/publications/iwann.html&lt;br /&gt;
&lt;br /&gt;
Http://www.ee.ic.ac.uk/research/neural/publications/iwann.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl = https://web.archive.org/web/19970302014628/http://www.ee.ic.ac.uk/research/neural/publications/iwann.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl = https://web.archive.org/web/19970302014628/http://www.ee.ic.ac.uk/research/neural/publications/iwann.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/19970302014628/http://www.ee.ic.ac.uk/research/neural/publications/iwann.html&lt;br /&gt;
&lt;br /&gt;
| archivedate = 2 March 1997&lt;br /&gt;
&lt;br /&gt;
| archivedate = 2 March 1997&lt;br /&gt;
&lt;br /&gt;
1997年3月2日&lt;br /&gt;
&lt;br /&gt;
| ref = harv&lt;br /&gt;
&lt;br /&gt;
| ref = harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
}} [http://dblp.uni-trier.de/rec/bibtex/conf/iwann/Aleksander95 BibTex] {{webarchive |url=https://web.archive.org/web/19970302014628/http://www.ee.ic.ac.uk/research/neural/publications/iwann.html |date=2 March 1997}}.&lt;br /&gt;
&lt;br /&gt;
}} [http://dblp.uni-trier.de/rec/bibtex/conf/iwann/Aleksander95 BibTex] .&lt;br /&gt;
&lt;br /&gt;
[}}[ http://dblp.uni-trier.de/rec/BibTex/conf/iwann/aleksander95 / BibTex ].&lt;br /&gt;
&lt;br /&gt;
* {{cite encyclopedia |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Bach |first=Joscha |year=2008 |pages=63–74&lt;br /&gt;
&lt;br /&gt;
| last=Bach |first=Joscha |year=2008 |pages=63–74&lt;br /&gt;
&lt;br /&gt;
最后巴赫 | 第一约沙 | 2008年 | 第63-74页&lt;br /&gt;
&lt;br /&gt;
| title=Seven Principles of Synthetic Intelligence&lt;br /&gt;
&lt;br /&gt;
| title=Seven Principles of Synthetic Intelligence&lt;br /&gt;
&lt;br /&gt;
7 Principles of Synthetic Intelligence | title 7 Principles of Synthetic Intelligence&lt;br /&gt;
&lt;br /&gt;
| editor1-last=Wang |editor1-first=Pei |editor2-last=Goertzel |editor2-first=Ben |editor3-last=Franklin |editor3-first=Stan&lt;br /&gt;
&lt;br /&gt;
| editor1-last=Wang |editor1-first=Pei |editor2-last=Goertzel |editor2-first=Ben |editor3-last=Franklin |editor3-first=Stan&lt;br /&gt;
&lt;br /&gt;
[参考译文][参考译文][参考译文][参考译文][参考译文][参考译文][参考译文]&lt;br /&gt;
&lt;br /&gt;
| work=Artificial General Intelligence, 2008: Proceedings of the First AGI Conference&lt;br /&gt;
&lt;br /&gt;
| work=Artificial General Intelligence, 2008: Proceedings of the First AGI Conference&lt;br /&gt;
&lt;br /&gt;
| 工作人工通用智能，2008: 第一次 AGI 会议记录&lt;br /&gt;
&lt;br /&gt;
| publisher=IOS Press |isbn=978-1-58603-833-5&lt;br /&gt;
&lt;br /&gt;
| publisher=IOS Press |isbn=978-1-58603-833-5&lt;br /&gt;
&lt;br /&gt;
| 出版商 IOS 出版社 | isbn 978-1-58603-833-5&lt;br /&gt;
&lt;br /&gt;
| url=https://books.google.com/books?id=a_ZR81Z25z0C&amp;amp;pg=PA63&lt;br /&gt;
&lt;br /&gt;
| url=https://books.google.com/books?id=a_ZR81Z25z0C&amp;amp;pg=PA63&lt;br /&gt;
&lt;br /&gt;
Https://books.google.com/books?id=a_zr81z25z0c&amp;amp;pg=pa63&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite news |ref={{harvid|''BBC News''|2006}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| date=21 December 2006&lt;br /&gt;
&lt;br /&gt;
| date=21 December 2006&lt;br /&gt;
&lt;br /&gt;
2006年12月21日&lt;br /&gt;
&lt;br /&gt;
| title=Robots could demand legal rights |work=BBC News&lt;br /&gt;
&lt;br /&gt;
| title=Robots could demand legal rights |work=BBC News&lt;br /&gt;
&lt;br /&gt;
机器人可以要求合法权利 | BBC 新闻&lt;br /&gt;
&lt;br /&gt;
| url=http://news.bbc.co.uk/2/hi/technology/6200005.stm |accessdate=3 February 2011&lt;br /&gt;
&lt;br /&gt;
| url=http://news.bbc.co.uk/2/hi/technology/6200005.stm |accessdate=3 February 2011&lt;br /&gt;
&lt;br /&gt;
Http://news.bbc.co.uk/2/hi/technology/6200005.stm  : 2011年2月3日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Brooks |first=Rodney |authorlink=Rodney Brooks |year=1990&lt;br /&gt;
&lt;br /&gt;
| last=Brooks |first=Rodney |authorlink=Rodney Brooks |year=1990&lt;br /&gt;
&lt;br /&gt;
罗德尼 · 布鲁克斯，1990年&lt;br /&gt;
&lt;br /&gt;
| title=Elephants Don't Play Chess&lt;br /&gt;
&lt;br /&gt;
| title=Elephants Don't Play Chess&lt;br /&gt;
&lt;br /&gt;
大象不下国际象棋&lt;br /&gt;
&lt;br /&gt;
| journal=Robotics and Autonomous Systems |volume=6 | issue=1–2 |pages=3–15&lt;br /&gt;
&lt;br /&gt;
| journal=Robotics and Autonomous Systems |volume=6 | issue=1–2 |pages=3–15&lt;br /&gt;
&lt;br /&gt;
机器人学与自主系统 | 第六卷 | 第1-2期 | 第3-15页&lt;br /&gt;
&lt;br /&gt;
| doi=10.1016/S0921-8890(05)80025-9&lt;br /&gt;
&lt;br /&gt;
| doi=10.1016/S0921-8890(05)80025-9&lt;br /&gt;
&lt;br /&gt;
10.1016 / S0921-8890(05)80025-9&lt;br /&gt;
&lt;br /&gt;
| url=http://people.csail.mit.edu/brooks/papers/elephants.pdf | archiveurl= https://web.archive.org/web/20070809020912/http://people.csail.mit.edu/brooks/papers/elephants.pdf&lt;br /&gt;
&lt;br /&gt;
| url=http://people.csail.mit.edu/brooks/papers/elephants.pdf | archiveurl= https://web.archive.org/web/20070809020912/http://people.csail.mit.edu/brooks/papers/elephants.pdf&lt;br /&gt;
&lt;br /&gt;
Http://people.csail.mit.edu/brooks/papers/elephants.pdf  https://web.archive.org/web/20070809020912/http://people.csail.mit.edu/brooks/papers/elephants.pdf&lt;br /&gt;
&lt;br /&gt;
| archivedate=9 August 2007 |url-status=live&lt;br /&gt;
&lt;br /&gt;
| archivedate=9 August 2007 |url-status=live&lt;br /&gt;
&lt;br /&gt;
2007年8月9日&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.588.7539 }}&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.588.7539 }}&lt;br /&gt;
&lt;br /&gt;
10.1.1.588.7539}&lt;br /&gt;
&lt;br /&gt;
* {{cite encyclopedia |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Brooks |first=R. A. |year=1991 |pages=225–239&lt;br /&gt;
&lt;br /&gt;
| last=Brooks |first=R. A. |year=1991 |pages=225–239&lt;br /&gt;
&lt;br /&gt;
| 最后的布鲁克斯 | 最初的 r。答:。1991年，第225-239页&lt;br /&gt;
&lt;br /&gt;
| title=How to build complete creatures rather than isolated cognitive simulators&lt;br /&gt;
&lt;br /&gt;
| title=How to build complete creatures rather than isolated cognitive simulators&lt;br /&gt;
&lt;br /&gt;
如何建造完整的生物而不是孤立的认知模拟器&lt;br /&gt;
&lt;br /&gt;
| editor-last=VanLehn |editor-first=K.&lt;br /&gt;
&lt;br /&gt;
| editor-last=VanLehn |editor-first=K.&lt;br /&gt;
&lt;br /&gt;
| 编辑-最后一个 VanLehn | 编辑-第一个 k。&lt;br /&gt;
&lt;br /&gt;
| encyclopedia=Architectures for Intelligence |location=Hillsdale, NJ |publisher=Lawrence Erlbaum Associates&lt;br /&gt;
&lt;br /&gt;
| encyclopedia=Architectures for Intelligence |location=Hillsdale, NJ |publisher=Lawrence Erlbaum Associates&lt;br /&gt;
&lt;br /&gt;
| 情报百科全书架构 | 位置希尔斯代尔，新泽西 | 出版商 Lawrence Erlbaum Associates&lt;br /&gt;
&lt;br /&gt;
|citeseerx=10.1.1.52.9510}}&lt;br /&gt;
&lt;br /&gt;
|citeseerx=10.1.1.52.9510}}&lt;br /&gt;
&lt;br /&gt;
10.1.1.52.9510}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
 |last=Buchanan&lt;br /&gt;
&lt;br /&gt;
 |last=Buchanan&lt;br /&gt;
&lt;br /&gt;
最后的布坎南&lt;br /&gt;
&lt;br /&gt;
 |first=Bruce G.&lt;br /&gt;
&lt;br /&gt;
 |first=Bruce G.&lt;br /&gt;
&lt;br /&gt;
首先是布鲁斯 · g。&lt;br /&gt;
&lt;br /&gt;
 |year=2005&lt;br /&gt;
&lt;br /&gt;
 |year=2005&lt;br /&gt;
&lt;br /&gt;
2005年&lt;br /&gt;
&lt;br /&gt;
 |pages=53–60&lt;br /&gt;
&lt;br /&gt;
 |pages=53–60&lt;br /&gt;
&lt;br /&gt;
第53-60页&lt;br /&gt;
&lt;br /&gt;
 |title=A (Very) Brief History of Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
 |title=A (Very) Brief History of Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
人工智能简史&lt;br /&gt;
&lt;br /&gt;
 |journal=AI Magazine&lt;br /&gt;
&lt;br /&gt;
 |journal=AI Magazine&lt;br /&gt;
&lt;br /&gt;
人工智能杂志&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.aaai.org/AITopics/assets/PDF/AIMag26-04-016.pdf&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.aaai.org/AITopics/assets/PDF/AIMag26-04-016.pdf&lt;br /&gt;
&lt;br /&gt;
Http://www.aaai.org/aitopics/assets/pdf/aimag26-04-016.pdf&lt;br /&gt;
&lt;br /&gt;
 |archiveurl=https://web.archive.org/web/20070926023314/http://www.aaai.org/AITopics/assets/PDF/AIMag26-04-016.pdf&lt;br /&gt;
&lt;br /&gt;
 |archiveurl=https://web.archive.org/web/20070926023314/http://www.aaai.org/AITopics/assets/PDF/AIMag26-04-016.pdf&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20070926023314/http://www.aaai.org/aitopics/assets/pdf/aimag26-04-016.pdf&lt;br /&gt;
&lt;br /&gt;
 |archivedate=26 September 2007&lt;br /&gt;
&lt;br /&gt;
 |archivedate=26 September 2007&lt;br /&gt;
&lt;br /&gt;
2007年9月26日&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
状态死机&lt;br /&gt;
&lt;br /&gt;
 |df=dmy&lt;br /&gt;
&lt;br /&gt;
 |df=dmy&lt;br /&gt;
&lt;br /&gt;
我不会让你失望的&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite news |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Butler |first=Samuel |authorlink=Samuel Butler (novelist) |date=13 June 1863&lt;br /&gt;
&lt;br /&gt;
| last=Butler |first=Samuel |authorlink=Samuel Butler (novelist) |date=13 June 1863&lt;br /&gt;
&lt;br /&gt;
塞缪尔 · 巴特勒(小说家)1863年6月13日&lt;br /&gt;
&lt;br /&gt;
| title=Darwin among the Machines&lt;br /&gt;
&lt;br /&gt;
| title=Darwin among the Machines&lt;br /&gt;
&lt;br /&gt;
标题: 机器中的达尔文&lt;br /&gt;
&lt;br /&gt;
| work=[[The Press]] |location=Christchurch, New Zealand |department=Letters to the Editor&lt;br /&gt;
&lt;br /&gt;
| work=The Press |location=Christchurch, New Zealand |department=Letters to the Editor&lt;br /&gt;
&lt;br /&gt;
| 工作 | 新闻 | 位置基督城 | 给编辑的信&lt;br /&gt;
&lt;br /&gt;
| url=http://www.nzetc.org/tm/scholarly/tei-ButFir-t1-g1-t1-g1-t4-body.html |accessdate=16 October 2014&lt;br /&gt;
&lt;br /&gt;
| url=http://www.nzetc.org/tm/scholarly/tei-ButFir-t1-g1-t1-g1-t4-body.html |accessdate=16 October 2014&lt;br /&gt;
&lt;br /&gt;
Http://www.nzetc.org/tm/scholarly/tei-butfir-t1-g1-t1-g1-t4-body.html  : 2014年10月16日&lt;br /&gt;
&lt;br /&gt;
| via=Victoria University of Wellington&lt;br /&gt;
&lt;br /&gt;
| via=Victoria University of Wellington&lt;br /&gt;
&lt;br /&gt;
惠灵顿维多利亚大学&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |url         = https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
 |url         = https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
Https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
 |title       = Why 2015 Was a Breakthrough Year in Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
 |title       = Why 2015 Was a Breakthrough Year in Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
为什么2015年是人工智能的突破之年&lt;br /&gt;
&lt;br /&gt;
 |last        = Clark&lt;br /&gt;
&lt;br /&gt;
 |last        = Clark&lt;br /&gt;
&lt;br /&gt;
最后的克拉克&lt;br /&gt;
&lt;br /&gt;
 |first       = Jack&lt;br /&gt;
&lt;br /&gt;
 |first       = Jack&lt;br /&gt;
&lt;br /&gt;
先是杰克&lt;br /&gt;
&lt;br /&gt;
 |website     = Bloomberg News&lt;br /&gt;
&lt;br /&gt;
 |website     = Bloomberg News&lt;br /&gt;
&lt;br /&gt;
彭博新闻网&lt;br /&gt;
&lt;br /&gt;
 |date        = 8 December 2015&lt;br /&gt;
&lt;br /&gt;
 |date        = 8 December 2015&lt;br /&gt;
&lt;br /&gt;
2015年12月8日&lt;br /&gt;
&lt;br /&gt;
 |access-date = 23 November 2016&lt;br /&gt;
&lt;br /&gt;
 |access-date = 23 November 2016&lt;br /&gt;
&lt;br /&gt;
| 2016年11月23日&lt;br /&gt;
&lt;br /&gt;
 |quote       = After a half-decade of quiet breakthroughs in artificial intelligence, 2015 has been a landmark year. Computers are smarter and learning faster than ever.&lt;br /&gt;
&lt;br /&gt;
 |quote       = After a half-decade of quiet breakthroughs in artificial intelligence, 2015 has been a landmark year. Computers are smarter and learning faster than ever.&lt;br /&gt;
&lt;br /&gt;
经过5年人工智能领域的悄然突破，2015年成为了具有里程碑意义的一年。计算机比以往更聪明，学习速度更快。&lt;br /&gt;
&lt;br /&gt;
 |url-status     = live&lt;br /&gt;
&lt;br /&gt;
 |url-status     = live&lt;br /&gt;
&lt;br /&gt;
状态直播&lt;br /&gt;
&lt;br /&gt;
 |archiveurl  = https://web.archive.org/web/20161123053855/https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
 |archiveurl  = https://web.archive.org/web/20161123053855/https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20161123053855/https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence&lt;br /&gt;
&lt;br /&gt;
 |archivedate = 23 November 2016&lt;br /&gt;
&lt;br /&gt;
 |archivedate = 23 November 2016&lt;br /&gt;
&lt;br /&gt;
2016年11月23日&lt;br /&gt;
&lt;br /&gt;
 |df          = dmy-all&lt;br /&gt;
&lt;br /&gt;
 |df          = dmy-all&lt;br /&gt;
&lt;br /&gt;
我不会放过你的&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite news |ref={{harvid|''CNN''|2006}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| title=AI set to exceed human brain power&lt;br /&gt;
&lt;br /&gt;
| title=AI set to exceed human brain power&lt;br /&gt;
&lt;br /&gt;
| 人工智能将超越人脑能力&lt;br /&gt;
&lt;br /&gt;
| work=CNN |date=26 July 2006&lt;br /&gt;
&lt;br /&gt;
| work=CNN |date=26 July 2006&lt;br /&gt;
&lt;br /&gt;
2006年7月26日&lt;br /&gt;
&lt;br /&gt;
| url=http://www.cnn.com/2006/TECH/science/07/24/ai.bostrom/&lt;br /&gt;
&lt;br /&gt;
| url=http://www.cnn.com/2006/TECH/science/07/24/ai.bostrom/&lt;br /&gt;
&lt;br /&gt;
Http://www.cnn.com/2006/tech/science/07/24/ai.bostrom/ &lt;br /&gt;
&lt;br /&gt;
| archiveurl= https://web.archive.org/web/20080219001624/http://www.cnn.com/2006/TECH/science/07/24/ai.bostrom/&lt;br /&gt;
&lt;br /&gt;
| archiveurl= https://web.archive.org/web/20080219001624/http://www.cnn.com/2006/TECH/science/07/24/ai.bostrom/&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20080219001624/http://www.cnn.com/2006/tech/science/07/24/ai.bostrom/ &lt;br /&gt;
&lt;br /&gt;
| archivedate=19 February 2008 |url-status=live&lt;br /&gt;
&lt;br /&gt;
| archivedate=19 February 2008 |url-status=live&lt;br /&gt;
&lt;br /&gt;
2008年2月19日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Dennett | first=Daniel | author-link=Daniel Dennett&lt;br /&gt;
&lt;br /&gt;
| last=Dennett | first=Daniel | author-link=Daniel Dennett&lt;br /&gt;
&lt;br /&gt;
丹尼特丹尼特丹尼特丹尼尔丹尼尔丹尼特丹尼尔丹尼特丹尼尔丹尼特丹尼尔丹尼特丹尼尔丹尼特&lt;br /&gt;
&lt;br /&gt;
| year=1991&lt;br /&gt;
&lt;br /&gt;
| year=1991&lt;br /&gt;
&lt;br /&gt;
1991年&lt;br /&gt;
&lt;br /&gt;
| title=Consciousness Explained&lt;br /&gt;
&lt;br /&gt;
| title=Consciousness Explained&lt;br /&gt;
&lt;br /&gt;
意识的解释&lt;br /&gt;
&lt;br /&gt;
| publisher=The Penguin Press&lt;br /&gt;
&lt;br /&gt;
| publisher=The Penguin Press&lt;br /&gt;
&lt;br /&gt;
企鹅出版社&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-7139-9037-9&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-7139-9037-9&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-7139-9037-9]&lt;br /&gt;
&lt;br /&gt;
| title-link=Consciousness Explained }}&lt;br /&gt;
&lt;br /&gt;
| title-link=Consciousness Explained }}&lt;br /&gt;
&lt;br /&gt;
| 标题-链接意识解释}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* {{cite magazine |ref=harv&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* {{cite magazine |ref=harv&lt;br /&gt;
&lt;br /&gt;
!-* { cite magazine | ref harv&lt;br /&gt;
&lt;br /&gt;
| last=Diamond |first=David |date=December 2003&lt;br /&gt;
&lt;br /&gt;
| last=Diamond |first=David |date=December 2003&lt;br /&gt;
&lt;br /&gt;
最后的钻石 | 第一个大卫 | 日期2003年12月&lt;br /&gt;
&lt;br /&gt;
| title=The Love Machine; Building computers that care&lt;br /&gt;
&lt;br /&gt;
| title=The Love Machine; Building computers that care&lt;br /&gt;
&lt;br /&gt;
| 题目: 爱情机器; 制造关心他人的电脑&lt;br /&gt;
&lt;br /&gt;
| magazine=Wired&lt;br /&gt;
&lt;br /&gt;
| magazine=Wired&lt;br /&gt;
&lt;br /&gt;
连线》杂志&lt;br /&gt;
&lt;br /&gt;
| url=https://www.wired.com/wired/archive/11.12/love.html&lt;br /&gt;
&lt;br /&gt;
| url=https://www.wired.com/wired/archive/11.12/love.html&lt;br /&gt;
&lt;br /&gt;
Https://www.wired.com/wired/archive/11.12/love.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl= https://web.archive.org/web/20080518185630/http://www.wired.com/wired/archive/11.12/love.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl= https://web.archive.org/web/20080518185630/http://www.wired.com/wired/archive/11.12/love.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20080518185630/http://www.wired.com/wired/archive/11.12/love.html&lt;br /&gt;
&lt;br /&gt;
| archivedate=18 May 2008 |url-status=live&lt;br /&gt;
&lt;br /&gt;
| archivedate=18 May 2008 |url-status=live&lt;br /&gt;
&lt;br /&gt;
2008年5月18日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
-- * { cite book | ref harv&lt;br /&gt;
&lt;br /&gt;
|first1=Pedro |last1=Domingos |author-link=Pedro Domingos&lt;br /&gt;
&lt;br /&gt;
|first1=Pedro |last1=Domingos |author-link=Pedro Domingos&lt;br /&gt;
&lt;br /&gt;
| first1 Pedro | last1 Domingos | 作者链接 Pedro Domingos&lt;br /&gt;
&lt;br /&gt;
|year=2015&lt;br /&gt;
&lt;br /&gt;
|year=2015&lt;br /&gt;
&lt;br /&gt;
2015年&lt;br /&gt;
&lt;br /&gt;
|title=The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World&lt;br /&gt;
&lt;br /&gt;
|title=The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World&lt;br /&gt;
&lt;br /&gt;
大师级算法: 探索终极学习机器将如何改造我们的世界&lt;br /&gt;
&lt;br /&gt;
|publisher = Basic Books&lt;br /&gt;
&lt;br /&gt;
|publisher = Basic Books&lt;br /&gt;
&lt;br /&gt;
| 出版商 Basic Books&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-465-06192-1&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-465-06192-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-465-06192-1]&lt;br /&gt;
&lt;br /&gt;
|title-link=The Master Algorithm }}&lt;br /&gt;
&lt;br /&gt;
|title-link=The Master Algorithm }}&lt;br /&gt;
&lt;br /&gt;
| title-link The Master Algorithm }&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv |last1=Dowe |first1=D. L. |last2=Hajek |first2=A. R. |year=1997 |title=A computational extension to the Turing Test |journal=Proceedings of the 4th Conference of the Australasian Cognitive Science Society |url=http://www.csse.monash.edu.au/publications/1997/tr-cs97-322-abs.html |url-status=dead |archiveurl=https://web.archive.org/web/20110628194905/http://www.csse.monash.edu.au/publications/1997/tr-cs97-322-abs.html |archivedate=28 June 2011 |df=dmy-all }}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Dreyfus | first=Hubert | authorlink = Hubert Dreyfus&lt;br /&gt;
&lt;br /&gt;
| last=Dreyfus | first=Hubert | authorlink = Hubert Dreyfus&lt;br /&gt;
&lt;br /&gt;
作者: 休伯特 · 德雷福斯&lt;br /&gt;
&lt;br /&gt;
| year = 1972&lt;br /&gt;
&lt;br /&gt;
| year = 1972&lt;br /&gt;
&lt;br /&gt;
1972年&lt;br /&gt;
&lt;br /&gt;
| title = What Computers Can't Do&lt;br /&gt;
&lt;br /&gt;
| title = What Computers Can't Do&lt;br /&gt;
&lt;br /&gt;
计算机不能做什么&lt;br /&gt;
&lt;br /&gt;
| publisher = MIT Press | location = New York&lt;br /&gt;
&lt;br /&gt;
| publisher = MIT Press | location = New York&lt;br /&gt;
&lt;br /&gt;
| 出版商麻省理工学院出版社 | 位置纽约&lt;br /&gt;
&lt;br /&gt;
| isbn = 978-0-06-011082-6&lt;br /&gt;
&lt;br /&gt;
| isbn = 978-0-06-011082-6&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-06-011082-6]&lt;br /&gt;
&lt;br /&gt;
| title-link=What Computers Can't Do }}&lt;br /&gt;
&lt;br /&gt;
| title-link=What Computers Can't Do }}&lt;br /&gt;
&lt;br /&gt;
| title-link What Computers can’t Do }&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref        = harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |last       = Dreyfus&lt;br /&gt;
&lt;br /&gt;
 |last       = Dreyfus&lt;br /&gt;
&lt;br /&gt;
最后一个德雷福斯&lt;br /&gt;
&lt;br /&gt;
 |first      = Hubert&lt;br /&gt;
&lt;br /&gt;
 |first      = Hubert&lt;br /&gt;
&lt;br /&gt;
首先是休伯特&lt;br /&gt;
&lt;br /&gt;
 |authorlink = Hubert Dreyfus&lt;br /&gt;
&lt;br /&gt;
 |authorlink = Hubert Dreyfus&lt;br /&gt;
&lt;br /&gt;
作者: 休伯特 · 德雷福斯&lt;br /&gt;
&lt;br /&gt;
 |last2      = Dreyfus&lt;br /&gt;
&lt;br /&gt;
 |last2      = Dreyfus&lt;br /&gt;
&lt;br /&gt;
最后2名路易达孚&lt;br /&gt;
&lt;br /&gt;
 |first2     = Stuart&lt;br /&gt;
&lt;br /&gt;
 |first2     = Stuart&lt;br /&gt;
&lt;br /&gt;
| first2 Stuart&lt;br /&gt;
&lt;br /&gt;
 |year       = 1986&lt;br /&gt;
&lt;br /&gt;
 |year       = 1986&lt;br /&gt;
&lt;br /&gt;
1986年&lt;br /&gt;
&lt;br /&gt;
 |title      = Mind over Machine: The Power of Human Intuition and Expertise in the Era of the Computer&lt;br /&gt;
&lt;br /&gt;
 |title      = Mind over Machine: The Power of Human Intuition and Expertise in the Era of the Computer&lt;br /&gt;
&lt;br /&gt;
心智胜过机器: 计算机时代人类直觉和专业知识的力量&lt;br /&gt;
&lt;br /&gt;
 |publisher  = Blackwell&lt;br /&gt;
&lt;br /&gt;
 |publisher  = Blackwell&lt;br /&gt;
&lt;br /&gt;
| 出版商 Blackwell&lt;br /&gt;
&lt;br /&gt;
 |location   = Oxford, UK&lt;br /&gt;
&lt;br /&gt;
 |location   = Oxford, UK&lt;br /&gt;
&lt;br /&gt;
| 位置: 牛津，英国&lt;br /&gt;
&lt;br /&gt;
 |isbn       = 978-0-02-908060-3&lt;br /&gt;
&lt;br /&gt;
 |isbn       = 978-0-02-908060-3&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-02-908060-3]&lt;br /&gt;
&lt;br /&gt;
 |url        = https://archive.org/details/mindovermachinep00drey&lt;br /&gt;
&lt;br /&gt;
 |url        = https://archive.org/details/mindovermachinep00drey&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/mindovermachinep00drey&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Dreyfus | first=Hubert | authorlink = Hubert Dreyfus&lt;br /&gt;
&lt;br /&gt;
| last=Dreyfus | first=Hubert | authorlink = Hubert Dreyfus&lt;br /&gt;
&lt;br /&gt;
作者: 休伯特 · 德雷福斯&lt;br /&gt;
&lt;br /&gt;
| year =1992&lt;br /&gt;
&lt;br /&gt;
| year =1992&lt;br /&gt;
&lt;br /&gt;
1992年&lt;br /&gt;
&lt;br /&gt;
| title = What Computers ''Still'' Can't Do&lt;br /&gt;
&lt;br /&gt;
| title = What Computers Still Can't Do&lt;br /&gt;
&lt;br /&gt;
计算机仍然不能做什么&lt;br /&gt;
&lt;br /&gt;
| publisher = MIT Press | location = New York&lt;br /&gt;
&lt;br /&gt;
| publisher = MIT Press | location = New York&lt;br /&gt;
&lt;br /&gt;
| 出版商麻省理工学院出版社 | 位置纽约&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-262-54067-4&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-262-54067-4&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-262-54067-4]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
|last=Dyson&lt;br /&gt;
&lt;br /&gt;
|last=Dyson&lt;br /&gt;
&lt;br /&gt;
戴森&lt;br /&gt;
&lt;br /&gt;
|first=George&lt;br /&gt;
&lt;br /&gt;
|first=George&lt;br /&gt;
&lt;br /&gt;
先是乔治&lt;br /&gt;
&lt;br /&gt;
|authorlink=George Dyson (science historian)&lt;br /&gt;
&lt;br /&gt;
|authorlink=George Dyson (science historian)&lt;br /&gt;
&lt;br /&gt;
乔治 · 戴森(科学历史学家)&lt;br /&gt;
&lt;br /&gt;
|year=1998&lt;br /&gt;
&lt;br /&gt;
|year=1998&lt;br /&gt;
&lt;br /&gt;
1998年&lt;br /&gt;
&lt;br /&gt;
|title=Darwin among the Machines&lt;br /&gt;
&lt;br /&gt;
|title=Darwin among the Machines&lt;br /&gt;
&lt;br /&gt;
标题: 机器中的达尔文&lt;br /&gt;
&lt;br /&gt;
|publisher=Allan Lane Science&lt;br /&gt;
&lt;br /&gt;
|publisher=Allan Lane Science&lt;br /&gt;
&lt;br /&gt;
| 出版人 Allan Lane Science&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-7382-0030-9&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-7382-0030-9&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-0-7382-0030-9]&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/darwinamongmachi00dyso&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/darwinamongmachi00dyso&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/darwinamongmachi00dyso&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web|ref=harv |last=Edelman |first=Gerald |authorlink=Gerald Edelman |date=23 November 2007 |title=Gerald Edelman – Neural Darwinism and Brain-based Devices |url=http://lis.epfl.ch/resources/podcast/2007/11/gerald-edelman-neural-darwinism-and.html |publisher=Talking Robots |url-status=dead |archiveurl=https://web.archive.org/web/20091008184132/http://lis.epfl.ch/resources/podcast/2007/11/gerald-edelman-neural-darwinism-and.html |archivedate=8 October 2009}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Edelson |first=Edward |year=1991&lt;br /&gt;
&lt;br /&gt;
| last=Edelson |first=Edward |year=1991&lt;br /&gt;
&lt;br /&gt;
1991年&lt;br /&gt;
&lt;br /&gt;
| title=The Nervous System&lt;br /&gt;
&lt;br /&gt;
| title=The Nervous System&lt;br /&gt;
&lt;br /&gt;
神经系统&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/nervoussystem0000edel&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/nervoussystem0000edel&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/nervoussystem0000edel&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
| publisher=Chelsea House&amp;lt;!--so Worldcat, originally here Remmel Nunn--&amp;gt; |location=New York |isbn=978-0-7910-0464-7&lt;br /&gt;
&lt;br /&gt;
| publisher=Chelsea House&amp;lt;!--so Worldcat, originally here Remmel Nunn--&amp;gt; |location=New York |isbn=978-0-7910-0464-7&lt;br /&gt;
&lt;br /&gt;
| 出版商切尔西之家! -- 所以 worldcat，最初在这里 remmel nunn-- | 位置纽约 | isbn 978-0-7910-0464-7&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Fearn&lt;br /&gt;
&lt;br /&gt;
| last=Fearn&lt;br /&gt;
&lt;br /&gt;
最后的恐惧&lt;br /&gt;
&lt;br /&gt;
| first = Nicholas&lt;br /&gt;
&lt;br /&gt;
| first = Nicholas&lt;br /&gt;
&lt;br /&gt;
| first = Nicholas&lt;br /&gt;
&lt;br /&gt;
| year =2007&lt;br /&gt;
&lt;br /&gt;
| year =2007&lt;br /&gt;
&lt;br /&gt;
2007年&lt;br /&gt;
&lt;br /&gt;
| title= The Latest Answers to the Oldest Questions: A Philosophical Adventure with the World's Greatest Thinkers&lt;br /&gt;
&lt;br /&gt;
| title= The Latest Answers to the Oldest Questions: A Philosophical Adventure with the World's Greatest Thinkers&lt;br /&gt;
&lt;br /&gt;
最古老问题的最新答案: 世界上最伟大思想家的哲学探险&lt;br /&gt;
&lt;br /&gt;
| publisher = Grove Press&lt;br /&gt;
&lt;br /&gt;
| publisher = Grove Press&lt;br /&gt;
&lt;br /&gt;
出版商: 格罗夫出版社&lt;br /&gt;
&lt;br /&gt;
| location=New York |isbn=978-0-8021-1839-4&lt;br /&gt;
&lt;br /&gt;
| location=New York |isbn=978-0-8021-1839-4&lt;br /&gt;
&lt;br /&gt;
| 位置纽约 | isbn 978-0-8021-1839-4&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 | last = Gladwell | first = Malcolm | authorlink= Malcolm Gladwell&lt;br /&gt;
&lt;br /&gt;
 | last = Gladwell | first = Malcolm | authorlink= Malcolm Gladwell&lt;br /&gt;
&lt;br /&gt;
2012年10月12日 | 最后一个马尔科姆·格拉德威尔 | 第一个 Malcolm | 作者 / 链接&lt;br /&gt;
&lt;br /&gt;
 | year = 2005&lt;br /&gt;
&lt;br /&gt;
 | year = 2005&lt;br /&gt;
&lt;br /&gt;
2005年&lt;br /&gt;
&lt;br /&gt;
 | title = Blink&lt;br /&gt;
&lt;br /&gt;
 | title = Blink&lt;br /&gt;
&lt;br /&gt;
标题: 眨眼&lt;br /&gt;
&lt;br /&gt;
 | isbn = 978-0-316-17232-5&lt;br /&gt;
&lt;br /&gt;
 | isbn = 978-0-316-17232-5&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-316-17232-5]&lt;br /&gt;
&lt;br /&gt;
 | publisher = Little, Brown and Co. | location = New York&lt;br /&gt;
&lt;br /&gt;
 | publisher = Little, Brown and Co. | location = New York&lt;br /&gt;
&lt;br /&gt;
| 出版商 Little，Brown and co. | 位置: 纽约&lt;br /&gt;
&lt;br /&gt;
| title-link = Blink (book) }}&lt;br /&gt;
&lt;br /&gt;
| title-link = Blink (book) }}&lt;br /&gt;
&lt;br /&gt;
| title-link Blink (book)}&lt;br /&gt;
&lt;br /&gt;
* {{cite conference | ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Gödel |first=Kurt |authorlink=Kurt Gödel |year=1951&lt;br /&gt;
&lt;br /&gt;
| last=Gödel |first=Kurt |authorlink=Kurt Gödel |year=1951&lt;br /&gt;
&lt;br /&gt;
1951年&lt;br /&gt;
&lt;br /&gt;
| title=Some basic theorems on the foundations of mathematics and their implications&lt;br /&gt;
&lt;br /&gt;
| title=Some basic theorems on the foundations of mathematics and their implications&lt;br /&gt;
&lt;br /&gt;
关于数学基础的一些基本定理及其意义&lt;br /&gt;
&lt;br /&gt;
| conference=Gibbs Lecture&lt;br /&gt;
&lt;br /&gt;
| conference=Gibbs Lecture&lt;br /&gt;
&lt;br /&gt;
会议吉布斯讲座&lt;br /&gt;
&lt;br /&gt;
}} In&amp;lt;br /&amp;gt; {{cite book&lt;br /&gt;
&lt;br /&gt;
}} In&amp;lt;br /&amp;gt; {{cite book&lt;br /&gt;
&lt;br /&gt;
}在 br / { cite book&lt;br /&gt;
&lt;br /&gt;
| editor-last=Feferman |editor-first=Solomon |editorlink=Solomon Feferman |year=1995 |pages=304–23&lt;br /&gt;
&lt;br /&gt;
| editor-last=Feferman |editor-first=Solomon |editorlink=Solomon Feferman |year=1995 |pages=304–23&lt;br /&gt;
&lt;br /&gt;
| 编辑-最后费尔曼 | 编辑-第一所罗门 | 编辑链接所罗门费尔曼 | 1995年 | 第304-23页&lt;br /&gt;
&lt;br /&gt;
| title=Kurt Gödel: Collected Works, Vol. III: Unpublished Essays and Lectures&lt;br /&gt;
&lt;br /&gt;
| title=Kurt Gödel: Collected Works, Vol. III: Unpublished Essays and Lectures&lt;br /&gt;
&lt;br /&gt;
库尔特 · 德尔: 作品集，第卷。三: 未发表的文章和讲座&lt;br /&gt;
&lt;br /&gt;
| publisher=Oxford University Press |isbn=978-0-19-514722-3&lt;br /&gt;
&lt;br /&gt;
| publisher=Oxford University Press |isbn=978-0-19-514722-3&lt;br /&gt;
&lt;br /&gt;
牛津大学出版社 | isbn 978-0-19-514722-3&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Haugeland | first=John | author-link = John Haugeland&lt;br /&gt;
&lt;br /&gt;
| last=Haugeland | first=John | author-link = John Haugeland&lt;br /&gt;
&lt;br /&gt;
作者链接: 约翰 · 豪格兰德&lt;br /&gt;
&lt;br /&gt;
| year = 1985&lt;br /&gt;
&lt;br /&gt;
| year = 1985&lt;br /&gt;
&lt;br /&gt;
1985年&lt;br /&gt;
&lt;br /&gt;
| title = Artificial Intelligence: The Very Idea&lt;br /&gt;
&lt;br /&gt;
| title = Artificial Intelligence: The Very Idea&lt;br /&gt;
&lt;br /&gt;
人工智能: 最重要的理念&lt;br /&gt;
&lt;br /&gt;
| publisher=MIT Press| location= Cambridge, Mass.&lt;br /&gt;
&lt;br /&gt;
| publisher=MIT Press| location= Cambridge, Mass.&lt;br /&gt;
&lt;br /&gt;
麻省理工学院出版社 | 位置: 马萨诸塞州剑桥。&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-262-08153-5&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-262-08153-5&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-0-262-08153-5]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Hawkins | first=Jeff | author-link=Jeff Hawkins&lt;br /&gt;
&lt;br /&gt;
| last=Hawkins | first=Jeff | author-link=Jeff Hawkins&lt;br /&gt;
&lt;br /&gt;
作者链接杰夫 · 霍金斯&lt;br /&gt;
&lt;br /&gt;
| last2=Blakeslee | first2=Sandra&lt;br /&gt;
&lt;br /&gt;
| last2=Blakeslee | first2=Sandra&lt;br /&gt;
&lt;br /&gt;
2 Blakeslee | first2 Sandra&lt;br /&gt;
&lt;br /&gt;
| year=2005&lt;br /&gt;
&lt;br /&gt;
| year=2005&lt;br /&gt;
&lt;br /&gt;
2005年&lt;br /&gt;
&lt;br /&gt;
| title=On Intelligence&lt;br /&gt;
&lt;br /&gt;
| title=On Intelligence&lt;br /&gt;
&lt;br /&gt;
关于智力&lt;br /&gt;
&lt;br /&gt;
| publisher=Owl Books | location=New York, NY&lt;br /&gt;
&lt;br /&gt;
| publisher=Owl Books | location=New York, NY&lt;br /&gt;
&lt;br /&gt;
| 出版商 Owl Books | 位置: 纽约，纽约&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-8050-7853-4&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-8050-7853-4&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-0-8050-7853-4]&lt;br /&gt;
&lt;br /&gt;
| title-link=On Intelligence }}&lt;br /&gt;
&lt;br /&gt;
| title-link=On Intelligence }}&lt;br /&gt;
&lt;br /&gt;
| title-link On Intelligence }&lt;br /&gt;
&lt;br /&gt;
* {{cite news |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Henderson |first=Mark |date=24 April 2007&lt;br /&gt;
&lt;br /&gt;
| last=Henderson |first=Mark |date=24 April 2007&lt;br /&gt;
&lt;br /&gt;
2007年4月24日&lt;br /&gt;
&lt;br /&gt;
| title=Human rights for robots? We're getting carried away&lt;br /&gt;
&lt;br /&gt;
| title=Human rights for robots? We're getting carried away&lt;br /&gt;
&lt;br /&gt;
| 题目: 机器人的人权？我们太激动了&lt;br /&gt;
&lt;br /&gt;
| url=http://www.thetimes.co.uk/tto/technology/article1966391.ece&lt;br /&gt;
&lt;br /&gt;
| url=http://www.thetimes.co.uk/tto/technology/article1966391.ece&lt;br /&gt;
&lt;br /&gt;
Http://www.thetimes.co.uk/tto/technology/article1966391.ece&lt;br /&gt;
&lt;br /&gt;
| work=The Times Online | location=London&lt;br /&gt;
&lt;br /&gt;
| work=The Times Online | location=London&lt;br /&gt;
&lt;br /&gt;
纽约时报在线 | 位置: 伦敦&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Hernandez-Orallo |first=Jose |year=2000&lt;br /&gt;
&lt;br /&gt;
| last=Hernandez-Orallo |first=Jose |year=2000&lt;br /&gt;
&lt;br /&gt;
最后赫尔南德斯-奥拉罗 | 第一何塞 | 2000年&lt;br /&gt;
&lt;br /&gt;
| title=Beyond the Turing Test&lt;br /&gt;
&lt;br /&gt;
| title=Beyond the Turing Test&lt;br /&gt;
&lt;br /&gt;
超越图灵测试&lt;br /&gt;
&lt;br /&gt;
| journal=Journal of Logic, Language and Information |volume=9 |issue=4 |pages=447–466&lt;br /&gt;
&lt;br /&gt;
| journal=Journal of Logic, Language and Information |volume=9 |issue=4 |pages=447–466&lt;br /&gt;
&lt;br /&gt;
逻辑、语言与信息杂志 | 第9卷 | 第4期 | 第447-466页&lt;br /&gt;
&lt;br /&gt;
| doi=10.1023/A:1008367325700&lt;br /&gt;
&lt;br /&gt;
| doi=10.1023/A:1008367325700&lt;br /&gt;
&lt;br /&gt;
10.1023 / a: 1008367325700&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=Hernandez-Orallo |first1=J. |last2=Dowe |first2=D. L. |year=2010&lt;br /&gt;
&lt;br /&gt;
| last1=Hernandez-Orallo |first1=J. |last2=Dowe |first2=D. L. |year=2010&lt;br /&gt;
&lt;br /&gt;
| 最后一次赫尔南德斯-奥拉罗 | 初次1 j。2 d.2010年&lt;br /&gt;
&lt;br /&gt;
| title=Measuring Universal Intelligence: Towards an Anytime Intelligence Test&lt;br /&gt;
&lt;br /&gt;
| title=Measuring Universal Intelligence: Towards an Anytime Intelligence Test&lt;br /&gt;
&lt;br /&gt;
测量普遍智力: 走向随时智力测试&lt;br /&gt;
&lt;br /&gt;
| journal=Artificial Intelligence |volume=174 |issue=18 |pages=1508–1539&lt;br /&gt;
&lt;br /&gt;
| journal=Artificial Intelligence |volume=174 |issue=18 |pages=1508–1539&lt;br /&gt;
&lt;br /&gt;
人工智能杂志 | 第174卷 | 第18期 | 第1508-1539页&lt;br /&gt;
&lt;br /&gt;
| doi=10.1016/j.artint.2010.09.006&lt;br /&gt;
&lt;br /&gt;
| doi=10.1016/j.artint.2010.09.006&lt;br /&gt;
&lt;br /&gt;
10.1016 / j.artint. 2010.09.006&lt;br /&gt;
&lt;br /&gt;
|citeseerx=10.1.1.295.9079}}&lt;br /&gt;
&lt;br /&gt;
|citeseerx=10.1.1.295.9079}}&lt;br /&gt;
&lt;br /&gt;
10.1.1.295.9079}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Hinton |first=G. E. |year=2007&lt;br /&gt;
&lt;br /&gt;
| last=Hinton |first=G. E. |year=2007&lt;br /&gt;
&lt;br /&gt;
最后辛顿 | 第一个 g。2007年&lt;br /&gt;
&lt;br /&gt;
| title=Learning multiple layers of representation&lt;br /&gt;
&lt;br /&gt;
| title=Learning multiple layers of representation&lt;br /&gt;
&lt;br /&gt;
学习多层次的表现&lt;br /&gt;
&lt;br /&gt;
| journal=Trends in Cognitive Sciences |volume=11 | issue=10 |pages=428–434 | doi=10.1016/j.tics.2007.09.004&lt;br /&gt;
&lt;br /&gt;
| journal=Trends in Cognitive Sciences |volume=11 | issue=10 |pages=428–434 | doi=10.1016/j.tics.2007.09.004&lt;br /&gt;
&lt;br /&gt;
认知科学趋势 | 第11卷 | 第10期 | 第428-434页 | doi 10.1016 / j.tics. 2007.09.004&lt;br /&gt;
&lt;br /&gt;
| pmid=17921042 }}&lt;br /&gt;
&lt;br /&gt;
| pmid=17921042 }}&lt;br /&gt;
&lt;br /&gt;
17921042}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Hofstadter | first = Douglas | author-link = Douglas Hofstadter&lt;br /&gt;
&lt;br /&gt;
| last=Hofstadter | first = Douglas | author-link = Douglas Hofstadter&lt;br /&gt;
&lt;br /&gt;
侯世达: 2012年3月15日&lt;br /&gt;
&lt;br /&gt;
| year = 1979&lt;br /&gt;
&lt;br /&gt;
| year = 1979&lt;br /&gt;
&lt;br /&gt;
1979年&lt;br /&gt;
&lt;br /&gt;
| title = Gödel, Escher, Bach: an Eternal Golden Braid&lt;br /&gt;
&lt;br /&gt;
| title = Gödel, Escher, Bach: an Eternal Golden Braid&lt;br /&gt;
&lt;br /&gt;
巴赫: 永恒的金色辫子&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-394-74502-2&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-394-74502-2&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-394-74502-2]&lt;br /&gt;
&lt;br /&gt;
| publisher=Vintage Books&lt;br /&gt;
&lt;br /&gt;
| publisher=Vintage Books&lt;br /&gt;
&lt;br /&gt;
出版商 Vintage Books&lt;br /&gt;
&lt;br /&gt;
| location=New York, NY&lt;br /&gt;
&lt;br /&gt;
| location=New York, NY&lt;br /&gt;
&lt;br /&gt;
纽约，纽约&lt;br /&gt;
&lt;br /&gt;
| title-link=Gödel, Escher, Bach }}&lt;br /&gt;
&lt;br /&gt;
| title-link=Gödel, Escher, Bach }}&lt;br /&gt;
&lt;br /&gt;
| title-link=Gödel, Escher, Bach }}&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
|last=Holland&lt;br /&gt;
&lt;br /&gt;
|last=Holland&lt;br /&gt;
&lt;br /&gt;
去年荷兰&lt;br /&gt;
&lt;br /&gt;
|first=John H.&lt;br /&gt;
&lt;br /&gt;
|first=John H.&lt;br /&gt;
&lt;br /&gt;
首先是约翰 · h。&lt;br /&gt;
&lt;br /&gt;
|year=1975&lt;br /&gt;
&lt;br /&gt;
|year=1975&lt;br /&gt;
&lt;br /&gt;
1975年&lt;br /&gt;
&lt;br /&gt;
|title=Adaptation in Natural and Artificial Systems&lt;br /&gt;
&lt;br /&gt;
|title=Adaptation in Natural and Artificial Systems&lt;br /&gt;
&lt;br /&gt;
自然和人工系统中的适应&lt;br /&gt;
&lt;br /&gt;
|publisher=University of Michigan Press&lt;br /&gt;
&lt;br /&gt;
|publisher=University of Michigan Press&lt;br /&gt;
&lt;br /&gt;
出版商密西根大学出版社&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-262-58111-0&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-262-58111-0&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-0-262-58111-0]&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/adaptationinnatu00holl&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/adaptationinnatu00holl&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/adaptationinnatu00holl&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| first = J. | last = Howe&lt;br /&gt;
&lt;br /&gt;
| first = J. | last = Howe&lt;br /&gt;
&lt;br /&gt;
首先是 j。最后豪&lt;br /&gt;
&lt;br /&gt;
| date = November 1994&lt;br /&gt;
&lt;br /&gt;
| date = November 1994&lt;br /&gt;
&lt;br /&gt;
1994年11月&lt;br /&gt;
&lt;br /&gt;
| title = Artificial Intelligence at Edinburgh University: a Perspective&lt;br /&gt;
&lt;br /&gt;
| title = Artificial Intelligence at Edinburgh University: a Perspective&lt;br /&gt;
&lt;br /&gt;
爱丁堡大学的人工智能: 一个远景&lt;br /&gt;
&lt;br /&gt;
| url=http://www.inf.ed.ac.uk/about/AIhistory.html | accessdate=30 August 2007&lt;br /&gt;
&lt;br /&gt;
| url=http://www.inf.ed.ac.uk/about/AIhistory.html | accessdate=30 August 2007&lt;br /&gt;
&lt;br /&gt;
Http://www.inf.ed.ac.uk/about/aihistory.html  : 2007年8月30日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Hutter |first=M. |year=2012&lt;br /&gt;
&lt;br /&gt;
| last=Hutter |first=M. |year=2012&lt;br /&gt;
&lt;br /&gt;
| 最后的哈特 | 第一个 m。2012年&lt;br /&gt;
&lt;br /&gt;
| title=Theoretical Foundations of Artificial General Intelligence&lt;br /&gt;
&lt;br /&gt;
| title=Theoretical Foundations of Artificial General Intelligence&lt;br /&gt;
&lt;br /&gt;
人工智能的理论基础&lt;br /&gt;
&lt;br /&gt;
| chapter=One Decade of Universal Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
| chapter=One Decade of Universal Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
通用人工智能的十年&lt;br /&gt;
&lt;br /&gt;
| volume=4 | pages=67–88 |series=Atlantis Thinking Machines&lt;br /&gt;
&lt;br /&gt;
| volume=4 | pages=67–88 |series=Atlantis Thinking Machines&lt;br /&gt;
&lt;br /&gt;
| 第4卷 | 第67-88页 | 亚特兰蒂斯思考机器系列&lt;br /&gt;
&lt;br /&gt;
| doi=10.2991/978-94-91216-62-6_5 |isbn=978-94-91216-61-9&lt;br /&gt;
&lt;br /&gt;
| doi=10.2991/978-94-91216-62-6_5 |isbn=978-94-91216-61-9&lt;br /&gt;
&lt;br /&gt;
10.2991 / 978-94-91216-62-65 | isbn 978-94-91216-61-9&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.228.8725 }}&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.228.8725 }}&lt;br /&gt;
&lt;br /&gt;
10.1.1.228.8725}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
!-* { cite journal | ref harv&lt;br /&gt;
&lt;br /&gt;
| last=James |first=William |year=1884&lt;br /&gt;
&lt;br /&gt;
| last=James |first=William |year=1884&lt;br /&gt;
&lt;br /&gt;
1884年&lt;br /&gt;
&lt;br /&gt;
| title=What is Emotion&lt;br /&gt;
&lt;br /&gt;
| title=What is Emotion&lt;br /&gt;
&lt;br /&gt;
什么是情感&lt;br /&gt;
&lt;br /&gt;
| journal=Mind |volume=9 | issue=34 |pages=188–205 |doi=10.1093/mind/os-IX.34.188&lt;br /&gt;
&lt;br /&gt;
| journal=Mind |volume=9 | issue=34 |pages=188–205 |doi=10.1093/mind/os-IX.34.188&lt;br /&gt;
&lt;br /&gt;
心灵日志 | 第9卷 | 第34期 | 第188-205页 | doi 10.1093 / Mind / os-ix. 34.188&lt;br /&gt;
&lt;br /&gt;
}} Cited by {{harvnb|Tao|Tan|2005}}.&lt;br /&gt;
&lt;br /&gt;
}} Cited by .&lt;br /&gt;
&lt;br /&gt;
引用。&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
-- * { cite book | ref harv&lt;br /&gt;
&lt;br /&gt;
| last=Kahneman | first=Daniel | author-link=Daniel Kahneman&lt;br /&gt;
&lt;br /&gt;
| last=Kahneman | first=Daniel | author-link=Daniel Kahneman&lt;br /&gt;
&lt;br /&gt;
作者: 丹尼尔 · 卡尼曼&lt;br /&gt;
&lt;br /&gt;
| last2=Slovic | first2= D.&lt;br /&gt;
&lt;br /&gt;
| last2=Slovic | first2= D.&lt;br /&gt;
&lt;br /&gt;
2 | Slovic | first2 d.&lt;br /&gt;
&lt;br /&gt;
| last3=Tversky | first3=Amos | author3-link=Amos Tversky&lt;br /&gt;
&lt;br /&gt;
| last3=Tversky | first3=Amos | author3-link=Amos Tversky&lt;br /&gt;
&lt;br /&gt;
| last 3 Tversky | first3 Amos | author3-link Amos Tversky&lt;br /&gt;
&lt;br /&gt;
| year=1982&lt;br /&gt;
&lt;br /&gt;
| year=1982&lt;br /&gt;
&lt;br /&gt;
1982年&lt;br /&gt;
&lt;br /&gt;
| title=Judgment under uncertainty: Heuristics and biases&lt;br /&gt;
&lt;br /&gt;
| title=Judgment under uncertainty: Heuristics and biases&lt;br /&gt;
&lt;br /&gt;
不确定条件下的判断: 启发式和偏见&lt;br /&gt;
&lt;br /&gt;
| journal=Science | volume=185 | issue=4157 | pages=1124–31 | publisher=Cambridge University Press | location=New York&lt;br /&gt;
&lt;br /&gt;
| journal=Science | volume=185 | issue=4157 | pages=1124–31 | publisher=Cambridge University Press | location=New York&lt;br /&gt;
&lt;br /&gt;
科学杂志 | 第185卷 | 第4157期 | 第1124-31页 | 出版商剑桥大学出版社 | 位置纽约&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-521-28414-1&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-521-28414-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-521-28414-1]&lt;br /&gt;
&lt;br /&gt;
| pmid=17835457 | doi=10.1126/science.185.4157.1124 }}&lt;br /&gt;
&lt;br /&gt;
| pmid=17835457 | doi=10.1126/science.185.4157.1124 }}&lt;br /&gt;
&lt;br /&gt;
10.1126 / science. 185.4157.1124}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Kaplan |first=Andreas&lt;br /&gt;
&lt;br /&gt;
| last=Kaplan |first=Andreas&lt;br /&gt;
&lt;br /&gt;
最后的卡普兰 | 第一安德烈亚斯&lt;br /&gt;
&lt;br /&gt;
| last2=Haenlein | first2= Michael&lt;br /&gt;
&lt;br /&gt;
| last2=Haenlein | first2= Michael&lt;br /&gt;
&lt;br /&gt;
最后2个 Haenlein 最初2个 Michael&lt;br /&gt;
&lt;br /&gt;
| title=Siri, Siri in my Hand, who's the Fairest in the Land? On the Interpretations, Illustrations and Implications of Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
| title=Siri, Siri in my Hand, who's the Fairest in the Land? On the Interpretations, Illustrations and Implications of Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
谁是世界上最美丽的女人？论人工智能的解释、实例及其意义&lt;br /&gt;
&lt;br /&gt;
| journal=Business Horizons | volume=62 | pages=15–25 | doi=10.1016/j.bushor.2018.08.004 | year=2019 }}&lt;br /&gt;
&lt;br /&gt;
| journal=Business Horizons | volume=62 | pages=15–25 | doi=10.1016/j.bushor.2018.08.004 | year=2019 }}&lt;br /&gt;
&lt;br /&gt;
商业视野杂志 | 第62卷 | 第15-25页 | doi 10.1016 / j.bushor. 2018.08.004 | year 2019}&lt;br /&gt;
&lt;br /&gt;
* {{cite magazine |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Katz |first=Yarden |date=1 November 2012&lt;br /&gt;
&lt;br /&gt;
| last=Katz |first=Yarden |date=1 November 2012&lt;br /&gt;
&lt;br /&gt;
2012年11月1日&lt;br /&gt;
&lt;br /&gt;
| title=Noam Chomsky on Where Artificial Intelligence Went Wrong&lt;br /&gt;
&lt;br /&gt;
| title=Noam Chomsky on Where Artificial Intelligence Went Wrong&lt;br /&gt;
&lt;br /&gt;
诺姆 · 乔姆斯基: 人工智能哪里出了问题&lt;br /&gt;
&lt;br /&gt;
| magazine=The Atlantic&lt;br /&gt;
&lt;br /&gt;
| magazine=The Atlantic&lt;br /&gt;
&lt;br /&gt;
美国《大西洋月刊》&lt;br /&gt;
&lt;br /&gt;
| url=https://www.theatlantic.com/technology/archive/2012/11/noam-chomsky-on-where-artificial-intelligence-went-wrong/261637/?single_page=true |accessdate=26 October 2014&lt;br /&gt;
&lt;br /&gt;
| url=https://www.theatlantic.com/technology/archive/2012/11/noam-chomsky-on-where-artificial-intelligence-went-wrong/261637/?single_page=true |accessdate=26 October 2014&lt;br /&gt;
&lt;br /&gt;
Https://www.theatlantic.com/technology/archive/2012/11/noam-chomsky-on-where-artificial-intelligence-went-wrong/261637/?single_page=true  : 2014年10月26日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web |ref={{harvid|''Kismet''}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| title=Kismet&lt;br /&gt;
&lt;br /&gt;
| title=Kismet&lt;br /&gt;
&lt;br /&gt;
命运&lt;br /&gt;
&lt;br /&gt;
| publisher=MIT Artificial Intelligence Laboratory, Humanoid Robotics Group&lt;br /&gt;
&lt;br /&gt;
| publisher=MIT Artificial Intelligence Laboratory, Humanoid Robotics Group&lt;br /&gt;
&lt;br /&gt;
麻省理工学院人工智能实验室，人形机器人集团&lt;br /&gt;
&lt;br /&gt;
| url=http://www.ai.mit.edu/projects/humanoid-robotics-group/kismet/kismet.html |accessdate=25 October 2014&lt;br /&gt;
&lt;br /&gt;
| url=http://www.ai.mit.edu/projects/humanoid-robotics-group/kismet/kismet.html |accessdate=25 October 2014&lt;br /&gt;
&lt;br /&gt;
Http://www.ai.mit.edu/projects/humanoid-robotics-group/kismet/kismet.html  : 2014年10月25日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Koza |first=John R. |year=1992&lt;br /&gt;
&lt;br /&gt;
| last=Koza |first=John R. |year=1992&lt;br /&gt;
&lt;br /&gt;
1992年，约翰 · r&lt;br /&gt;
&lt;br /&gt;
| title=Genetic Programming (On the Programming of Computers by Means of Natural Selection)&lt;br /&gt;
&lt;br /&gt;
| title=Genetic Programming (On the Programming of Computers by Means of Natural Selection)&lt;br /&gt;
&lt;br /&gt;
遗传程序设计(论计算机通过自然选择的程序设计)&lt;br /&gt;
&lt;br /&gt;
| publisher=MIT Press |isbn=978-0-262-11170-6&lt;br /&gt;
&lt;br /&gt;
| publisher=MIT Press |isbn=978-0-262-11170-6&lt;br /&gt;
&lt;br /&gt;
| 出版商麻省理工学院出版社 | isbn 978-0-262-11170-6&lt;br /&gt;
&lt;br /&gt;
| bibcode=1992gppc.book.....K }}&lt;br /&gt;
&lt;br /&gt;
| bibcode=1992gppc.book.....K }}&lt;br /&gt;
&lt;br /&gt;
1992gppc. book... k }&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* {{cite web |ref=harv&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* {{cite web |ref=harv&lt;br /&gt;
&lt;br /&gt;
!-* { cite web | ref harv&lt;br /&gt;
&lt;br /&gt;
| last=Kleine-Cosack |first=Christian |date=October 2006 |format=PDF&lt;br /&gt;
&lt;br /&gt;
| last=Kleine-Cosack |first=Christian |date=October 2006 |format=PDF&lt;br /&gt;
&lt;br /&gt;
最后克莱恩-科萨克 | 第一个基督徒 | 2006年10月 | 格式 PDF&lt;br /&gt;
&lt;br /&gt;
| title= Recognition and Simulation of Emotions&lt;br /&gt;
&lt;br /&gt;
| title= Recognition and Simulation of Emotions&lt;br /&gt;
&lt;br /&gt;
标题识别和情感模拟&lt;br /&gt;
&lt;br /&gt;
| url= http://ls12-www.cs.tu-dortmund.de//~fink/lectures/SS06/human-robot-interaction/Emotion-RecognitionAndSimulation.pdf&lt;br /&gt;
&lt;br /&gt;
| url= http://ls12-www.cs.tu-dortmund.de//~fink/lectures/SS06/human-robot-interaction/Emotion-RecognitionAndSimulation.pdf&lt;br /&gt;
&lt;br /&gt;
Http://ls12-www.cs.tu-dortmund.de//~fink/lectures/ss06/human-robot-interaction/emotion-recognitionandsimulation.pdf&lt;br /&gt;
&lt;br /&gt;
| archiveurl=https://web.archive.org/web/20080528135730/http://ls12-www.cs.tu-dortmund.de/~fink/lectures/SS06/human-robot-interaction/Emotion-RecognitionAndSimulation.pdf |archivedate=28 May 2008&lt;br /&gt;
&lt;br /&gt;
| archiveurl=https://web.archive.org/web/20080528135730/http://ls12-www.cs.tu-dortmund.de/~fink/lectures/SS06/human-robot-interaction/Emotion-RecognitionAndSimulation.pdf |archivedate=28 May 2008&lt;br /&gt;
&lt;br /&gt;
2008年5月28日 https://web.archive.org/web/20080528135730/http://ls12-www.cs.tu-dortmund.de/~fink/lectures/ss06/human-robot-interaction/emotion-recognitionandsimulation.pdf&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;* {{Cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;* {{Cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
-- * { Cite journal | ref harv&lt;br /&gt;
&lt;br /&gt;
| first = G. | last=Kolata&lt;br /&gt;
&lt;br /&gt;
| first = G. | last=Kolata&lt;br /&gt;
&lt;br /&gt;
| 第一个 g | 最后一个 Kolata&lt;br /&gt;
&lt;br /&gt;
| year=1982&lt;br /&gt;
&lt;br /&gt;
| year=1982&lt;br /&gt;
&lt;br /&gt;
1982年&lt;br /&gt;
&lt;br /&gt;
| title=How can computers get common sense?&lt;br /&gt;
&lt;br /&gt;
| title=How can computers get common sense?&lt;br /&gt;
&lt;br /&gt;
| 题目计算机如何获得常识？&lt;br /&gt;
&lt;br /&gt;
| journal=Science | issue= 4566| pages=1237–1238&lt;br /&gt;
&lt;br /&gt;
| journal=Science | issue= 4566| pages=1237–1238&lt;br /&gt;
&lt;br /&gt;
科学杂志 | 第4566期 | 第1237-1238页&lt;br /&gt;
&lt;br /&gt;
| doi = 10.1126/science.217.4566.1237&lt;br /&gt;
&lt;br /&gt;
| doi = 10.1126/science.217.4566.1237&lt;br /&gt;
&lt;br /&gt;
10.1126 / science. 217.4566.1237&lt;br /&gt;
&lt;br /&gt;
| volume = 217 |pmid=17837639&lt;br /&gt;
&lt;br /&gt;
| volume = 217 |pmid=17837639&lt;br /&gt;
&lt;br /&gt;
217 | pmid 17837639&lt;br /&gt;
&lt;br /&gt;
| bibcode=1982Sci...217.1237K}}&lt;br /&gt;
&lt;br /&gt;
| bibcode=1982Sci...217.1237K}}&lt;br /&gt;
&lt;br /&gt;
1982Sci... 217.1237 k }&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=Kumar | first1=Gulshan&lt;br /&gt;
&lt;br /&gt;
| last1=Kumar | first1=Gulshan&lt;br /&gt;
&lt;br /&gt;
| last1=Kumar | first1=Gulshan&lt;br /&gt;
&lt;br /&gt;
| last2=Kumar | first2=Krishan&lt;br /&gt;
&lt;br /&gt;
| last2=Kumar | first2=Krishan&lt;br /&gt;
&lt;br /&gt;
2 Kumar | first2 Krishan&lt;br /&gt;
&lt;br /&gt;
| title=The Use of Artificial-Intelligence-Based Ensembles for Intrusion Detection: A Review&lt;br /&gt;
&lt;br /&gt;
| title=The Use of Artificial-Intelligence-Based Ensembles for Intrusion Detection: A Review&lt;br /&gt;
&lt;br /&gt;
| 题目: 基于人工智能的集成在入侵检测中的应用: 综述&lt;br /&gt;
&lt;br /&gt;
| journal=Applied Computational Intelligence and Soft Computing&lt;br /&gt;
&lt;br /&gt;
| journal=Applied Computational Intelligence and Soft Computing&lt;br /&gt;
&lt;br /&gt;
应用计算智能和软计算&lt;br /&gt;
&lt;br /&gt;
| year=2012&lt;br /&gt;
&lt;br /&gt;
| year=2012&lt;br /&gt;
&lt;br /&gt;
2012年&lt;br /&gt;
&lt;br /&gt;
| volume=2012&lt;br /&gt;
&lt;br /&gt;
| volume=2012&lt;br /&gt;
&lt;br /&gt;
2012年&lt;br /&gt;
&lt;br /&gt;
| pages=1–20&lt;br /&gt;
&lt;br /&gt;
| pages=1–20&lt;br /&gt;
&lt;br /&gt;
第1-20页&lt;br /&gt;
&lt;br /&gt;
| doi=10.1155/2012/850160&lt;br /&gt;
&lt;br /&gt;
| doi=10.1155/2012/850160&lt;br /&gt;
&lt;br /&gt;
10.1155 / 2012 / 850160&lt;br /&gt;
&lt;br /&gt;
| doi-access=free&lt;br /&gt;
&lt;br /&gt;
| doi-access=free&lt;br /&gt;
&lt;br /&gt;
免费访问&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Kurzweil | first=Ray | author-link=Ray Kurzweil&lt;br /&gt;
&lt;br /&gt;
| last=Kurzweil | first=Ray | author-link=Ray Kurzweil&lt;br /&gt;
&lt;br /&gt;
最后一个库兹韦尔 | 第一个雷 | 作者链接雷 · 库兹韦尔&lt;br /&gt;
&lt;br /&gt;
| year=1999&lt;br /&gt;
&lt;br /&gt;
| year=1999&lt;br /&gt;
&lt;br /&gt;
1999年&lt;br /&gt;
&lt;br /&gt;
| title=The Age of Spiritual Machines&lt;br /&gt;
&lt;br /&gt;
| title=The Age of Spiritual Machines&lt;br /&gt;
&lt;br /&gt;
精神机器时代&lt;br /&gt;
&lt;br /&gt;
| publisher=Penguin Books&lt;br /&gt;
&lt;br /&gt;
| publisher=Penguin Books&lt;br /&gt;
&lt;br /&gt;
企鹅出版社&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-670-88217-5&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-670-88217-5&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-670-88217-5]&lt;br /&gt;
&lt;br /&gt;
| title-link=The Age of Spiritual Machines }}&lt;br /&gt;
&lt;br /&gt;
| title-link=The Age of Spiritual Machines }}&lt;br /&gt;
&lt;br /&gt;
| title-link The Age of Spiritual Machines }&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Kurzweil | first=Ray | author-link=Ray Kurzweil&lt;br /&gt;
&lt;br /&gt;
| last=Kurzweil | first=Ray | author-link=Ray Kurzweil&lt;br /&gt;
&lt;br /&gt;
最后一个库兹韦尔 | 第一个雷 | 作者链接雷 · 库兹韦尔&lt;br /&gt;
&lt;br /&gt;
| year=2005&lt;br /&gt;
&lt;br /&gt;
| year=2005&lt;br /&gt;
&lt;br /&gt;
2005年&lt;br /&gt;
&lt;br /&gt;
| title=The Singularity is Near&lt;br /&gt;
&lt;br /&gt;
| title=The Singularity is Near&lt;br /&gt;
&lt;br /&gt;
标题奇点迫近&lt;br /&gt;
&lt;br /&gt;
| publisher=Penguin Books&lt;br /&gt;
&lt;br /&gt;
| publisher=Penguin Books&lt;br /&gt;
&lt;br /&gt;
企鹅出版社&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-670-03384-3&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-670-03384-3&lt;br /&gt;
&lt;br /&gt;
| isbn 978-0-670-03384-3&lt;br /&gt;
&lt;br /&gt;
| title-link=The Singularity is Near }}&lt;br /&gt;
&lt;br /&gt;
| title-link=The Singularity is Near }}&lt;br /&gt;
&lt;br /&gt;
| title-link 奇点迫近}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Lakoff | first=George | author-link=George Lakoff&lt;br /&gt;
&lt;br /&gt;
| last=Lakoff | first=George | author-link=George Lakoff&lt;br /&gt;
&lt;br /&gt;
最后拉考夫 | 第一个乔治 | 作者链接乔治拉考夫&lt;br /&gt;
&lt;br /&gt;
| last2=Núñez | first2=Rafael E. | author2-link=Rafael E. Núñez| year=2000&lt;br /&gt;
&lt;br /&gt;
| last2=Núñez | first2=Rafael E. | author2-link=Rafael E. Núñez| year=2000&lt;br /&gt;
&lt;br /&gt;
2000年2月2日 | 最后2秒 | 第一2个 Rafael e. | 作者2-link Rafael e. n E. | 2000年&lt;br /&gt;
&lt;br /&gt;
| title=Where Mathematics Comes From: How the Embodied Mind Brings Mathematics into Being&lt;br /&gt;
&lt;br /&gt;
| title=Where Mathematics Comes From: How the Embodied Mind Brings Mathematics into Being&lt;br /&gt;
&lt;br /&gt;
数学从何而来: 具身思维如何使数学成为现实&lt;br /&gt;
&lt;br /&gt;
| publisher=Basic Books&lt;br /&gt;
&lt;br /&gt;
| publisher=Basic Books&lt;br /&gt;
&lt;br /&gt;
| 出版商 Basic Books&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-465-03771-1&lt;br /&gt;
&lt;br /&gt;
| isbn= 978-0-465-03771-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-0-465-03771-1]&lt;br /&gt;
&lt;br /&gt;
| title-link=Where Mathematics Comes From }}&lt;br /&gt;
&lt;br /&gt;
| title-link=Where Mathematics Comes From }}&lt;br /&gt;
&lt;br /&gt;
| title-link Where Mathematics Comes From }&lt;br /&gt;
&lt;br /&gt;
* {{Cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=Langley |first1=Pat |year=2011&lt;br /&gt;
&lt;br /&gt;
| last1=Langley |first1=Pat |year=2011&lt;br /&gt;
&lt;br /&gt;
2011年1月1日&lt;br /&gt;
&lt;br /&gt;
| title=The changing science of machine learning&lt;br /&gt;
&lt;br /&gt;
| title=The changing science of machine learning&lt;br /&gt;
&lt;br /&gt;
不断变化的机器学习科学&lt;br /&gt;
&lt;br /&gt;
| journal=[[Machine Learning (journal)|Machine Learning]]&lt;br /&gt;
&lt;br /&gt;
| journal=Machine Learning&lt;br /&gt;
&lt;br /&gt;
机器学习》杂志&lt;br /&gt;
&lt;br /&gt;
| volume=82 |issue=3 |pages=275–279&lt;br /&gt;
&lt;br /&gt;
| volume=82 |issue=3 |pages=275–279&lt;br /&gt;
&lt;br /&gt;
第82卷，第3期，第275-279页&lt;br /&gt;
&lt;br /&gt;
| doi=10.1007/s10994-011-5242-y&lt;br /&gt;
&lt;br /&gt;
| doi=10.1007/s10994-011-5242-y&lt;br /&gt;
&lt;br /&gt;
10.1007 / s10994-011-5242-y&lt;br /&gt;
&lt;br /&gt;
|doi-access=free&lt;br /&gt;
&lt;br /&gt;
|doi-access=free&lt;br /&gt;
&lt;br /&gt;
免费访问&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite techreport |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Law |first=Diane |date=June 1994&lt;br /&gt;
&lt;br /&gt;
| last=Law |first=Diane |date=June 1994&lt;br /&gt;
&lt;br /&gt;
最后的法律 | 第一个黛安 | 日期1994年6月&lt;br /&gt;
&lt;br /&gt;
| title=Searle, Subsymbolic Functionalism and Synthetic Intelligence&lt;br /&gt;
&lt;br /&gt;
| title=Searle, Subsymbolic Functionalism and Synthetic Intelligence&lt;br /&gt;
&lt;br /&gt;
塞尔，次符号功能主义和综合智能&lt;br /&gt;
&lt;br /&gt;
| institution=University of Texas at Austin |page=AI94-222&lt;br /&gt;
&lt;br /&gt;
| institution=University of Texas at Austin |page=AI94-222&lt;br /&gt;
&lt;br /&gt;
机构德克萨斯州大学奥斯汀分校 | 第 AI94-222页&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.38.8384&lt;br /&gt;
&lt;br /&gt;
| citeseerx=10.1.1.38.8384&lt;br /&gt;
&lt;br /&gt;
10.1.1.38.8384&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite techreport |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=Legg |first1=Shane |last2=Hutter |first2=Marcus |date=15 June 2007&lt;br /&gt;
&lt;br /&gt;
| last1=Legg |first1=Shane |last2=Hutter |first2=Marcus |date=15 June 2007&lt;br /&gt;
&lt;br /&gt;
2007年6月15日&lt;br /&gt;
&lt;br /&gt;
| title=A Collection of Definitions of Intelligence&lt;br /&gt;
&lt;br /&gt;
| title=A Collection of Definitions of Intelligence&lt;br /&gt;
&lt;br /&gt;
文章标题: 智慧的定义集&lt;br /&gt;
&lt;br /&gt;
| institution=[[IDSIA]] |number=07-07 |arxiv=0706.3639&lt;br /&gt;
&lt;br /&gt;
| institution=IDSIA |number=07-07 |arxiv=0706.3639&lt;br /&gt;
&lt;br /&gt;
机构 IDSIA | 07-07 | arxiv 0706.3639&lt;br /&gt;
&lt;br /&gt;
|bibcode=2007arXiv0706.3639L}}&lt;br /&gt;
&lt;br /&gt;
|bibcode=2007arXiv0706.3639L}}&lt;br /&gt;
&lt;br /&gt;
|bibcode=2007arXiv0706.3639L}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Lenat | first=Douglas | author-link=Douglas Lenat&lt;br /&gt;
&lt;br /&gt;
| last=Lenat | first=Douglas | author-link=Douglas Lenat&lt;br /&gt;
&lt;br /&gt;
作者链接道格拉斯 · 莱纳特&lt;br /&gt;
&lt;br /&gt;
| last2=Guha | first2=R. V.&lt;br /&gt;
&lt;br /&gt;
| last2=Guha | first2=R. V.&lt;br /&gt;
&lt;br /&gt;
2 Guha | first2 r.五。&lt;br /&gt;
&lt;br /&gt;
| year = 1989&lt;br /&gt;
&lt;br /&gt;
| year = 1989&lt;br /&gt;
&lt;br /&gt;
1989年&lt;br /&gt;
&lt;br /&gt;
| title = Building Large Knowledge-Based Systems&lt;br /&gt;
&lt;br /&gt;
| title = Building Large Knowledge-Based Systems&lt;br /&gt;
&lt;br /&gt;
建造大型知识推理系统&lt;br /&gt;
&lt;br /&gt;
| publisher = Addison-Wesley&lt;br /&gt;
&lt;br /&gt;
| publisher = Addison-Wesley&lt;br /&gt;
&lt;br /&gt;
出版商 Addison-Wesley&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-201-51752-1&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-201-51752-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-201-51752-1]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{Cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Lighthill |first=James |author-link=James Lighthill |year=1973&lt;br /&gt;
&lt;br /&gt;
| last=Lighthill |first=James |author-link=James Lighthill |year=1973&lt;br /&gt;
&lt;br /&gt;
作者链接: 詹姆斯 · 莱特希尔1973年&lt;br /&gt;
&lt;br /&gt;
| contribution= Artificial Intelligence: A General Survey&lt;br /&gt;
&lt;br /&gt;
| contribution= Artificial Intelligence: A General Survey&lt;br /&gt;
&lt;br /&gt;
人工智能: 一般调查&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence: a paper symposium&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence: a paper symposium&lt;br /&gt;
&lt;br /&gt;
人工智能: 论文研讨会&lt;br /&gt;
&lt;br /&gt;
| publisher=Science Research Council&lt;br /&gt;
&lt;br /&gt;
| publisher=Science Research Council&lt;br /&gt;
&lt;br /&gt;
科学研究委员会&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Lucas | first= John | author-link = John Lucas (philosopher)&lt;br /&gt;
&lt;br /&gt;
| last=Lucas | first= John | author-link = John Lucas (philosopher)&lt;br /&gt;
&lt;br /&gt;
约翰 · 卢卡斯(哲学家)&lt;br /&gt;
&lt;br /&gt;
| year = 1961&lt;br /&gt;
&lt;br /&gt;
| year = 1961&lt;br /&gt;
&lt;br /&gt;
1961年&lt;br /&gt;
&lt;br /&gt;
| contribution=Minds, Machines and Gödel&lt;br /&gt;
&lt;br /&gt;
| contribution=Minds, Machines and Gödel&lt;br /&gt;
&lt;br /&gt;
投稿: 思想，机器和 g del&lt;br /&gt;
&lt;br /&gt;
| editor-last = Anderson | editor-first =A.R.&lt;br /&gt;
&lt;br /&gt;
| editor-last = Anderson | editor-first =A.R.&lt;br /&gt;
&lt;br /&gt;
| 编辑-最后一个安德森 | 编辑-第一个 a.r。&lt;br /&gt;
&lt;br /&gt;
| title=Minds and Machines&lt;br /&gt;
&lt;br /&gt;
| title=Minds and Machines&lt;br /&gt;
&lt;br /&gt;
文章标题: 思想与机器&lt;br /&gt;
&lt;br /&gt;
| url = http://users.ox.ac.uk/~jrlucas/Godel/mmg.html | accessdate=30 August 2007&lt;br /&gt;
&lt;br /&gt;
| url = http://users.ox.ac.uk/~jrlucas/Godel/mmg.html | accessdate=30 August 2007&lt;br /&gt;
&lt;br /&gt;
Http://users.ox.ac.uk/~jrlucas/godel/mmg.html  : 2007年8月30日&lt;br /&gt;
&lt;br /&gt;
| archiveurl= https://web.archive.org/web/20070819165214/http://users.ox.ac.uk/~jrlucas/Godel/mmg.html| archivedate= 19 August 2007 | url-status=live&lt;br /&gt;
&lt;br /&gt;
| archiveurl= https://web.archive.org/web/20070819165214/http://users.ox.ac.uk/~jrlucas/Godel/mmg.html| archivedate= 19 August 2007 | url-status=live&lt;br /&gt;
&lt;br /&gt;
Https://web.archive.org/web/20070819165214/http://users.ox.ac.uk/~jrlucas/godel/mmg.html| 2007年8月19日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=Lungarella |first1=M. |last2=Metta |first2=G. |last3=Pfeifer |first3=R. |last4=Sandini |first4=G. |year=2003&lt;br /&gt;
&lt;br /&gt;
| last1=Lungarella |first1=M. |last2=Metta |first2=G. |last3=Pfeifer |first3=R. |last4=Sandini |first4=G. |year=2003&lt;br /&gt;
&lt;br /&gt;
1 | Lungarella | first1 m.2 Metta | first2 g.3 Pfeifer | first3 r.最后4个 Sandini 最初4个 g。2003年&lt;br /&gt;
&lt;br /&gt;
| title=Developmental robotics: a survey&lt;br /&gt;
&lt;br /&gt;
| title=Developmental robotics: a survey&lt;br /&gt;
&lt;br /&gt;
发展机器人学: 一项调查&lt;br /&gt;
&lt;br /&gt;
| journal=Connection Science |volume=15 | issue=4 |pages=151–190 |citeseerx=10.1.1.83.7615 | doi=10.1080/09540090310001655110&lt;br /&gt;
&lt;br /&gt;
| journal=Connection Science |volume=15 | issue=4 |pages=151–190 |citeseerx=10.1.1.83.7615 | doi=10.1080/09540090310001655110&lt;br /&gt;
&lt;br /&gt;
15 | issue 4 | pages 151-190 | citeserx 10.1.1.83.7615 | doi 10.1080 / 09540090310001655110&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
 |last=Maker&lt;br /&gt;
&lt;br /&gt;
 |last=Maker&lt;br /&gt;
&lt;br /&gt;
最后一个制造者&lt;br /&gt;
&lt;br /&gt;
 |first=Meg Houston&lt;br /&gt;
&lt;br /&gt;
 |first=Meg Houston&lt;br /&gt;
&lt;br /&gt;
首先是梅格 · 休斯顿&lt;br /&gt;
&lt;br /&gt;
 |year=2006&lt;br /&gt;
&lt;br /&gt;
 |year=2006&lt;br /&gt;
&lt;br /&gt;
2006年&lt;br /&gt;
&lt;br /&gt;
 |title=AI@50: AI Past, Present, Future&lt;br /&gt;
&lt;br /&gt;
 |title=AI@50: AI Past, Present, Future&lt;br /&gt;
&lt;br /&gt;
50: AI 过去，现在，未来&lt;br /&gt;
&lt;br /&gt;
 |location=Dartmouth College&lt;br /&gt;
&lt;br /&gt;
 |location=Dartmouth College&lt;br /&gt;
&lt;br /&gt;
| 位置达特茅斯学院&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html&lt;br /&gt;
&lt;br /&gt;
Http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html&lt;br /&gt;
&lt;br /&gt;
 |archive-url=https://web.archive.org/web/20070103222615/http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html&lt;br /&gt;
&lt;br /&gt;
 |archive-url=https://web.archive.org/web/20070103222615/http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html&lt;br /&gt;
&lt;br /&gt;
| 档案-网址 https://web.archive.org/web/20070103222615/http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
状态死机&lt;br /&gt;
&lt;br /&gt;
 |archive-date=3 January 2007&lt;br /&gt;
&lt;br /&gt;
 |archive-date=3 January 2007&lt;br /&gt;
&lt;br /&gt;
| 档案-日期2007年1月3日&lt;br /&gt;
&lt;br /&gt;
 |accessdate=16 October 2008&lt;br /&gt;
&lt;br /&gt;
 |accessdate=16 October 2008&lt;br /&gt;
&lt;br /&gt;
2008年10月16日&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
我不会让你失望的&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite news |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Markoff |first=John | date=16 February 2011&amp;lt;!-- corrected 24 February 2011--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
| last=Markoff |first=John | date=16 February 2011&amp;lt;!-- corrected 24 February 2011--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2011年2月16日修正2011年2月24日&lt;br /&gt;
&lt;br /&gt;
| title=Computer Wins on 'Jeopardy!': Trivial, It's Not |work=The New York Times&lt;br /&gt;
&lt;br /&gt;
| title=Computer Wins on 'Jeopardy!': Trivial, It's Not |work=The New York Times&lt;br /&gt;
&lt;br /&gt;
电脑赢得“危险边缘” ！《纽约时报》 : 微不足道，这不是工作&lt;br /&gt;
&lt;br /&gt;
| url=https://www.nytimes.com/2011/02/17/science/17jeopardy-watson.html |accessdate=25 October 2014&lt;br /&gt;
&lt;br /&gt;
| url=https://www.nytimes.com/2011/02/17/science/17jeopardy-watson.html |accessdate=25 October 2014&lt;br /&gt;
&lt;br /&gt;
Https://www.nytimes.com/2011/02/17/science/17jeopardy-watson.html  : 2014年10月25日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web | ref = harv | last1 = McCarthy | first1 = John | authorlink1 = John McCarthy (computer scientist) | last2 = Minsky | first2 = Marvin | authorlink2 = Marvin Minsky | last3 = Rochester | first3 = Nathan | authorlink3 = Nathan Rochester | last4 = Shannon | first4 = Claude | authorlink4 = Claude Shannon | year = 1955 | title = A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence | url = http://www-formal.stanford.edu/jmc/history/dartmouth/dartmouth.html | accessdate = 30 August 2007 | archiveurl = https://web.archive.org/web/20070826230310/http://www-formal.stanford.edu/jmc/history/dartmouth/dartmouth.html | archivedate = 26 August 2007 | url-status=dead | df = dmy-all }}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1 = McCarthy | first1 = John | author-link = John McCarthy (computer scientist)&lt;br /&gt;
&lt;br /&gt;
| last1 = McCarthy | first1 = John | author-link = John McCarthy (computer scientist)&lt;br /&gt;
&lt;br /&gt;
约翰 · 麦卡锡(计算机科学家)&lt;br /&gt;
&lt;br /&gt;
| last2 = Hayes | first2=P. J.&lt;br /&gt;
&lt;br /&gt;
| last2 = Hayes | first2=P. J.&lt;br /&gt;
&lt;br /&gt;
2 | last 2 | Hayes | first2 p.J.&lt;br /&gt;
&lt;br /&gt;
| year = 1969&lt;br /&gt;
&lt;br /&gt;
| year = 1969&lt;br /&gt;
&lt;br /&gt;
1969年&lt;br /&gt;
&lt;br /&gt;
| title= Some philosophical problems from the standpoint of artificial intelligence&lt;br /&gt;
&lt;br /&gt;
| title= Some philosophical problems from the standpoint of artificial intelligence&lt;br /&gt;
&lt;br /&gt;
从人工智能的角度看一些哲学问题&lt;br /&gt;
&lt;br /&gt;
| journal =Machine Intelligence | volume= 4 | pages = 463–502&lt;br /&gt;
&lt;br /&gt;
| journal =Machine Intelligence | volume= 4 | pages = 463–502&lt;br /&gt;
&lt;br /&gt;
机器智能 | 第四卷 | 第463-502页&lt;br /&gt;
&lt;br /&gt;
| url=http://www-formal.stanford.edu/jmc/mcchay69.html | accessdate=30 August 2007&lt;br /&gt;
&lt;br /&gt;
| url=http://www-formal.stanford.edu/jmc/mcchay69.html | accessdate=30 August 2007&lt;br /&gt;
&lt;br /&gt;
Http://www-formal.stanford.edu/jmc/mcchay69.html  : 2007年8月30日&lt;br /&gt;
&lt;br /&gt;
| archiveurl= https://web.archive.org/web/20070810233856/http://www-formal.stanford.edu/jmc/mcchay69.html| archivedate= 10 August 2007 | url-status=live| citeseerx=10.1.1.85.5082}}&lt;br /&gt;
&lt;br /&gt;
| archiveurl= https://web.archive.org/web/20070810233856/http://www-formal.stanford.edu/jmc/mcchay69.html| archivedate= 10 August 2007 | url-status=live| citeseerx=10.1.1.85.5082}}&lt;br /&gt;
&lt;br /&gt;
2007年8月10日 |  https://web.archive.org/web/20070810233856/http://www-formal.stanford.edu/jmc/mcchay69.html| 档案 / 日期 | url-status live | citeseerx 10.1.85.5082}&lt;br /&gt;
&lt;br /&gt;
* {{cite web&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |ref         = harv&lt;br /&gt;
&lt;br /&gt;
 |ref         = harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
 |last        = McCarthy&lt;br /&gt;
&lt;br /&gt;
 |last        = McCarthy&lt;br /&gt;
&lt;br /&gt;
最后麦卡锡&lt;br /&gt;
&lt;br /&gt;
 |first       = John&lt;br /&gt;
&lt;br /&gt;
 |first       = John&lt;br /&gt;
&lt;br /&gt;
第一个约翰&lt;br /&gt;
&lt;br /&gt;
 |authorlink  = John McCarthy (computer scientist)&lt;br /&gt;
&lt;br /&gt;
 |authorlink  = John McCarthy (computer scientist)&lt;br /&gt;
&lt;br /&gt;
约翰 · 麦卡锡(计算机科学家)&lt;br /&gt;
&lt;br /&gt;
 |title       = What Is Artificial Intelligence?&lt;br /&gt;
&lt;br /&gt;
 |title       = What Is Artificial Intelligence?&lt;br /&gt;
&lt;br /&gt;
什么是人工智能？&lt;br /&gt;
&lt;br /&gt;
 |date        = 12 November 2007&lt;br /&gt;
&lt;br /&gt;
 |date        = 12 November 2007&lt;br /&gt;
&lt;br /&gt;
2007年11月12日&lt;br /&gt;
&lt;br /&gt;
 |url         = http://www-formal.stanford.edu/jmc/whatisai/whatisai.html&lt;br /&gt;
&lt;br /&gt;
 |url         = http://www-formal.stanford.edu/jmc/whatisai/whatisai.html&lt;br /&gt;
&lt;br /&gt;
Http://www-formal.stanford.edu/jmc/whatisai/whatisai.html&lt;br /&gt;
&lt;br /&gt;
 |url-status     = dead&lt;br /&gt;
&lt;br /&gt;
 |url-status     = dead&lt;br /&gt;
&lt;br /&gt;
状态死机&lt;br /&gt;
&lt;br /&gt;
 |archiveurl  = https://web.archive.org/web/20151118212402/http://www-formal.stanford.edu/jmc/whatisai/whatisai.html&lt;br /&gt;
&lt;br /&gt;
 |archiveurl  = https://web.archive.org/web/20151118212402/http://www-formal.stanford.edu/jmc/whatisai/whatisai.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20151118212402/http://www-formal.stanford.edu/jmc/whatisai/whatisai.html&lt;br /&gt;
&lt;br /&gt;
 |archivedate = 18 November 2015&lt;br /&gt;
&lt;br /&gt;
 |archivedate = 18 November 2015&lt;br /&gt;
&lt;br /&gt;
2015年11月18日&lt;br /&gt;
&lt;br /&gt;
 |df          = dmy-all&lt;br /&gt;
&lt;br /&gt;
 |df          = dmy-all&lt;br /&gt;
&lt;br /&gt;
我不会放过你的&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Minsky | first=Marvin | author-link=Marvin Minsky&lt;br /&gt;
&lt;br /&gt;
| last=Minsky | first=Marvin | author-link=Marvin Minsky&lt;br /&gt;
&lt;br /&gt;
最后一个明斯基 | 第一个马文 | 作者链接马文明斯基&lt;br /&gt;
&lt;br /&gt;
| year = 1967&lt;br /&gt;
&lt;br /&gt;
| year = 1967&lt;br /&gt;
&lt;br /&gt;
1967年&lt;br /&gt;
&lt;br /&gt;
| title = Computation: Finite and Infinite Machines&lt;br /&gt;
&lt;br /&gt;
| title = Computation: Finite and Infinite Machines&lt;br /&gt;
&lt;br /&gt;
计算: 有限和无限机器&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/computationfinit0000mins&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/computationfinit0000mins&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/computationfinit0000mins&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
| publisher = Prentice-Hall | location=Englewood Cliffs, N.J.&lt;br /&gt;
&lt;br /&gt;
| publisher = Prentice-Hall | location=Englewood Cliffs, N.J.&lt;br /&gt;
&lt;br /&gt;
| 出版商 Prentice-Hall | 位置: 恩格尔伍德克利夫斯，新泽西州。&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-13-165449-5&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-13-165449-5&lt;br /&gt;
&lt;br /&gt;
| isbn 978-0-13-165449-5&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Minsky | first=Marvin | author-link=Marvin Minsky&lt;br /&gt;
&lt;br /&gt;
| last=Minsky | first=Marvin | author-link=Marvin Minsky&lt;br /&gt;
&lt;br /&gt;
最后一个明斯基 | 第一个马文 | 作者链接马文明斯基&lt;br /&gt;
&lt;br /&gt;
| year = 2006&lt;br /&gt;
&lt;br /&gt;
| year = 2006&lt;br /&gt;
&lt;br /&gt;
2006年&lt;br /&gt;
&lt;br /&gt;
| title = The Emotion Machine&lt;br /&gt;
&lt;br /&gt;
| title = The Emotion Machine&lt;br /&gt;
&lt;br /&gt;
标题: 情感机器&lt;br /&gt;
&lt;br /&gt;
| publisher = Simon &amp;amp; Schusterl | location=New York, NY&lt;br /&gt;
&lt;br /&gt;
| publisher = Simon &amp;amp; Schusterl | location=New York, NY&lt;br /&gt;
&lt;br /&gt;
| 出版商 Simon &amp;amp; schuster | 位置: 纽约，纽约&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-7432-7663-4&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-7432-7663-4&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-7432-7663-4]&lt;br /&gt;
&lt;br /&gt;
| title-link=The Emotion Machine }}&lt;br /&gt;
&lt;br /&gt;
| title-link=The Emotion Machine }}&lt;br /&gt;
&lt;br /&gt;
| title-link The Emotion Machine }&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Moravec | first=Hans | author-link=Hans Moravec&lt;br /&gt;
&lt;br /&gt;
| last=Moravec | first=Hans | author-link=Hans Moravec&lt;br /&gt;
&lt;br /&gt;
| last=Moravec | first=Hans | author-link=Hans Moravec&lt;br /&gt;
&lt;br /&gt;
| year = 1988&lt;br /&gt;
&lt;br /&gt;
| year = 1988&lt;br /&gt;
&lt;br /&gt;
1988年&lt;br /&gt;
&lt;br /&gt;
| title = Mind Children&lt;br /&gt;
&lt;br /&gt;
| title = Mind Children&lt;br /&gt;
&lt;br /&gt;
标题: 小心孩子&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/mindchildrenfutu00mora&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/mindchildrenfutu00mora&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/mindchildrenfutu00mora&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
| publisher = Harvard University Press&lt;br /&gt;
&lt;br /&gt;
| publisher = Harvard University Press&lt;br /&gt;
&lt;br /&gt;
哈佛大学出版社&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-674-57616-2&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-674-57616-2&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-0-674-57616-2]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Norvig |first=Peter |authorlink=Peter Norvig |date=25 June 2012&amp;lt;!--page metadata, last modified--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
| last=Norvig |first=Peter |authorlink=Peter Norvig |date=25 June 2012&amp;lt;!--page metadata, last modified--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
2012年6月25日---- 页面元数据，最后修改&lt;br /&gt;
&lt;br /&gt;
| title=On Chomsky and the Two Cultures of Statistical Learning&lt;br /&gt;
&lt;br /&gt;
| title=On Chomsky and the Two Cultures of Statistical Learning&lt;br /&gt;
&lt;br /&gt;
乔姆斯基与两种统计学习文化&lt;br /&gt;
&lt;br /&gt;
| publisher=Peter Norvig&lt;br /&gt;
&lt;br /&gt;
| publisher=Peter Norvig&lt;br /&gt;
&lt;br /&gt;
出版商 Peter Norvig&lt;br /&gt;
&lt;br /&gt;
| url=http://norvig.com/chomsky.html&lt;br /&gt;
&lt;br /&gt;
| url=http://norvig.com/chomsky.html&lt;br /&gt;
&lt;br /&gt;
Http://norvig.com/chomsky.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl=https://web.archive.org/web/20141019223259/http://norvig.com/chomsky.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl=https://web.archive.org/web/20141019223259/http://norvig.com/chomsky.html&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20141019223259/http://norvig.com/chomsky.html&lt;br /&gt;
&lt;br /&gt;
| archivedate=19 October 2014 |url-status=live&lt;br /&gt;
&lt;br /&gt;
| archivedate=19 October 2014 |url-status=live&lt;br /&gt;
&lt;br /&gt;
2014年10月19日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref={{harvid|NRC|1999}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| author=NRC (United States National Research Council) | authorlink=United States National Research Council&lt;br /&gt;
&lt;br /&gt;
| author=NRC (United States National Research Council) | authorlink=United States National Research Council&lt;br /&gt;
&lt;br /&gt;
作者 NRC (美国国家研究委员会)&lt;br /&gt;
&lt;br /&gt;
| year=1999&lt;br /&gt;
&lt;br /&gt;
| year=1999&lt;br /&gt;
&lt;br /&gt;
1999年&lt;br /&gt;
&lt;br /&gt;
| chapter=Developments in Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
| chapter=Developments in Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
人工智能的发展&lt;br /&gt;
&lt;br /&gt;
| title=Funding a Revolution: Government Support for Computing Research&lt;br /&gt;
&lt;br /&gt;
| title=Funding a Revolution: Government Support for Computing Research&lt;br /&gt;
&lt;br /&gt;
资助一场革命: 政府对计算机研究的支持&lt;br /&gt;
&lt;br /&gt;
| publisher=National Academy Press&lt;br /&gt;
&lt;br /&gt;
| publisher=National Academy Press&lt;br /&gt;
&lt;br /&gt;
美国国家科学院出版社&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Needham | first=Joseph | authorlink = Joseph Needham&lt;br /&gt;
&lt;br /&gt;
| last=Needham | first=Joseph | authorlink = Joseph Needham&lt;br /&gt;
&lt;br /&gt;
作者: 约瑟夫 · 李约瑟&lt;br /&gt;
&lt;br /&gt;
| year=1986&lt;br /&gt;
&lt;br /&gt;
| year=1986&lt;br /&gt;
&lt;br /&gt;
1986年&lt;br /&gt;
&lt;br /&gt;
| title=Science and Civilization in China: Volume 2&lt;br /&gt;
&lt;br /&gt;
| title=Science and Civilization in China: Volume 2&lt;br /&gt;
&lt;br /&gt;
中国的科学与文明: 第二卷&lt;br /&gt;
&lt;br /&gt;
| publisher=Caves Books Ltd.&lt;br /&gt;
&lt;br /&gt;
| publisher=Caves Books Ltd.&lt;br /&gt;
&lt;br /&gt;
| 出版商洞穴图书有限公司。&lt;br /&gt;
&lt;br /&gt;
| title-link=Science and Civilization in China }}&lt;br /&gt;
&lt;br /&gt;
| title-link=Science and Civilization in China }}&lt;br /&gt;
&lt;br /&gt;
| 题目链接中国的科学与文明}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal|ref=harv |last=Newell |first=Allen |author-link=Allen Newell |last2=Simon |first2=H. A. |authorlink2=Herbert A. Simon |year=1976 |title=Computer Science as Empirical Inquiry: Symbols and Search |journal=Communications of the ACM |volume=19 |issue=3 |doi=10.1145/360018.360022 |url=http://www.rci.rutgers.edu/~cfs/472_html/AI_SEARCH/PSS/PSSH4.html |pages=113–126 |url-status=dead |archiveurl=https://web.archive.org/web/20081007162810/http://www.rci.rutgers.edu/~cfs/472_html/AI_SEARCH/PSS/PSSH4.html |archivedate=7 October 2008|doi-access=free }}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Nilsson |first=Nils |author-link = Nils Nilsson (researcher) |year=1983&lt;br /&gt;
&lt;br /&gt;
| last=Nilsson |first=Nils |author-link = Nils Nilsson (researcher) |year=1983&lt;br /&gt;
&lt;br /&gt;
| 最后尼尔森 | 第一个尼尔斯 | 作者链接尼尔斯尼尔森(研究员) | 1983年&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence Prepares for 2001&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence Prepares for 2001&lt;br /&gt;
&lt;br /&gt;
人工智能为2001年做准备&lt;br /&gt;
&lt;br /&gt;
| journal=AI Magazine |volume=1 |number=1&lt;br /&gt;
&lt;br /&gt;
| journal=AI Magazine |volume=1 |number=1&lt;br /&gt;
&lt;br /&gt;
人工智能杂志 | 第一卷 | 第一期&lt;br /&gt;
&lt;br /&gt;
| url=https://ai.stanford.edu/~nilsson/OnlinePubs-Nils/General%20Essays/AIMag04-04-002.pdf&lt;br /&gt;
&lt;br /&gt;
| url=https://ai.stanford.edu/~nilsson/OnlinePubs-Nils/General%20Essays/AIMag04-04-002.pdf&lt;br /&gt;
&lt;br /&gt;
Https://ai.stanford.edu/~nilsson/onlinepubs-nils/general%20essays/aimag04-04-002.pdf&lt;br /&gt;
&lt;br /&gt;
}} Presidential Address to the [[Association for the Advancement of Artificial Intelligence]].&lt;br /&gt;
&lt;br /&gt;
}} Presidential Address to the Association for the Advancement of Artificial Intelligence.&lt;br /&gt;
&lt;br /&gt;
美国总统的美国人工智能协会地址。&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=O'Brien |first1=James |last2=Marakas |first2=George |year=2011&lt;br /&gt;
&lt;br /&gt;
| last1=O'Brien |first1=James |last2=Marakas |first2=George |year=2011&lt;br /&gt;
&lt;br /&gt;
2011年1月1日&lt;br /&gt;
&lt;br /&gt;
| title=Management Information Systems |publisher=McGraw-Hill/Irwin |edition=10th&lt;br /&gt;
&lt;br /&gt;
| title=Management Information Systems |publisher=McGraw-Hill/Irwin |edition=10th&lt;br /&gt;
&lt;br /&gt;
| 题目: 管理信息系统 | 出版商 mcgraw-hill / irwin | 第10版&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-07-337681-3&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-07-337681-3&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-07-337681-3]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=O'Connor |first=Kathleen Malone |year=1994&lt;br /&gt;
&lt;br /&gt;
| last=O'Connor |first=Kathleen Malone |year=1994&lt;br /&gt;
&lt;br /&gt;
1994年，凯瑟琳 · 马龙&lt;br /&gt;
&lt;br /&gt;
| title=The alchemical creation of life (takwin) and other concepts of Genesis in medieval Islam&lt;br /&gt;
&lt;br /&gt;
| title=The alchemical creation of life (takwin) and other concepts of Genesis in medieval Islam&lt;br /&gt;
&lt;br /&gt;
中世纪伊斯兰教的炼金术创造生命(takwin)和创世纪的其他概念&lt;br /&gt;
&lt;br /&gt;
| pages=1–435 | publisher=University of Pennsylvania&lt;br /&gt;
&lt;br /&gt;
| pages=1–435 | publisher=University of Pennsylvania&lt;br /&gt;
&lt;br /&gt;
| 第1-435页 | 出版商宾夕法尼亚大学&lt;br /&gt;
&lt;br /&gt;
| url=http://repository.upenn.edu/dissertations/AAI9503804&lt;br /&gt;
&lt;br /&gt;
| url=http://repository.upenn.edu/dissertations/AAI9503804&lt;br /&gt;
&lt;br /&gt;
Http://repository.upenn.edu/dissertations/aai9503804&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Oudeyer |first=P-Y. |year=2010&lt;br /&gt;
&lt;br /&gt;
| last=Oudeyer |first=P-Y. |year=2010&lt;br /&gt;
&lt;br /&gt;
| 最后一个 Oudeyer | 第一个 p-y。2010年&lt;br /&gt;
&lt;br /&gt;
| title=On the impact of robotics in behavioral and cognitive sciences: from insect navigation to human cognitive development&lt;br /&gt;
&lt;br /&gt;
| title=On the impact of robotics in behavioral and cognitive sciences: from insect navigation to human cognitive development&lt;br /&gt;
&lt;br /&gt;
机器人技术对行为和认知科学的影响: 从昆虫导航到人类认知发展&lt;br /&gt;
&lt;br /&gt;
| journal=IEEE Transactions on Autonomous Mental Development |volume=2 |issue=1 |pages=2–16&lt;br /&gt;
&lt;br /&gt;
| journal=IEEE Transactions on Autonomous Mental Development |volume=2 |issue=1 |pages=2–16&lt;br /&gt;
&lt;br /&gt;
自主智力发展杂志 | 第2卷 | 第1期 | 第2-16页&lt;br /&gt;
&lt;br /&gt;
| url=http://www.pyoudeyer.com/IEEETAMDOudeyer10.pdf | doi=10.1109/tamd.2009.2039057&lt;br /&gt;
&lt;br /&gt;
| url=http://www.pyoudeyer.com/IEEETAMDOudeyer10.pdf | doi=10.1109/tamd.2009.2039057&lt;br /&gt;
&lt;br /&gt;
Http://www.pyoudeyer.com/ieeetamdoudeyer10.pdf 10.1109 / tamd. 2009.2039057&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Penrose |first=Roger |author-link=Roger Penrose |year=1989&lt;br /&gt;
&lt;br /&gt;
| last=Penrose |first=Roger |author-link=Roger Penrose |year=1989&lt;br /&gt;
&lt;br /&gt;
最后一个彭罗斯 | 第一个罗杰 | 作者链接罗杰彭罗斯 | 1989年&lt;br /&gt;
&lt;br /&gt;
| title=The Emperor's New Mind: Concerning Computer, Minds and The Laws of Physics&lt;br /&gt;
&lt;br /&gt;
| title=The Emperor's New Mind: Concerning Computer, Minds and The Laws of Physics&lt;br /&gt;
&lt;br /&gt;
皇帝的新头脑: 关于计算机，头脑和物理定律&lt;br /&gt;
&lt;br /&gt;
| publisher=[[Oxford University Press]]&lt;br /&gt;
&lt;br /&gt;
| publisher=Oxford University Press&lt;br /&gt;
&lt;br /&gt;
牛津大学出版社&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-19-851973-7&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-19-851973-7&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-19-851973-7]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* {{cite techreport |ref=harv&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* {{cite techreport |ref=harv&lt;br /&gt;
&lt;br /&gt;
!-* { cite techreport | ref harv&lt;br /&gt;
&lt;br /&gt;
| last=Picard |first=Rosalind |authorlink=Rosalind Picard |year=1995&lt;br /&gt;
&lt;br /&gt;
| last=Picard |first=Rosalind |authorlink=Rosalind Picard |year=1995&lt;br /&gt;
&lt;br /&gt;
作者: Rosalind Picard 1995年&lt;br /&gt;
&lt;br /&gt;
| title=Affective Computing |institution=MIT |number=321&lt;br /&gt;
&lt;br /&gt;
| title=Affective Computing |institution=MIT |number=321&lt;br /&gt;
&lt;br /&gt;
情感计算机 | 机构麻省理工学院 | 321号&lt;br /&gt;
&lt;br /&gt;
| url=http://affect.media.mit.edu/pdfs/95.picard.pdf&lt;br /&gt;
&lt;br /&gt;
| url=http://affect.media.mit.edu/pdfs/95.picard.pdf&lt;br /&gt;
&lt;br /&gt;
Http://affect.media.mit.edu/pdfs/95.picard.pdf&lt;br /&gt;
&lt;br /&gt;
| laysource=Abstract |layurl=http://vismod.media.mit.edu/pub/tech-reports/TR-321-ABSTRACT.html&lt;br /&gt;
&lt;br /&gt;
| laysource=Abstract |layurl=http://vismod.media.mit.edu/pub/tech-reports/TR-321-ABSTRACT.html&lt;br /&gt;
&lt;br /&gt;
2012年3月15日 |  http://vismod.media.mit.edu/pub/tech-reports/tr-321-Abstract.html&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
--&amp;gt;* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
-- * { cite book | ref harv&lt;br /&gt;
&lt;br /&gt;
| last1=Poli |first1=R. |last2=Langdon |first2=W. B. |last3=McPhee |first3=N. F. |year=2008&lt;br /&gt;
&lt;br /&gt;
| last1=Poli |first1=R. |last2=Langdon |first2=W. B. |last3=McPhee |first3=N. F. |year=2008&lt;br /&gt;
&lt;br /&gt;
1 Poli | first1 r.最后2个兰登，最初2个 w。乙。3 McPhee | first3 n.2008年&lt;br /&gt;
&lt;br /&gt;
| title=A Field Guide to Genetic Programming |publisher=Lulu.com |isbn=978-1-4092-0073-4&lt;br /&gt;
&lt;br /&gt;
| title=A Field Guide to Genetic Programming |publisher=Lulu.com |isbn=978-1-4092-0073-4&lt;br /&gt;
&lt;br /&gt;
遗传编程实地指南 | 出版商 lulu. com | isbn 978-1-4092-0073-4&lt;br /&gt;
&lt;br /&gt;
| url=http://www.gp-field-guide.org.uk/ |via=gp-field-guide.org.uk&lt;br /&gt;
&lt;br /&gt;
| url=http://www.gp-field-guide.org.uk/ |via=gp-field-guide.org.uk&lt;br /&gt;
&lt;br /&gt;
Http://www.gp-field-guide.org.uk/  gp-field-guide.org.uk&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
 |last=Rajani&lt;br /&gt;
&lt;br /&gt;
 |last=Rajani&lt;br /&gt;
&lt;br /&gt;
最后的拉贾尼&lt;br /&gt;
&lt;br /&gt;
 |first=Sandeep&lt;br /&gt;
&lt;br /&gt;
 |first=Sandeep&lt;br /&gt;
&lt;br /&gt;
第一个 Sandeep&lt;br /&gt;
&lt;br /&gt;
 |year=2011&lt;br /&gt;
&lt;br /&gt;
 |year=2011&lt;br /&gt;
&lt;br /&gt;
2011年&lt;br /&gt;
&lt;br /&gt;
 |title=Artificial Intelligence – Man or Machine&lt;br /&gt;
&lt;br /&gt;
 |title=Artificial Intelligence – Man or Machine&lt;br /&gt;
&lt;br /&gt;
| 题目: 人工智能-人还是机器&lt;br /&gt;
&lt;br /&gt;
 |journal=International Journal of Information Technology and Knowledge Management&lt;br /&gt;
&lt;br /&gt;
 |journal=International Journal of Information Technology and Knowledge Management&lt;br /&gt;
&lt;br /&gt;
国际信息技术与知识管理杂志&lt;br /&gt;
&lt;br /&gt;
 |volume=4&lt;br /&gt;
&lt;br /&gt;
 |volume=4&lt;br /&gt;
&lt;br /&gt;
第四卷&lt;br /&gt;
&lt;br /&gt;
 |issue=1&lt;br /&gt;
&lt;br /&gt;
 |issue=1&lt;br /&gt;
&lt;br /&gt;
第一期&lt;br /&gt;
&lt;br /&gt;
 |pages=173–176&lt;br /&gt;
&lt;br /&gt;
 |pages=173–176&lt;br /&gt;
&lt;br /&gt;
第173-176页&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.csjournals.com/IJITKM/PDF%204-1/35.Sandeep%20Rajani.pdf&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.csjournals.com/IJITKM/PDF%204-1/35.Sandeep%20Rajani.pdf&lt;br /&gt;
&lt;br /&gt;
Http://www.csjournals.com/ijitkm/pdf%204-1/35.sandeep%20rajani.pdf&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
状态死机&lt;br /&gt;
&lt;br /&gt;
 |archiveurl=https://web.archive.org/web/20130118095844/http://www.csjournals.com/IJITKM/PDF%204-1/35.Sandeep%20Rajani.pdf&lt;br /&gt;
&lt;br /&gt;
 |archiveurl=https://web.archive.org/web/20130118095844/http://www.csjournals.com/IJITKM/PDF%204-1/35.Sandeep%20Rajani.pdf&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20130118095844/http://www.csjournals.com/ijitkm/pdf%204-1/35.sandeep%20rajani.pdf&lt;br /&gt;
&lt;br /&gt;
 |archivedate=18 January 2013&lt;br /&gt;
&lt;br /&gt;
 |archivedate=18 January 2013&lt;br /&gt;
&lt;br /&gt;
2013年1月18日&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
我不会让你失望的&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* Ronald, E. M. A.  and Sipper, M.  [https://drive.google.com/file/d/0B6G3tbmMcpR4TFdHSXNFWUtlNWc/view?usp=sharing Intelligence is not enough: On the socialization of talking machines, Minds and Machines], vol. 11, no. 4, pp.&amp;amp;nbsp;567–576, November 2001.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* Ronald, E. M. A.  and Sipper, M.  [https://drive.google.com/file/d/0B6G3tbmMcpR4VnpOX0xxazFNbjA/view?usp=sharing What use is a Turing chatterbox?], Communications of the ACM, vol. 43, no. 10, pp.&amp;amp;nbsp;21–23, October 2000.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{Cite journal&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
 |last=Searle&lt;br /&gt;
&lt;br /&gt;
 |last=Searle&lt;br /&gt;
&lt;br /&gt;
最后 Searle&lt;br /&gt;
&lt;br /&gt;
 |first=John&lt;br /&gt;
&lt;br /&gt;
 |first=John&lt;br /&gt;
&lt;br /&gt;
第一个约翰&lt;br /&gt;
&lt;br /&gt;
 |author-link=John Searle&lt;br /&gt;
&lt;br /&gt;
 |author-link=John Searle&lt;br /&gt;
&lt;br /&gt;
作者链接约翰 · 塞尔&lt;br /&gt;
&lt;br /&gt;
 |year=1980&lt;br /&gt;
&lt;br /&gt;
 |year=1980&lt;br /&gt;
&lt;br /&gt;
1980年&lt;br /&gt;
&lt;br /&gt;
 |title=Minds, Brains and Programs&lt;br /&gt;
&lt;br /&gt;
 |title=Minds, Brains and Programs&lt;br /&gt;
&lt;br /&gt;
文章标题: 思想，大脑和程序&lt;br /&gt;
&lt;br /&gt;
 |journal=Behavioral and Brain Sciences&lt;br /&gt;
&lt;br /&gt;
 |journal=Behavioral and Brain Sciences&lt;br /&gt;
&lt;br /&gt;
行为与脑科学杂志&lt;br /&gt;
&lt;br /&gt;
 |volume=3&lt;br /&gt;
&lt;br /&gt;
 |volume=3&lt;br /&gt;
&lt;br /&gt;
第三卷&lt;br /&gt;
&lt;br /&gt;
 |issue=3&lt;br /&gt;
&lt;br /&gt;
 |issue=3&lt;br /&gt;
&lt;br /&gt;
第三期&lt;br /&gt;
&lt;br /&gt;
 |pages=417–457&lt;br /&gt;
&lt;br /&gt;
 |pages=417–457&lt;br /&gt;
&lt;br /&gt;
第417-457页&lt;br /&gt;
&lt;br /&gt;
 |doi=10.1017/S0140525X00005756&lt;br /&gt;
&lt;br /&gt;
 |doi=10.1017/S0140525X00005756&lt;br /&gt;
&lt;br /&gt;
10.1017 / s0140525x0005756&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
我不会让你失望的&lt;br /&gt;
&lt;br /&gt;
|url=http://cogprints.org/7150/1/10.1.1.83.5248.pdf&lt;br /&gt;
&lt;br /&gt;
|url=http://cogprints.org/7150/1/10.1.1.83.5248.pdf&lt;br /&gt;
&lt;br /&gt;
Http://cogprints.org/7150/1/10.1.1.83.5248.pdf&lt;br /&gt;
&lt;br /&gt;
 }}&lt;br /&gt;
&lt;br /&gt;
 }}&lt;br /&gt;
&lt;br /&gt;
 }}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref         = harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |last        = Searle&lt;br /&gt;
&lt;br /&gt;
 |last        = Searle&lt;br /&gt;
&lt;br /&gt;
最后 Searle&lt;br /&gt;
&lt;br /&gt;
 |first       = John&lt;br /&gt;
&lt;br /&gt;
 |first       = John&lt;br /&gt;
&lt;br /&gt;
第一个约翰&lt;br /&gt;
&lt;br /&gt;
 |author-link = John Searle&lt;br /&gt;
&lt;br /&gt;
 |author-link = John Searle&lt;br /&gt;
&lt;br /&gt;
作者链接约翰 · 塞尔&lt;br /&gt;
&lt;br /&gt;
 |year        = 1999&lt;br /&gt;
&lt;br /&gt;
 |year        = 1999&lt;br /&gt;
&lt;br /&gt;
1999年&lt;br /&gt;
&lt;br /&gt;
 |title       = Mind, language and society&lt;br /&gt;
&lt;br /&gt;
 |title       = Mind, language and society&lt;br /&gt;
&lt;br /&gt;
文章标题: 思想，语言和社会&lt;br /&gt;
&lt;br /&gt;
 |publisher   = Basic Books&lt;br /&gt;
&lt;br /&gt;
 |publisher   = Basic Books&lt;br /&gt;
&lt;br /&gt;
| 出版商 Basic Books&lt;br /&gt;
&lt;br /&gt;
 |location    = New York, NY&lt;br /&gt;
&lt;br /&gt;
 |location    = New York, NY&lt;br /&gt;
&lt;br /&gt;
纽约，纽约&lt;br /&gt;
&lt;br /&gt;
 |isbn        = 978-0-465-04521-1&lt;br /&gt;
&lt;br /&gt;
 |isbn        = 978-0-465-04521-1&lt;br /&gt;
&lt;br /&gt;
[国际标准图书馆编号978-0-465-04521-1]&lt;br /&gt;
&lt;br /&gt;
 |oclc        = 231867665&lt;br /&gt;
&lt;br /&gt;
 |oclc        = 231867665&lt;br /&gt;
&lt;br /&gt;
231867665&lt;br /&gt;
&lt;br /&gt;
 |url         = https://archive.org/details/mindlanguagesoci00sear&lt;br /&gt;
&lt;br /&gt;
 |url         = https://archive.org/details/mindlanguagesoci00sear&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/mindlanguagesoci00sear&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Shapiro | first= Stuart C. | editor-first=Stuart C. | editor-last=Shapiro&lt;br /&gt;
&lt;br /&gt;
| last=Shapiro | first= Stuart C. | editor-first=Stuart C. | editor-last=Shapiro&lt;br /&gt;
&lt;br /&gt;
最后一个夏皮罗 | 第一个斯图尔特 c. | 编辑-第一个斯图尔特 c. | 编辑-最后一个夏皮罗&lt;br /&gt;
&lt;br /&gt;
| year=1992&lt;br /&gt;
&lt;br /&gt;
| year=1992&lt;br /&gt;
&lt;br /&gt;
1992年&lt;br /&gt;
&lt;br /&gt;
| contribution=Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
| contribution=Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
人工智能&lt;br /&gt;
&lt;br /&gt;
| title=Encyclopedia of Artificial Intelligence | edition=2nd | pages=54–57&lt;br /&gt;
&lt;br /&gt;
| title=Encyclopedia of Artificial Intelligence | edition=2nd | pages=54–57&lt;br /&gt;
&lt;br /&gt;
人工智能百科全书 | 第二版 | 第54-57页&lt;br /&gt;
&lt;br /&gt;
| url=http://www.cse.buffalo.edu/~shapiro/Papers/ai.pdf&lt;br /&gt;
&lt;br /&gt;
| url=http://www.cse.buffalo.edu/~shapiro/Papers/ai.pdf&lt;br /&gt;
&lt;br /&gt;
Http://www.cse.buffalo.edu/~shapiro/papers/ai.pdf&lt;br /&gt;
&lt;br /&gt;
| publisher=John Wiley | location=New York&lt;br /&gt;
&lt;br /&gt;
| publisher=John Wiley | location=New York&lt;br /&gt;
&lt;br /&gt;
| 出版人约翰 · 威利 | 位置: 纽约&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-471-50306-4&lt;br /&gt;
&lt;br /&gt;
| isbn=978-0-471-50306-4&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-471-50306-4]&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Simon | first = H. A. | author-link=Herbert A. Simon&lt;br /&gt;
&lt;br /&gt;
| last=Simon | first = H. A. | author-link=Herbert A. Simon&lt;br /&gt;
&lt;br /&gt;
最后的西蒙 | 第一个 h. a。| 作者链接赫伯特·西蒙&lt;br /&gt;
&lt;br /&gt;
| year = 1965&lt;br /&gt;
&lt;br /&gt;
| year = 1965&lt;br /&gt;
&lt;br /&gt;
1965年&lt;br /&gt;
&lt;br /&gt;
| title=The Shape of Automation for Men and Management&lt;br /&gt;
&lt;br /&gt;
| title=The Shape of Automation for Men and Management&lt;br /&gt;
&lt;br /&gt;
男性和管理自动化的形态&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/shapeofautomatio00simo&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/shapeofautomatio00simo&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/shapeofautomatio00simo&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
|url-access=registration&lt;br /&gt;
&lt;br /&gt;
访问注册&lt;br /&gt;
&lt;br /&gt;
| publisher = Harper &amp;amp; Row | location = New York&lt;br /&gt;
&lt;br /&gt;
| publisher = Harper &amp;amp; Row | location = New York&lt;br /&gt;
&lt;br /&gt;
| 出版商 Harper &amp;amp; Row | 位置: 纽约&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Skillings | first=Jonathan&lt;br /&gt;
&lt;br /&gt;
| last=Skillings | first=Jonathan&lt;br /&gt;
&lt;br /&gt;
最后的技能 | 第一个乔纳森&lt;br /&gt;
&lt;br /&gt;
| url=http://news.cnet.com/Getting-machines-to-think-like-us/2008-11394_3-6090207.html&lt;br /&gt;
&lt;br /&gt;
| url=http://news.cnet.com/Getting-machines-to-think-like-us/2008-11394_3-6090207.html&lt;br /&gt;
&lt;br /&gt;
Http://news.cnet.com/getting-machines-to-think-like-us/2008-11394_3-6090207.html&lt;br /&gt;
&lt;br /&gt;
| title=Getting Machines to Think Like Us&lt;br /&gt;
&lt;br /&gt;
| title=Getting Machines to Think Like Us&lt;br /&gt;
&lt;br /&gt;
让机器像我们一样思考&lt;br /&gt;
&lt;br /&gt;
| work=cnet&lt;br /&gt;
&lt;br /&gt;
| work=cnet&lt;br /&gt;
&lt;br /&gt;
我会在 cnet 工作&lt;br /&gt;
&lt;br /&gt;
| date=3 July 2006&lt;br /&gt;
&lt;br /&gt;
| date=3 July 2006&lt;br /&gt;
&lt;br /&gt;
2006年7月3日&lt;br /&gt;
&lt;br /&gt;
| accessdate=3 February 2011&lt;br /&gt;
&lt;br /&gt;
| accessdate=3 February 2011&lt;br /&gt;
&lt;br /&gt;
2011年2月3日&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite conference |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Solomonoff |first=Ray |authorlink=Ray Solomonoff |year=1956&lt;br /&gt;
&lt;br /&gt;
| last=Solomonoff |first=Ray |authorlink=Ray Solomonoff |year=1956&lt;br /&gt;
&lt;br /&gt;
作者: Ray Solomonoff 1956年&lt;br /&gt;
&lt;br /&gt;
| title=An Inductive Inference Machine&lt;br /&gt;
&lt;br /&gt;
| title=An Inductive Inference Machine&lt;br /&gt;
&lt;br /&gt;
归纳推理机&lt;br /&gt;
&lt;br /&gt;
| conference=Dartmouth Summer Research Conference on Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
| conference=Dartmouth Summer Research Conference on Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
达特茅斯夏季人工智能研究会议&lt;br /&gt;
&lt;br /&gt;
| url=http://world.std.com/~rjs/indinf56.pdf |via=std.com, pdf scanned copy of the original&lt;br /&gt;
&lt;br /&gt;
| url=http://world.std.com/~rjs/indinf56.pdf |via=std.com, pdf scanned copy of the original&lt;br /&gt;
&lt;br /&gt;
Http://world.std.com/~rjs/indinf56.pdf  : http: / / www.std. com / pdf&lt;br /&gt;
&lt;br /&gt;
}} Later published as&amp;lt;br /&amp;gt;{{cite book&lt;br /&gt;
&lt;br /&gt;
}} Later published as&amp;lt;br /&amp;gt;{{cite book&lt;br /&gt;
&lt;br /&gt;
}}后来作为 br / { cite book 出版&lt;br /&gt;
&lt;br /&gt;
| last=Solomonoff |first=Ray |year=1957 |pages=56–62&lt;br /&gt;
&lt;br /&gt;
| last=Solomonoff |first=Ray |year=1957 |pages=56–62&lt;br /&gt;
&lt;br /&gt;
最后所罗门诺夫 | 第一射线 | 1957年 | 第56-62页&lt;br /&gt;
&lt;br /&gt;
| chapter=An Inductive Inference Machine&lt;br /&gt;
&lt;br /&gt;
| chapter=An Inductive Inference Machine&lt;br /&gt;
&lt;br /&gt;
归纳推理机&lt;br /&gt;
&lt;br /&gt;
| title=IRE Convention Record |volume=Section on Information Theory, part 2&lt;br /&gt;
&lt;br /&gt;
| title=IRE Convention Record |volume=Section on Information Theory, part 2&lt;br /&gt;
&lt;br /&gt;
信息理论部分，第二部分&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite conference |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Tao |first=Jianhua |first2=Tieniu |last2=Tan |year=2005&lt;br /&gt;
&lt;br /&gt;
| last=Tao |first=Jianhua |first2=Tieniu |last2=Tan |year=2005&lt;br /&gt;
&lt;br /&gt;
2 Tieniu | last 2 Tan | year 2005&lt;br /&gt;
&lt;br /&gt;
| conference=Affective Computing: A Review&lt;br /&gt;
&lt;br /&gt;
| conference=Affective Computing: A Review&lt;br /&gt;
&lt;br /&gt;
会议情感计算: 回顾&lt;br /&gt;
&lt;br /&gt;
| booktitle=Affective Computing and Intelligent Interaction |volume=[[LNCS]] 3784 |pages=981–995&lt;br /&gt;
&lt;br /&gt;
| booktitle=Affective Computing and Intelligent Interaction |volume=LNCS 3784 |pages=981–995&lt;br /&gt;
&lt;br /&gt;
| 书名情感计算和智能交互 | 卷 LNCS 3784 | 页981-995&lt;br /&gt;
&lt;br /&gt;
 |publisher=Springer |doi=10.1007/11573548&lt;br /&gt;
&lt;br /&gt;
 |publisher=Springer |doi=10.1007/11573548&lt;br /&gt;
&lt;br /&gt;
| 出版商 Springer | doi 10.1007 / 11573548&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Tecuci |first=Gheorghe |date=March–April 2012&lt;br /&gt;
&lt;br /&gt;
| last=Tecuci |first=Gheorghe |date=March–April 2012&lt;br /&gt;
&lt;br /&gt;
2012年3-4月&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
| title=Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
人工智能&lt;br /&gt;
&lt;br /&gt;
| journal=Wiley Interdisciplinary Reviews: Computational Statistics&lt;br /&gt;
&lt;br /&gt;
| journal=Wiley Interdisciplinary Reviews: Computational Statistics&lt;br /&gt;
&lt;br /&gt;
杂志 Wiley 跨学科评论: 计算机数据&lt;br /&gt;
&lt;br /&gt;
| volume=4 |issue=2 |pages=168–180 |doi=10.1002/wics.200&lt;br /&gt;
&lt;br /&gt;
| volume=4 |issue=2 |pages=168–180 |doi=10.1002/wics.200&lt;br /&gt;
&lt;br /&gt;
第四卷，第二期，第168-180页，页数10.1002 / wics. 200&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
|ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
|last=Thro&lt;br /&gt;
&lt;br /&gt;
|last=Thro&lt;br /&gt;
&lt;br /&gt;
最后一次&lt;br /&gt;
&lt;br /&gt;
|first=Ellen&lt;br /&gt;
&lt;br /&gt;
|first=Ellen&lt;br /&gt;
&lt;br /&gt;
首先是艾伦&lt;br /&gt;
&lt;br /&gt;
|year=1993&lt;br /&gt;
&lt;br /&gt;
|year=1993&lt;br /&gt;
&lt;br /&gt;
1993年&lt;br /&gt;
&lt;br /&gt;
|title=Robotics: The Marriage of Computers and Machines&lt;br /&gt;
&lt;br /&gt;
|title=Robotics: The Marriage of Computers and Machines&lt;br /&gt;
&lt;br /&gt;
机器人技术: 计算机与机器的联姻&lt;br /&gt;
&lt;br /&gt;
|location=New York&lt;br /&gt;
&lt;br /&gt;
|location=New York&lt;br /&gt;
&lt;br /&gt;
| 地点: 纽约&lt;br /&gt;
&lt;br /&gt;
|publisher=Facts on File&lt;br /&gt;
&lt;br /&gt;
|publisher=Facts on File&lt;br /&gt;
&lt;br /&gt;
文件中的事实&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-8160-2628-9&lt;br /&gt;
&lt;br /&gt;
|isbn=978-0-8160-2628-9&lt;br /&gt;
&lt;br /&gt;
[国际标准图书编号978-0-8160-2628-9]&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/isbn_9780816026289&lt;br /&gt;
&lt;br /&gt;
|url=https://archive.org/details/isbn_9780816026289&lt;br /&gt;
&lt;br /&gt;
Https://archive.org/details/isbn_9780816026289&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{Turing 1950}}.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite web&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
 |ref=harv&lt;br /&gt;
&lt;br /&gt;
不会有事的&lt;br /&gt;
&lt;br /&gt;
 |last=van der Walt&lt;br /&gt;
&lt;br /&gt;
 |last=van der Walt&lt;br /&gt;
&lt;br /&gt;
最后一个范德沃尔特&lt;br /&gt;
&lt;br /&gt;
 |first=Christiaan&lt;br /&gt;
&lt;br /&gt;
 |first=Christiaan&lt;br /&gt;
&lt;br /&gt;
第一个克里斯蒂安&lt;br /&gt;
&lt;br /&gt;
 |last2=Bernard&lt;br /&gt;
&lt;br /&gt;
 |last2=Bernard&lt;br /&gt;
&lt;br /&gt;
最后2个 Bernard&lt;br /&gt;
&lt;br /&gt;
 |first2=Etienne&lt;br /&gt;
&lt;br /&gt;
 |first2=Etienne&lt;br /&gt;
&lt;br /&gt;
| first2 Etienne&lt;br /&gt;
&lt;br /&gt;
 |year=2006&lt;br /&gt;
&lt;br /&gt;
 |year=2006&lt;br /&gt;
&lt;br /&gt;
2006年&lt;br /&gt;
&lt;br /&gt;
 |title=Data characteristics that determine classifier performance&lt;br /&gt;
&lt;br /&gt;
 |title=Data characteristics that determine classifier performance&lt;br /&gt;
&lt;br /&gt;
| 决定分类器性能的数据特征&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf&lt;br /&gt;
&lt;br /&gt;
 |url=http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf&lt;br /&gt;
&lt;br /&gt;
Http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf&lt;br /&gt;
&lt;br /&gt;
 |accessdate=5 August 2009&lt;br /&gt;
&lt;br /&gt;
 |accessdate=5 August 2009&lt;br /&gt;
&lt;br /&gt;
2009年8月5日&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
 |url-status=dead&lt;br /&gt;
&lt;br /&gt;
状态死机&lt;br /&gt;
&lt;br /&gt;
 |archiveurl=https://web.archive.org/web/20090325194051/http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf&lt;br /&gt;
&lt;br /&gt;
 |archiveurl=https://web.archive.org/web/20090325194051/http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf&lt;br /&gt;
&lt;br /&gt;
| archiveurl  https://web.archive.org/web/20090325194051/http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf&lt;br /&gt;
&lt;br /&gt;
 |archivedate=25 March 2009&lt;br /&gt;
&lt;br /&gt;
 |archivedate=25 March 2009&lt;br /&gt;
&lt;br /&gt;
2009年3月25日&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
 |df=&lt;br /&gt;
&lt;br /&gt;
我不会让你失望的&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal | ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Vinge | first=Vernor | authorlink=Vernor Vinge&lt;br /&gt;
&lt;br /&gt;
| last=Vinge | first=Vernor | authorlink=Vernor Vinge&lt;br /&gt;
&lt;br /&gt;
最后一个 Vinge | 第一个 Vernor | authorlink Vernor Vinge&lt;br /&gt;
&lt;br /&gt;
| year=1993&lt;br /&gt;
&lt;br /&gt;
| year=1993&lt;br /&gt;
&lt;br /&gt;
1993年&lt;br /&gt;
&lt;br /&gt;
| title=The Coming Technological Singularity: How to Survive in the Post-Human Era&lt;br /&gt;
&lt;br /&gt;
| title=The Coming Technological Singularity: How to Survive in the Post-Human Era&lt;br /&gt;
&lt;br /&gt;
即将到来的技术奇异点: 如何在后人类时代生存&lt;br /&gt;
&lt;br /&gt;
| journal=Vision 21: Interdisciplinary Science and Engineering in the Era of Cyberspace | pages=11 | url=http://www-rohan.sdsu.edu/faculty/vinge/misc/singularity.html&lt;br /&gt;
&lt;br /&gt;
| journal=Vision 21: Interdisciplinary Science and Engineering in the Era of Cyberspace | pages=11 | url=http://www-rohan.sdsu.edu/faculty/vinge/misc/singularity.html&lt;br /&gt;
&lt;br /&gt;
视觉21: 网络时代的跨学科科学与工程杂志 | 第11页 |  http://www-rohan.sdsu.edu/faculty/vinge/misc/singularity.html&lt;br /&gt;
&lt;br /&gt;
| bibcode=1993vise.nasa...11V }}&lt;br /&gt;
&lt;br /&gt;
| bibcode=1993vise.nasa...11V }}&lt;br /&gt;
&lt;br /&gt;
1993 vise. nasa... 11V }&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=Wason | first1=P. C. | author-link=Peter Cathcart Wason&lt;br /&gt;
&lt;br /&gt;
| last1=Wason | first1=P. C. | author-link=Peter Cathcart Wason&lt;br /&gt;
&lt;br /&gt;
| last 1 Wason | first1 p.作者链接: Peter Cathcart Wason&lt;br /&gt;
&lt;br /&gt;
| last2=Shapiro | first2=D.&lt;br /&gt;
&lt;br /&gt;
| last2=Shapiro | first2=D.&lt;br /&gt;
&lt;br /&gt;
2 Shapiro | first2 d.&lt;br /&gt;
&lt;br /&gt;
| editor=Foss, B. M.&lt;br /&gt;
&lt;br /&gt;
| editor=Foss, B. M.&lt;br /&gt;
&lt;br /&gt;
编辑 Foss，B.m。&lt;br /&gt;
&lt;br /&gt;
| year=1966&lt;br /&gt;
&lt;br /&gt;
| year=1966&lt;br /&gt;
&lt;br /&gt;
1966年&lt;br /&gt;
&lt;br /&gt;
| title=New horizons in psychology&lt;br /&gt;
&lt;br /&gt;
| title=New horizons in psychology&lt;br /&gt;
&lt;br /&gt;
心理学的新视野&lt;br /&gt;
&lt;br /&gt;
|chapter-url=https://archive.org/details/newhorizonsinpsy0000foss&lt;br /&gt;
&lt;br /&gt;
|chapter-url=https://archive.org/details/newhorizonsinpsy0000foss&lt;br /&gt;
&lt;br /&gt;
| 章节-网址 https://archive.org/details/newhorizonsinpsy0000foss&lt;br /&gt;
&lt;br /&gt;
|chapter-url-access=registration&lt;br /&gt;
&lt;br /&gt;
|chapter-url-access=registration&lt;br /&gt;
&lt;br /&gt;
| chapter-url-access registration&lt;br /&gt;
&lt;br /&gt;
| location=Harmondsworth | publisher=Penguin&lt;br /&gt;
&lt;br /&gt;
| location=Harmondsworth | publisher=Penguin&lt;br /&gt;
&lt;br /&gt;
| 地址 Harmondsworth | 出版商 Penguin&lt;br /&gt;
&lt;br /&gt;
| chapter=Reasoning&lt;br /&gt;
&lt;br /&gt;
| chapter=Reasoning&lt;br /&gt;
&lt;br /&gt;
推理 | 第一章&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite book |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last=Weizenbaum | first = Joseph | authorlink=Joseph Weizenbaum&lt;br /&gt;
&lt;br /&gt;
| last=Weizenbaum | first = Joseph | authorlink=Joseph Weizenbaum&lt;br /&gt;
&lt;br /&gt;
2012年3月15日 | 约瑟夫·维森鲍姆&lt;br /&gt;
&lt;br /&gt;
| year = 1976&lt;br /&gt;
&lt;br /&gt;
| year = 1976&lt;br /&gt;
&lt;br /&gt;
1976年&lt;br /&gt;
&lt;br /&gt;
| title = Computer Power and Human Reason&lt;br /&gt;
&lt;br /&gt;
| title = Computer Power and Human Reason&lt;br /&gt;
&lt;br /&gt;
计算机能力与人类理性&lt;br /&gt;
&lt;br /&gt;
| publisher = W.H. Freeman &amp;amp; Company | location = San Francisco&lt;br /&gt;
&lt;br /&gt;
| publisher = W.H. Freeman &amp;amp; Company | location = San Francisco&lt;br /&gt;
&lt;br /&gt;
出版商 w.h。弗里曼公司 | 地点: 旧金山&lt;br /&gt;
&lt;br /&gt;
| isbn = 978-0-7167-0464-5&lt;br /&gt;
&lt;br /&gt;
| isbn = 978-0-7167-0464-5&lt;br /&gt;
&lt;br /&gt;
| isbn 978-0-7167-0464-5&lt;br /&gt;
&lt;br /&gt;
| title-link=Computer Power and Human Reason }}&lt;br /&gt;
&lt;br /&gt;
| title-link=Computer Power and Human Reason }}&lt;br /&gt;
&lt;br /&gt;
| title-link 计算机能力和人类理性}&lt;br /&gt;
&lt;br /&gt;
* {{cite journal |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
| last1=Weng |first1=J. |last2=McClelland |last3=Pentland |first3=A. |last4=Sporns |first4=O.&lt;br /&gt;
&lt;br /&gt;
| last1=Weng |first1=J. |last2=McClelland |last3=Pentland |first3=A. |last4=Sporns |first4=O.&lt;br /&gt;
&lt;br /&gt;
最后1个翁最初1个 j。最后2个麦克利兰最后3个彭特兰最初3个 a。最后4个运动项目。&lt;br /&gt;
&lt;br /&gt;
| last5=Stockman |first5=I. |last6=Sur |first6=M. |last7=Thelen |first7=E. |year=2001&lt;br /&gt;
&lt;br /&gt;
| last5=Stockman |first5=I. |last6=Sur |first6=M. |last7=Thelen |first7=E. |year=2001&lt;br /&gt;
&lt;br /&gt;
| 最后5个斯托克曼 | 最初5个。6:00.7 Thelen | first7 e.2001年&lt;br /&gt;
&lt;br /&gt;
| url=http://www.cse.msu.edu/dl/SciencePaper.pdf |via=msu.edu | doi= 10.1126/science.291.5504.599&lt;br /&gt;
&lt;br /&gt;
| url=http://www.cse.msu.edu/dl/SciencePaper.pdf |via=msu.edu | doi= 10.1126/science.291.5504.599&lt;br /&gt;
&lt;br /&gt;
Http://www.cse.msu.edu/dl/sciencepaper.pdf 10.1126 / science. 291.5504.599&lt;br /&gt;
&lt;br /&gt;
| pmid=11229402 | title=Autonomous mental development by robots and animals |journal=Science |volume=291 | issue=5504 |pages=599–600&lt;br /&gt;
&lt;br /&gt;
| pmid=11229402 | title=Autonomous mental development by robots and animals |journal=Science |volume=291 | issue=5504 |pages=599–600&lt;br /&gt;
&lt;br /&gt;
机器人和动物的自主智力开发 | 科学杂志 | 第291卷 | 第5504期 | 第599-600页&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* {{cite web |ref=harv&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|url=http://www-formal.stanford.edu/jmc/whatisai/node3.html&lt;br /&gt;
&lt;br /&gt;
|url=http://www-formal.stanford.edu/jmc/whatisai/node3.html&lt;br /&gt;
&lt;br /&gt;
Http://www-formal.stanford.edu/jmc/whatisai/node3.html&lt;br /&gt;
&lt;br /&gt;
|title=Applications of AI&lt;br /&gt;
&lt;br /&gt;
|title=Applications of AI&lt;br /&gt;
&lt;br /&gt;
| 人工智能的应用&lt;br /&gt;
&lt;br /&gt;
|website=www-formal.stanford.edu&lt;br /&gt;
&lt;br /&gt;
|website=www-formal.stanford.edu&lt;br /&gt;
&lt;br /&gt;
网站 www-formal.stanford.edu&lt;br /&gt;
&lt;br /&gt;
|access-date=25 September 2016}}&lt;br /&gt;
&lt;br /&gt;
|access-date=25 September 2016}}&lt;br /&gt;
&lt;br /&gt;
| access-date 25 September 2016}&lt;br /&gt;
&lt;br /&gt;
{{refend}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==扩展阅读 Further reading ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{refbegin|30em}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* DH Author, 'Why Are There Still So Many Jobs? The History and Future of Workplace Automation' (2015) 29(3) Journal of Economic Perspectives 3.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[Margaret Boden|Boden, Margaret]], ''Mind As Machine'', [[Oxford University Press]], 2006.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[Kenneth Cukier|Cukier, Kenneth]], &amp;quot;Ready for Robots?  How to Think about the Future of AI&amp;quot;, ''[[Foreign Affairs]]'', vol. 98, no. 4 (July/August 2019), pp.&amp;amp;nbsp;192–98.  [[George Dyson (science historian)|George Dyson]], historian of computing, writes (in what might be called &amp;quot;Dyson's Law&amp;quot;) that &amp;quot;Any system simple enough to be understandable will not be complicated enough to behave intelligently, while any system complicated enough to behave intelligently will be too complicated to understand.&amp;quot; (p.&amp;amp;nbsp;197.)  Computer scientist [[Alex Pentland]] writes:  &amp;quot;Current [[machine learning|AI machine-learning]] [[algorithm]]s are, at their core, dead simple stupid.  They work, but they work by brute force.&amp;quot; (p.&amp;amp;nbsp;198.)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[Pedro Domingos|Domingos, Pedro]], &amp;quot;Our Digital Doubles:  AI will serve our species, not control it&amp;quot;, ''[[Scientific American]]'', vol. 319, no. 3 (September 2018), pp.&amp;amp;nbsp;88–93.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[Alison Gopnik|Gopnik, Alison]], &amp;quot;Making AI More Human:  Artificial intelligence has staged a revival by starting to incorporate what we know about how children learn&amp;quot;, ''[[Scientific American]]'', vol. 316, no. 6 (June 2017), pp.&amp;amp;nbsp;60–65.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* Johnston, John (2008) ''The Allure of Machinic Life: Cybernetics, Artificial Life, and the New AI'', MIT Press.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[Christof Koch|Koch, Christof]], &amp;quot;Proust among the Machines&amp;quot;, ''[[Scientific American]]'', vol. 321, no. 6 (December 2019), pp.&amp;amp;nbsp;46–49. [[Christof Koch]] doubts the possibility of &amp;quot;intelligent&amp;quot; machines attaining [[consciousness]], because &amp;quot;[e]ven the most sophisticated [[brain simulation]]s are unlikely to produce conscious [[feelings]].&amp;quot; (p.&amp;amp;nbsp;48.) According to Koch, &amp;quot;Whether machines can become [[sentience|sentient]] [is important] for [[ethics|ethical]] reasons. If computers experience life through their own senses, they cease to be purely a means to an end determined by their usefulness to... humans. Per GNW [the [[Global Workspace Theory#Global neuronal workspace|Global Neuronal Workspace]] theory], they turn from mere objects into subjects... with a [[point of view (philosophy)|point of view]].... Once computers' [[cognitive abilities]] rival those of humanity, their impulse to push for legal and political [[rights]] will become irresistible – the right not to be deleted, not to have their memories wiped clean, not to suffer [[pain]] and degradation. The alternative, embodied by IIT [Integrated Information Theory], is that computers will remain only supersophisticated machinery, ghostlike empty shells, devoid of what we value most: the feeling of life itself.&amp;quot; (p.&amp;amp;nbsp;49.)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[Gary Marcus|Marcus, Gary]], &amp;quot;Am I Human?: Researchers need new ways to distinguish artificial intelligence from the natural kind&amp;quot;, ''[[Scientific American]]'', vol. 316, no. 3 (March 2017), pp.&amp;amp;nbsp;58–63.  A stumbling block to AI has been an incapacity for reliable [[disambiguation]].  An example is the &amp;quot;pronoun disambiguation problem&amp;quot;:  a machine has no way of determining to whom or what a [[pronoun]] in a sentence refers. (p.&amp;amp;nbsp;61.)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* E McGaughey, 'Will Robots Automate Your Job Away? Full Employment, Basic Income, and Economic Democracy' (2018) [https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3044448 SSRN, part 2(3)].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [[George Musser]], &amp;quot;[[Artificial Imagination]]:  How machines could learn [[creativity]] and [[common sense]], among other human qualities&amp;quot;, ''[[Scientific American]]'', vol. 320, no. 5 (May 2019), pp.&amp;amp;nbsp;58–63.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* Myers, Courtney Boyd ed. (2009). [https://www.forbes.com/2009/06/22/singularity-robots-computers-opinions-contributors-artificial-intelligence-09_land.html &amp;quot;The AI Report&amp;quot;]. ''Forbes'' June 2009&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite book |last=Raphael |first=Bertram |author-link=Bertram Raphael |year=1976 |title=The Thinking Computer |publisher=W.H.Freeman and Company |isbn=978-0-7167-0723-3 |url=https://archive.org/details/thinkingcomputer00raph }}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* Scharre, Paul, &amp;quot;Killer Apps:  The Real Dangers of an AI Arms Race&amp;quot;, ''[[Foreign Affairs]]'', vol. 98, no. 3 (May/June 2019), pp.&amp;amp;nbsp;135–44.  &amp;quot;Today's AI technologies are powerful but unreliable.  Rules-based systems cannot deal with circumstances their programmers did not anticipate.  Learning systems are limited by the data on which they were trained.  AI failures have already led to tragedy.  Advanced autopilot features in cars, although they perform well in some circumstances, have driven cars without warning into trucks, concrete barriers, and parked cars.  In the wrong situation, AI systems go from supersmart to superdumb in an instant.  When an enemy is trying to manipulate and hack an AI system, the risks are even greater.&amp;quot;  (p.&amp;amp;nbsp;140.) &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite journal | last1 = Serenko | first1 = Alexander | year = 2010 | title = The development of an AI journal ranking based on the revealed preference approach | url = http://www.aserenko.com/papers/JOI_Serenko_AI_Journal_Ranking_Published.pdf | journal = Journal of Informetrics | volume = 4 | issue = 4| pages = 447–459 | doi = 10.1016/j.joi.2010.04.001}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite journal | last1 = Serenko | first1 = Alexander | author2=Michael Dohan | year = 2011 | title = Comparing the expert survey and citation impact journal ranking methods: Example from the field of Artificial Intelligence | url = http://www.aserenko.com/papers/JOI_AI_Journal_Ranking_Serenko.pdf | journal = Journal of Informetrics | volume = 5 | issue = 4| pages = 629–649 | doi = 10.1016/j.joi.2011.06.002}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* Sun, R. &amp;amp; Bookman, L. (eds.), ''Computational Architectures: Integrating Neural and Symbolic Processes''. Kluwer Academic Publishers, Needham, MA. 1994.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite web&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|url=http://www.technologyreview.com/news/533686/2014-in-computing-breakthroughs-in-artificial-intelligence/&lt;br /&gt;
&lt;br /&gt;
|url=http://www.technologyreview.com/news/533686/2014-in-computing-breakthroughs-in-artificial-intelligence/&lt;br /&gt;
&lt;br /&gt;
Http://www.technologyreview.com/news/533686/2014-in-computing-breakthroughs-in-artificial-intelligence/ &lt;br /&gt;
&lt;br /&gt;
|title=2014 in Computing: Breakthroughs in Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
|title=2014 in Computing: Breakthroughs in Artificial Intelligence&lt;br /&gt;
&lt;br /&gt;
2014年《计算机: 人工智能的突破》&lt;br /&gt;
&lt;br /&gt;
|author=Tom Simonite&lt;br /&gt;
&lt;br /&gt;
|author=Tom Simonite&lt;br /&gt;
&lt;br /&gt;
作者: Tom Simonite&lt;br /&gt;
&lt;br /&gt;
|date=29 December 2014&lt;br /&gt;
&lt;br /&gt;
|date=29 December 2014&lt;br /&gt;
&lt;br /&gt;
2014年12月29日&lt;br /&gt;
&lt;br /&gt;
|work=MIT Technology Review&lt;br /&gt;
&lt;br /&gt;
|work=MIT Technology Review&lt;br /&gt;
&lt;br /&gt;
麻省理工学院技术评论&lt;br /&gt;
&lt;br /&gt;
|accessdate=&lt;br /&gt;
&lt;br /&gt;
|accessdate=&lt;br /&gt;
&lt;br /&gt;
访问日期&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
* [[Adam Tooze|Tooze, Adam]], &amp;quot;Democracy and Its Discontents&amp;quot;, ''[[The New York Review of Books]]'', vol. LXVI, no. 10 (6 June 2019), pp.&amp;amp;nbsp;52–53, 56–57.  &amp;quot;Democracy has no clear answer for the mindless operation of [[bureaucracy|bureaucratic]] and [[technology|technological power]].  We may indeed be witnessing its extension in the form of artificial intelligence and [[robotics]].  Likewise, after decades of dire warning, the [[environmentalism|environmental problem]] remains fundamentally unaddressed.... Bureaucratic overreach and environmental catastrophe are precisely the kinds of slow-moving existential challenges that democracies deal with very badly.... Finally, there is the threat du jour:  [[corporation]]s and the technologies they promote.&amp;quot;  (pp.&amp;amp;nbsp;56–57.)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{refend}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==外部链接 External links ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--======================== {{No more links}} ============================&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--========================  ============================&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--========================  ============================&lt;br /&gt;
&lt;br /&gt;
                        | PLEASE BE CAUTIOUS IN ADDING MORE LINKS TO THIS ARTICLE. Wikipedia  |&lt;br /&gt;
&lt;br /&gt;
                        | PLEASE BE CAUTIOUS IN ADDING MORE LINKS TO THIS ARTICLE. Wikipedia  |&lt;br /&gt;
&lt;br /&gt;
请谨慎添加更多链接到本文。维基百科 | &lt;br /&gt;
&lt;br /&gt;
                        | is not a collection of links nor should it be used for advertising. |&lt;br /&gt;
&lt;br /&gt;
                        | is not a collection of links nor should it be used for advertising. |&lt;br /&gt;
&lt;br /&gt;
不是一个链接的集合，也不应该用来做广告。|&lt;br /&gt;
&lt;br /&gt;
                        |                                                                     |&lt;br /&gt;
&lt;br /&gt;
                        |                                                                     |&lt;br /&gt;
&lt;br /&gt;
                        |                                                                     |&lt;br /&gt;
&lt;br /&gt;
                        |           Excessive or inappropriate links WILL BE DELETED.         |&lt;br /&gt;
&lt;br /&gt;
                        |           Excessive or inappropriate links WILL BE DELETED.         |&lt;br /&gt;
&lt;br /&gt;
| 过多或不适当的链接将被删除。|&lt;br /&gt;
&lt;br /&gt;
                        | See [[Wikipedia:External links]] &amp;amp; [[Wikipedia:Spam]] for details.  |&lt;br /&gt;
&lt;br /&gt;
                        | See Wikipedia:External links &amp;amp; Wikipedia:Spam for details.  |&lt;br /&gt;
&lt;br /&gt;
查看维基百科: 外部链接和维基百科: 垃圾信息。|&lt;br /&gt;
&lt;br /&gt;
                        |                                                                     |&lt;br /&gt;
&lt;br /&gt;
                        |                                                                     |&lt;br /&gt;
&lt;br /&gt;
                        |                                                                     |&lt;br /&gt;
&lt;br /&gt;
                        | If there are already plentiful links, please propose additions or   |&lt;br /&gt;
&lt;br /&gt;
                        | If there are already plentiful links, please propose additions or   |&lt;br /&gt;
&lt;br /&gt;
如果已经有大量的链接，请提出附加或 | &lt;br /&gt;
&lt;br /&gt;
                        | replacements on this article's discussion page, or submit your link |&lt;br /&gt;
&lt;br /&gt;
                        | replacements on this article's discussion page, or submit your link |&lt;br /&gt;
&lt;br /&gt;
更新本文讨论页面，或者提交你的链接&lt;br /&gt;
&lt;br /&gt;
                        | to the relevant category at the Open Directory Project (dmoz.org)   |&lt;br /&gt;
&lt;br /&gt;
                        | to the relevant category at the Open Directory Project (dmoz.org)   |&lt;br /&gt;
&lt;br /&gt;
| 相关类别的 dmoz (dmoz. org) | &lt;br /&gt;
&lt;br /&gt;
                        | and link back to that category using the {{dmoz}} template.         |&lt;br /&gt;
&lt;br /&gt;
                        | and link back to that category using the  template.         |&lt;br /&gt;
&lt;br /&gt;
并使用该模板链接回该类别。|&lt;br /&gt;
&lt;br /&gt;
                        ======================= {{No more links}} =============================--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
                        =======================  =============================--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
                        =======================  =============================--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Sister project links|voy=no|species=no|d=Q11660|v=Portal:Artificial intelligence|n=no|s=no|c=Category:Artificial intelligence|wikt=artificial intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{IEP|art-inte|Artificial Intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* {{cite SEP |url-id=logic-ai |title=Logic and Artificial Intelligence |last=Thomason |first=Richmond}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [http://aitopics.org/ AITopics] – A large directory of links and other resources maintained by the [[Association for the Advancement of Artificial Intelligence]], the leading organization of academic AI researchers.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://www.bbc.co.uk/programmes/p003k9fc Artificial Intelligence], BBC Radio 4 discussion with John Agar, Alison Adam &amp;amp; Igor Aleksander (''In Our Time'', Dec. 8, 2005)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Navboxes&lt;br /&gt;
&lt;br /&gt;
{{Navboxes&lt;br /&gt;
&lt;br /&gt;
{导航框&lt;br /&gt;
&lt;br /&gt;
|list=&lt;br /&gt;
&lt;br /&gt;
|list=&lt;br /&gt;
&lt;br /&gt;
名单&lt;br /&gt;
&lt;br /&gt;
{{John McCarthy navbox}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{philosophy of mind}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{philosophy of science}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Evolutionary computation}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Computable knowledge}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Computer science}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{emerging technologies|topics=yes|infocom=yes}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Robotics}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
{{Existential_risk_from_artificial_intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Philosophy of mind}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Cybernetics}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Computer science}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Evolutionary computation}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{emerging technologies|topics=yes|infocom=yes}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Glossaries of science and engineering}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Authority control}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:Artificial Intelligence}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:Artificial intelligence| ]]&amp;lt;!--please leave the empty space as standard--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;!--please leave the empty space as standard--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
!-请离开空白的空间作为标准 -- &lt;br /&gt;
&lt;br /&gt;
[[Category:Cybernetics]]&lt;br /&gt;
&lt;br /&gt;
Category:Cybernetics&lt;br /&gt;
&lt;br /&gt;
类别: 控制论&lt;br /&gt;
&lt;br /&gt;
[[Category:Formal sciences]]&lt;br /&gt;
&lt;br /&gt;
Category:Formal sciences&lt;br /&gt;
&lt;br /&gt;
类别: 正规科学&lt;br /&gt;
&lt;br /&gt;
[[Category:Technology in society]]&lt;br /&gt;
&lt;br /&gt;
Category:Technology in society&lt;br /&gt;
&lt;br /&gt;
类别: 社会中的技术&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational neuroscience]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational neuroscience&lt;br /&gt;
&lt;br /&gt;
类别: 计算神经科学&lt;br /&gt;
&lt;br /&gt;
[[Category:Emerging technologies]]&lt;br /&gt;
&lt;br /&gt;
Category:Emerging technologies&lt;br /&gt;
&lt;br /&gt;
类别: 新兴技术&lt;br /&gt;
&lt;br /&gt;
[[Category:Unsolved problems in computer science]]&lt;br /&gt;
&lt;br /&gt;
Category:Unsolved problems in computer science&lt;br /&gt;
&lt;br /&gt;
类别: 计算机科学中未解决的问题&lt;br /&gt;
&lt;br /&gt;
[[Category:Computational fields of study]]&lt;br /&gt;
&lt;br /&gt;
Category:Computational fields of study&lt;br /&gt;
&lt;br /&gt;
类别: 研究的计算领域&lt;br /&gt;
&lt;br /&gt;
&amp;lt;noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;small&amp;gt;This page was moved from [[wikipedia:en:Artificial intelligence]]. Its edit history can be viewed at [[人工智能/edithistory]]&amp;lt;/small&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:待整理页面]]&lt;/div&gt;</summary>
		<author><name>Pumpkin南瓜</name></author>
	</entry>
</feed>