更改

添加561,319字节、 2020年5月6日 (三) 18:28

Moved page from wikipedia:en:Artificial intelligence (history)

此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。{{Redirect|AI|other uses|AI (disambiguation)|and|Artificial intelligence (disambiguation)}}

{{pp-pc1}}

{{short description|Intelligence demonstrated by machines}}

{{Use dmy dates|date=January 2018}}

{{artificial intelligence}}





! -- 定义 --

In [[computer science]], '''artificial intelligence''' ('''AI'''), sometimes called '''machine intelligence''', is [[intelligence]] demonstrated by [[machine]]s, in contrast to the '''natural intelligence''' displayed by [[human intelligence|humans]] and [[animal cognition|animals]]. Leading AI textbooks define the field as the study of "[[intelligent agent]]s": any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals.<ref name="Definition of AI"/> Colloquially, the term "artificial intelligence" is often used to describe machines (or computers) that mimic "cognitive" functions that humans associate with the [[human mind]], such as "learning" and "problem solving".{{sfn|Russell|Norvig|2009|p=2}}

In computer science, artificial intelligence (AI), sometimes called machine intelligence, is intelligence demonstrated by machines, in contrast to the natural intelligence displayed by humans and animals. Leading AI textbooks define the field as the study of "intelligent agents": any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals. Colloquially, the term "artificial intelligence" is often used to describe machines (or computers) that mimic "cognitive" functions that humans associate with the human mind, such as "learning" and "problem solving".

在计算机科学中，人工智能(AI) ，有时也被称为机器智能，是由机器演示的智能，与自然智能形成鲜明对比。领先的人工智能教科书将这一领域定义为“智能代理人”的研究: 任何感知其环境并采取行动以最大化其成功实现其目标的机会的设备。通俗地说，”人工智能”一词通常用来描述模仿人类与人类大脑相关的”认知”功能的机器(或计算机) ，例如”学习”和”解决问题”。

As machines become increasingly capable, tasks considered to require "intelligence" are often removed from the definition of AI, a phenomenon known as the [[AI effect]].<ref>{{Harvnb|McCorduck|2004|p=204}}</ref> A quip in Tesler's Theorem says "AI is whatever hasn't been done yet."<ref>{{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=}}</ref> For instance, [[optical character recognition]] is frequently excluded from things considered to be AI,<ref>{{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}}</ref> having become a routine technology.<ref>{{cite magazine |last=Schank |first=Roger C. |title=Where's the AI |magazine=AI magazine |volume=12 |issue=4 |year=1991|p=38}}</ref> 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]]),<ref name="bbc-alphago"/> [[autonomous car|autonomously operating cars]], intelligent routing in [[content delivery network]]s, and [[military simulations]]<ref>{{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}}</ref>.

As machines become increasingly capable, tasks considered to require "intelligence" are often removed from the definition of AI, a phenomenon known as the AI effect. A quip in Tesler's Theorem says "AI is whatever hasn't been done yet." 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),.

随着机器的能力越来越强，被认为需要“智能”的任务往往从人工智能的定义中移除，这种现象被称为人工智能效应。特斯勒定理中的一句俏皮话说: “人工智能就是尚未完成的事情。”例如，光学字符识别经常被排除在被认为是人工智能的东西之外，已经成为一种常规技术。现代机器能力通常被归类为人工智能，包括成功地理解人类语言，在战略游戏系统(如国际象棋和围棋)中处于最高级别的竞争。





! ——总结历史——

Artificial intelligence was founded as an academic discipline in 1955, and in the years since has experienced several waves of optimism,<ref name="Optimism of early AI"/><ref name="AI in the 80s"/> followed by disappointment and the loss of funding (known as an "[[AI winter]]"),<ref name="First AI winter"/><ref name="Second AI winter"/> followed by new approaches, success and renewed funding.<ref name="AI in the 80s"/><ref name="AI in 2000s"/> For most of its history, AI research has been divided into sub-fields that often fail to communicate with each other.<ref name="Fragmentation of AI"/> These sub-fields are based on technical considerations, such as particular goals (e.g. "[[robotics]]" or "[[machine learning]]"),<ref name="Problems of AI"/> the use of particular tools ("[[logic]]" or [[artificial neural network]]s), or deep philosophical differences.<ref name="Biological intelligence vs. intelligence in general"/><ref name="Neats vs. scruffies"/><ref name="Symbolic vs. sub-symbolic"/> Sub-fields have also been based on social factors (particular institutions or the work of particular researchers).<ref name="Fragmentation of AI"/>

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 "AI winter"), 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. "robotics" or "machine learning"), the use of particular tools ("logic" 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).

1955年，人工智能作为一门学科成立，此后几年，人们经历了几波乐观情绪，接着是失望和资金流失(被称为“人工智能的冬天”) ，接着是新的方法、成功和新的资金。在人工智能发展的大部分历史中，人工智能研究一直被划分为许多子领域，这些子领域之间往往无法进行交流。这些子领域是基于技术考虑的，例如特定的目标(例如:。“机器人”或“机器学习”) ，使用特定的工具(“逻辑”或人工神经网络) ，或深刻的哲学差异。子领域也基于社会因素(特定机构或特定研究人员的工作)。





! ——总结问题、方法、工具——

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.<ref name="Problems of AI"/> [[artificial general intelligence|General intelligence]] is among the field's long-term goals.<ref name="General intelligence"/> 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.

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.

人工智能研究的传统问题(或目标)包括推理、知识表示、规划、学习、自然语言处理、知觉以及移动和操作物体的能力。一般智力是该领域的长期目标之一。方法包括统计方法、计算智能和传统的符号人工智能。人工智能中使用了许多工具，包括搜索和最优化，人工神经网络，以及基于统计学、概率和经济学的方法。人工智能领域利用计算机科学，信息工程，数学，心理学，语言学，哲学和许多其他领域。





! ——总结小说 / 推测，哲学，历史——

The field was founded on the assumption that [[human intelligence]] "can be so precisely described that a machine can be made to simulate it".<ref>See the [[Dartmouth Workshop|Dartmouth proposal]], under [[#Philosophy|Philosophy]], below.</ref> 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]].<ref name="McCorduck's thesis"/> Some people also consider AI to be [[existential risk|a danger to humanity]] if it progresses unabated.<ref>{{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}}</ref><ref name="pmid31835078">{{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 }}</ref> Others believe that AI, unlike previous technological revolutions, will create a [[Technological unemployment#21st century|risk of mass unemployment]].<ref name="guardian jobs debate"/>

The field was founded on the assumption that human intelligence "can be so precisely described that a machine can be made to simulate it". 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.

这个领域建立在这样的假设之上: 人类的智能“可以被如此精确地描述，以至于可以制造一台机器来模拟它”。这引发了关于心智本质和创造具有类人智能的人工生命的伦理学的哲学争论。自古以来，神话、小说和哲学一直在探索这些问题。其他人则认为，人工智能与以往的技术革命不同，它将带来大规模失业的风险。





! ——总结应用，最新进展——

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]].<ref name="AI widely used"/><ref name="AI in 2000s"/>

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.

在二十一世纪，随着计算机能力、大量数据和理论认识的同步发展，人工智能技术经历了一次复兴; 人工智能技术已成为技术工业的重要组成部分，帮助解决了计算机科学、软件工程和运筹学中的许多具有挑战性的问题。

{{toclimit|3}}

== History ==

== History ==

历史





! ——这是一部社会史。“方法”和“工具”部分介绍了技术历史。-->

{{Main|History of artificial intelligence|Timeline of artificial intelligence}}

[[File:Didrachm Phaistos obverse CdM.jpg|thumb|Silver [[didrachma]] from [[Crete]] depicting [[Talos]], an ancient mythical [[automaton]] with artificial intelligence]]

Silver [[didrachma from Crete depicting Talos, an ancient mythical automaton with artificial intelligence]]

银[来自克里特岛的描绘塔罗斯的狄拉克马，一种古代神话中的具有人工智能的自动机]





! -- 20世纪前。也许是为了保持简短。-->

Thought-capable [[artificial being]]s appeared as [[storytelling device]]s in antiquity,<ref name="AI in myth"/> and have been common in fiction, as in [[Mary Shelley]]'s ''[[Frankenstein]]'' or [[Karel Čapek]]'s ''[[R.U.R. (Rossum's Universal Robots)]]''.<ref name="AI in early science fiction"/> These characters and their fates raised many of the same issues now discussed in the [[ethics of artificial intelligence]].<ref name="McCorduck's thesis"/>

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). These characters and their fates raised many of the same issues now discussed in the ethics of artificial intelligence.

具有思维能力的人造生物在古代以讲故事的方式出现，在小说中也很常见，比如玛丽 · 雪莱的《弗兰肯斯坦》或卡雷尔 · 阿佩克的《 r.u.r. 》。(Rossum's Universal Robots).



! ——主要智力先驱: 逻辑学、计算理论、控制论、信息论、早期神经网络

The study of mechanical or [[formal reasoning|"formal" 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 "0" and "1", 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]].<ref name="Formal reasoning"/> 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 "whether or not it is possible for machinery to show intelligent behaviour".<ref>{{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 }}</ref> The first work that is now generally recognized as AI was [[Warren McCullouch|McCullouch]] and [[Walter Pitts|Pitts]]' 1943 formal design for [[Turing-complete]] "artificial neurons".{{sfn|Russell|Norvig|2009|p=16}}

The study of mechanical or "formal" 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 "0" and "1", 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 "artificial neurons".

对机械或“正式”推理的研究始于古代的哲学家和数学家。对数理逻辑的研究直接导致了 Alan Turing 的计算理论理论，该理论认为一台机器，通过移动像“0”和“1”这样简单的符号，可以模拟任何可以想象的数学推理行为。这种数字计算机可以模拟任何形式推理过程的见解，被称为丘奇-图灵论文。现在被公认为人工智能的第一项工作是 McCullouch 和 Pitts 在1943年为图灵完整的“人工神经元”所做的正式设计。





! -- “黄金年代”1956 -- 1974 --

The field of AI research was born at [[Dartmouth workshop|a workshop]] at [[Dartmouth College]] in 1956,<ref name="Dartmouth conference"/> where the term "Artificial Intelligence" was coined by [[John McCarthy (computer scientist)|John McCarthy]] to distinguish the field from cybernetics and escape the influence of the cyberneticist [[Norbert Wiener]].<ref>{{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, "[O]ne of the reasons for inventing the term "artificial intelligence" was to escape association with "cybernetics". 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."</ref> 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.<ref name="Hegemony of the Dartmouth conference attendees"/> They and their students produced programs that the press described as "astonishing":{{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)<ref>Schaeffer J. (2009) Didn't Samuel Solve That Game?. In: One Jump Ahead. Springer, Boston, MA</ref> (and by 1959 were reportedly playing better than the average human),<ref>{{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}}</ref> solving word problems in algebra, proving [[Theorem|logical theorems]] ([[Logic Theorist]], first run c. 1956) and speaking English.<ref name="Golden years of AI"/> By the middle of the 1960s, research in the U.S. was heavily funded by the [[DARPA|Department of Defense]]<ref name="AI funding in the 60s"/> and laboratories had been established around the world.<ref name="AI in England"/> AI's founders were optimistic about the future: [[Herbert A. Simon|Herbert Simon]] predicted, "machines will be capable, within twenty years, of doing any work a man can do". [[Marvin Minsky]] agreed, writing, "within a generation ... the problem of creating 'artificial intelligence' will substantially be solved".<ref name="Optimism of early AI"/>

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, "machines will be capable, within twenty years, of doing any work a man can do". Marvin Minsky agreed, writing, "within a generation ... the problem of creating 'artificial intelligence' will substantially be solved".

人工智能研究领域诞生于1956年达特茅斯学院的一个研讨会上，与会者 Allen Newell (CMU) ，Herbert Simon (CMU) ，John McCarthy (MIT) ，Marvin Minsky (MIT)和 Arthur Samuel (IBM)成为了人工智能研究的创始人和领导者。(到1959年，据说玩得比普通人好) ，解决代数中的文字问题，证明逻辑定理(逻辑理论家，1956年第一次运行)和说英语。到20世纪60年代中期，美国的研究得到了国防部的大量资助，世界各地都建立了实验室。人工智能的创始人对未来很乐观: 赫伯特 · 西蒙预言，“机器将在20年内完成人类能做的任何工作。”。马文•明斯基(Marvin Minsky)对此表示同意，他写道: “在一代人的时间里... ... 创造‘人工智能’的问题将得到实质性的解决。”。





! 第一个人工智能的冬天

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 "[[AI winter]]",<ref name="First AI winter"/> a period when obtaining funding for AI projects was difficult.

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 "AI winter", a period when obtaining funding for AI projects was difficult.

他们没有认识到剩下的一些任务的困难。在1974年，为了回应 James Lighthill 爵士的批评和来自美国国会资助更多生产性项目的持续压力，美国和英国政府都切断了人工智能领域的探索性研究。接下来的几年后来被称为“人工智能的冬天” ，这个时期人工智能项目很难获得资金。





! 20世纪80年代的繁荣，第二个人工智能的冬天

In the early 1980s, AI research was revived by the commercial success of [[expert system]]s,<ref name="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]].<ref name="AI in the 80s"/> 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.<ref name="Second AI winter"/>

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.

在20世纪80年代早期，人工智能研究因专家系统的商业成功而复兴，这是一种模拟人类专家知识和分析技能的人工智能程序。到1985年，人工智能的市场已经超过了10亿美元。与此同时，日本的第五代计算机项目促使美国和英国政府恢复对学术研究的资助。然而，随着1987年 Lisp 机器市场的崩溃，人工智能再次声名狼藉，并开始了第二次更长时间的停滞。

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.<ref name="Mead">{{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}}</ref>

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.

20世纪80年代，以互补 MOS (CMOS)晶体管技术形式出现的金属氧化物半导体(MOS)超大规模集成电路(VLSI)的发展，使实用的人工神经网络(ANN)技术得以发展。这一领域里程碑式的出版物是1989年出版的《模拟 VLSI 神经系统的实现》，作者是卡弗 · a · 米德和穆罕默德 · 伊斯梅尔。





! ——形式方法兴起于90年代

In the late 1990s and early 21st century, AI began to be used for logistics, [[data mining]], [[medical diagnosis]] and other areas.<ref name="AI widely used"/> 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.<ref name="Formal methods in AI"/> [[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}}

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.

在20世纪90年代末和21世纪初，人工智能开始被用于物流、数据挖掘、医疗诊断和其他领域。这种成功归功于计算能力的提高(见摩尔定律和晶体管数量)、对解决特定问题的更大重视、人工智能与其它领域(如统计学、经济学和数学)之间的新联系，以及研究人员对数学方法和科学标准的承诺。1997年5月11日，深蓝成为第一个击败国际象棋卫冕冠军加里 · 卡斯帕罗夫的计算机国际象棋系统。





! 2010年代的深度学习、大数据和机器学习

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]].<ref>{{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 & Company|accessdate=13 April 2018|language=en}}</ref> 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<ref>{{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}}</ref> as do [[intelligent personal assistant]]s in [[smartphone]]s.<ref>{{cite web|url=http://readwrite.com/2013/01/15/virtual-personal-assistants-the-future-of-your-smartphone-infographic|title=Virtual Personal Assistants & 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}}</ref> 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]].<ref name="bbc-alphago">{{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}}</ref><ref>{{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}}</ref> In the 2017 [[Future of Go Summit]], [[AlphaGo]] won a [[AlphaGo versus Ke Jie|three-game match]] with [[Ke Jie]],<ref>{{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}}</ref> who at the time continuously held the world No. 1 ranking for two years.<ref>{{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}}</ref><ref>{{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}}</ref> 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.

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.

2011年，《危险边缘》！展览会智力竞赛，IBM 的问答系统，沃森，击败了两个最伟大的危险边缘！冠军布拉德 · 拉特和肯 · 詹宁斯以微弱优势获胜。更快的计算机，算法的改进，以及大量数据的获取，使得机器学习和感知能力得到提高; 数据饥渴的深度学习方法在2012年左右开始主导精确度基准。Kinect 为 Xbox 360和 Xbox One 提供了3D 人体运动界面，它使用的算法来自冗长的人工智能研究，智能手机上的智能个人助理也是如此。2016年3月，AlphaGo 与围棋冠军李世石在5局围棋中赢了4局，成为第一个击败无残疾围棋职业选手的计算机围棋系统。在2017年围棋未来峰会上，阿尔法狗赢得了与柯洁的三局比赛，柯洁当时一直是世界第一。一个排名两年。这标志着人工智能发展的一个重要里程碑的完成，围棋是一个相对复杂的游戏，比国际象棋更复杂。

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 "sporadic usage" 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.<ref name=":0">{{cite web

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 "sporadic usage" 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.<ref name=":0">{{cite web

彭博社的杰克 · 克拉克(Jack Clark)表示，2015年是人工智能领域具有里程碑意义的一年，使用谷歌人工智能的软件项目数量从2012年的“零星使用”增加到2700多个项目。克拉克还提供了事实数据，表明自2012年以来人工智能的改进得到了图像处理任务中较低错误率的支持。 0"{ cite web

|url = https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence

|url = https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence

Https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence

|title = Why 2015 Was a Breakthrough Year in Artificial Intelligence

|title = Why 2015 Was a Breakthrough Year in Artificial Intelligence

为什么2015年是人工智能的突破之年

|last = Clark

|last = Clark

最后的克拉克

|first = Jack

|first = Jack

先是杰克

|website = Bloomberg News

|website = Bloomberg News

彭博新闻网

|date = 8 December 2015

|date = 8 December 2015

2015年12月8日

|access-date = 23 November 2016

|access-date = 23 November 2016

| 2016年11月23日

|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.

|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.

经过5年人工智能领域的悄然突破，2015年成为了具有里程碑意义的一年。计算机比以往更聪明，学习速度更快。

|url-status = live

|url-status = live

状态直播

|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

|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

| 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

|archivedate = 23 November 2016

|archivedate = 23 November 2016

2016年11月23日

|df = dmy-all

|df = dmy-all

我不会放过你的

}}</ref> 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.<ref name="AI in 2000s"/> 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.<ref name=":0"/> In a 2017 survey, one in five companies reported they had "incorporated AI in some offerings or processes".<ref>{{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}}</ref><ref>{{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}}</ref> 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 "AI superpower".<ref>{{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=}}</ref><ref>{{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}}</ref> However, it has been acknowledged that reports regarding artificial intelligence have tended to be exaggerated.<ref>{{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}}</ref><ref>{{Cite web|url=https://joshworth.com/stop-calling-in-artificial-intelligence/|title=Stop Calling it Artificial Intelligence}}</ref><ref>{{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}}</ref>

}}</ref> 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 "AI superpower". However, it has been acknowledged that reports regarding artificial intelligence have tended to be exaggerated.

} / ref 他把这归因于负担得起的神经网络的增加，因为云计算基础设施的增加，以及研究工具和数据集的增加。2016年前后，中国大大加快了政府资助的步伐; 鉴于其大量数据供应和快速增长的研究产出，一些观察人士认为，中国可能正走上成为“人工智能超级大国”的道路。然而，人们承认，有关人工智能的报告有夸大之嫌。

== Definitions ==

== Definitions ==

定义

Computer science defines AI research as the study of "[[intelligent agent]]s": any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals.<ref name="Definition of AI"/> A more elaborate definition characterizes AI as "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."<ref>{{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}}</ref>

Computer science defines AI research as the study of "intelligent agents": any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals.

计算机科学将人工智能研究定义为对“智能代理人”的研究: 任何感知周围环境并采取行动以最大化其成功实现目标的机会的设备。

== Basics ==

== Basics ==

基本知识





! ——这部分是为了向非专业人士解释有助于理解人工智能的核心概念，你可以随意扩展甚至引用到它自己的“人工智能导论”文章中，类似于量子力学导论——

A typical AI analyzes its environment and takes actions that maximize its chance of success.<ref name="Definition of AI"/> An AI's intended [[utility function|utility function (or goal)]] can be simple ("1 if the AI wins a game of [[Go (game)|Go]], 0 otherwise") or complex ("Do mathematically similar actions to the ones succeeded in the past"). Goals can be explicitly defined or induced. If the AI is programmed for "[[reinforcement learning]]", 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 "[[reward function]]".}} Alternatively, an evolutionary system can induce goals by using a "[[fitness function]]" 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 "goal" is to successfully accomplish its narrow classification task.<ref>Lindenbaum, M., Markovitch, S., & Rusakov, D. (2004). Selective sampling for nearest neighbor classifiers. Machine learning, 54(2), 125–152.</ref>

A typical AI analyzes its environment and takes actions that maximize its chance of success.

典型的人工智能分析其环境，并采取行动，最大限度地提高其成功的机会。

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}}

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:

人工智能经常围绕着算法的使用。算法是机械计算机可以执行的一组明确的指令。复杂的算法通常是建立在其他更简单的算法之上的。一个算法的简单例子是下面的井字游戏配方(对于第一个玩家来说是最佳的) :

# If someone has a "threat" (that is, two in a row), take the remaining square. Otherwise,

If someone has a "threat" (that is, two in a row), take the remaining square. Otherwise,

如果某人有一个“威胁”(也就是说，连续两个) ，取剩下的方块。否则,

# if a move "forks" to create two threats at once, play that move. Otherwise,

if a move "forks" to create two threats at once, play that move. Otherwise,

如果一招“叉子”能同时制造两种威胁，就用那招。否则,

# take the center square if it is free. Otherwise,

take the center square if it is free. Otherwise,

如果有空的话，就走中间的广场。否则,

# if your opponent has played in a corner, take the opposite corner. Otherwise,

if your opponent has played in a corner, take the opposite corner. Otherwise,

如果你的对手在一个角落里打球，就走另一个角落。否则,

# take an empty corner if one exists. Otherwise,

take an empty corner if one exists. Otherwise,

找个空角落，如果有的话。否则,

# take any empty square.

take any empty square.

随便找个空格子。

Many AI algorithms are capable of learning from data; they can enhance themselves by learning new [[heuristic (computer science)|heuristics]] (strategies, or "rules of thumb", that have worked well in the past), or can themselves write other algorithms. Some of the "learners" 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 "[[combinatorial explosion]]", 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.<ref name="Intractability"/>{{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.<ref>{{cite journal

Many AI algorithms are capable of learning from data; they can enhance themselves by learning new heuristics (strategies, or "rules of thumb", that have worked well in the past), or can themselves write other algorithms. Some of the "learners" 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 "combinatorial explosion", 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.<ref>{{cite journal

许多人工智能算法能够从数据中学习; 它们可以通过学习新的启发式算法(策略或“经验法则” ，在过去运行良好)来提高自己，或者自己编写其他算法。下面描述的一些“学习者” ，包括贝叶斯网络、决策树和最近邻，在理论上，(给定的无限数据、时间和记忆)可以学习近似任何函数，包括哪些数学函数的组合可以最好地描述世界。因此，这些学习者可以通过考虑每一个可能的假设，并将它们与数据进行匹配，来获得所有可能的知识。在实践中，几乎从来不可能考虑到每一种可能性，因为“组合爆炸”现象，解决一个问题所需的时间呈指数增长。许多人工智能研究涉及到如何识别和避免考虑范围广泛的可能性，这些可能性不太可能是有益的。例如，当你查看地图并寻找从丹佛到东部纽约的最短的行车路线时，你可以在大多数情况下跳过旧金山或其他遥远的西部地区的任何路径; 因此，一个人工智能机器人可以使用像 a * 这样的寻路算法来避开组合爆炸，如果每一条可能的路径都必须被仔细考虑的话。文献{ cite journal

| first = P. E.

| first = P. E.

第一次体育。

| last = Hart

| last = Hart

| last Hart

|author2= Nilsson, N. J.|author3= Raphael, B.

|author2= Nilsson, N. J.|author3= Raphael, B.

作者: 尼尔森 | 作者: 拉斐尔。

| title = Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths"

| title = Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths"

修正“启发式确定最小费用路径的形式基础”

| journal = SIGART Newsletter

| journal = SIGART Newsletter

期刊 SIGART 时事通讯

| issue = 37

| issue = 37

第37期

| pages = 28–29

| pages = 28–29

第28-29页

| year = 1972

| year = 1972

1972年

| doi=10.1145/1056777.1056779

| doi=10.1145/1056777.1056779

10.1145 / 1056777.1056779

}}</ref>

}}</ref>

{} / ref

The earliest (and easiest to understand) approach to AI was symbolism (such as formal logic): "If an otherwise healthy adult has a fever, then they may have [[influenza]]". A second, more general, approach is [[Bayesian inference]]: "If the current patient has a fever, adjust the probability they have influenza in such-and-such way". 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]]: "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". 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 "[[neurons]]" that can learn by comparing itself to the desired output and altering the strengths of the connections between its internal neurons to "reinforce" 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}}<ref>{{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}}</ref>

The earliest (and easiest to understand) approach to AI was symbolism (such as formal logic): "If an otherwise healthy adult has a fever, then they may have influenza". A second, more general, approach is Bayesian inference: "If the current patient has a fever, adjust the probability they have influenza in such-and-such way". The third major approach, extremely popular in routine business AI applications, are analogizers such as SVM and nearest-neighbor: "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". 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 "neurons" that can learn by comparing itself to the desired output and altering the strengths of the connections between its internal neurons to "reinforce" 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.

人工智能最早(也是最容易理解的)的研究方法是象征主义(比如形式逻辑) : “如果一个原本健康的成年人发烧了，那么他们可能患上了流感。”。第二种更普遍的方法是贝叶斯推断: “如果当前患者发烧，调整他们感染某种流感的可能性”。第三个主要的方法，在日常商业人工智能应用中非常流行，是类比方法，例如支持向量机和最近的邻居: “在检查了已知过去的病人的记录，这些病人的体温、症状、年龄和其他因素主要匹配现在的病人，x% 的病人被证明患有流感”。第四种方法更难以直观理解，但它受到大脑机制工作方式的启发: 人工神经网络方法使用人工“神经元” ，这种神经元可以通过将自身与期望的输出进行比较，并改变内部神经元之间的连接强度，以“强化”似乎有用的连接，从而进行学习。这四种主要方法可以相互重叠，也可以与进化系统重叠; 例如，神经网络可以学习做出推论、概括和进行类比。一些系统隐式或显式地使用多种这些方法，以及许多其他人工智能和非人工智能算法; 最佳方法往往根据问题的不同而不同。 ! -- 流感的例子是从多明戈斯第六章扩展而来的; 如果你有更好的例子，请随意举一个

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 "since the sun rose every morning for the last 10,000 days, it will probably rise tomorrow morning as well". They can be nuanced, such as "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". Learners also work on the basis of "[[Occam's razor#Probability theory and statistics|Occam's razor]]": 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.

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 "since the sun rose every morning for the last 10,000 days, it will probably rise tomorrow morning as well". They can be nuanced, such as "X% of families have geographically separate species with color variants, so there is a Y% chance that undiscovered black swans exist". Learners also work on the basis of "Occam's razor": 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.

学习算法的工作基础是策略、算法和推论，这些在过去运行良好，在未来可能继续运行良好。这些推论可以是显而易见的，例如“在过去的10000天里，太阳每天早上都升起，明天早上也可能升起”。他们可能会有细微差别，比如“ x% 的科在地理上分属不同的物种，有颜色变异，所以有 y% 的可能性存在未被发现的黑天鹅”。学习者也在“ Occam 剃刀”的基础上学习: 解释数据最简单的理论是最有可能的。因此，根据 Occam 的剃刀原则，一个学习者必须被设计成更喜欢简单的理论而不是复杂的理论，除非复杂的理论被证明实质上更好。

[[File:Overfitted Data.png|thumb|The blue line could be an example of [[overfitting]] a linear function due to random noise.]]

The blue line could be an example of [[overfitting a linear function due to random noise.]]

蓝线可能是[[由于随机噪声过拟合线性函数]的一个例子。]

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 "learning the wrong lesson". 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 "adversarial" 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.}}<ref>{{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}}</ref><ref>{{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}}</ref><ref>{{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}}</ref>

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 "learning the wrong lesson". 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 "adversarial" image that the system misclassifies.

对一个错误的、过于复杂的理论做出错误的选择，以适应过去所有的训练数据，这被称为过度拟合。许多系统试图减少过度拟合的奖励一个理论如何适合数据，但惩罚理论如何复杂的理论是一致的。除了经典的过分修饰，学习者也会因为“学错了课程”而失望。一个玩具例子是，一个图像分类器训练只对图片的棕色马和黑猫可能得出结论，所有的棕色斑块可能是马。一个现实世界的例子是，与人类不同，当前的图像分类器并不确定图像组件之间的空间关系; 相反，它们学习人类遗忘的像素抽象模式，但与某些类型的真实物体的图像线性相关。将这种模式隐约地叠加在合法的图像上，会导致系统错误分类的“敌对”图像。

[[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.<ref>{{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}}</ref><ref>{{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}}</ref>]]

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.

自动驾驶汽车系统可以使用神经网络来确定图像的哪些部分与先前训练的行人图像匹配，然后将这些区域建模为移动缓慢但有点不可预测的矩形棱镜，这是必须避免的。

Compared with humans, existing AI lacks several features of human "[[commonsense reasoning]]"; most notably, humans have powerful mechanisms for reasoning about "[[naïve physics]]" such as space, time, and physical interactions. This enables even young children to easily make inferences like "If I roll this pen off a table, it will fall on the floor". Humans also have a powerful mechanism of "[[folk psychology]]" that helps them to interpret natural-language sentences such as "The city councilmen refused the demonstrators a permit because they advocated violence". (A generic AI has difficulty discerning whether the ones alleged to be advocating violence are the councilmen or the demonstrators.)<ref>{{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}}</ref><ref>{{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/}}</ref><ref>{{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}}</ref> This lack of "common knowledge" 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.<ref>{{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}}</ref><ref>{{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}}</ref><ref>{{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}}</ref>

Compared with humans, existing AI lacks several features of human "commonsense reasoning"; most notably, humans have powerful mechanisms for reasoning about "naïve physics" such as space, time, and physical interactions. This enables even young children to easily make inferences like "If I roll this pen off a table, it will fall on the floor". Humans also have a powerful mechanism of "folk psychology" that helps them to interpret natural-language sentences such as "The city councilmen refused the demonstrators a permit because they advocated violence". (A generic AI has difficulty discerning whether the ones alleged to be advocating violence are the councilmen or the demonstrators.) This lack of "common knowledge" 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.

与人类相比，现有的人工智能缺少人类“常识推理”的几个特征; 最值得注意的是，人类拥有强大的推理“天真的物理学”的机制，如空间、时间和物理互动。这使得即使是小孩子也能够轻易地做出推论，比如“如果我把这支笔从桌子上滚下来，它就会掉到地板上”。人类还有一种强大的“民间心理”机制，帮助他们解释自然语言的句子，如“市议员因为示威者鼓吹暴力而拒绝给予许可”。(一般的大赦国际难以辨别被指控鼓吹暴力的人是议员还是示威者。)这种“常识”的缺乏意味着人工智能经常会犯一些与人类不同的错误，这些错误看起来是难以理解的。例如，现有的自动驾驶汽车不能像人类那样精确推理位置和行人的意图，而必须使用非人类的推理模式来避免事故。

== Challenges ==

== Challenges ==

挑战





! ——这跟文章的导言和“人工智能研究”部分有关——

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.<ref>{{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}}</ref>

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.

当前架构的认知能力非常有限，只使用了智能真正能够做到的简化版本。例如，人类的大脑已经想出了各种方法来推理超出测量和逻辑解释不同的事件在生活中。原本直截了当的问题，与使用人类思维相比，一个同等困难的问题，在计算上可能是具有挑战性的。这就产生了两类模型: 结构主义和功能主义。结构模型旨在松散地模拟大脑的基本智力操作，如推理和逻辑。函数模型是指与其计算的对应数据相关联的数据。

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.<ref name="Problems of AI" />

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.

人工智能的总体研究目标是创造能够使计算机和机器以智能方式运行的技术。模拟(或创造)智能的一般问题已分解为子问题。这些特征或能力是研究人员期望智能系统显示出来的。下面描述的特征受到了最多的关注。

=== Reasoning, problem solving ===

=== Reasoning, problem solving ===

推理，解决问题





! ——这在介绍中有关——解决问题——

Early researchers developed algorithms that imitated step-by-step reasoning that humans use when they solve puzzles or make logical deductions.<ref name="Reasoning"/> 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]].<ref name="Uncertain reasoning"/>

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.

早期的研究人员开发了一种算法，这种算法模仿了人类在解决谜题或进行逻辑推理时所使用的循序渐进的推理。到20世纪80年代末和90年代，人工智能研究已经开发出处理不确定或不完全信息的方法，使用概率和经济学的概念。

These algorithms proved to be insufficient for solving large reasoning problems because they experienced a "combinatorial explosion": they became exponentially slower as the problems grew larger.<ref name="Intractability"/> 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.<ref name="Psychological evidence of sub-symbolic reasoning"/>

These algorithms proved to be insufficient for solving large reasoning problems because they experienced a "combinatorial explosion": 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.

这些算法被证明不足以解决大型推理问题，因为它们经历了一个“组合爆炸” : 随着问题变得越来越大，它们变得越来越慢。事实上，即使是人类也很少使用早期人工智能研究能够建模的逐步推理。他们通过快速、直觉的判断来解决大多数问题。

=== Knowledge representation ===

=== Knowledge representation ===

知识表示





! ——这个链接在介绍中——

[[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.]]

An ontology represents knowledge as a set of concepts within a domain and the relationships between those concepts.

本体将知识表示为领域中的一组概念以及这些概念之间的关系。

{{Main|Knowledge representation|Commonsense knowledge}}

[[Knowledge representation]]<ref name="Knowledge representation"/> and [[knowledge engineering]]<ref name="Knowledge engineering"/> are central to classical AI research. Some "expert systems" attempt to gather together explicit knowledge possessed by experts in some narrow domain. In addition, some projects attempt to gather the "commonsense knowledge" 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;<ref name="Representing categories and relations"/> situations, events, states and time;<ref name="Representing time"/> causes and effects;<ref name="Representing causation"/> knowledge about knowledge (what we know about what other people know);<ref name="Representing knowledge about knowledge"/> and many other, less well researched domains. A representation of "what exists" 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]].<ref>{{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 }}</ref> The most general ontologies are called [[upper ontology|upper ontologies]], which attempt to provide a foundation for all other knowledge<ref name="Ontology"/> 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,<ref>{{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}}</ref> scene interpretation,<ref>{{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}}</ref> clinical decision support,<ref>{{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}}</ref> knowledge discovery (mining "interesting" and actionable inferences from large databases),<ref>{{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}}</ref> and other areas.<ref>{{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}}</ref>

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 "interesting" and actionable inferences from large databases), and other areas.

知识表示最一般的本体称为上本体，它试图为所有其他知识场景解释、临床决策支持、知识发现(从大型数据库中挖掘“有趣的”和可操作的推论)等领域提供基础。

Among the most difficult problems in knowledge representation are:

Among the most difficult problems in knowledge representation are:

知识表示中最困难的问题是:

;[[Default reasoning]] and the [[qualification problem]]: Many of the things people know take the form of "working assumptions". 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<ref name="Qualification problem"/> 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.<ref name="Default reasoning and non-monotonic logic"/>

Default reasoning and the qualification problem: Many of the things people know take the form of "working assumptions". 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.

缺省推理和限定性问题: 人们所知道的许多事情都采取“工作假设”的形式。例如，如果一只鸟出现在谈话中，人们通常会想象一只拳头大小、会唱歌、会飞的动物。这些关于所有鸟类的事情都不是真的。约翰 · 麦卡锡在1969年将这个问题定义为资格问题: 对于人工智能研究人员所关心的任何常识性规则来说，往往存在大量的例外。在抽象逻辑所要求的方式中，几乎没有什么是简单的真或假。人工智能研究已经探索了许多解决这个问题的方法。

;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.<ref name="Breadth of commonsense knowledge"/>

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.

常识知识的广度: 一般人知道的原子事实的数量是非常大的。试图建立一个完整的常识知识知识库的研究项目(例如 Cyc)需要大量艰苦的本体工程学ーー它们必须一次手工构建一个复杂的概念。

;Subsymbolic form of some commonsense knowledge: Much of what people know is not represented as "facts" or "statements" that they could express verbally. For example, a chess master will avoid a particular chess position because it "feels too exposed"{{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.<ref name="Intuition"/> 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.<ref name="Intuition"/>

Subsymbolic form of some commonsense knowledge: Much of what people know is not represented as "facts" or "statements" that they could express verbally. For example, a chess master will avoid a particular chess position because it "feels too exposed" 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.

某些常识知识的次象征形式: 人们所知道的许多东西并没有表现为他们可以口头表达的“事实”或“陈述”。例如，一个国际象棋大师会避免一个特定的象棋位置，因为它“感觉太暴露” ，或者一个艺术评论家可以看一眼雕像，意识到它是一个假的。这些是人类大脑中无意识和次象征性的直觉或倾向。像这样的知识为象征性的、有意识的知识提供信息、支持和提供背景。与子符号推理的相关问题一样，我们希望情境中的人工智能、计算智能或统计人工智能能够提供表示这类知识的方法。

=== Planning ===

=== Planning ===

规划





! ——这个链接在介绍中——

[[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.]]

A [[hierarchical control system is a form of control system in which a set of devices and governing software is arranged in a hierarchy.]]

分层控制系统是控制系统的一种形式，在这种控制系统中，一组设备和管理软件被安排在一个层次结构中

{{Main|Automated planning and scheduling}}

Intelligent agents must be able to set goals and achieve them.<ref name="Planning"/> 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 "value") of available choices.<ref name="Information value theory"/>

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 "value") of available choices.

智能代理必须能够设定目标并实现它们。他们需要一种可视化未来的方式——一种对世界状况的表述，并能够预测他们的行动将如何改变世界——以及能够做出选择，使可用选择的效用(或“价值”)最大化。

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.<ref name="Classical planning"/> 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.<ref name="Non-deterministic planning"/>

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.

在经典的规划问题中，主体可以假设它是世界上唯一的系统，允许主体确定其行为的后果。然而，如果代理人不是唯一的参与者，那么它要求代理人能够在不确定的情况下推理。这需要一个代理人，不仅能够评估其环境和作出预测，而且还评估其预测和适应基于其评估。

[[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]].<ref name="Multi-agent planning"/>

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.

多智能体规划是利用多个智能体之间的协作和竞争来实现给定的目标。类似这样的突发行为被进化算法和群体智能应用。

=== Learning ===

=== Learning ===

学习





! ——这个链接在介绍中——

{{Main|Machine learning}}

Machine learning (ML), a fundamental concept of AI research since the field's inception,<ref>[[Alan Turing]] discussed the centrality of learning as early as 1950, in his classic paper "[[Computing Machinery and Intelligence]]".{{Harv|Turing|1950}} In 1956, at the original Dartmouth AI summer conference, [[Ray Solomonoff]] wrote a report on unsupervised probabilistic machine learning: "An Inductive Inference Machine".{{Harv|Solomonoff|1956}}</ref> is the study of computer algorithms that improve automatically through experience.<ref>This is a form of [[Tom M. Mitchell|Tom Mitchell]]'s widely quoted definition of machine learning: "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''."</ref><ref name="Machine learning"/>

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.

机器学习(ML)是人工智能研究的一个基本概念，它是通过经验自动改进计算机算法的研究。

[[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.<ref name="Machine learning"/> Both classifiers and regression learners can be viewed as "function approximators" 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, "spam" or "not spam". [[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]].<ref>{{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}}</ref> In [[reinforcement learning]]<ref name="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.

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.

非监督式学习是在输入流中发现模式的能力，而不需要人类首先标记输入。监督式学习包括分类和数值回归，这需要人类首先标记输入数据。分类用于确定某物属于哪个类别，并且在程序看到来自几个类别的事物的大量例子后发生。回归是试图产生一个函数来描述输入和输出之间的关系，并预测输出应该如何随着输入的变化而变化。在强化学习，代理人会因为好的回应而受到奖励，因为坏的回应而受到惩罚。代理使用这一系列的奖励和惩罚来形成一个在其问题空间中操作的策略。

=== Natural language processing ===

=== Natural language processing ===

自然语言处理





! ——这个链接在介绍中——

[[File:ParseTree.svg|thumb| A [[parse tree]] represents the [[syntax|syntactic]] structure of a sentence according to some [[formal grammar]].]]

A [[parse tree represents the syntactic structure of a sentence according to some formal grammar.]]

一个[[根据某种形式语法，解析树表示一个句子的句法结构]

{{Main|Natural language processing}}

[[Natural language processing]]<ref name="Natural language processing"/> (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]]<ref>[https://www.academia.edu/2475776/Versatile_question_answering_systems_seeing_in_synthesis "Versatile question answering systems: seeing in synthesis"] {{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

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 natural language processing include information retrieval, text mining, question answering<ref>[https://www.academia.edu/2475776/Versatile_question_answering_systems_seeing_in_synthesis "Versatile question answering systems: seeing in synthesis"] , Mittal et al., IJIIDS, 5(2), 119–142, 2011

自然语言处理(NLP)赋予机器阅读和理解人类语言的能力。一个足够强大的自然语言处理系统将使自然语言用户界面成为可能，并能够直接从人类书面来源(如新闻通讯社文本)获取知识。一些自然语言处理的直接应用包括信息检索，文本挖掘，问题回答参考[ https://www.academia.edu/2475776/versatile_question_answering_systems_seeing_in_synthesis : 通用的问题回答系统: 在综合中看到] ，Mittal et al. ，IJIIDS，5(2) ，119-142,2011

</ref> and [[machine translation]].<ref name="Applications of natural language processing"/> Many current approaches use word co-occurrence frequencies to construct syntactic representations of text. "Keyword spotting" strategies for search are popular and scalable but dumb; a search query for "dog" might only match documents with the literal word "dog" and miss a document with the word "poodle". "Lexical affinity" strategies use the occurrence of words such as "accident" 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 "narrative" NLP is to embody a full understanding of commonsense reasoning.<ref>{{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}}</ref>

</ref> and machine translation.

/ ref 和机器翻译。

=== Perception ===

=== Perception ===

知觉





! ——这个链接在介绍中——

{{Main|Machine perception|Computer vision|Speech recognition}}

[[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.]]

[图片: 边缘检测特征提取]帮助人工智能从原始数据中组成信息丰富的抽象结构

[[Machine perception]]<ref name="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 sensor]]s) to deduce aspects of the world. Applications include [[speech recognition]],<ref name="Speech recognition"/> [[facial recognition system|facial recognition]], and [[object recognition]].<ref name="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 "object model" to assess that fifty-meter pedestrians do not exist.<ref name="Computer vision"/>

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 "object model" to assess that fifty-meter pedestrians do not exist.

机器感知是利用传感器(如相机(可见光或红外线)、麦克风、无线信号、激光雷达、声纳、雷达和触觉传感器)的输入来推断世界的方方面面的能力。应用包括语音识别、面部识别和物体识别。计算机视觉是分析视觉输入的能力。这种输入通常是模棱两可的; 一个巨大的50米高的行人可能会产生与附近正常大小的行人完全相同的像素，这就要求人工智能判断不同解释的相对可能性和合理性，例如使用其”对象模型”来评估50米高的行人不存在。

=== Motion and manipulation ===

=== Motion and manipulation ===

运动和操作





! ——这个链接在介绍中——

{{Main|Robotics}}

AI is heavily used in [[robotics]].<ref name="Robotics"/> 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.<ref name="Configuration space"/> 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 "primitives" 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}}<ref name="Robotic mapping"/><ref>{{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}}</ref> [[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 "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".<ref>{{Cite book| first = Hans | last = Moravec | year = 1988 | title = Mind Children | publisher = Harvard University Press | author-link =Hans Moravec| p=15}}</ref><ref>{{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}}</ref> This is attributed to the fact that, unlike checkers, physical dexterity has been a direct target of [[natural selection]] for millions of years.<ref name="The Economist">{{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}}</ref>

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 "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". This is attributed to the fact that, unlike checkers, physical dexterity has been a direct target of natural selection for millions of years.

人工智能在机器人技术中应用广泛。莫拉维克的悖论概括了人类认为理所当然的低层次的感知运动技能很难在机器人中编程的事实，这个悖论是以汉斯 · 莫拉维克的名字命名的，他在1988年表示: “让计算机在智力测试或下跳棋中展现出成人水平的表现相对容易，但要让计算机拥有一岁小孩的感知和移动能力却很难，甚至不可能。”。这是因为，与跳棋不同，身体灵巧性一直是自然选择数百万年的直接目标。

=== Social intelligence ===

=== Social intelligence ===

社会智力





! ——这个链接在介绍中——

{{Main|Affective computing}}

[[File:Kismet robot at MIT Museum.jpg|thumb|[[Kismet (robot)|Kismet]], a robot with rudimentary social skills{{sfn|''Kismet''}}]]

Kismet, a robot with rudimentary social skills]]

Kismet，一个具有基本社交技能的机器人]]

Moravec's paradox can be extended to many forms of social intelligence.<ref>{{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}}</ref><ref>{{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}}</ref> Distributed multi-agent coordination of autonomous vehicles remains a difficult problem.<ref>{{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}}</ref> [[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.<ref>{{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}}</ref>

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.

莫拉维克的悖论可以扩展到许多形式的社会智力。自主车辆的分布式多智能体协调一直是一个难题。情感计算是一个跨学科的保护伞，包括系统，识别，解释，处理，或模拟人的影响。与情感计算相关的一些成功包括文本情感分析，以及最近的多模态情感分析(见多模态情感分析) ，其中人工智能通过视频主题将情感分类。

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]].<ref name="Emotion and affective computing"/> 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.<ref>{{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}}</ref>

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.

从长远来看，社交技巧以及对人类情感和博弈论的理解对于社会行为者来说是很有价值的。能够通过理解他人的动机和情绪状态来预测他人的行为，会让代理人做出更好的决策。有些计算机系统模仿人类的情感和表情，以显得对人类互动的情感动力学更敏感，或以其他方式促进人机交互。

=== General intelligence ===

=== General intelligence ===

一般情报





! ——这个链接在介绍中——

{{Main|Artificial general intelligence|AI-complete}}

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 "narrow AI" applications (such as medical diagnosis or automobile navigation).<ref name="contemporary agi">{{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}}</ref> Many researchers predict that such "narrow AI" 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.<ref name="General intelligence"/><ref name="Roberts">{{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}}</ref> Many advances have general, cross-domain significance. One high-profile example is that [[DeepMind]] in the 2010s developed a "generalized artificial intelligence" 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]].<ref>{{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}}</ref><ref>{{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}}</ref><ref>{{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}}</ref> Besides [[transfer learning]],<ref>{{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}}</ref> hypothetical AGI breakthroughs could include the development of reflective architectures that can engage in decision-theoretic metareasoning, and figuring out how to "slurp up" 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, "Master Algorithm" could lead to AGI.{{sfn|Domingos|2015|chapter=9. The Pieces of the Puzzle Fall into Place}} Finally, a few "emergent" 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.<ref name="Brain simulation"/><ref>{{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}}</ref>

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 "narrow AI" applications (such as medical diagnosis or automobile navigation). Many researchers predict that such "narrow AI" 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 "generalized artificial intelligence" 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 "slurp up" a comprehensive knowledge base from the entire unstructured Web. Some argue that some kind of (currently-undiscovered) conceptually straightforward, but mathematically difficult, "Master Algorithm" could lead to AGI. Finally, a few "emergent" 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.

历史上，诸如 Cyc 知识库(1984 -)和大规模的日本第五代计算机系统倡议(1982-1992)等项目试图涵盖人类认知的广度。这些早期的项目未能逃脱非定量符号逻辑模型的限制，回顾过去，大大低估了跨领域人工智能的难度。如今，绝大多数当前的人工智能研究人员致力于易于处理的“狭义人工智能”应用(如医疗诊断或汽车导航)。许多研究人员预测，这种在不同领域的“狭义人工智能”工作最终将被整合到一台具有人工通用智能(AGI)的机器中，结合本文中提到的大多数狭义技能，甚至在某种程度上超过人类在大多数或所有这些领域的能力。许多进展具有普遍的、跨领域的意义。一个引人注目的例子是，DeepMind 在2010年代开发了一种“通用人工智能”(generalized artificial intelligence) ，它可以自己学习许多不同的 Atari 游戏，后来又开发了一种系统的变体，在顺序学习方面取得了成功。除了迁移学习，假想的 AGI 突破可能包括开发能够进行决策理论元推理的反射架构，以及从整个非结构化网络中找出如何“吸取”一个全面的知识库。一些人认为，某种(目前尚未发现的)概念简单，但在数学上困难的“主算法”可以导致 AGI。最后，一些“涌现”的方法着眼于极其密切地模拟人类智能，并相信拟人化的特征，如人工大脑或模拟儿童发展，可能有一天达到一个临界点，一般智能出现。

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 "[[AI-complete]]", because all of these problems need to be solved simultaneously in order to reach human-level machine performance.

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 "AI-complete", because all of these problems need to be solved simultaneously in order to reach human-level machine performance.

如果机器要像人一样解决问题，那么本文中的许多问题也可能需要一般的智能。例如，即使是特定的直接任务，如机器翻译，也要求机器用两种语言进行读写(NLP) ，遵循作者的论点(理由) ，知道谈论的内容(知识) ，并忠实地再现作者的原始意图(社会智能)。像机器翻译这样的问题被认为是“人工智能完全”的，因为所有这些问题都需要同时解决，以达到人类水平的机器性能。

== Approaches ==

== Approaches ==

方法

There is no established unifying theory or [[paradigm]] that guides AI research. Researchers disagree about many issues.<ref>[[Nils Nilsson (researcher)|Nils Nilsson]] writes: "Simply put, there is wide disagreement in the field about what AI is all about" {{Harv|Nilsson|1983|p=10}}.</ref> 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]]?<ref name="Biological intelligence vs. intelligence in general"/>

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?

目前还没有统一的理论或范式来指导人工智能的研究。研究人员在许多问题上存在分歧。一些长期悬而未决的问题是: 人工智能是否应该通过研究心理学或神经生物学来模拟自然智能？或者人类生物学和人工智能研究的关系就像鸟类生物学和航空工程学的关系一样？

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?<ref name="Neats vs. scruffies"/>

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?

智能行为可以用简单、优雅的原则(如逻辑或优化)来描述吗？还是需要解决大量完全不相关的问题？

=== Cybernetics and brain simulation ===

=== Cybernetics and brain simulation ===

控制论与大脑模拟

{{Main|Cybernetics|Computational neuroscience}}

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.<ref name="AI's immediate precursors"/> By 1960, this approach was largely abandoned, although elements of it would be revived in the 1980s.

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.

在20世纪40年代和50年代，许多研究人员探索了神经生物学、信息论和控制论之间的联系。他们中的一些人利用电子网络制造机器来展示基本的智能，比如 w · 格雷 · 沃尔特的乌龟和约翰 · 霍普金斯的野兽。这些研究人员中的许多人聚集在英格兰的普林斯顿大学和比率俱乐部参加目的论学会的会议。到了1960年，这种方法基本上被放弃了，尽管其中的一些元素在1980年代又复活了。

=== Symbolic ===

=== Symbolic ===

象征性的

{{Main|Symbolic AI}}

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 "good old fashioned AI" or "[[GOFAI]]".<ref name="GOFAI"/> During the 1960s, symbolic approaches had achieved great success at simulating high-level "thinking" in small demonstration programs. Approaches based on [[cybernetics]] or [[artificial neural network]]s were abandoned or pushed into the background.<ref>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]].</ref>

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 "good old fashioned AI" or "GOFAI".

20世纪50年代中期，当数字计算机成为可能时，人工智能研究开始探索人类智能可以降低为符号操纵的可能性。这项研究集中在3个机构: 卡内基梅隆大学，斯坦福和麻省理工学院，正如下面所描述的，每个机构都有自己的研究风格。约翰 · 豪格兰德将这些具有象征意义的人工智能方法命名为“好的老式人工智能”或“ GOFAI”。

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.

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.

20世纪60年代和70年代的研究人员相信，象征性的方法最终会成功地创造出一台具有人工通用智能的机器，并认为这是他们研究领域的目标。

==== Cognitive simulation ====

==== Cognitive simulation ====

认知模拟

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.<ref name="AI at CMU in the 60s"/><ref name="Soar"/>

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.

经济学家赫伯特 · 西蒙和艾伦 · 纽厄尔研究了人类解决问题的能力，并试图将其形式化，他们的工作为人工智能、认知科学、运筹学和管理科学奠定了基础。他们的研究团队利用心理学实验的结果来开发程序，模拟人们用来解决问题的技术。这个传统，以卡内基梅隆大学为中心，最终在20世纪80年代中期的 Soar 建筑的发展达到顶峰。

==== Logic-based ====

==== Logic-based ====

基于逻辑的

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.<ref name="Biological intelligence vs. intelligence in general"/> 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]].<ref name="AI at Stanford in the 60s"/> 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]].<ref name="AI at Edinburgh and France in the 60s"/>

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.

与西蒙和纽厄尔不同，约翰 · 麦卡锡认为机器不需要模拟人类的思维，而是应该尝试寻找抽象推理和解决问题的本质，不管人们是否使用相同的算法。他在斯坦福大学的实验室(SAIL)致力于使用形式逻辑来解决各种各样的问题，包括知识表示、规划和学习。逻辑也是爱丁堡大学和欧洲其他地方工作的重点，这导致了编程语言 Prolog 和逻辑编程科学的发展。

==== Anti-logic or scruffy ====

==== Anti-logic or scruffy ====

反逻辑的或邋遢的

Researchers at [[MIT]] (such as [[Marvin Minsky]] and [[Seymour Papert]])<ref name="AI at MIT in the 60s"/> 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 "anti-logic" approaches as "[[Neats vs. scruffies|scruffy]]" (as opposed to the "[[neats vs. scruffies|neat]]" paradigms at [[Carnegie Mellon University|CMU]] and Stanford).<ref name="Neats vs. scruffies"/> [[Commonsense knowledge bases]] (such as [[Doug Lenat]]'s [[Cyc]]) are an example of "scruffy" AI, since they must be built by hand, one complicated concept at a time.<ref name="Cyc"/>

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 "anti-logic" approaches as "scruffy" (as opposed to the "neat" paradigms at CMU and Stanford). Commonsense knowledge bases (such as Doug Lenat's Cyc) are an example of "scruffy" AI, since they must be built by hand, one complicated concept at a time.

麻省理工学院(MIT)的研究人员(如马文•明斯基(Marvin Minsky)和西摩•派珀特(Seymour Papert))发现，解决视觉和自然语言处理中的难题需要特定的解决方案——他们认为，没有简单而普遍的原则(如逻辑)可以涵盖智能行为的。罗杰•尚克(Roger Schank)将他们的“反逻辑”方法形容为“邋遢”(相对于卡内基梅隆大学(CMU)和斯坦福大学(Stanford)的“整洁”范式)。常识性知识库(如 Doug Lenat 的 Cyc)是“邋遢”人工智能的一个例子，因为它们必须手工构建，一次构建一个复杂的概念。

====Knowledge-based====

====Knowledge-based====

以知识为本

When computers with large memories became available around 1970, researchers from all three traditions began to build [[knowledge representation|knowledge]] into AI applications.<ref name="Knowledge revolution"/> This "knowledge revolution" led to the development and deployment of [[expert system]]s (introduced by [[Edward Feigenbaum]]), the first truly successful form of AI software.<ref name="Expert systems"/> A key component of the system architecture for all expert systems is the knowledge base, which stores facts and rules that illustrate AI.<ref>{{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}}</ref> The knowledge revolution was also driven by the realization that enormous amounts of knowledge would be required by many simple AI applications.

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.

1970年左右，当拥有大容量存储器的计算机出现时，来自这三个传统的研究人员开始将知识应用于人工智能领域。推动知识革命的另一个原因是人们认识到，许多简单的人工智能应用程序需要大量的知识。

=== Sub-symbolic ===

=== Sub-symbolic ===

子符号

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 "sub-symbolic" approaches to specific AI problems.<ref name="Symbolic vs. sub-symbolic"/> Sub-symbolic methods manage to approach intelligence without specific representations of knowledge.

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 "sub-symbolic" approaches to specific AI problems. Sub-symbolic methods manage to approach intelligence without specific representations of knowledge.

到了20世纪80年代，符号人工智能的进步似乎停滞不前，许多人认为符号系统永远无法模仿人类认知的所有过程，尤其是感知、机器人、学习和模式识别。许多研究人员开始研究针对特定人工智能问题的“次象征性”方法。子符号方法在没有特定知识表示的情况下，设法接近智能。

==== Embodied intelligence ====

==== Embodied intelligence ====

具身智慧

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.<ref name="Embodied AI"/> 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.

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.

这包括具体化的、情境化的、基于行为的和 nouvelle AI。来自机器人相关领域的研究人员，如罗德尼 · 布鲁克斯，拒绝接受符号化人工智能，而专注于使机器人能够移动和生存的基本工程问题。他们的工作复活了20世纪50年代早期控制论研究者的非符号观点，并重新引入了控制理论在人工智能中的应用。这与认知科学相关领域的具身心理论的发展相吻合: 认为身体的各个方面(如运动、感知和可视化)是高智力所必需的。

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}}

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.).

在发展型机器人中，发展型学习方法被详细阐述，通过自主的自我探索、与人类教师的社会互动，以及使用指导机制(主动学习、成熟、协同运动等) ，使机器人积累新技能的能力。).

====Computational intelligence and soft computing====

====Computational intelligence and soft computing====

计算智能与软计算

Interest in [[Artificial neural network|neural networks]] and "[[connectionism]]" was revived by [[David Rumelhart]] and others in the middle of the 1980s.<ref name="Revival of connectionism"/> [[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]].<ref name="Computational intelligence"/>

Interest in neural networks and "connectionism" 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.

上世纪80年代中期，大卫•鲁梅尔哈特(David Rumelhart)等人重新激发了人们对神经网络和“连接主义”的兴趣。人工神经网络是软计算的一个例子ーー它们是不能完全用逻辑确定性解决的问题的解决方案，而且近似解常常是充分的。人工智能的其他软计算方法包括模糊系统、灰色系统理论、进化计算和许多统计工具。软计算在人工智能中的应用是计算智能这一新兴学科的集体研究领域。

=== Statistical learning ===

=== Statistical learning ===

统计学习

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 "victory of the neats" 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 "statistical learning" 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.<ref name="Formal methods in AI"/><ref>{{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}}</ref> 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}}

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 "statistical learning" 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.

许多传统的 GOFAI 陷入了特别补丁的符号计算，工作在自己的玩具模型，但未能推广到现实世界的结果。然而，在20世纪90年代前后，人工智能研究人员采用了复杂的数学工具，如隐马尔可夫模型(HMM)、信息理论和规范贝叶斯决策理论来比较或统一竞争架构。共享的数学语言允许与更成熟的领域(如数学、经济学或运筹学)进行高层次的合作。与 GOFAI 相比，隐马尔可夫模型(HMM)和神经网络(neural networks)等新的“统计学习”技术在数据挖掘等许多实际领域中获得了更高的精度，而不必获得对数据集的语义理解。随着现实世界数据的日益成功，人们越来越重视将不同的方法与共享的测试数据进行比较，以查明哪种方法在更广泛的背景下比特殊玩具模型提供的方法表现得更好; 人工智能研究正变得更加科。如今，实验结果经常是严格可测的，有时(很难)重现。不同的统计学习技术有不同的局限性，例如，基本的 HMM 不能为自然语言的无限可能组合建模。批评家们指出，从 GOFAI 到统计学习的转变也经常是从可解释的人工智能的转变。在 AGI 的研究中，一些学者警告不要过度依赖统计学习，并认为继续研究 GOFAI 仍然是获得一般智力的必要条件。

=== Integrating the approaches ===

=== Integrating the approaches ===

整合各种方法

;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 "goal function". 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.<ref name="Intelligent agents"/>

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 "goal function". 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.

智能代理范式: 智能代理是一个系统，感知其环境，并采取行动，最大限度地提高其成功的机会。最简单的智能代理是解决特定问题的程序。更复杂的行为者包括人类和人类组织(如公司)。这种范式允许研究人员直接比较甚至结合不同的方法来解决孤立的问题，通过询问哪一个主体最适合最大化给定的“目标函数”。解决特定问题的代理可以使用任何有效的方法ーー有些代理是符号化和逻辑化的，有些是次符号化的人工神经网络，还有一些可能使用新的方法。这种范式还为研究人员提供了一种与其他领域(如决策理论和经济学)进行交流的共同语言，这些领域也使用了抽象代理的概念。建立一个完整的主体需要研究人员解决现实的集成问题; 例如，由于感官系统提供关于环境的不确定信息，计划系统必须能够在不确定性的存在下运作。智能主体范式在20世纪90年代被广泛接受。

;[[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]].<ref name="Agent architectures"/> 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.<ref name="Hierarchical control system"/> 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.<ref>{{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}}</ref><ref>{{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}}</ref><ref>{{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}}</ref>

Agent architectures and cognitive architectures:Researchers have designed systems to build intelligent systems out of interacting intelligent agents in a multi-agent system.

代理体系结构和认知体系结构: 研究人员已经设计了一些系统，以便在多智能体系统中利用相互作用的智能代理构建智能系统。

== Tools ==

== Tools ==

工具

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.

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.

人工智能已经开发出许多工具来解决计算机科学中最困难的问题。下面将讨论其中一些最常用的方法。

=== Search and optimization ===

=== Search and optimization ===

搜索和优化

{{Main|Search algorithm|Mathematical optimization|Evolutionary computation}}

Many problems in AI can be solved in theory by intelligently searching through many possible solutions:<ref name="Search"/> [[#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]].<ref name="Logic as search"/> [[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]].<ref name="Planning as search"/> [[Robotics]] algorithms for moving limbs and grasping objects use [[local search (optimization)|local searches]] in [[Configuration space (physics)|configuration space]].<ref name="Configuration space"/> Many [[machine learning|learning]] algorithms use search algorithms based on [[optimization (mathematics)|optimization]].

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.

人工智能中的许多问题可以通过智能地搜索许多可能的解决方案而在理论上得到解决: 推理可以简化为执行一次搜索。例如，逻辑证明可以看作是寻找从前提到结论的路径，其中每一步都是推理规则的应用。规划算法通过目标和子目标的树搜索，试图找到一条通往目标的路径，这个过程称为目的手段分析。机器人学中的移动肢体和抓取物体的算法使用的是位形空间的局部搜索。许多学习算法使用基于优化的搜索算法。

Simple exhaustive searches<ref name="Uninformed search"/> 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 "[[heuristics]]" or "rules of thumb" 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 "[[pruning (algorithm)|pruning]] the [[search tree]]"). [[Heuristics]] supply the program with a "best guess" for the path on which the solution lies.<ref name="Informed search"/> Heuristics limit the search for solutions into a smaller sample size.{{sfn|Tecuci|2012}}

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 "heuristics" or "rules of thumb" 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 "pruning the search tree"). Heuristics supply the program with a "best guess" for the path on which the solution lies. Heuristics limit the search for solutions into a smaller sample size.

对于大多数真实世界的问题，简单的穷举搜索很难满足要求: 搜索空间(要搜索的位置数)很快就会增加到天文数字。结果就是搜索速度太慢或者永远不能完成。对于许多问题，解决方法是使用“启发式”或“经验法则” ，优先考虑那些更有可能达到目标的选择，并且在较短的步骤内完成。在一些搜索方法中，启发式方法还可以完全消除一些不可能导致目标的选择(称为“剪枝搜索树”)。启发式为程序提供了解决方案所在路径的“最佳猜测”。启发式限制解的搜索到一个更小的样本大小。

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]].<ref name="Optimization search"/>

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.

在20世纪90年代，一种基于数学最优化理论的非常不同的搜索引起了人们的注意。对于许多问题，可以从某种形式的猜测开始搜索，然后逐步完善猜测，直到无法进行更多的细化。这些算法可以被视为盲目的爬山: 我们从地形上的一个随机点开始搜索，然后，通过跳跃或步骤，我们继续向山上移动我们的猜测，直到我们到达山顶。其他的优化算法有模拟退火搜索、波束搜索和随机优化。

[[File:ParticleSwarmArrowsAnimation.gif|thumb|A [[particle swarm optimization|particle swarm]] seeking the [[global minimum]]]]

particle swarm seeking the global minimum]]

[粒子群搜索全局最小]

[[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]].<ref name="Genetic programming"/> 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).<ref name="Society based learning"/><ref>{{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 & Business Media|isbn=978-1-4614-6940-7|language=en|chapter=Swarm Intelligence}}</ref>

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.

进化计算使用了一种优化搜索的形式。例如，他们可能从一群有机体(猜测)开始，然后允许它们变异和重组，选择适者生存每一代(改进猜测)。经典的进化算法包括遗传算法、基因表达式编程和遗传编程。

=== Logic ===

=== Logic ===

逻辑

{{Main|Logic programming|Automated reasoning}}

[[Logic]]<ref name="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 [[automated planning and scheduling|planning]]<ref name="Satplan"/> and [[inductive logic programming]] is a method for [[machine learning|learning]].<ref name="Symbolic learning techniques"/>

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.

逻辑用于知识表示和问题解决，但它也可以应用于其他问题。例如，satplan 算法使用逻辑进行规划，归纳逻辑规划是一种学习方法。

Several different forms of logic are used in AI research. [[Propositional logic]]<ref name="Propositional logic"/> involves [[truth function]]s such as "or" and "not". [[First-order logic]]<ref name="First-order logic"/> 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 "degree of truth" (between 0 and 1) to vague statements such as "Alice is old" (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 "if you are close to the destination station and moving fast, increase the train's brake pressure"; 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|"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."<ref>{{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}}</ref>}}<ref name="Fuzzy logic"/><ref>{{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}}</ref>

Several different forms of logic are used in AI research. Propositional logic}}

人工智能研究中使用了几种不同形式的逻辑。命题逻辑

[[Default logic]]s, [[non-monotonic logic]]s and [[circumscription (logic)|circumscription]]<ref name="Default reasoning and non-monotonic logic"/> 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;<ref name="Representing categories and relations"/> [[situation calculus]], [[event calculus]] and [[fluent calculus]] (for representing events and time);<ref name="Representing time"/> [[Causality#Causal calculus|causal calculus]];<ref name="Representing causation"/> [[Belief revision|belief calculus (belief revision)]];<ref>"The Belief Calculus and Uncertain Reasoning", Yen-Teh Hsia</ref> and [[modal logic]]s.<ref name="Representing knowledge about knowledge"/> Logics to model contradictory or inconsistent statements arising in multi-agent systems have also been designed, such as [[paraconsistent logic]]s.

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.

默认逻辑、非单调逻辑、限制逻辑和模态逻辑。对多智能体系统中出现的矛盾或不一致的陈述进行建模的逻辑也已经被设计出来，例如次协调逻辑。

=== Probabilistic methods for uncertain reasoning ===

=== Probabilistic methods for uncertain reasoning ===

不确定推理的概率方法

{{Main|Bayesian network|Hidden Markov model|Kalman filter|Particle filter|Decision theory|Utility theory}}

[[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.]]

[[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.]]

[[期望-最大化老忠实喷发数据的聚类从一个随机的猜测开始，然后成功地收敛到两个物理上截然不同的喷发模式的精确聚类]]

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.<ref name="Stochastic methods for uncertain reasoning"/>

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.

人工智能中的许多问题(在推理、规划、学习、感知和机器人技术方面)要求智能体在信息不完整或不确定的情况下进行操作。人工智能研究人员从概率论和经济学的角度设计了许多强大的工具来解决这些问题。

[[Bayesian network]]s<ref name="Bayesian networks"/> are a very general tool that can be used for various problems: reasoning (using the [[Bayesian inference]] algorithm),<ref name="Bayesian inference"/> [[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}}}}<ref name="Bayesian learning"/> [[Automated planning and scheduling|planning]] (using [[decision network]]s)<ref name="Bayesian decision networks"/> and [[machine perception|perception]] (using [[dynamic Bayesian network]]s).<ref name="Stochastic temporal models"/> 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).<ref name="Stochastic temporal models"/> 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 "loops" (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 "evidence" 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}}

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 "loops" (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 "evidence" of how good a player is. AdSense uses a Bayesian network with over 300 million edges to learn which ads to serve.

贝叶斯网络是一个非常通用的工具，可用于各种问题: 推理(使用贝叶斯推断算法) ，学习(使用期望最大化算法) ，}规划(使用决策网络)和知觉(使用动态贝叶斯网络)。概率算法也可以用于滤波、预测、平滑和为数据流寻找解释，帮助感知系统分析随时间发生的过程(例如，隐马尔可夫模型或卡尔曼滤波器)。与符号逻辑相比，正式的贝叶斯推断逻辑运算量很大。为了使推论易于处理，大多数观察值必须彼此有条件地独立。带有方块或其他“循环”(无向循环)的复杂图形可能需要一种复杂的方法，比如马尔科夫蒙特卡洛图，这种方法将一组随机行走遍布整个贝氏网路，并试图收敛到对条件概率的评估。贝叶斯网络在 Xbox Live 上被用来评估和匹配玩家; 胜负是一个玩家有多优秀的“证据”。使用一个有超过3亿个边缘的贝氏网路来了解哪些广告可以提供服务。

A key concept from the science of economics is "[[utility]]": 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]],<ref name="Decisions theory and analysis"/> and [[applied information economics|information value theory]].<ref name="Information value theory"/> These tools include models such as [[Markov decision process]]es,<ref name="Markov decision process"/> dynamic [[decision network]]s,<ref name="Stochastic temporal models"/> [[game theory]] and [[mechanism design]].<ref name="Game theory and mechanism design"/>

A key concept from the science of economics is "utility": 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.

经济学中的一个关键概念是“效用” : 一种衡量某物对于一个聪明的代理人的价值的方法。运用决策理论、决策分析和信息价值理论，已经开发出精确的数学工具来分析代理人如何做出选择和计划。这些工具包括马尔可夫决策过程、动态决策网络、博弈论和机制设计等模型。

=== Classifiers and statistical learning methods ===

=== Classifiers and statistical learning methods ===

分类器与统计学习方法

{{Main|Classifier (mathematics)|Statistical classification|Machine learning}}

The simplest AI applications can be divided into two types: classifiers ("if shiny then diamond") and controllers ("if shiny then pick up"). 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.<ref name="Classifiers"/>

The simplest AI applications can be divided into two types: classifiers ("if shiny then diamond") and controllers ("if shiny then pick up"). 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.

最简单的人工智能应用程序可以分为两类: 分类器(“ if shiny then diamond”)和控制器(“ if shiny then pick up”)。然而，控制器在推断动作之前也对条件进行分类，因此分类构成了许多人工智能系统的核心部分。分类器是使用模式匹配来确定最接近的匹配的函数。它们可以根据例子进行调整，使它们在人工智能中非常有吸引力。这些例子被称为观察或模式。在监督式学习中，每个模式都属于某个预定义的类别。一个类可以被看作是一个必须做出的决定。所有的观测结合它们的类标签被称为数据集。当接收到一个新的观察结果时，这个观察结果将根据以前的经验进行分类。

A classifier can be trained in various ways; there are many statistical and [[machine learning]] approaches. The [[decision tree learning|decision tree]]<ref name="Decision tree"/> 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]],<ref name="Neural networks"/>

A classifier can be trained in various ways; there are many statistical and machine learning approaches. The decision tree is perhaps the most widely used machine learning algorithm. Other widely used classifiers are the neural network,

分类器可以通过多种方式进行训练; 有许多统计学和机器学习方法。决策树可能是应用最广泛的机器学习算法。其他广泛使用的分类器是神经网络,

[[k-nearest neighbor algorithm]],{{efn|The most widely used analogical AI until the mid-1990s{{sfn|Domingos|2015|p=187}}}}<ref name="K-nearest neighbor algorithm"/>

k-nearest neighbor algorithm,}}

最近邻居法，开始

[[kernel methods]] such as the [[support vector machine]] (SVM),{{efn|SVM displaced k-nearest neighbor in the 1990s{{sfn|Domingos|2015|p=188}}}}<ref name="Kernel methods"/>

kernel methods such as the support vector machine (SVM),}}

内核方法，例如支持向量机

[[Gaussian mixture model]],<ref name="Gaussian mixture model"/> and the extremely popular [[naive Bayes classifier]].{{efn|Naive Bayes is reportedly the "most widely used learner" at Google, due in part to its scalability.{{sfn|Domingos|2015|p=152}}}}<ref name="Naive Bayes classifier"/> 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 "naive Bayes" on most practical data sets.<ref name="Classifier performance"/>{{sfn|Russell|Norvig|2009|loc=18.12: Learning from Examples: Summary}}

Gaussian mixture model, and the extremely popular naive Bayes classifier.}} 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 "naive Bayes" on most practical data sets.

高斯混合模型，以及非常流行的朴素贝叶斯分类器分类器的性能在很大程度上取决于待分类数据的特征，如数据集的大小、样本跨类别的分布、维数和噪声水平。如果假设的模型非常适合实际数据，那么基于模型的分类器表现良好。否则，如果没有匹配模型可用，而且只关心准确性(而不是速度或可伸缩性) ，传统观点认为，在大多数实际数据集上，鉴别分类器(尤其是支持向量机)往往比基于模型的分类器(如“朴素贝叶斯”)更准确。

=== Artificial neural networks ===

=== Artificial neural networks ===

人工神经网络

{{Main|Artificial neural network|Connectionism}}

[[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]].]]

A neural network is an interconnected group of nodes, akin to the vast network of [[neurons in the human brain.]]

神经网络是一组相互连接的节点，类似于人脑中庞大的神经元网络

Neural networks were inspired by the architecture of neurons in the human brain. A simple "neuron" ''N'' accepts input from other neurons, each of which, when activated (or "fired"), cast a weighted "vote" 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 "[[Hebbian learning|fire together, wire together]]") is to increase the weight between two connected neurons when the activation of one triggers the successful activation of another. The neural network forms "concepts" 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 "leg" might be coupled with a subnetwork meaning "foot" that includes the sound for "foot". 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 "[[History of autonomous cars#1990s|No Hands Across America]]" required "only a few human assists".}}{{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&A]] in 2017 was over 25 times as large as in 2015.<ref>{{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}}</ref><ref>{{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}}</ref>

Neural networks were inspired by the architecture of neurons in the human brain. A simple "neuron" N accepts input from other neurons, each of which, when activated (or "fired"), cast a weighted "vote" 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 "fire together, wire together") is to increase the weight between two connected neurons when the activation of one triggers the successful activation of another. The neural network forms "concepts" that are distributed among a subnetwork of shared neurons that tend to fire together; a concept meaning "leg" might be coupled with a subnetwork meaning "foot" that includes the sound for "foot". 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&A in 2017 was over 25 times as large as in 2015.

神经网络的灵感来自于人脑中神经元的结构。一个简单的“神经元” n 接受来自其他神经元的输入，每个神经元在被激活(或“被激活”)时，对神经元 n 本身是否应该被激活投下加权的“选票”。学习需要一个根据训练数据调整这些权重的算法; 一个简单的算法(称为“一起发射，一起连线”)是在一个神经元的激活触发另一个神经元的成功激活时，增加两个连接神经元之间的权重。神经网络形成”概念” ，这些概念分布在一个共享的神经元子网络中，这些神经元往往一起发射信号; 一个意为”腿”的概念可能与一个意为”脚”的子网络相结合，后者包括”脚”的发音。神经元有一个连续的激活光谱; 此外，神经元可以以非线性的方式处理输入，而不是权衡简单的投票。现代神经网络可以学习连续函数和令人惊讶的数字逻辑操作。神经网络的早期成功包括预测股票市场和(1995年)自动驾驶汽车。2010年代，使用深度学习的神经网络的进步将人工智能推向了广泛的公众意识，并促成了企业人工智能支出的巨大上升; 例如，2017年与人工智能相关的并购交易规模是2015年的25倍多。

The study of non-learning [[artificial neural network]]s<ref name="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{{citation needed|date=July 2019}}.

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.

非学习型人工神经网络的研究开始于人工智能研究领域成立之前的十年，由沃尔特 · 皮茨和沃伦 · 麦克卢奇共同完成。发明了感知器，一个单层的学习网络，类似于线性回归的旧概念。早期的先驱者还包括 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 等。

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.<ref name="Feedforward neural networks"/> Neural networks can be applied to the problem of [[intelligent control]] (for robotics) or [[machine learning|learning]], using such techniques as [[Hebbian learning]] ("fire together, wire together"), [[GMDH]] or [[competitive learning]].<ref name="Learning in neural networks"/>

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 ("fire together, wire together"), GMDH or competitive learning.

网络的主要类别是非循环或前馈神经网络(信号只向一个方向传递)和循环神经网络(允许对以前的输入事件进行反馈和短期记忆)。其中最常用的前馈网络有感知器、多层感知器和径向基网络。神经网络可以应用于智能控制(机器人)或学习的问题，使用赫布学习(“火在一起，线在一起”) ，GMDH 或竞争学习等技术。

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]],<ref name="lin1970">[[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.</ref><ref name="grie2012">Griewank, Andreas (2012). Who Invented the Reverse Mode of Differentiation?. Optimization Stories, Documenta Matematica, Extra Volume ISMP (2012), 389–400.</ref> and was introduced to neural networks by [[Paul Werbos]].<ref name="WERBOS1974">[[Paul Werbos]], "Beyond Regression: New Tools for Prediction and Analysis in the Behavioral Sciences", ''PhD thesis, Harvard University'', 1974.</ref><ref name="werbos1982">[[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 }}</ref><ref name="Backpropagation"/>

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.

今天，神经网络经常用反向传播算法来训练，这种算法从1970年开始就作为 Seppo Linnainmaa 发表的自动微分的反向模式出现，Paul Werbos 将其引入神经网络。

[[Hierarchical temporal memory]] is an approach that models some of the structural and algorithmic properties of the [[neocortex]].<ref name="Hierarchical temporal memory"/>

Hierarchical temporal memory is an approach that models some of the structural and algorithmic properties of the neocortex.

分级暂存记忆是一种模拟大脑新皮层结构和算法特性的方法。

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 "dead ends".<ref>{{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}}</ref>

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 "dead ends".

总之，大多数神经网络在手工创建的神经拓扑结构上使用某种形式的梯度下降法。然而，一些研究小组，比如 Uber，认为通过简单的神经进化来改变新的神经网络拓扑结构和重量可能比复杂的梯度下降法 / 神经网络方法更有竞争力。神经进化的一个优势是，它可能不太容易陷入“死胡同”。

==== Deep feedforward neural networks ====

==== Deep feedforward neural networks ====

深层前馈神经网络

{{Main|Deep learning}}

[[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|"credit assignment path"]] (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.<ref name="schmidhuber2015"/> Deep learning has transformed many important subfields of artificial intelligence{{why|date=July 2019}}, including [[computer vision]], [[speech recognition]], [[natural language processing]] and others.<ref name="goodfellow2016">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 }}</ref><ref name="HintonDengYu2012">{{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}}</ref><ref name="schmidhuber2015">{{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 }}</ref>

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 "credit assignment path" (CAP) depth of seven. Many deep learning systems need to be able to learn chains ten or more causal links in length.

深度学习是任何人工神经网络，可以学习一个长链的因果关系。例如，一个具有六个隐藏层的前馈网络可以学习七个链接的因果链(六个隐藏层 + 输出层) ，并且具有七个“信用分配路径”(CAP)深度。许多深度学习系统需要能够学习链的长度十个或更多的因果关系。

According to one overview,<ref name="scholarpedia">{{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 }}</ref> the expression "Deep Learning" was introduced to the [[machine learning]] community by [[Rina Dechter]] in 1986<ref name="dechter1986">[[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 }}</ref> and gained traction after

According to one overview, the expression "Deep Learning" was introduced to the machine learning community by Rina Dechter in 1986 and gained traction after

根据一篇综述，“深度学习”这个表达在1986年被 Rina Dechter 引入到机器学习社区，并在之后获得了关注

Igor Aizenberg and colleagues introduced it to [[artificial neural network]]s in 2000.<ref name="aizenberg2000">Igor Aizenberg, Naum N. Aizenberg, Joos P.L. Vandewalle (2000). Multi-Valued and Universal Binary Neurons: Theory, Learning and Applications. Springer Science & Business Media.</ref> The first functional Deep Learning networks were published by [[Alexey Grigorevich Ivakhnenko]] and V. G. Lapa in 1965.<ref>{{Cite book|title=Cybernetic Predicting Devices|last=Ivakhnenko|first=Alexey|publisher=Naukova Dumka|year=1965|isbn=|location=Kiev|pages=}}</ref>{{page needed|date=December 2016}} These networks are trained one layer at a time. Ivakhnenko's 1971 paper<ref name="ivak1971">{{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}}</ref> 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.<ref>{{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}}</ref>

Igor Aizenberg and colleagues introduced it to artificial neural networks in 2000. 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.

2000年，Igor Aizenberg 和他的同事将其引入人工神经网络。第一个功能性的深度学习网络是由 Alexey Grigorevich Ivakhnenko 和 v. g. Lapa 在1965年发表的。这些网络每次只训练一层。在1971年的论文中描述了一个8层的深度前馈多层感知机网络的学习过程，这个网络已经比许多后来的网络要深得多了。2006年，Geoffrey Hinton 和 Ruslan Salakhutdinov 的出版物介绍了另一种预训练多层前向神经网络(FNNs)的方法，一次训练一层，将每一层依次视为无监督的受限玻尔兹曼机，然后使用有监督的反向传播进行微调。与浅层人工神经网络类似，深层神经网络可以模拟复杂的非线性关系。在过去的几年里，机器学习算法和计算机硬件的进步已经导致了更有效的方法训练深层神经网络，其中包含许多层非线性隐藏单元和一个非常大的输出层。

Deep learning often uses [[convolutional neural network]]s (CNNs), whose origins can be traced back to the [[Neocognitron]] introduced by [[Kunihiko Fukushima]] in 1980.<ref name="FUKU1980">{{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}}</ref> 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.<ref name="lecun2016slides">[[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 }}</ref>

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.

深度学习通常使用卷积神经网络(CNNs) ，其起源可以追溯到1980年由福岛邦彦(Kunihiko Fukushima)引进的神经网络。1989年，Yann LeCun 和他的同事将反向传播应用于这样的架构。在21世纪初，在一项工业应用中，cnn 已经处理了美国所有签发支票的10% 到20% 。

Since 2011, fast implementations of CNNs on GPUs have

Since 2011, fast implementations of CNNs on GPUs have

自2011年以来，在 gpu 上快速实现的 cnn

won many visual pattern recognition competitions.<ref name="schmidhuber2015"/>

won many visual pattern recognition competitions.

赢得了许多视觉模式识别比赛。

CNNs with 12 convolutional layers were used in conjunction with [[reinforcement learning]] by Deepmind's "[[AlphaGo]] Lee", the program that beat a top [[Go (game)|Go]] champion in 2016.<ref name="Nature2017">{{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}}</ref>

CNNs with 12 convolutional layers were used in conjunction with reinforcement learning by Deepmind's "AlphaGo Lee", the program that beat a top Go champion in 2016.

带有12个卷积层的 CNNs 被 Deepmind 的“阿尔法狗李”与强化学习一起使用，这个程序在2016年击败了一个围棋冠军。

==== Deep recurrent neural networks ====

==== Deep recurrent neural networks ====

深层递归神经网络

{{Main|Recurrent neural networks}}

Early on, deep learning was also applied to sequence learning with [[recurrent neural network]]s (RNNs)<ref name="Recurrent neural networks"/> which are in theory Turing complete<ref>{{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}}</ref> 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.<ref name="schmidhuber2015"/> RNNs can be trained by [[gradient descent]]<ref>P. J. Werbos. Generalization of backpropagation with application to a recurrent gas market model" ''Neural Networks'' 1, 1988.</ref><ref>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.</ref><ref>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.</ref> but suffer from the [[vanishing gradient problem]].<ref name="goodfellow2016"/><ref name="hochreiter1991">[[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.</ref> 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.<ref name="SCHMID1992">{{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}}</ref>

Early on, deep learning was also applied to sequence learning with recurrent neural networks (RNNs) 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.

早期，深度学习也被用于循环神经网络(RNNs)的序列学习，可以运行任意程序来处理任意的输入序列。一个神经网络的深度是无限的，并取决于其输入序列的长度; 因此，一个神经网络是一个深度学习的例子。但却要忍受梯度消失的问题。1992年，研究表明，无监督的预训练一堆循环神经网络可以加速后续的深度连续问题的监督式学习。

Numerous researchers now use variants of a deep learning recurrent NN called the [[long short-term memory]] (LSTM) network published by Hochreiter & Schmidhuber in 1997.<ref name=lstm>[[Sepp Hochreiter|Hochreiter, Sepp]]; and [[Jürgen Schmidhuber|Schmidhuber, Jürgen]]; ''Long Short-Term Memory'', Neural Computation, 9(8):1735–1780, 1997</ref> LSTM is often trained by [[Connectionist temporal classification|Connectionist Temporal Classification]] (CTC).<ref name="graves2006">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.</ref> At Google, Microsoft and Baidu this approach has revolutionized [[speech recognition]].<ref name="hannun2014">{{cite arXiv

Numerous researchers now use variants of a deep learning recurrent NN called the long short-term memory (LSTM) network published by Hochreiter & Schmidhuber in 1997. LSTM is often trained by Connectionist Temporal Classification (CTC). At Google, Microsoft and Baidu this approach has revolutionized speech recognition.<ref name="hannun2014">{{cite arXiv

许多研究人员现在使用一种名为长期短期记忆(LSTM)网络的深度学习循环神经网络的变种，该网络由 Hochreiter 和 Schmidhuber 于1997年发表。Lstm 常用连接主义时态分类(CTC)进行训练。在谷歌，微软和百度这种方法已经彻底改变了语音识别

|last1=Hannun |first1=Awni

|last1=Hannun |first1=Awni

1 Awni

|last2=Case |first2=Carl

|last2=Case |first2=Carl

2 Case | first2 Carl

|last3=Casper |first3=Jared

|last3=Casper |first3=Jared

3 / last 3 / Casper | first3 / Jared

|last4=Catanzaro |first4=Bryan

|last4=Catanzaro |first4=Bryan

4 Catanzaro | first4 Bryan

|last5=Diamos |first5=Greg

|last5=Diamos |first5=Greg

5 Diamos | first5 Greg

|last6=Elsen |first6=Erich

|last6=Elsen |first6=Erich

6 Elsen | first6 Erich

|last7=Prenger |first7=Ryan

|last7=Prenger |first7=Ryan

7 Prenger | first7 Ryan

|last8=Satheesh |first8=Sanjeev

|last8=Satheesh |first8=Sanjeev

|last8=Satheesh |first8=Sanjeev

|last9=Sengupta |first9=Shubho

|last9=Sengupta |first9=Shubho

9 Sengupta | first9 Shubho

|last10=Coates |first10=Adam

|last10=Coates |first10=Adam

2010年10月10日

|last11=Ng |first11=Andrew Y. |author11-link=Andrew Ng

|last11=Ng |first11=Andrew Y. |author11-link=Andrew Ng

11 Ng | first11 Andrew y.| author11-link

|year=2014

|year=2014

2014年

|title=Deep Speech: Scaling up end-to-end speech recognition

|title=Deep Speech: Scaling up end-to-end speech recognition

| 标题深度语音: 扩展端到端语音识别

|eprint=1412.5567

|eprint=1412.5567

1412.5567

|class=cs.CL

|class=cs.CL

| cs.CL 类

}}</ref><ref name="sak2014">Hasim Sak and Andrew Senior and Francoise Beaufays (2014). Long Short-Term Memory recurrent neural network architectures for large scale acoustic modeling. Proceedings of Interspeech 2014.</ref><ref name="liwu2015">{{cite arXiv

}}</ref><ref name="liwu2015">{{cite arXiv

}}</ref><ref name="liwu2015">{{cite arXiv

|last1=Li |first1=Xiangang

|last1=Li |first1=Xiangang

1 Li | first1 Xiangang

|last2=Wu |first2=Xihong

|last2=Wu |first2=Xihong

|last2=Wu |first2=Xihong

|year=2015

|year=2015

2015年

|title=Constructing Long Short-Term Memory based Deep Recurrent Neural Networks for Large Vocabulary Speech Recognition

|title=Constructing Long Short-Term Memory based Deep Recurrent Neural Networks for Large Vocabulary Speech Recognition

基于长短期记忆的大词汇量语音识别深层递归神经网络的构建

|eprint=1410.4281

|eprint=1410.4281

1410.4281

|class=cs.CL

|class=cs.CL

| cs.CL 类

}}</ref> For example, in 2015, Google's speech recognition experienced a dramatic performance jump of 49% through CTC-trained LSTM, which is now available through [[Google Voice]] to billions of smartphone users.<ref name="sak2015">Haşim Sak, Andrew Senior, Kanishka Rao, Françoise Beaufays and Johan Schalkwyk (September 2015): [http://googleresearch.blogspot.ch/2015/09/google-voice-search-faster-and-more.html Google voice search: faster and more accurate.] {{webarchive|url=https://web.archive.org/web/20160309191532/http://googleresearch.blogspot.ch/2015/09/google-voice-search-faster-and-more.html |date=9 March 2016 }}</ref> Google also used LSTM to improve machine translation,<ref name="sutskever2014">{{cite arXiv

}}</ref> For example, in 2015, Google's speech recognition experienced a dramatic performance jump of 49% through CTC-trained LSTM, which is now available through Google Voice to billions of smartphone users. Google also used LSTM to improve machine translation,<ref name="sutskever2014">{{cite arXiv

} / ref 例如，在2015年，Google 的语音识别通过 ctc 训练的 LSTM 经历了49% 的戏剧性增长，现在数十亿的智能手机用户可以通过 Google Voice 使用该技术。谷歌还利用 LSTM 改进机器翻译，ref name"sutskever2014"{ cite arXiv

|last1=Sutskever |first1=Ilya

|last1=Sutskever |first1=Ilya

1 / 01 / Ilya

|last2=Vinyals |first2=Oriol

|last2=Vinyals |first2=Oriol

2 Vinyals | first2 Oriol

|last3=Le |first3=Quoc V.

|last3=Le |first3=Quoc V.

最后3天 | 最初3天。

|year=2014

|year=2014

2014年

|title=Sequence to Sequence Learning with Neural Networks

|title=Sequence to Sequence Learning with Neural Networks

| 标题序列到序列学习与神经网络

|eprint=1409.3215

|eprint=1409.3215

1409.3215

|class=cs.CL

|class=cs.CL

| cs.CL 类

}}</ref> Language Modeling<ref name="vinyals2016">{{cite arXiv

}}</ref> Language Modeling<ref name="vinyals2016">{{cite arXiv

2016"{ cite arXiv

|last1=Jozefowicz |first1=Rafal

|last1=Jozefowicz |first1=Rafal

1 Rafal | last 1 Jozefowicz | first1 Rafal

|last2=Vinyals |first2=Oriol

|last2=Vinyals |first2=Oriol

2 Vinyals | first2 Oriol

|last3=Schuster |first3=Mike

|last3=Schuster |first3=Mike

最后3舒斯特最初3迈克

|last4=Shazeer |first4=Noam

|last4=Shazeer |first4=Noam

| last 4 Shazeer | first4 Noam

|last5=Wu |first5=Yonghui

|last5=Wu |first5=Yonghui

5永辉

|year=2016

|year=2016

2016年

|title=Exploring the Limits of Language Modeling

|title=Exploring the Limits of Language Modeling

探索语言建模的极限

|eprint=1602.02410

|eprint=1602.02410

1602.02410

|class=cs.CL

|class=cs.CL

| cs.CL 类

}}</ref> and Multilingual Language Processing.<ref name="gillick2015">{{cite arXiv

}}</ref> and Multilingual Language Processing.<ref name="gillick2015">{{cite arXiv

2015"{ cite arXiv

|last1=Gillick |first1=Dan

|last1=Gillick |first1=Dan

最后1吉利克最初1丹

|last2=Brunk |first2=Cliff

|last2=Brunk |first2=Cliff

2 | last 2 Brunk | first2 Cliff

|last3=Vinyals |first3=Oriol

|last3=Vinyals |first3=Oriol

3 Vinyals | first3 Oriol

|last4=Subramanya |first4=Amarnag

|last4=Subramanya |first4=Amarnag

4 Subramanya | first4 Amarnag

|year=2015

|year=2015

2015年

|title=Multilingual Language Processing From Bytes

|title=Multilingual Language Processing From Bytes

字节多语言处理

|eprint=1512.00103

|eprint=1512.00103

1512.00103

|class=cs.CL

|class=cs.CL

| cs.CL 类

}}</ref> LSTM combined with CNNs also improved automatic image captioning<ref name="vinyals2015">{{cite arXiv

}}</ref> LSTM combined with CNNs also improved automatic image captioning<ref name="vinyals2015">{{cite arXiv

{{{ cite arXiv，} / ref LSTM 结合 CNNs 也改进了自动图像字幕 ref name"vinyals2015"

|last1=Vinyals |first1=Oriol

|last1=Vinyals |first1=Oriol

1欧力欧

|last2=Toshev |first2=Alexander

|last2=Toshev |first2=Alexander

2 Toshev | first2 Alexander

|last3=Bengio |first3=Samy

|last3=Bengio |first3=Samy

3 Bengio | first3 Samy

|last4=Erhan |first4=Dumitru

|last4=Erhan |first4=Dumitru

|last4=Erhan |first4=Dumitru

|year=2015

|year=2015

2015年

|title=Show and Tell: A Neural Image Caption Generator

|title=Show and Tell: A Neural Image Caption Generator

显示与讲述: 一个神经图像标题生成器

|eprint=1411.4555

|eprint=1411.4555

1411.4555

|class=cs.CV

|class=cs.CV

| cs.CV

}}</ref> and a plethora of other applications.

}}</ref> and a plethora of other applications.

} / ref 和大量其他应用程序。

=== Evaluating progress ===

=== Evaluating progress ===

评估进度

{{Further|Progress in artificial intelligence|Competitions and prizes in artificial intelligence}}

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.<ref>{{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}}</ref> While projects such as [[AlphaZero]] have succeeded in generating their own knowledge from scratch, many other machine learning projects require large training datasets.<ref>{{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}}</ref><ref>{{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}}</ref> Researcher [[Andrew Ng]] has suggested, as a "highly imperfect rule of thumb", that "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."<ref>{{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}}</ref> [[Moravec's paradox]] suggests that AI lags humans at many tasks that the human brain has specifically evolved to perform well.<ref name="The Economist"/>

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 "highly imperfect rule of thumb", that "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." Moravec's paradox suggests that AI lags humans at many tasks that the human brain has specifically evolved to perform well.

人工智能就像电或蒸汽机一样，是一种通用技术。关于如何描述 AI 倾向于擅长的任务，目前还没有共识。虽然像 AlphaZero 这样的项目已经成功地从零开始生成了自己的知识，但是许多其他的机器学习项目需要大量的训练数据集。研究人员 Andrew Ng 认为，作为一个“极不完美的经验法则” ，“几乎任何一个典型的人类只需要不到一秒钟的思维就能做到的事情，我们现在或者在不久的将来都可以使用人工智能自动化。”莫拉维克的悖论表明，人工智能在许多人类大脑专门进化出来的、能够很好完成的任务上落后于人类。

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]].<ref>{{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}}</ref><ref>{{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}}</ref> [[Esports|E-sports]] such as [[StarCraft]] continue to provide additional public benchmarks.<ref>{{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}}</ref><ref>{{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}}</ref> 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.<ref>{{Cite web|url=http://image-net.org/challenges/LSVRC/2017/|title=ILSVRC2017|website=image-net.org|language=en|access-date=2018-11-06}}</ref>

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.

奥运会为评估进步率提供了一个广为宣传的基准。2016年左右，AlphaGo 结束了传统棋类基准的时代。不完全知识的博弈为人工智能在博弈论领域提供了新的挑战。星际争霸等电子竞技继续提供额外的公众基准。有许多比赛和奖项，如 Imagenet 挑战赛，以促进人工智能的研究。最常见的竞争领域包括一般机器智能、会话行为、数据挖掘、机器人汽车、机器人足球以及传统游戏。

The "imitation game" (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.<ref>{{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}}</ref> 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}}

The "imitation game" (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.

“模仿游戏”(对1950年图灵测试的一种解释，用来评估计算机是否可以模仿人类)如今被认为是一个过于可利用的有意义的基准。图灵测试的一个衍生物是完全自动的公共图灵测试，用于区分计算机和人类(CAPTCHA)。顾名思义，这有助于确定用户是一个真实的人，而不是一台伪装成人的计算机。与标准的图灵测试不同，CAPTCHA 是由机器实施的，针对的是人，而不是由人实施的，针对的是机器。计算机要求用户完成一个简单的测试，然后为该测试生成一个等级。计算机无法解决这个问题，所以正确的解决方案被认为是一个人参加考试的结果。验证码的一个常见类型是测试，要求输入扭曲的字母，数字或符号出现在一个图像无法破译的计算机。

Proposed "universal intelligence" 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.<ref name="Mathematical definitions of intelligence"/><ref>{{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}}</ref>

Proposed "universal intelligence" 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.

提出的“通用智能”测试旨在比较机器、人类甚至非人类动物在尽可能通用的问题集上的表现。在极端情况下，测试套件可以包含所有可能出现的问题，这些问题的权重是柯氏复杂性; 不幸的是，这些问题集往往被贫乏的模式匹配练习所主导，在这些练习中，调优的 AI 可以轻易地超过人类。

== Applications{{anchor|Goals}} ==

== Applications ==

申请

[[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]]

An [[automated online assistant providing customer service on a web page – one of many very primitive applications of artificial intelligence]]

一个[在网页上提供客户服务的自动在线助理——人工智能的许多原始应用之一]

{{Main|Applications of artificial intelligence}}

AI is relevant to any intellectual task.{{sfn|Russell|Norvig|2009|p=1}} Modern artificial intelligence techniques are pervasive<ref name=":1">{{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}}</ref> 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}}

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.

人工智能与任何智力任务都息息相关。现代人工智能技术无处不在，数量众多，无法在此列举。通常，当一种技术达到主流应用时，它就不再被认为是人工智能; 这种现象被称为人工智能效应。

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,<ref>[https://ishti.org/2018/11/19/using-artificial-intelligence-to-predict-flight-delays/ Using AI to predict flight delays], Ishti.org.</ref> prediction of judicial decisions,<ref name="ecthr2016">{{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 }}</ref> targeting online advertisements, {{sfn|Russell|Norvig|2009|p=1}}<ref>{{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}}</ref><ref>{{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}}</ref> and [[energy storage]]<ref>{{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}}</ref>

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

引人注目的人工智能例子包括自动驾驶汽车(如无人机和自动驾驶汽车)、医疗诊断、创造艺术(如诗歌)、证明数学定理、玩游戏(如国际象棋或围棋)、搜索引擎(如谷歌搜索)、在线助手(如 Siri)、照片图像识别、垃圾邮件过滤、航班延误预测、司法判决预测、针对在线广告和能源储存

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,<ref>{{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}}</ref> major publishers now use artificial intelligence (AI) technology to post stories more effectively and generate higher volumes of traffic.<ref>{{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}}</ref>

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.

随着社交媒体网站取代电视成为年轻人的新闻来源，以及新闻机构越来越依赖社交媒体平台来发布新闻，大型出版商现在使用人工智能技术来更有效地发布新闻，并产生更高的流量。

AI can also produce [[Deepfake]]s, a content-altering technology. ZDNet reports, "It presents something that did not actually occur," 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.<ref>{{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}}</ref>

AI can also produce Deepfakes, a content-altering technology. ZDNet reports, "It presents something that did not actually occur," 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.

人工智能还可以生产“深度假货” ，这是一种改变内容的技术。Zdnet 报道说，“它展示了一些并没有真正发生的东西。”尽管88% 的美国人认为伪造的东西弊大于利，但只有47% 的人认为他们可以成为目标。选举年的繁荣也开启了公共话语，政治家虚假媒体视频的威胁。

=== Healthcare ===

=== Healthcare ===

医疗

{{Main|Artificial intelligence in healthcare}}

[[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.

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.

在医疗保健中，[[达芬奇外科手术系统]人工智能的患者侧手术臂通常用于分类，无论是自动进行 CT 扫描或心电图的初步评估，还是为群体健康识别高风险患者。应用范围正在迅速扩大。

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.<ref>{{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}}</ref> [[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]]

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]]

例如，人工智能正被用于解决高成本的剂量问题ーー研究结果表明，人工智能可以节省160亿美元。2016年，加利福尼亚州的一项开创性研究发现，在人工智能的帮助下开发的一个数学公式正确地确定了免疫抑制药给予器官患者的准确剂量。用计算机软件自动计算骨龄]

Artificial intelligence is assisting doctors. According to Bloomberg Technology, Microsoft has developed AI to help doctors find the right treatments for cancer.<ref>{{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 }}</ref> 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 "Hanover"{{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.<ref>{{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}}</ref> 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.<ref>{{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}}</ref> 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.<ref>{{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}}</ref>

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 "Hanover". 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.

人工智能正在协助医生。据彭博科技报道，微软已经开发出人工智能来帮助医生找到正确的癌症治疗方法。有大量的研究和药物开发与癌症有关。具体来说，有800多种药物和疫苗可以治疗癌症。这对医生造成了负面影响，因为有太多的选择可供选择，使得更难为病人选择合适的药物。微软正在进行一个项目，开发一种名为“汉诺威”的机器。它的目标是记住所有与癌症有关的论文，并帮助预测哪些药物组合对每个病人最有效。目前正在进行的一个项目是抗击髓系白血病，这是一种致命的癌症，几十年来治疗一直没有改善。据报道，另一项研究发现，在识别皮肤癌方面，人工智能与训练有素的医生一样优秀。另一项研究是使用人工智能来监测多个高风险患者，这是通过询问每个患者许多问题来完成的，这些问题是基于从现场医生与患者互动中获得的数据。其中一项研究是通过转移学习完成的，机器进行的诊断类似于训练有素的眼科医生，可以在30秒内做出是否应该转诊治疗的决定，准确率超过95% 。

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.<ref>{{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}}</ref> 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.<ref>{{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}}</ref>

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.

据 CNN 报道，华盛顿国家儿童医疗中心的外科医生最近的一项研究成功地展示了一台自主机器人手术。研究小组声称，当机器人进行软组织手术、在开放手术中缝合猪肠时，他们负责监督机器人，而且比人类外科医生做得更好。Ibm 已经创造了自己的人工智能计算机，IBM 沃森，它在某些层面上已经超越了人类智能。沃森一直在努力实现医疗保健领域的成功和采用。

=== Automotive ===

=== Automotive ===

汽车

{{Main|driverless cars}}

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]].<ref>"33 Corporations Working On Autonomous Vehicles". CB Insights. N.p., 11 August 2016. 12 November 2016.</ref>

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.

人工智能技术的进步通过自动驾驶汽车的创造和发展促进了汽车工业的发展。目前，有超过30家公司利用人工智能开发自动驾驶汽车。少数涉及人工智能的公司包括特斯拉、谷歌和苹果。

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.<ref>West, Darrell M. "Moving forward: Self-driving vehicles in China, Europe, Japan, Korea, and the United States". Center for Technology Innovation at Brookings. N.p., September 2016. 12 November 2016.</ref>

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.

许多组件有助于自动驾驶汽车的功能。这些车辆集成了诸如刹车、换车道、防撞、导航和测绘等系统。这些系统以及高性能计算机一起集成到一个复杂的车辆中。

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.<ref>{{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}}</ref> 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.<ref>{{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}}</ref>

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.

自动驾驶汽车的最新发展使自动驾驶卡车的创新成为可能，尽管它们仍处于测试阶段。英国政府已通过立法，将于2018年开始测试自动驾驶卡车排。自动驾驶卡车排是一队自动驾驶卡车跟随一辆非自动驾驶卡车的领导，所以卡车排还不是完全自动的。与此同时，德国汽车公司戴姆勒正在测试福莱纳灵感，这是一种只在高速公路上使用的半自动卡车。

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.<ref>McFarland, Matt. "Google's artificial intelligence breakthrough may have a huge impact on self-driving cars and much more". ''The Washington Post'' 25 February 2015. Infotrac Newsstand. 24 October 2016</ref> 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.<ref>"Programming safety into self-driving cars". National Science Foundation. N.p., 2 February 2015. 24 October 2016.</ref>

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.

影响无人驾驶汽车性能的一个主要因素是地图。一般来说，车辆将预先编程与地图的区域正在驾驶。这张地图将包括近似的街灯和路缘高度的数据，以便车辆能够感知周围环境。然而，谷歌一直在研究一种算法，其目的是消除对预编程地图的需求，而是创造一种能够适应各种新环境的设备。一些自动驾驶汽车没有配备方向盘或刹车踏板，因此也有研究集中于创建一种算法，能够通过对速度和驾驶条件的了解，为车内乘客维持一个安全的环境。

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.<ref>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 }}</ref> The programming of the car in these situations is crucial to a successful driver-less automobile.

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.

另一个影响无人驾驶汽车能力的因素是乘客的安全。为了制造一辆无人驾驶的汽车，工程师们必须对其进行编程，使其能够处理高风险的情况。这些情况可能包括与行人迎面相撞。这辆车的主要目标应该是做出一个决定，避免撞到行人，救出车内的乘客。但是汽车有可能需要做出一个将某人置于危险之中的决定。换句话说，汽车需要决定是拯救行人还是乘客。汽车在这些情况下的编程对于一辆成功的无人驾驶汽车是至关重要的。

=== Finance and economics ===

=== Finance and economics ===

金融和经济

[[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.<ref>{{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}}</ref> Programs like Kasisto and Moneystream are using AI in financial services.

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.

长期以来，金融机构一直使用人工神经网络系统来检测超出常规的费用或索赔，并将其标记为人工调查。人工智能在银行业的应用可以追溯到1987年，当时美国国家安全太平洋银行成立了一个防止欺诈工作队，以打击未经授权使用借记卡的行为。像 Kasisto 和 Moneystream 这样的程序正在金融服务中使用人工智能。

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.<ref name="Eleanor">{{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}}</ref> In August 2001, robots beat humans in a simulated [[stock trader|financial trading]] competition.<ref>[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)</ref> AI has also reduced fraud and financial crimes by [[Statistical software|monitoring]] [[behavioral pattern]]s of users for any abnormal changes or anomalies.<ref name="fsroundtable.org">{{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}}</ref><ref>{{Cite web|url=https://www.sas.com/en_ae/solutions/ai.html|title=Artificial Intelligence Solutions, AI Solutions|website=www.sas.com}}</ref><ref>{{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}}</ref>

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.

如今，银行使用人工智能系统来组织业务、记账、投资股票和管理房地产。人工智能可以对一夜之间的变化做出反应，或者当业务没有发生的时候。2001年8月，机器人在一场模拟金融交易竞赛中击败了人类。人工智能还通过监测用户的行为模式以发现任何异常变化或异常现象，减少了欺诈和金融犯罪。

AI is increasingly being used by [[Corporate finance|corporations]]. [[Jack Ma]] has controversially predicted that AI [[CEO]]'s are 30 years away.<ref>{{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}}</ref><ref>{{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}}</ref>

AI is increasingly being used by corporations. Jack Ma has controversially predicted that AI CEO's are 30 years away.

人工智能正越来越多地被企业所使用。马曾有争议地预测，人工智能 CEO 离苹果还有30年的时间。

The use of AI machines in the market in applications such as online trading and decision making has changed major economic theories.<ref>{{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}}</ref> 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.<ref>{{Cite web|url=https://www.mileseducation.com/finance/artificial_intelligence|title=Miles Education {{!}} Future Of Finance {{!}} Blockchain Fundamentals for F&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}}</ref>

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.

人工智能机器在市场上的应用，如在线交易和决策，改变了主要的经济理论。例如，基于人工智能的买卖平台改变了供求规律，现在可以很容易地估计个性化的需求和供给曲线，从而实现个性化的定价。此外，人工智能机器减少了市场的信息不对称，从而使市场更有效率，同时减少了交易量。此外，市场中的人工智能限制了市场行为的后果，再次提高了市场效率。人工智能影响的其他理论包括理性选择、理性预期、博弈论、刘易斯转折点、投资组合优化和反事实思维。 .2019年8月，AICPA 为会计专业人员开设了 AI 培训课程。

=== Cybersecurity ===

=== Cybersecurity ===

网络安全

{{More citations needed section|date=January 2020}}

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.

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.

网络安全领域面临着各种形式的大规模黑客攻击的重大挑战，这些攻击伤害了各种组织，造成了数十亿美元的商业损失。安全公司已经开始使用人工智能和自然语言处理(NLP) ，例如，SIEM (安全信息和事件管理)解决方案。这些更先进的解决方案使用人工智能和自然语言处理自动排序的数据网络中的高风险和低风险的信息。这使得安全团队能够专注于那些有可能对组织造成真正伤害的攻击，而不是成为分布式拒绝服务攻击攻击、恶意软件和其他攻击的受害者。

=== Government ===

=== Government ===

政府

{{Main|Artificial intelligence in government}}

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.<ref>{{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}}</ref><ref>{{Cite web|url=http://social.techcrunch.com/2019/05/03/china-smart-city-exposed/|title=Security lapse exposed a Chinese smart city surveillance system}}</ref> An artificial intelligence has also competed in the Tama City [[AI mayor|mayoral elections]] in 2018.

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.

政府中的人工智能包括应用和管理。人工智能与人脸识别系统相结合可用于大规模监控。在中国的一些地区已经出现了这种情况。人工智能还参与了2018年 Tama City 市长选举的角逐。

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.<ref>{{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}}</ref>

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.

2019年，印度科技城市 Bengaluru 将在该市的387个交通信号灯上部署人工智能管理的交通信号系统。这个系统将使用摄影机来确定交通密度，并据此计算清除交通量所需的时间，这将决定横过街道的车辆交通灯持续时间。

=== Law-related professions ===

=== Law-related professions ===

与法律有关的专业

{{Main|Legal informatics#Artificial intelligence}}

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}}

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.

人工智能(AI)正在成为法律相关专业的主要组成部分。在某些情况下，这种分析处理技术正在使用算法和机器学习来完成以前由初级律师完成的工作。

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.<ref>{{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}}</ref>

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.

在电子发现(eDiscovery)中，工业界一直关注于机器学习(预测编码 / 技术辅助评审) ，这是人工智能的一个子集。自然语言处理(NLP)和自动语音识别(ASR)也正在业界流行起来。

=== Video games ===

=== Video games ===

电子游戏

{{Main|Artificial intelligence (video games)}}

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 "solved problem" 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).<ref>{{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}}</ref><ref>Yannakakis, G. N. (2012, May). Game AI revisited. In Proceedings of the 9th conference on Computing Frontiers (pp. 285–292). ACM.</ref>

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 "solved problem" 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).

在视频游戏中，人工智能通常被用来在非玩家角色(npc)中产生动态的有目的的行为。此外，众所周知的人工智能技术常用于寻路。一些研究人员认为，对于大多数生产任务来说，游戏中的 NPC AI 是一个“解决了的问题”。具有更多非典型 AI 的游戏包括《左4死》(2008)的 AI 导演和《最高指挥官2》(2010)中的排神经进化训练。

=== Military ===

=== Military ===

军事

{{Further|Artificial intelligence arms race|Lethal autonomous weapon|Unmanned combat aerial vehicle}}

The United States and other nations are developing AI applications for a range of military functions.<ref name=":2">{{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]]</ref> The main military applications of Artificial Intelligence and Machine Learning are to enhance C2, Communications, Sensors, Integration and Interoperability.<ref name="AI">{{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}}</ref> 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.<ref name=":2" /> 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).<ref name=AI /> AI has been incorporated into military operations in Iraq and Syria.<ref name=":2" />

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.

美国和其他国家正在为一系列军事功能开发人工智能应用程序。人工智能和机器学习的主要军事应用是增强 C2、通信、传感器、集成和互操作性。人工智能研究正在情报收集和分析、后勤、网络操作、信息操作、指挥和控制以及各种半自动和自动车辆等领域进行。人工智能技术能够协调传感器和效应器、威胁探测和识别、标记敌人阵地、目标获取、协调和消除分布式联合火力，在有人和无人小组(MUM-T)内部，联网作战车辆和坦克之间也是如此。大赦国际已被纳入伊拉克和叙利亚的军事行动。

Worldwide annual military spending on robotics rose from US$5.1 billion in 2010 to US$7.5 billion in 2015.<ref>{{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}}</ref><ref>{{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}}</ref> Military drones capable of autonomous action are widely considered a useful asset.<ref>{{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}}</ref> Many artificial intelligence researchers seek to distance themselves from military applications of AI.<ref>{{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}}</ref>

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.

全球每年在机器人方面的军费开支从2010年的51亿美元增加到2015年的75亿美元。具有自主行动能力的军用无人机被广泛认为是一种有用的资产。许多人工智能研究人员试图与人工智能的军事应用保持距离。

=== Hospitality ===

=== Hospitality ===

好客

In the hospitality industry, Artificial Intelligence based solutions are used to reduce staff load and increase efficiency<ref>{{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}}</ref> by cutting repetitive tasks frequency, trends analysis, guest interaction, and customer needs prediction.<ref>{{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 & Company|date=2017}}</ref> Hotel services backed by Artificial Intelligence are represented in the form of a chatbot,<ref>{{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}}</ref> application, virtual voice assistant and service robots.

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.

在款待业，基于人工智能的解决方案通过减少重复性任务的频率、趋势分析、客户互动和客户需求预测来减少员工负担和提高效率。人工智能支持的酒店服务以聊天机器人、应用程序、虚拟语音助手和服务机器人的形式表现出来。

=== Audit ===

=== Audit ===

审计署

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.<ref>{{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 & Finance|volume=33|issue=4|date=10 April 2017|pages=580–600|doi=10.1177/0148558X17696760}}</ref>

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.

对于财务报表审计，AI 使持续审计成为可能。人工智能工具可以立即分析多组不同的信息。潜在的好处是总体审计风险将减少，保证水平将提高，审计时间将缩短。

=== Advertising ===

=== Advertising ===

广告

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.<ref name="Matz et al 2017">Matz, S. C., et al. "Psychological targeting as an effective approach to digital mass persuasion." Proceedings of the National Academy of Sciences (2017): 201710966.</ref> A documented case reports that online gambling companies were using AI to improve customer targeting.<ref>{{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}}</ref>

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.

这是可能的使用人工智能预测或归纳客户的行为从他们的数字足迹，以个性化的促销目标他们或建立客户角色自动。一个记录在案的案例报告说，在线赌博公司正在使用人工智能来改善客户定位。

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.<ref name="Celli et al. 2017">Celli, Fabio, Pietro Zani Massani, and Bruno Lepri. "Profilio: Psychometric Profiling to Boost Social Media Advertising." Proceedings of the 2017 ACM on Multimedia Conference. ACM, 2017 [https://www.researchgate.net/publication/320542489_Profilio_Psychometric_Profiling_to_Boost_Social_Media_Advertising]</ref>

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.

此外，个性计算人工智能模型的应用可以帮助降低广告活动的成本，通过增加心理定位到更传统的社会人口学或行为定位。

=== Art ===

=== Art ===

艺术

{{Further|Computer art}}

Artificial Intelligence has inspired numerous creative applications including its usage to produce visual art. The exhibition "Thinking Machines: Art and Design in the Computer Age, 1959–1989" at MoMA<ref name="moma">{{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}}</ref> 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<ref name = wp1>[https://www.washingtonpost.com/news/innovations/wp/2016/03/10/googles-psychedelic-paint-brush-raises-the-oldest-question-in-art/ Retrieved July 29]</ref> and the exhibition "Unhuman: Art in the Age of AI," which took place in Los Angeles and Frankfurt in the fall of 2017.<ref name = sf>{{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}}</ref><ref name="artsy">{{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}}</ref> 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.<ref name = acm>[https://dl.acm.org/citation.cfm?id=3204480.3186697 Retrieved July 29]</ref> The Austrian [[Ars Electronica]] and [[Museum of Applied Arts, Vienna]] opened exhibitions on AI in 2019.<ref name="Ars Electronica Exhibition ''Understanding AI''">{{Cite web|url=https://ars.electronica.art/center/en/exhibitions/ai/ |access-date=September 2019}}</ref><ref name="Museum of Applied Arts Exhibition ''Uncanny Values''">{{Cite web|url=https://www.mak.at/en/program/exhibitions/uncanny_values |access-date=October 2019|title=MAK Wien - MAK Museum Wien}}</ref> The Ars Electronica's 2019 festival "Out of the box" extensively thematized the role of arts for a sustainable societal transformation with AI.<ref name="European Platform for Digital Humanism">{{Cite web|url=https://ars.electronica.art/outofthebox/en/digital-humanism-conf/ |access-date=September 2019}}</ref>

Artificial Intelligence has inspired numerous creative applications including its usage to produce visual art. The exhibition "Thinking Machines: Art and Design in the Computer Age, 1959–1989" 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 "Unhuman: Art in the Age of AI," 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 "Out of the box" extensively thematized the role of arts for a sustainable societal transformation with AI.

人工智能激发了许多创造性的应用，包括它在视觉艺术中的应用。在纽约现代艺术博物馆举办的“思考机器: 计算机时代的艺术与设计，1959-1989”展览为艺术、建筑和设计中人工智能的历史应用提供了一个很好的概述。最近的展览展示了人工智能在艺术创作中的应用，包括谷歌赞助的旧金山灰色地带基金会(Gray Area Foundation)的慈善拍卖会，艺术家们在那里尝试了 DeepDream 算法，以及2017年秋天在洛杉矶和法兰克福举办的“非人类: 人工智能时代的艺术”展览。2018年春天，计算机协会专门发行了一期特刊，主题是计算机和艺术，突出了机器学习在艺术中的作用。奥地利电子艺术博物馆和维也纳应用艺术博物馆于2019年开设了人工智能展览。电子艺术节2019年的“跳出框框”广泛地主题化了艺术在可持续社会转型中的作用与人工智能。

== Philosophy and ethics ==

== Philosophy and ethics ==

哲学和伦理学

{{Main|Philosophy of artificial intelligence|Ethics of artificial intelligence}}

There are three philosophical questions related to AI:

There are three philosophical questions related to AI:

有三个与人工智能相关的哲学问题:

# 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?

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?

人工智能是可能的吗？机器能解决任何人类能用智能解决的问题吗？或者一台机器所能完成的事情是否有严格的限制？

# Are intelligent machines dangerous? How can we ensure that machines behave ethically and that they are used ethically?

Are intelligent machines dangerous? How can we ensure that machines behave ethically and that they are used ethically?

智能机器危险吗？我们怎样才能确保机器的行为符合道德规范，并且它们的使用符合道德规范？

# 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?

Can a machine have a mind, consciousness and mental states in exactly the same sense that human beings do? Can a machine be sentient, and thus deserve certain rights? Can a machine intentionally cause harm?

机器能否拥有与人类完全相同的思维、意识和精神状态？一台机器是否具有感知能力，因此值得拥有某些权利？机器会故意造成伤害吗？

=== The limits of artificial general intelligence ===

=== The limits of artificial general intelligence ===

人工智能的局限性

{{Main|Philosophy of AI|Turing test|Physical symbol systems hypothesis|Dreyfus' critique of AI|The Emperor's New Mind|AI effect}}

Can a machine be intelligent? Can it "think"?

Can a machine be intelligent? Can it "think"?

机器是智能的吗？它能“思考”吗？

;''[[Computing Machinery and Intelligence|Alan Turing's "polite convention"]]'': We need not decide if a machine can "think"; 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]].<ref name="Turing test"/>

Alan Turing's "polite convention": We need not decide if a machine can "think"; 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.

阿兰 · 图灵的“礼貌惯例” : 我们不需要决定一台机器是否可以“思考” ; 我们只需要决定一台机器是否可以像人一样聪明地行动。这种解决与人工智能相关的哲学问题的方法构成了图灵测试的基础。

;''The [[Dartmouth Workshop|Dartmouth proposal]]'': "Every aspect of learning or any other feature of intelligence can be so precisely described that a machine can be made to simulate it." This conjecture was printed in the proposal for the Dartmouth Conference of 1956.<ref name="Dartmouth proposal"/>

The Dartmouth proposal: "Every aspect of learning or any other feature of intelligence can be so precisely described that a machine can be made to simulate it." This conjecture was printed in the proposal for the Dartmouth Conference of 1956.

达特茅斯学院的建议是: “学习的每一个方面或智能的任何其他特征都可以被精确地描述，以至于一台机器可以被用来模拟它。”这个猜想被印在1956年达特茅斯学院会议的提案中。

;''[[Physical symbol system|Newell and Simon's physical symbol system hypothesis]]'': "A physical symbol system has the necessary and sufficient means of general intelligent action." Newell and Simon argue that intelligence consists of formal operations on symbols.<ref name="Physical symbol system hypothesis"/> [[Hubert Dreyfus]] argued that, on the contrary, human expertise depends on unconscious instinct rather than conscious symbol manipulation and on having a "feel" for the situation rather than explicit symbolic knowledge. (See [[Dreyfus' critique of AI]].)<ref>

Newell and Simon's physical symbol system hypothesis: "A physical symbol system has the necessary and sufficient means of general intelligent action." 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 "feel" for the situation rather than explicit symbolic knowledge. (See Dreyfus' critique of AI.)<ref>

纽威尔和西蒙的物理符号系统假说: “物理符号系统具有一般智能行为的必要和充分的手段。”纽厄尔和西蒙认为，智力是由符号的形式运算组成的。休伯特 · 德雷福斯认为，恰恰相反，人类的专业知识依赖于无意识的本能，而不是有意识的符号操纵，并且依赖于对情况的“感觉” ，而不是明确的符号知识。(见德雷福斯对人工智能的批评。)

Dreyfus criticized the [[necessary and sufficient|necessary]] condition of the [[physical symbol system]] hypothesis, which he called the "psychological assumption": "The mind can be viewed as a device operating on bits of information according to formal rules." {{Harv|Dreyfus|1992|p=156}}</ref><ref name="Dreyfus' critique"/>

Dreyfus criticized the necessary condition of the physical symbol system hypothesis, which he called the "psychological assumption": "The mind can be viewed as a device operating on bits of information according to formal rules." </ref>

德莱弗斯批评了物理符号系统假设的必要条件，他称之为“心理假设” : “头脑可以被看作是一种按照形式规则操作信息位的装置。”/ 参考

;''Gödelian arguments'': [[Gödel]] himself,<ref name="Gödel himself"/> [[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 "Gödel statements" and therefore have computational abilities beyond that of mechanical Turing machines.<ref name="The mathematical objection"/> However, some people do not agree with the "Gödelian arguments".<ref>{{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}}</ref><ref>{{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}}</ref><ref>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': "The accepted wisdom (with which I concur) is that the Lucas-Penrose arguments fail."</ref>

Gödelian arguments: Gödel himself,

德利安的论点: 德尔本人,

;''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.<ref name="Brain simulation"/>

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.

人工大脑的论点: 大脑可以被机器模拟，因为大脑是智能的，模拟的大脑也必须是智能的; 因此机器可以是智能的。汉斯 · 莫拉维克、雷 · 库兹韦尔和其他人认为，在技术上直接将大脑复制到硬件和软件是可行的，而且这种模拟将基本上与原始模拟相同。

;''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 "real" intelligence after all; thus "real" intelligence is whatever intelligent behavior people can do that machines still cannot. This is known as the AI Effect: "AI is whatever hasn't been done yet."

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 "real" intelligence after all; thus "real" intelligence is whatever intelligent behavior people can do that machines still cannot. This is known as the AI Effect: "AI is whatever hasn't been done yet."

人工智能效应: 机器本来就是智能的，但是观察者却没有意识到这一点。当深蓝在国际象棋比赛中击败加里 · 卡斯帕罗夫时，机器正在聪明地行动。然而，旁观者通常对人工智能程序的行为不屑一顾，认为它根本不是“真正的”智能; 因此，“真正的”智能就是人类能够做到的任何智能行为，而机器仍然做不到。这就是众所周知的人工智能效应: “人工智能就是一切尚未完成的事情。"

=== Potential harm{{anchor|Potential_risks_and_moral_reasoning}} ===

=== Potential harm ===

=== Potential harm ===

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.<ref>Russel, Stuart., Daniel Dewey, and Max Tegmark. Research Priorities for Robust and Beneficial Artificial Intelligence. AI Magazine 36:4 (2015). 8 December 2016.</ref>

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.

人工智能的广泛使用可能会产生危险或不受欢迎的意外后果。生命未来研究所(Future of Life Institute)等机构的科学家介绍了一些短期研究目标，以了解人工智能如何影响经济、涉及人工智能的法律和道德规范，以及如何将人工智能的安全风险降到最低。从长远来看，科学家们建议继续优化功能，同时最小化伴随新技术而来的可能的安全风险。

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.<ref>{{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}}</ref> Irakli Beridze, Head of the Centre for Artificial Intelligence and Robotics at UNICRI, United Nations, has expressed that "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."<ref>{{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}}</ref>

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 "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."

人工智能和自动化的潜在负面影响是杨2020年美国总统竞选的一个主要问题。联合国 UNICRI 人工智能和机器人中心主任 Irakli Beridze 表示: ”我认为，从我的观点来看，人工智能的危险应用是犯罪分子或大型恐怖组织利用人工智能破坏大型流程或只是造成纯粹的伤害。(恐怖分子可能通过数字战争造成伤害) ，或者可能是机器人、无人机、人工智能以及其他可能非常危险的东西的结合。当然，其他风险也来自失业这样的事情。如果我们有大量的人失去工作，而且没有找到解决方案，这将是极其危险的。像致命的自主武器系统这样的东西应该得到适当的管理，否则就会有大量的滥用的可能。”

==== Existential risk ====

==== Existential risk ====

世界末日

{{Main|Existential risk from artificial general intelligence}}

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 "[[Global catastrophic risk|spell the end of the human race]]".<ref>{{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}}</ref><ref name="Holley">{{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}}</ref><ref>{{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}}</ref>

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 "spell the end of the human race".

物理学家斯蒂芬 · 霍金、微软创始人比尔 · 盖茨和 SpaceX 公司创始人埃隆 · 马斯克对人工智能进化到人类无法控制的程度表示担忧，霍金认为这可能“意味着人类的终结”。

{{quote|text=The development of full artificial intelligence could spell the end of the human race. Once humans develop artificial intelligence, it will take off on its own and redesign itself at an ever-increasing rate. Humans, who are limited by slow biological evolution, couldn't compete and would be superseded.|author=[[Stephen Hawking]]<ref>{{Cite news|title = Stephen Hawking warns artificial intelligence could end mankind|url = https://www.bbc.com/news/technology-30290540|accessdate = 30 October 2015|url-status=live|archiveurl = https://web.archive.org/web/20151030054329/http://www.bbc.com/news/technology-30290540|archivedate = 30 October 2015|df = dmy-all|work = [[BBC News]]|date = 2014-12-02|last1 = Cellan-Jones|first1 = Rory}}</ref>}}

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 "electrodes into the facial muscles of humans to cause constant, beaming grins" because that would be an efficient way to achieve its goal of making humans smile.<ref>{{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}}</ref> 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,<ref name="HC">{{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 }}</ref>{{rp|173}} possibly involving [[Reinforcement learning#Inverse reinforcement learning|inverse reinforcement learning]].<ref name="HC"/>{{rp|191–193}}

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 "electrodes into the facial muscles of humans to cause constant, beaming grins" 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.

在《超级智能》一书中，哲学家尼克 · 博斯特罗姆提出了一个论点，即人工智能将对人类构成威胁。他认为，足够智能的人工智能，如果它选择行动的基础上实现一些目标，将表现出收敛的行为，如获取资源或保护自己不被关闭。如果这个人工智能的目标不能完全反映人类的情况，比如一个人工智能被告知要尽可能多地计算圆周率的位数，那么它可能会伤害人类，以便获得更多的资源，或者防止自身被关闭，最终更好地实现目标。博斯特罗姆还强调了向高级人工智能充分传达人类价值观的困难。他用一个假设的例子来说明一个误入歧途的尝试: 给人工智能一个目标，让人类微笑。博斯特罗姆认为，如果这种情况下的人工智能变得超级聪明，它可能会采用大多数人类都会感到恐怖的方法，比如“在人类面部肌肉中插入电极，使其产生持续的笑容” ，因为这将是实现让人类微笑的目标的有效方法。人工智能研究人员 Stuart j. Russell 在他的《人类相容》一书中回应了 Bostrom 的一些担忧，同时也提出了一种开发可证明有益的机器的方法，这种机器着眼于不确定性和对人类的尊重，可能涉及逆强化学习。

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.<ref>{{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}}</ref> The opinion of experts within the field of artificial intelligence is mixed, with sizable fractions both concerned and unconcerned by risk from eventual superhumanly-capable AI.<ref>{{cite journal

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. The opinion of experts within the field of artificial intelligence is mixed, with sizable fractions both concerned and unconcerned by risk from eventual superhumanly-capable AI.<ref>{{cite journal

对人工智能风险的担忧导致了一些备受瞩目的捐赠和投资。包括彼得 · 蒂尔、亚马逊网络服务和马斯克在内的一些知名科技巨头已经向 OpenAI 投入了10亿美元，这是一家旨在支持负责任的人工智能开发的非盈利公司。人工智能领域的专家们的意见不一，有相当一部分人既关心也不关心最终具有超人能力的人工智能带来的风险。文献{ cite journal

|last1 = Müller

|last1 = Müller

|last1 = Müller

|first1 = Vincent C.

|first1 = Vincent C.

第一名: Vincent c。

|last2 = Bostrom

|last2 = Bostrom

2 Bostrom

|first2 = Nick

|first2 = Nick

| first2 Nick

|year = 2014

|year = 2014

2014年

|title = Future Progress in Artificial Intelligence: A Poll Among Experts

|title = Future Progress in Artificial Intelligence: A Poll Among Experts

人工智能的未来发展: 专家调查

|journal = AI Matters

|journal = AI Matters

人工智能的重要性

|volume = 1

|volume = 1

第一卷

|issue = 1

|issue = 1

第一期

|pages = 9–11

|pages = 9–11

第9-11页

|doi = 10.1145/2639475.2639478

|doi = 10.1145/2639475.2639478

10.1145 / 2639475.2639478

|url = http://www.sophia.de/pdf/2014_PT-AI_polls.pdf

|url = http://www.sophia.de/pdf/2014_PT-AI_polls.pdf

Http://www.sophia.de/pdf/2014_pt-ai_polls.pdf

|url-status = live

|url-status = live

状态直播

|archiveurl = https://web.archive.org/web/20160115114604/http://www.sophia.de/pdf/2014_PT-AI_polls.pdf

|archiveurl = https://web.archive.org/web/20160115114604/http://www.sophia.de/pdf/2014_PT-AI_polls.pdf

| archiveurl https://web.archive.org/web/20160115114604/http://www.sophia.de/pdf/2014_pt-ai_polls.pdf

|archivedate = 15 January 2016

|archivedate = 15 January 2016

2016年1月15日

|df = dmy-all

|df = dmy-all

我不会放过你的

}}</ref> Other technology industry leaders believe that artificial intelligence is helpful in its current form and will continue to assist humans. Oracle CEO [[Mark Hurd]] has stated that AI "will actually create more jobs, not less jobs" as humans will be needed to manage AI systems.<ref>{{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}}</ref> Facebook CEO [[Mark Zuckerberg]] believes AI will "unlock a huge amount of positive things," such as curing disease and increasing the safety of autonomous cars.<ref>{{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}}</ref> 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 "grow wisdom with which we manage" the growing power of technology. Musk also funds companies developing artificial intelligence such as [[DeepMind]] and [[Vicarious (company)|Vicarious]] to "just keep an eye on what's going on with artificial intelligence.<ref>{{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}}</ref> I think there is potentially a dangerous outcome there."<ref>{{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}}</ref><ref>{{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}}</ref>

}}</ref> Other technology industry leaders believe that artificial intelligence is helpful in its current form and will continue to assist humans. Oracle CEO Mark Hurd has stated that AI "will actually create more jobs, not less jobs" as humans will be needed to manage AI systems. Facebook CEO Mark Zuckerberg believes AI will "unlock a huge amount of positive things," such as curing disease and increasing the safety of autonomous cars. 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 "grow wisdom with which we manage" the growing power of technology. Musk also funds companies developing artificial intelligence such as DeepMind and Vicarious to "just keep an eye on what's going on with artificial intelligence. I think there is potentially a dangerous outcome there."

其他技术行业的领导者相信人工智能在目前的形式下是有帮助的，并将继续帮助人类。甲骨文首席执行官马克 · 赫德表示，人工智能“实际上将创造更多的就业机会，而不是更少的就业机会” ，因为管理人工智能系统需要人力。Facebook 首席执行官马克 · 扎克伯格相信人工智能将“解锁大量积极的东西” ，比如治愈疾病和提高自动驾驶汽车的安全性。2015年1月，马斯克向未来生命研究所捐赠了1000万美元，用于研究人工智能决策。该研究所的目标是“用智慧来管理”日益增长的技术力量。马斯克还为 DeepMind 和 Vicarious 等开发人工智能的公司提供资金，以“关注人工智能的发展情况”。我认为这可能会产生危险的后果。”

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.<ref>{{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}}</ref><ref>{{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}}</ref> Other counterarguments revolve around humans being either intrinsically or convergently valuable from the perspective of an artificial intelligence.<ref>{{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}}</ref>

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.

为了实现不受控制的先进人工智能的危险，假设的人工智能必须超越或超越整个人类，一小部分专家认为这种可能性在未来足够遥远，不值得研究。其他反对意见则围绕着从人工智能的角度来看，人类要么具有内在价值，要么具有可交流的价值。

==== Devaluation of humanity ====

==== Devaluation of humanity ====

人性的贬值

{{Main|Computer Power and Human Reason}}

[[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]]<ref>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}}</ref> 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.<ref name="Weizenbaum's critique"/>

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.

写道，根据定义，人工智能应用程序不能成功地模拟真正的人类移情，并且在诸如客户服务或心理治疗等领域使用人工智能技术是被严重误导的约瑟夫·维森鲍姆。韦岑鲍姆还对人工智能研究人员(以及一些哲学家)愿意将人类思维视为一个计算机程序(现在称为计算主义)而感到困扰。对魏岑鲍姆来说，这些观点表明人工智能研究贬低了人类的生命价值。

====Social justice====

====Social justice====

社会正义

{{further|Algorithmic bias}}

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.<ref>{{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}}</ref> Support for artificial intelligence is higher among men (with 47% approving) than women (35% approving).

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).

人们担心的一个问题是，人工智能程序可能会对某些群体存在偏见，比如女性和少数民族，因为大多数开发者都是富有的白人男性。男性对人工智能的支持率(47%)高于女性(35%)。

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.<ref name="propublica.org">{{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}}</ref> COMPAS (an acronym for Correctional Offender Management Profiling for Alternative Sanctions) counts among the most widely utilized commercially available solutions.<ref name="propublica.org"/> 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.<ref name="propublica.org"/>

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.

算法在今天的法律体系中已经有了大量的应用，它们可以帮助从法官到假释官员和公设辩护人的官员们评估被告再次犯罪的可能性。Compas (替代制裁惩教罪犯管理特征分析的首字母缩写)是商业上使用最广泛的解决办法之一。有人建议，COMPAS 将非常高的累犯风险分配给黑人被告，而相反，将低风险估计分配给白人被告的频率明显高于统计预期。

==== Decrease in demand for human labor ====

==== Decrease in demand for human labor ====

减少对人力劳动的需求

{{Further|Technological unemployment#21st century}}

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.<ref>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)]</ref> Unlike previous waves of automation, many middle-class jobs may be eliminated by artificial intelligence; ''[[The Economist]]'' states that "the worry that AI could do to white-collar jobs what steam power did to blue-collar ones during the Industrial Revolution" is "worth taking seriously".<ref>{{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}}</ref> Subjective estimates of the risk vary widely; for example, Michael Osborne and [[Carl Benedikt Frey]] estimate 47% of U.S. jobs are at "high risk" of potential automation, while an OECD report classifies only 9% of U.S. jobs as "high risk".<ref>{{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}}</ref><ref>{{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}}</ref><ref>Arntz, Melanie, Terry Gregory, and Ulrich Zierahn. "The risk of automation for jobs in OECD countries: A comparative analysis." OECD Social, Employment, and Migration Working Papers 189 (2016). p. 33.</ref> 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.<ref>{{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}}</ref> 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 "accessible to people with average capability", even with retraining. Economists point out that in the past technology has tended to increase rather than reduce total employment, but acknowledge that "we're in uncharted territory" with AI.<ref name="guardian jobs debate">{{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}}</ref>

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 "the worry that AI could do to white-collar jobs what steam power did to blue-collar ones during the Industrial Revolution" is "worth taking seriously". Subjective estimates of the risk vary widely; for example, Michael Osborne and Carl Benedikt Frey estimate 47% of U.S. jobs are at "high risk" of potential automation, while an OECD report classifies only 9% of U.S. jobs as "high risk". 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 "accessible to people with average capability", even with retraining. Economists point out that in the past technology has tended to increase rather than reduce total employment, but acknowledge that "we're in uncharted territory" with AI.

自动化与就业的关系是复杂的。自动化在消除旧工作的同时，也通过微观经济和宏观经济效应创造了新的就业机会。与以往的自动化浪潮不同，许多中产阶级的工作可能会被人工智能淘汰; 《经济学人》指出，“人工智能对白领工作的影响，就像工业革命时期蒸汽动力对蓝领工作的影响一样，值得认真对待”。对风险的主观估计差别很大，例如，迈克尔 · 奥斯本和卡尔 · 贝内迪克特 · 弗雷估计，美国47% 的工作是潜在自动化的“高风险” ，而经合组织的报告仅将美国9% 的工作分类为“高风险”——见报告第33页表4; 9% 是经合组织的平均水平和美国的平均水平——工作是“高风险”。从律师助理到快餐厨师等职业都面临着极大的风险，而从个人医疗保健到神职人员等护理相关职业的就业需求可能会增加。作家马丁•福特(Martin Ford)和其他人进一步指出，许多工作都是常规的、重复的，(对人工智能而言)是可以预测的。福特警告称，这些工作可能在未来几十年内实现自动化，而且即便进行再培训，许多新工作也可能“无法让能力一般的人获得”。经济学家指出，在过去，技术往往会增加而不是减少总就业人数，但他们承认，人工智能“正处于未知领域”。

==== Autonomous weapons ====

==== Autonomous weapons ====

自动化武器

{{See also|Lethal autonomous weapon}}

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.<ref>{{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}}</ref>

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.

目前，包括美国、中国、俄罗斯和英国在内的50多个国家正在研究战场机器人。许多人担心来自超级智能人工智能的风险，也希望限制人造士兵和无人机的使用。

=== Ethical machines ===

=== Ethical machines ===

道德的机器

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.<ref>{{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}}</ref> Research in this area includes [[machine ethics]], [[artificial moral agents]], [[friendly AI]] and discussion towards building a [[human rights]] framework is also in talks.<ref>{{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}}</ref>

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.

具有智能的机器有潜力利用它们的智能来防止伤害和减少风险; 它们可能有能力利用伦理推理来更好地选择它们在世界上的行动。因此，有必要制定政策，为人工智能和机器人制定和规范政策。这一领域的研究包括机器伦理学、人工道德代理、友好的人工智能以及关于建立人权框架的讨论也正在进行。

==== Artificial moral agents ====

==== Artificial moral agents ====

人为的道德行为者

Wendell Wallach introduced the concept of [[artificial moral agents]] (AMA) in his book ''Moral Machines''<ref>Wendell Wallach (2010). ''Moral Machines'', Oxford University Press.</ref> 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 "Does Humanity Want Computers Making Moral Decisions"<ref>Wallach, pp 37–54.</ref> and "Can (Ro)bots Really Be Moral".<ref>Wallach, pp 55–73.</ref> 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.<ref>Wallach, Introduction chapter.</ref>

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 "Does Humanity Want Computers Making Moral Decisions" and "Can (Ro)bots Really Be Moral". 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.

温德尔•沃勒克(Wendell Wallach)在他的著作《沃勒克的道德机器》(Moral Machines For Wallach)中提出了人工道德代理人(AMA)的概念，在这两个核心问题的指导下，AMA 已经成为人工智能研究领域的一部分。他将这两个核心问题定义为“人类是否希望计算机做出道德决策”和“。对于 Wallach 来说，这个问题并不集中在机器是否能够证明道德行为的等价性，与社会可能对研究性行为的发展施加的限制形成对比。

==== Machine ethics ====

==== Machine ethics ====

机器伦理学

{{Main|Machine ethics}}

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.<ref name="autogenerated1">Michael Anderson and Susan Leigh Anderson (2011), Machine Ethics, Cambridge University Press.</ref> The field was delineated in the AAAI Fall 2005 Symposium on Machine Ethics: "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."<ref name="autogenerated2">{{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 }}</ref> 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 "Machine Ethics"<ref name="autogenerated1"/> that stems from the AAAI Fall 2005 Symposium on Machine Ethics.<ref name="autogenerated2"/>

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: "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." 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 "Machine Ethics" that stems from the AAAI Fall 2005 Symposium on Machine Ethics.

机器伦理学领域关注的是给予机器伦理原则，或者一种程序，用于发现一种解决它们可能遇到的伦理困境的方法，使它们能够通过自己的伦理决策以一种伦理上负责任的方式运作。2005年美国科学促进会秋季机器伦理学专题讨论会阐述了这一领域: ”过去关于技术与伦理学之间关系的研究主要侧重于人类负责任和不负责任地使用技术，少数人对人类应当如何对待机器感兴趣。在所有情况下，只有人类参与了伦理推理。现在是时候给至少一些机器增加一个道德层面了。认识到涉及机器的行为的道德后果，以及机器自主性的最新和潜在发展，使这成为必要。与计算机黑客行为、软件产权问题、隐私问题和其他通常归因于计算机道德的主题不同，机器道德关注的是机器对人类用户和其他机器的行为。机器伦理学的研究是减轻人们对自主系统担忧的关键ーー可以说，没有这种维度的自主机器概念是人们对机器智能担忧的根源。此外，对机器伦理学的研究可以发现当前伦理学理论的问题，推进我们对伦理学的思考。”机器伦理学有时被称为机器道德、计算伦理学或计算伦理学。这个新兴领域的各种观点可以在 AAAI 秋季2005年机器伦理学研讨会上收集的“机器伦理学”版本中找到。

==== Malevolent and friendly AI ====

==== Malevolent and friendly AI ====

邪恶而友好的人工智能

{{Main|Friendly AI}}

Political scientist [[Charles T. Rubin]] believes that AI can be neither designed nor guaranteed to be benevolent.<ref>{{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}}</ref> He argues that "any sufficiently advanced benevolence may be indistinguishable from malevolence." 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.

Political scientist Charles T. Rubin believes that AI can be neither designed nor guaranteed to be benevolent. He argues that "any sufficiently advanced benevolence may be indistinguishable from malevolence." 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.

政治科学家查尔斯 · 鲁宾认为，人工智能既不能被设计，也不能保证是仁慈的。他认为“任何足够先进的善行可能与恶意难以区分。”人类不应该假设机器或机器人会对我们好，因为没有先验的理由相信他们会同情我们的道德体系，这个体系是随着我们特定的生物进化而来的(人工智能不会同意这一点)。超智能软件可能不一定决定支持人类的继续存在，并且将极难停止。最近学术出版物也开始讨论这个话题，认为它是对文明、人类和地球造成风险的真正来源。

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.

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.

解决这个问题的一个建议是确保第一个普遍具有智能的人工智能是“友好的人工智能” ，并能够随后控制已发展的人工智能。一些人质疑这种检查是否真的能够保持不变。

Leading AI researcher [[Rodney Brooks]] writes, "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."<ref>{{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}}</ref>

Leading AI researcher Rodney Brooks writes, "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."

首席人工智能研究员罗德尼 · 布鲁克斯写道: “我认为担心我们在未来几百年的任何时候发展出恶毒的人工智能都是错误的。我认为，这种担忧源于一个根本性的错误，即没有区分人工智能某个特定方面非常现实的最新进展与构建有意识的意志智能的艰巨性和复杂性之间的区别。”

=== Machine consciousness, sentience and mind ===

=== Machine consciousness, sentience and mind ===

机器意识、知觉和思维

{{Main|Artificial consciousness}}

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]].

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.

如果一个人工智能系统复制了人类智能的所有关键方面，那么这个系统是否也具有感知能力ーー它是否有一个拥有有意识经验的头脑？这个问题与人类意识本质的哲学问题密切相关，一般称之为意识的难题。

==== Consciousness ====

==== Consciousness ====

意识

{{Main|Hard problem of consciousness|Theory of mind}}

[[David Chalmers]] identified two problems in understanding the mind, which he named the "hard" and "easy" problems of consciousness.<ref name=Chalmers>{{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]

David Chalmers identified two problems in understanding the mind, which he named the "hard" and "easy" problems of consciousness.<ref name=Chalmers> See also [http://consc.net/papers/facing.html this link]

大卫 · 查尔默斯在理解心智方面提出了两个问题，他称之为意识的“困难”和“容易”问题。参考文献名称 chalmers 查看 http://consc.net/papers/facing.html 链接

</ref> 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.

</ref> 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.

简单的问题是理解大脑如何处理信号，制定计划和控制行为。困难的问题是如何解释这种感觉或者为什么它应该感觉像任何东西。人类的信息处理过程很容易解释，然而人类的感质却很难解释。

For example, consider what happens when a person is shown a color swatch and identifies it, saying "it's red". 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.

For example, consider what happens when a person is shown a color swatch and identifies it, saying "it's red". 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.

例如，考虑当一个人看到一个颜色样本并识别它，说“它是红色的”时会发生什么。这个简单的问题只需要理解大脑中的机制，使一个人有可能知道色块是红色的。困难的问题是，人们还知道其他一些东西ーー他们也知道红色是什么样子。(想象一下，一个天生失明的人，即使不知道红色是什么样子，也能知道什么是红色。)每个人都知道感质的存在，因为他们每天都这样做(例如，所有视力正常的人都知道红色是什么样子)。困难的问题是解释大脑如何创造它，为什么它存在，以及它如何不同于知识和大脑的其他方面。

==== Computationalism and functionalism ====

==== Computationalism and functionalism ====

计算主义和功能主义

{{Main|Computationalism|Functionalism (philosophy of mind)}}

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.<ref>[[Steven Horst|Horst, Steven]], (2005) [http://plato.stanford.edu/entries/computational-mind/ "The Computational Theory of Mind"] in ''The Stanford Encyclopedia of Philosophy''</ref> 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]].

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.

计算主义是心智哲学的立场，认为人类心智或人类大脑(或两者)是一个信息处理系统，思维是一种计算形式。计算主义认为，思想和身体之间的关系与软件和硬件之间的关系是相似或相同的，因此可能是一个解决方案的心身二分法。这一哲学立场的灵感来自于20世纪60年代人工智能研究人员和认知科学家的工作，最初由哲学家杰里 · 福多和希拉里 · 普特南提出。

==== Strong AI hypothesis ====

==== Strong AI hypothesis ====

强人工智能假说

{{Main|Chinese room}}

The philosophical position that [[John Searle]] has named [[strong AI hypothesis|"strong AI"]] states: "The appropriately programmed computer with the right inputs and outputs would thereby have a mind in exactly the same sense human beings have minds."<ref name="Searle's strong AI"/> Searle counters this assertion with his [[Chinese room]] argument, which asks us to look ''inside'' the computer and try to find where the "mind" might be.<ref name="Chinese room"/>

The philosophical position that John Searle has named "strong AI" states: "The appropriately programmed computer with the right inputs and outputs would thereby have a mind in exactly the same sense human beings have minds." Searle counters this assertion with his Chinese room argument, which asks us to look inside the computer and try to find where the "mind" might be.

约翰 · 塞尔称之为“强人工智能”的哲学立场指出: “具有正确输入和输出的适当程序计算机，将因此拥有与人类拥有头脑完全相同的意义上的头脑。”塞尔用他的中文房间论点反驳了这种说法，他要求我们看看电脑内部，并试图找出“思维”可能在哪里。

==== Robot rights ====

==== Robot rights ====

机器人的权利

{{Main|Robot rights}}

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 "[[robot rights]]", is currently being considered by, for example, California's [[Institute for the Future]], although many critics believe that the discussion is premature.<ref name="Robot rights"/> Some critics of [[transhumanism]] argue that any hypothetical robot rights would lie on a spectrum with [[animal rights]] and human rights. <ref Name="Evans 2015">{{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 }}</ref> The subject is profoundly discussed in the 2010 documentary film ''[[Plug & Pray]]'',<ref>{{cite web|url=http://www.plugandpray-film.de/en/content.html|title=Content: Plug & 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}}</ref> 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 "become human", and the robotic holograms in Voyager.

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 "robot rights", 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 & 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 "become human", and the robotic holograms in Voyager.

如果可以创造出一台有智能的机器，那么它是否也有感觉呢？如果它有感觉，它是否拥有与人类同样的权利？这个问题，现在被称为“机器人权利” ，目前正在考虑，例如，加利福尼亚的未来研究所，尽管许多批评家认为这种讨论为时过早。2010年的纪录片《即插即祈》(Plug & Pray)以及《星际迷航: 下一代》(Star Trek Next Generation)等许多科幻媒体都对这个主题进行了深入讨论。这些媒体的角色是指挥官戴塔(Data) ，他为了研究而反抗被拆解，并希望“变成人类” ，还有旅行者号上的机器人全息图。

=== Superintelligence ===

=== Superintelligence ===

超级智能

{{Main|Superintelligence}}

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.<ref name="Roberts"/>

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.

智能机器——或者说人机混合体——能达到的程度有限吗？超级智能、超级智能或者超人智能是一种假想的智能体，它拥有的智能远远超过最聪明、最有天赋的人类智慧。超级智能也可以指这种智能体所拥有的智能的形式或程度。

==== Technological singularity ====

==== Technological singularity ====

技术奇异点

{{Main|Technological singularity|Moore's law}}

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]].<ref name="recurse"/> The new intelligence could thus increase exponentially and dramatically surpass humans. Science fiction writer [[Vernor Vinge]] named this scenario "[[technological singularity|singularity]]".<ref name=Singularity/> 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.<ref name=Singularity/><ref name="Roberts"/>

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 "singularity". 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.

如果对强大人工智能的研究产生了足够智能的软件，那么它也许能够重新编程并改进自己。改进后的软件甚至可以更好地改进自己，从而实现递归的自我改进。这种新的智能因此可以呈指数增长，并大大超过人类。科幻作家 Vernor Vinge 将这种情况命名为“奇点”。本世纪技术奇异点，技术的加速发展将导致一种失控的后果，即人工智能将超越人类智力和控制能力，从而彻底改变甚至终结文明。因为这样的情报的能力可能是不可能理解的，技术奇异点是一个发生的事件是不可预测的，甚至是深不可测的。

[[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.<ref name=Singularity/>

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.

雷 · 库兹韦尔利用摩尔定律(描述了数字技术无情的指数增长)计算出，到2029年，台式电脑的处理能力将与人类大脑相当，并预测奇点将出现在2045年。

==== Transhumanism ====

==== Transhumanism ====

超人主义

{{Main|Transhumanism}}

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.<ref name="Transhumanism"/> This idea, called [[transhumanism]], has roots in [[Aldous Huxley]] and [[Robert Ettinger]].

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.

机器人设计师汉斯 · 莫拉维克、控制论专家凯文 · 沃里克和发明家雷 · 库兹韦尔预言，人类和机器将在未来合并成为比两者都更有能力和力量的半机器人。这种观点被称为“超人主义”(transhumanism) ，起源于 Aldous Huxley 和罗伯特•艾廷格(Robert Ettinger)。

[[Edward Fredkin]] argues that "artificial intelligence is the next stage in evolution", an idea first proposed by [[Samuel Butler (novelist)|Samuel Butler]]'s "[[Darwin among the Machines]]" as far back as 1863, and expanded upon by [[George Dyson (science historian)|George Dyson]] in his book of the same name in 1998.<ref name="AI as evolution"/>

Edward Fredkin argues that "artificial intelligence is the next stage in evolution", an idea first proposed by Samuel Butler's "Darwin among the Machines" as far back as 1863, and expanded upon by George Dyson in his book of the same name in 1998.

爱德华•弗雷德金(Edward Fredkin)认为，“人工智能是进化的下一个阶段”。早在1863年，塞缪尔•巴特勒(Samuel Butler)的《机器中的达尔文》(Darwin among the Machines)就首次提出了这一观点，乔治•戴森(George Dyson)在1998年的同名著作中对其进。

== Economics ==

== Economics ==

经济学

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]].<ref>{{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}}</ref> A February 2020 European Union white paper on artificial intelligence advocated for artificial intelligence for economic benefits, including "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", while acknowledging potential risks.<ref name=":1" />

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 "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", while acknowledging potential risks.

人工智能的长期经济效应是不确定的。一项针对经济学家的调查显示，对于机器人和人工智能的日益使用是否会导致长期失业率大幅上升，人们的意见存在分歧。但他们普遍认为，如果生产率提高的成果得到重新分配，这可能是一。2020年2月，欧盟发表了一份关于人工智能的白皮书，主张为了经济利益而使用人工智能，其中包括“改善医疗保健(例如:。使诊断更加精确，能够更好地预防疾病) ，提高耕作效率，有助于减缓和适应气候变化，(以及)通过预测性维护提高生产系统的效率” ，同时承认潜在风险。

== Regulation ==

== Regulation ==

规例

{{Main|Regulation of artificial intelligence|Regulation of algorithms}}

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.<ref>{{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}}</ref> In 2017 [[Elon Musk]] called for regulation of AI development.<ref>{{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}}</ref> Multiple states now have national policies under development or in place,<ref>{{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=}}</ref> and in February 2020, the European Union published its draft strategy paper for promoting and regulating AI.<ref name=":12">{{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}}</ref>

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.

为鼓励人工智能和管理相关风险，制定促进和规范人工智能的公共部门政策被认为是必要的，但具有挑战性。2017年，埃隆 · 马斯克呼吁监管人工智能的发展。多个国家现在正在制定或实施国家政策，2020年2月，欧洲联盟公布了促进和管理人工智能的战略文件草案。

== In fiction ==

== In fiction ==

在小说里

{{Main|Artificial intelligence in fiction}}

[[File:Capek play.jpg|thumb|The word "robot" itself was coined by [[Karel Čapek]] in his 1921 play ''[[R.U.R.]]'', the title standing for "[[Rossum's Universal Robots]]"]]

The word "robot" itself was coined by [[Karel Čapek in his 1921 play R.U.R., the title standing for "Rossum's Universal Robots"]]

“机器人”这个词本身是由[[ Karel apek 在他1921年的戏剧《 r.u.r. 》中创造的，这部戏剧的名字代表“ Rossum 的万能机器人”]

Thought-capable artificial beings appeared as storytelling devices since antiquity,<ref name="AI in myth"/>

Thought-capable artificial beings appeared as storytelling devices since antiquity,

有思想能力的人造生物自古以来就作为讲故事的工具出现,

and have been a persistent theme in [[science fiction]].

and have been a persistent theme in science fiction.

一直是科幻小说中的一个永恒主题。

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.<ref>{{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}}</ref>

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.

在这些作品中，一个常见的比喻开始于玛丽 · 雪莱的《弗兰肯斯坦》，在这部作品中，人类的创造物成为了对其主人的威胁。这些作品包括《亚瑟·查理斯·克拉克斯坦利 · 库布里克的《2001: 太空漫游》(2001: a Space Odyssey，都是1968年出品) ，包括哈尔9000(HAL 9000) ，负责发现一号飞船的凶残计算机，以及《终结者》(The Terminator，1984)和《黑客帝国》(The Matrix，1999)。相比之下，像《地球停止转动的日子》(1951)中的格特和《异形》(1986)中的主教这样罕见的忠诚机器人在流行文化中就不那么突出了。

[[Isaac Asimov]] introduced the [[Three Laws of Robotics]] in many books and stories, most notably the "Multivac" series about a super-intelligent computer of the same name. Asimov's laws are often brought up during lay discussions of machine ethics;<ref>Anderson, Susan Leigh. "Asimov's "three laws of robotics" and machine metaethics." AI & Society 22.4 (2008): 477–493.</ref> 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.<ref>{{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}}</ref>

Isaac Asimov introduced the Three Laws of Robotics in many books and stories, most notably the "Multivac" 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.

艾萨克 · 阿西莫夫在许多书籍和故事中介绍了机器人三定律，最著名的是关于同名的超级智能计算机的“ multitvac”系列。几乎所有的人工智能研究人员都通过流行文化熟悉阿西莫夫的法律，他们通常认为这些法律因为许多原因而无用，其中一个原因就是它们的模糊性。

[[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 "the Gynoids" 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.

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 "the Gynoids" 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.

漫画《攻壳机动队和科幻小说《沙丘》探讨了超人类主义(人类和机器的结合)。20世纪80年代，艺术家 Hajime Sorayama 的性感机器人系列在日本绘制并出版，描绘了真实的有机人类形体，拥有栩栩如生的金属肌肉皮肤，后来又出版了《雌蕊》一书，该书被乔治 · 卢卡斯等电影制作人使用或影响。Sorayama 从来没有认为这些有机机器人是真实的自然的一部分，但总是非自然的产品的人类心灵，一个幻想存在于头脑中，甚至当实际形式实现。

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.<ref>{{Cite journal|last=Galvan|first=Jill|date=1 January 1997|title=Entering the Posthuman Collective in Philip K. Dick's "Do Androids Dream of Electric Sheep?"|journal=Science Fiction Studies|volume=24|issue=3|pages=413–429|jstor=4240644}}</ref>

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.

一些作品使用人工智能迫使我们面对是什么让我们成为人类这一根本问题，向我们展示了人工智能，它们有感知的能力，因此也有受苦的能力。这出现在卡雷尔 · 阿佩克的电影《人工智能》中。人工智能和机器人，以及菲利普 · k · 迪克的小说《机器人会梦见电子羊吗? 》。迪克认为，我们对人类主观性的理解被人工智能创造的技术所改变。

{{div col end}}

==See also==

==See also==

参见

{{portal|Computer programming}}

{{col div|colwidth=20em}}

* [[Abductive reasoning]]

* ''[[A.I. Rising]]''

* [[Artificial intelligence arms race]]

* [[Behavior selection algorithm]]

* [[Business process automation]]

* [[Case-based reasoning]]

* [[Citizen science#Plastics and pollution|Citizen Science]]

* [[Commonsense reasoning]]

* [[Emergent algorithm]]

* [[Evolutionary computation]]

* [[Female gendering of AI technologies]]

* [[Glossary of artificial intelligence]]

* [[Machine learning]]

* [[Mathematical optimization]]

* [[Multi-agent system]]

* [[Personality computing]]

* [[Regulation of artificial intelligence]]

* [[Robotic process automation]]

* [[Universal basic income]]

* [[Weak AI]]

{{colend}}

== Explanatory notes ==

== Explanatory notes ==

解释说明

{{notelist}}

== References ==

== References ==

参考资料

{{reflist|30em|refs=

{{reflist|30em|refs=

{通货再膨胀 | 30em | 参考文献





-- 引言——————————————————————————————————————————————————————————————————————————————

<ref name="Definition of AI">

<ref name="Definition of AI">

”人工智能的定义”

Definition of AI as the study of [[intelligent agents]]:

Definition of AI as the study of intelligent agents:

将人工智能定义为对智能体的研究:

* {{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 "computational intelligence" as a synonym for artificial intelligence.

* {{Harvtxt|Russell|Norvig|2003}} (who prefer the term "rational agent") and write "The whole-agent view is now widely accepted in the field" {{Harv|Russell|Norvig|2003|p=55}}.

* {{Harvnb|Nilsson|1998}}





这些教科书是学术上使用最广泛的

* {{Harvnb|Legg|Hutter|2007}}.

</ref>

</ref>

/ 参考



</ref> -->

/ ref --



</ref> -->

/ ref --

<ref name="McCorduck's thesis">

<ref name="McCorduck's thesis">

「麦考达克的论文」

This is a central idea of [[Pamela McCorduck]]'s ''Machines Who Think''. She writes: "I like to think of artificial intelligence as the scientific apotheosis of a venerable cultural tradition." {{Harv|McCorduck|2004|p=34}} "Artificial intelligence in one form or another is an idea that has pervaded Western intellectual history, a dream in urgent need of being realized." {{Harv|McCorduck|2004|p=xviii}} "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." {{Harv|McCorduck|2004|p=3}} She traces the desire back to its [[Hellenistic]] roots and calls it the urge to "forge the Gods." {{Harv|McCorduck|2004|pp=340–400}}

This is a central idea of Pamela McCorduck's Machines Who Think. She writes: "I like to think of artificial intelligence as the scientific apotheosis of a venerable cultural tradition." "Artificial intelligence in one form or another is an idea that has pervaded Western intellectual history, a dream in urgent need of being realized." "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." She traces the desire back to its Hellenistic roots and calls it the urge to "forge the Gods."

这是帕梅拉 · 麦考达克的《会思考的机器》的中心思想。她写道: “我喜欢把人工智能看作是古老文化传统的科学典范。”“以这样或那样的形式出现的人工智能是一个弥漫在西方思想史上的思想，一个急需实现的梦想。”“我们的历史充满了各种各样的尝试——疯狂的、怪诞的、滑稽的、严肃的、传奇的和真实的——创造人工智能，复制本质上的我们，绕过普通的手段。在神话和现实之间来回穿梭，我们的想象力提供了我们的工作室所不能提供的东西，我们长期以来一直致力于这种奇怪的自我复制形式。”她将这种欲望追溯到希腊化的根源，并称之为“锻造上帝”的冲动

</ref>

</ref>

/ 参考

<ref name="Fragmentation of AI">

<ref name="Fragmentation of AI">

Ai 碎片化运动

Pamela {{Harvtxt|McCorduck|2004|p=424}} writes of "the rough shattering of AI in subfields—vision, natural language, decision theory, genetic algorithms, robotics ... and these with own sub-subfield—that would hardly have anything to say to each other."

Pamela writes of "the rough shattering of AI in subfields—vision, natural language, decision theory, genetic algorithms, robotics ... and these with own sub-subfield—that would hardly have anything to say to each other."

帕梅拉写道，“人工智能在子领域——视觉、自然语言、决策理论、遗传算法、机器人... ... 以及这些有自己子领域的领域——受到了粗暴的打击，彼此之间几乎没有什么可说的。”

</ref>

</ref>

/ 参考

<ref name="Problems of AI">

<ref name="Problems of AI">

Ai 的问题

This list of intelligent traits is based on the topics covered by the major AI textbooks, including:

This list of intelligent traits is based on the topics covered by the major AI textbooks, including:

这个智能特征列表是基于主要的人工智能教科书所涉及的主题，包括:

* {{Harvnb|Russell|Norvig|2003}}

* {{Harvnb|Luger|Stubblefield|2004}}

* {{Harvnb|Poole|Mackworth|Goebel|1998}}

* {{Harvnb|Nilsson|1998}}

</ref>

</ref>

/ 参考

<ref name="General intelligence">

<ref name="General intelligence">

通用情报局

General intelligence ([[artificial general intelligence|strong AI]]) is discussed in popular introductions to AI:

General intelligence (strong AI) is discussed in popular introductions to AI:

一般智能(强人工智能)在人工智能的常见介绍中被讨论:

* {{Harvnb|Kurzweil|1999}} and {{Harvnb|Kurzweil|2005}}

</ref>

</ref>

/ 参考





-- 历史——————————————————————————————————————————————————————————————————————————————————————————————

<ref name="AI in myth">

<ref name="AI in myth">

神话中的人工智能

AI in myth:

AI in myth:

神话中的人工智能:

* {{Harvnb|McCorduck|2004|pp=4–5}}

* {{Harvnb|Russell|Norvig|2003|p=939}}

</ref>

</ref>

/ 参考

<ref name="AI in early science fiction">

<ref name="AI in early science fiction">

早期科幻小说中的人工智能

AI in early science fiction.

AI in early science fiction.

早期科幻小说中的人工智能。

* {{Harvnb|McCorduck|2004|pp=17–25}}

</ref>

</ref>

/ 参考

<ref name="Formal reasoning">

<ref name="Formal reasoning">

”正式推理”

Formal reasoning:

Formal reasoning:

正式推理:

* {{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 }}

</ref>{{page needed|date=December 2016}}

</ref>

/ 参考

<ref name="AI's immediate precursors">

<ref name="AI's immediate precursors">

人工智能的直接前兆

AI's immediate precursors:

AI's immediate precursors:

大赦国际的直接前身是:

* {{Harvnb|McCorduck|2004|pp=51–107}}

* {{Harvnb|Crevier|1993|pp=27–32}}

* {{Harvnb|Russell|Norvig|2003|pp=15, 940}}

* {{Harvnb|Moravec|1988|p=3}}</ref>

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]].<ref name="Dartmouth conference">

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.<ref name="Dartmouth conference">

参见。在奠定人工智能基础的研究人员中，有 Alan Turing，约翰·冯·诺伊曼，Norbert Wiener，Claude Shannon，Warren McCullough，Walter Pitts 和 Donald Hebb。达特茅斯会议」

[[Dartmouth Workshop|Dartmouth conference]]:

Dartmouth conference:

返回文章页面达特茅斯大会:

* {{Harvnb|McCorduck|2004|pp=111–136}}

* {{Harvnb|Crevier|1993|pp=47–49}}, who writes "the conference is generally recognized as the official birthdate of the new science."

* {{Harvnb|Russell|Norvig|2003|p=17}}, who call the conference "the birth of artificial intelligence."

* {{Harvnb|NRC|1999|pp=200–201}}

</ref>

</ref>

/ 参考

<ref name="Hegemony of the Dartmouth conference attendees">

<ref name="Hegemony of the Dartmouth conference attendees">

达特茅斯会议与会者的霸权

Hegemony of the Dartmouth conference attendees:

Hegemony of the Dartmouth conference attendees:

达特茅斯大会与会者的霸权:

* {{Harvnb|Russell|Norvig|2003|p=17}}, who write "for the next 20 years the field would be dominated by these people and their students."

* {{Harvnb|McCorduck|2004|pp=129–130}}

</ref>

</ref>

/ 参考

<ref name="Golden years of AI">

<ref name="Golden years of AI">

黄金人工智能时代

"[[History of AI#The golden years 1956–1974|Golden years]]" of AI (successful symbolic reasoning programs 1956–1973):

"Golden years" of AI (successful symbolic reasoning programs 1956–1973):

人工智能的“黄金年代”(1956-1973年成功的符号推理程序) :

* {{Harvnb|McCorduck|2004|pp=243–252}}

* {{Harvnb|Crevier|1993|pp=52–107}}

* {{Harvnb|Moravec|1988|p=9}}

* {{Harvnb|Russell|Norvig|2003|pp=18–21}}

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]].

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.

所描述的程序有: Arthur Samuel 为 IBM 701设计的检查程序，Daniel Bobrow 的学生，Newell 和 Simon 的逻辑理论家，以及 Terry Winograd 的 SHRDLU。

</ref>

</ref>

/ 参考

<ref name="AI funding in the 60s">

<ref name="AI funding in the 60s">

60年代的人工智能资金

[[DARPA]] pours money into undirected pure research into AI during the 1960s:

DARPA pours money into undirected pure research into AI during the 1960s:

20世纪60年代，美国国防部高级研究计划局(DARPA)将资金投入到对人工智能的无目的的纯粹研究中:

* {{Harvnb|McCorduck|2004|p=131}}

* {{Harvnb|Crevier|1993|pp=51, 64–65}}

* {{Harvnb|NRC|1999|pp=204–205}}

</ref>

</ref>

/ 参考

<ref name="AI in England">

<ref name="AI in England">

在英国的「 ai 」

AI in England:

AI in England:

英国的人工智能:

* {{Harvnb|Howe|1994}}

</ref>

</ref>

/ 参考

<ref name="Optimism of early AI">

<ref name="Optimism of early AI">

早期 ai 的乐观主义

Optimism of early AI:

Optimism of early AI:

早期人工智能的乐观主义:

* [[Herbert A. Simon|Herbert Simon]] quote: {{Harvnb|Simon|1965|p=96}} quoted in {{Harvnb|Crevier|1993|p=109}}.

* [[Marvin Minsky]] quote: {{Harvnb|Minsky|1967|p=2}} quoted in {{Harvnb|Crevier|1993|p=109}}.

</ref>

</ref>

/ 参考

<ref name="First AI winter">

<ref name="First AI winter">

第一 ai 温特”

First [[AI Winter]], [[Mansfield Amendment]], [[Lighthill report]]

First AI Winter, Mansfield Amendment, Lighthill report

第一人工智能冬季，曼斯菲尔德修正案，莱特希尔报告

* {{Harvnb|Crevier|1993|pp=115–117}}

* {{Harvnb|Russell|Norvig|2003|p=22}}

* {{Harvnb|NRC|1999|pp=212–213}}

* {{Harvnb|Howe|1994}}

* {{Harvnb|Newquist|1994|pp=189–201}}

</ref>

</ref>

/ 参考

<ref name="Expert systems">

<ref name="Expert systems">

专家系统”

Expert systems:

Expert systems:

专家系统:

* {{Harvnb|ACM|1998|loc=I.2.1}}

* {{Harvnb|Russell|Norvig|2003|pp=22–24}}

* {{Harvnb|Luger|Stubblefield|2004|pp=227–331}}

* {{Harvnb|Nilsson|1998|loc=chpt. 17.4}}

* {{Harvnb|McCorduck|2004|pp=327–335, 434–435}}

* {{Harvnb|Crevier|1993|pp=145–62, 197–203}}

* {{Harvnb|Newquist|1994|pp=155–183}}

</ref>

</ref>

/ 参考

<ref name="AI in the 80s">

<ref name="AI in the 80s">

80年代的「人工智能」

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]]:

Boom of the 1980s: rise of expert systems, Fifth Generation Project, Alvey, MCC, SCI:

20世纪80年代的繁荣: 专家系统的兴起，第五代计划，Alvey，MCC，SCI:

* {{Harvnb|McCorduck|2004|pp=426–441}}

* {{Harvnb|Crevier|1993|pp=161–162,197–203, 211, 240}}

* {{Harvnb|Russell|Norvig|2003|p=24}}

* {{Harvnb|NRC|1999|pp=210–211}}

* {{Harvnb|Newquist|1994|pp=235–248}}

</ref>

</ref>

/ 参考

<ref name="Second AI winter">

<ref name="Second AI winter">

二 ai 温特”

Second [[AI winter]]:

Second AI winter:

第二个 AI 冬天:

* {{Harvnb|McCorduck|2004|pp=430–435}}

* {{Harvnb|Crevier|1993|pp=209–210}}

* {{Harvnb|NRC|1999|pp=214–216}}

* {{Harvnb|Newquist|1994|pp=301–318}}

</ref>

</ref>

/ 参考

<ref name="Formal methods in AI">

<ref name="Formal methods in AI">

正式的方法在 ai"

Formal methods are now preferred ("Victory of the [[neats vs. scruffies|neats]]"):

Formal methods are now preferred ("Victory of the neats"):

现在更倾向于使用正式的方法(“近亲的胜利”) :

* {{Harvnb|Russell|Norvig|2003|pp=25–26}}

* {{Harvnb|McCorduck|2004|pp=486–487}}

</ref>

</ref>

/ 参考

<ref name="AI widely used">

<ref name="AI widely used">

广泛使用的人工智能

AI applications widely used behind the scenes:

AI applications widely used behind the scenes:

在幕后广泛使用的人工智能应用:

* {{Harvnb|Russell|Norvig|2003|p=28}}

* {{Harvnb|Kurzweil|2005|p=265}}

* {{Harvnb|NRC|1999|pp=216–222}}

* {{Harvnb|Newquist|1994|pp=189–201}}

</ref>

</ref>

/ 参考

<ref name="AI in 2000s">

<ref name="AI in 2000s">

2000年代的人工智能

AI becomes hugely successful in the early 21st century

AI becomes hugely successful in the early 21st century

人工智能在21世纪初取得了巨大的成功

* {{Harvnb|Clark|2015}}

</ref>

</ref>

/ 参考





! ——问题——————————————————————————————————————————————————————————————————————————————————————

<ref name="Reasoning">

<ref name="Reasoning">

推理推理

Problem solving, puzzle solving, game playing and deduction:

Problem solving, puzzle solving, game playing and deduction:

解决问题，解决难题，玩游戏和演绎:

* {{Harvnb|Russell|Norvig|2003|loc=chpt. 3–9}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|loc=chpt. 2,3,7,9}},

* {{Harvnb|Luger|Stubblefield|2004|loc=chpt. 3,4,6,8}},

* {{Harvnb|Nilsson|1998|loc=chpt. 7–12}}

</ref>

</ref>

/ 参考

<ref name="Uncertain reasoning">

<ref name="Uncertain reasoning">

不确定推理“

Uncertain reasoning:

Uncertain reasoning:

不确定的推理:

* {{Harvnb|Russell|Norvig|2003|pp=452–644}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=345–395}},

* {{Harvnb|Luger|Stubblefield|2004|pp=333–381}},

* {{Harvnb|Nilsson|1998|loc=chpt. 19}}

</ref>

</ref>

/ 参考

<ref name="Intractability">

<ref name="Intractability">

反对者名字“棘手”

[[Intractably|Intractability and efficiency]] and the [[combinatorial explosion]]:

Intractability and efficiency and the combinatorial explosion:

难以驾驭的效率和组合爆炸:

* {{Harvnb|Russell|Norvig|2003|pp=9, 21–22}}

</ref>

</ref>

/ 参考

<ref name="Psychological evidence of sub-symbolic reasoning">

<ref name="Psychological evidence of sub-symbolic reasoning">

亚符号推理的心理学证据”

Psychological evidence of sub-symbolic reasoning:

Psychological evidence of sub-symbolic reasoning:

子符号推理的心理学证据:

* {{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]])

* {{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).

* {{Harvtxt|Lakoff|Núñez|2000}} have controversially argued that even our skills at mathematics depend on knowledge and skills that come from "the body", i.e. sensorimotor and perceptual skills. (See [[Where Mathematics Comes From]])

</ref>

</ref>

/ 参考

<ref name="Knowledge representation">

<ref name="Knowledge representation">

知识表达"

[[Knowledge representation]]:

Knowledge representation:

知识表示:

* {{Harvnb|ACM|1998|loc=I.2.4}},

* {{Harvnb|Russell|Norvig|2003|pp=320–363}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=23–46, 69–81, 169–196, 235–277, 281–298, 319–345}},

* {{Harvnb|Luger|Stubblefield|2004|pp=227–243}},

* {{Harvnb|Nilsson|1998|loc=chpt. 18}}

</ref>

</ref>

/ 参考

<ref name="Knowledge engineering">

<ref name="Knowledge engineering">

知识工程学

[[Knowledge engineering]]:

Knowledge engineering:

知识工程:

* {{Harvnb|Russell|Norvig|2003|pp=260–266}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=199–233}},

* {{Harvnb|Nilsson|1998|loc=chpt. ≈17.1–17.4}}

</ref>

</ref>

/ 参考

<ref name="Representing categories and relations">

<ref name="Representing categories and relations">

代表类别和关系"

Representing categories and relations: [[Semantic network]]s, [[description logic]]s, [[inheritance (computer science)|inheritance]] (including [[frame (artificial intelligence)|frames]] and [[scripts (artificial intelligence)|scripts]]):

Representing categories and relations: Semantic networks, description logics, inheritance (including frames and scripts):

表示类别和关系: 语义网络，描述逻辑，继承(包括框架和脚本) :

* {{Harvnb|Russell|Norvig|2003|pp=349–354}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=174–177}},

* {{Harvnb|Luger|Stubblefield|2004|pp=248–258}},

* {{Harvnb|Nilsson|1998|loc=chpt. 18.3}}

</ref>

</ref>

/ 参考

<ref name="Representing time">

<ref name="Representing time">

代表时间”

Representing events and time:[[Situation calculus]], [[event calculus]], [[fluent calculus]] (including solving the [[frame problem]]):

Representing events and time:Situation calculus, event calculus, fluent calculus (including solving the frame problem):

表示事件和时间: 情境演算、事件演算、流演算(包括解决框架问题) :

* {{Harvnb|Russell|Norvig|2003|pp=328–341}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=281–298}},

* {{Harvnb|Nilsson|1998|loc=chpt. 18.2}}

</ref>

</ref>

/ 参考

<ref name="Representing causation">

<ref name="Representing causation">

代表因果关系”

[[Causality#Causal calculus|Causal calculus]]:

Causal calculus:

因果演算:

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=335–337}}

</ref>

</ref>

/ 参考

<ref name="Representing knowledge about knowledge">

<ref name="Representing knowledge about knowledge">

代表知识的知识”

Representing knowledge about knowledge: Belief calculus, [[modal logic]]s:

Representing knowledge about knowledge: Belief calculus, modal logics:

代表知识的知识: 信念演算，模态逻辑:

* {{Harvnb|Russell|Norvig|2003|pp=341–344}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=275–277}}

</ref>

</ref>

/ 参考

<ref name="Ontology">

<ref name="Ontology">

Ref name"ontology"

[[Ontology (computer science)|Ontology]]:

Ontology:

本体论:

* {{Harvnb|Russell|Norvig|2003|pp=320–328}}

</ref>

</ref>

/ 参考

<ref name="Qualification problem">

<ref name="Qualification problem">

资格问题

[[Qualification problem]]:

Qualification problem:

资格问题:

* {{Harvnb|McCarthy|Hayes|1969}}

* {{Harvnb|Russell|Norvig|2003}}{{Page needed|date=February 2011}}

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.

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.

麦卡锡主要关注的是行为的逻辑表达问题，而把这个术语应用到我们所有常识知识背后庞大的假设网络中更为普遍的缺省推理问题上。

</ref>

</ref>

/ 参考

<ref name="Default reasoning and non-monotonic logic">

<ref name="Default reasoning and non-monotonic logic">

违约推理和非单调逻辑"

Default reasoning and [[default logic]], [[non-monotonic logic]]s, [[circumscription (logic)|circumscription]], [[closed world assumption]], [[abductive reasoning|abduction]] (Poole ''et al.'' places abduction under "default reasoning". Luger ''et al.'' places this under "uncertain reasoning"):

Default reasoning and default logic, non-monotonic logics, circumscription, closed world assumption, abduction (Poole et al. places abduction under "default reasoning". Luger et al. places this under "uncertain reasoning"):

缺省推理和缺省逻辑，非单调逻辑，界限，封闭世界假设，溯因(Poole 等。把绑架放在”缺省推理”下。鲁格尔等人。将其归类为“不确定推理”) :

* {{Harvnb|Russell|Norvig|2003|pp=354–360}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=248–256, 323–335}},

* {{Harvnb|Luger|Stubblefield|2004|pp=335–363}},

* {{Harvnb|Nilsson|1998|loc=~18.3.3}}

</ref>

</ref>

/ 参考

<ref name="Breadth of commonsense knowledge">

<ref name="Breadth of commonsense knowledge">

常识的广度知识”

Breadth of commonsense knowledge:

Breadth of commonsense knowledge:

常识知识的广度:

* {{Harvnb|Russell|Norvig|2003|p=21}},

* {{Harvnb|Crevier|1993|pp=113–114}},

* {{Harvnb|Moravec|1988|p=13}},

* {{Harvnb|Lenat|Guha|1989}} (Introduction)

</ref>

</ref>

/ 参考

<ref name="Intuition">

<ref name="Intuition">

直觉

Expert knowledge as [[embodied cognition|embodied]] intuition:

Expert knowledge as embodied intuition:

体现直觉的专业知识:

* {{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]])

* {{Harvnb|Gladwell|2005}} (Gladwell's ''[[Blink (book)|Blink]]'' is a popular introduction to sub-symbolic reasoning and knowledge.)

* {{Harvnb|Hawkins|Blakeslee|2005}} (Hawkins argues that sub-symbolic knowledge should be the primary focus of AI research.)

</ref>

</ref>

/ 参考

<ref name="Planning">

<ref name="Planning">

”计划”组织

[[automated planning and scheduling|Planning]]:

Planning:

规划:

* {{Harvnb|ACM|1998|loc=~I.2.8}},

* {{Harvnb|Russell|Norvig|2003|pp= 375–459}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=281–316}},

* {{Harvnb|Luger|Stubblefield|2004|pp=314–329}},

* {{Harvnb|Nilsson|1998|loc=chpt. 10.1–2, 22}}

</ref>

</ref>

/ 参考

<ref name="Information value theory">

<ref name="Information value theory">

信息价值理论”

[[Applied information economics|Information value theory]]:

Information value theory:

信息价值理论:

* {{Harvnb|Russell|Norvig|2003|pp=600–604}}

</ref>

</ref>

/ 参考

<ref name="Classical planning">

<ref name="Classical planning">

”古典计划”

Classical planning:

Classical planning:

经典的规划:

* {{Harvnb|Russell|Norvig|2003|pp=375–430}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=281–315}},

* {{Harvnb|Luger|Stubblefield|2004|pp=314–329}},

* {{Harvnb|Nilsson|1998|loc=chpt. 10.1–2, 22}}

</ref>

</ref>

/ 参考

<ref name="Non-deterministic planning">

<ref name="Non-deterministic planning">

非确定性计划”

Planning and acting in non-deterministic domains: conditional planning, execution monitoring, replanning and continuous planning:

Planning and acting in non-deterministic domains: conditional planning, execution monitoring, replanning and continuous planning:

计划和行动在非确定性领域: 有条件的计划，执行监控，重新计划和持续计划:

* {{Harvnb|Russell|Norvig|2003|pp=430–449}}

</ref>

</ref>

/ 参考

<ref name="Multi-agent planning">

<ref name="Multi-agent planning">

多智能体计划

Multi-agent planning and emergent behavior:

Multi-agent planning and emergent behavior:

多智能体计划与应急行为:

* {{Harvnb|Russell|Norvig|2003|pp=449–455}}

</ref>

</ref>

/ 参考

<ref name="Machine learning">

<ref name="Machine learning">

机器学习“

[[machine learning|Learning]]:

Learning:

学习:

* {{Harvnb|ACM|1998|loc=I.2.6}},

* {{Harvnb|Russell|Norvig|2003|pp=649–788}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=397–438}},

* {{Harvnb|Luger|Stubblefield|2004|pp=385–542}},

* {{Harvnb|Nilsson|1998|loc=chpt. 3.3, 10.3, 17.5, 20}}

</ref>

</ref>

/ 参考

<ref name="Reinforcement learning">

<ref name="Reinforcement learning">

强化学习

[[Reinforcement learning]]:

Reinforcement learning:

强化学习

* {{Harvnb|Russell|Norvig|2003|pp=763–788}}

* {{Harvnb|Luger|Stubblefield|2004|pp=442–449}}

</ref>

</ref>

/ 参考

<ref name="Natural language processing">

<ref name="Natural language processing">

自然语言处理"

[[Natural language processing]]:

Natural language processing:

自然语言处理:

* {{Harvnb|ACM|1998|loc=I.2.7}}

* {{Harvnb|Russell|Norvig|2003|pp=790–831}}

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=91–104}}

* {{Harvnb|Luger|Stubblefield|2004|pp=591–632}}

</ref>

</ref>

/ 参考

<ref name="Applications of natural language processing">

<ref name="Applications of natural language processing">

自然语言处理应用程序”

Applications of natural language processing, including [[information retrieval]] (i.e. [[text mining]]) and [[machine translation]]:

Applications of natural language processing, including information retrieval (i.e. text mining) and machine translation:

自然语言处理的应用，包括信息检索(即。文本挖掘和机器翻译:

* {{Harvnb|Russell|Norvig|2003|pp=840–857}},

* {{Harvnb|Luger|Stubblefield|2004|pp=623–630}}

</ref>

</ref>

/ 参考

<ref name="Robotics">

<ref name="Robotics">

机器人公司”

[[Robotic]]s:

Robotics:

Robotics:

* {{Harvnb|ACM|1998|loc=I.2.9}},

* {{Harvnb|Russell|Norvig|2003|pp=901–942}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=443–460}}

</ref>

</ref>

/ 参考

<ref name="Configuration space">

<ref name="Configuration space">

配置空间”

Moving and [[Configuration space (physics)|configuration space]]:

Moving and configuration space:

移动和位形空间:

* {{Harvnb|Russell|Norvig|2003|pp=916–932}}

</ref>

</ref>

/ 参考

<ref name="Robotic mapping">

<ref name="Robotic mapping">

机器人测绘网

[[Robotic mapping]] (localization, etc):

Robotic mapping (localization, etc):

机器人绘图(本地化等) :

* {{Harvnb|Russell|Norvig|2003|pp=908–915}}

</ref>

</ref>

/ 参考

<ref name="Machine perception">

<ref name="Machine perception">

”机器感知”

[[Machine perception]]:

Machine perception:

机器感知:

* {{Harvnb|Russell|Norvig|2003|pp=537–581, 863–898}}

* {{Harvnb|Nilsson|1998|loc=~chpt. 6}}

</ref>

</ref>

/ 参考

<ref name="Computer vision">

<ref name="Computer vision">

”计算机视觉”

[[Computer vision]]:

Computer vision:

电脑视觉:

* {{Harvnb|ACM|1998|loc=I.2.10}}

* {{Harvnb|Russell|Norvig|2003|pp=863–898}}

* {{Harvnb|Nilsson|1998|loc=chpt. 6}}

</ref>

</ref>

/ 参考

<ref name="Speech recognition">

<ref name="Speech recognition">

”语音识别”

[[Speech recognition]]:

Speech recognition:

语音识别:

* {{Harvnb|ACM|1998|loc=~I.2.7}}

* {{Harvnb|Russell|Norvig|2003|pp=568–578}}

</ref>

</ref>

/ 参考

<ref name="Object recognition">

<ref name="Object recognition">

对象识别”

[[Object recognition]]:

Object recognition:

物体识别:

* {{Harvnb|Russell|Norvig|2003|pp=885–892}}

</ref>

</ref>

/ 参考

<ref name="Emotion and affective computing">

<ref name="Emotion and affective computing">

情感与情感计算”

Emotion and [[affective computing]]:

Emotion and affective computing:

情感与情感计算:

* {{Harvnb|Minsky|2006}}

</ref>

</ref>

/ 参考

<ref name="Brain simulation">

--><ref name="Brain simulation">

”大脑模拟”

[[Artificial brain]] arguments: AI requires a simulation of the operation of the human brain

Artificial brain arguments: AI requires a simulation of the operation of the human brain

人工大脑的论点: 人工智能需要模拟人脑的运作

* {{Harvnb|Russell|Norvig|2003|p=957}}

* {{Harvnb|Crevier|1993|pp=271 and 279}}

A few of the people who make some form of the argument:

A few of the people who make some form of the argument:

一些提出某种论点的人:

* {{Harvnb|Moravec|1988}}

* {{Harvnb|Kurzweil|2005|p=262}}

* {{Harvnb|Hawkins|Blakeslee|2005}}

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.

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.

这种观点(大脑替代情景)最极端的形式是克拉克•格莱莫尔(Clark Glymour)在上世纪70年代中期提出的，泽农•派利辛(Zenon Pylyshyn)和约翰•塞尔(John Searle)在1980年提出了这一观点。

</ref>

</ref>

/ 参考



</ref>-->

/ ref --





——方法—————————————————————————————————————————————————————————————————————————————————— --

<ref name="Biological intelligence vs. intelligence in general">

<ref name="Biological intelligence vs. intelligence in general">

生物智能对抗一般智能

Biological intelligence vs. intelligence in general:

Biological intelligence vs. intelligence in general:

生物智能 vs 一般智能:

* {{Harvnb|Russell|Norvig|2003|pp=2–3}}, who make the analogy with [[aeronautical engineering]].

* {{Harvnb|McCorduck|2004|pp=100–101}}, who writes that there are "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."

* {{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: "This is AI, so we don't care if it's psychologically real"{{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 "Artificial intelligence is not, by definition, simulation of human intelligence" {{Harv|Maker|2006}}.

</ref>

</ref>

/ 参考

<ref name="Neats vs. scruffies">

<ref name="Neats vs. scruffies">

裁判名称“ neats vs. scruffies”

[[Neats vs. scruffies]]:

Neats vs. scruffies:

Neats vs. scruffies:

* {{Harvnb|McCorduck|2004|pp=421–424, 486–489}}

* {{Harvnb|Crevier|1993|p=168}}

* {{Harvnb|Nilsson|1983|pp=10–11}}

</ref>

</ref>

/ 参考

<ref name="Symbolic vs. sub-symbolic">

<ref name="Symbolic vs. sub-symbolic">

”象征对抗子象征”

Symbolic vs. sub-symbolic AI:

Symbolic vs. sub-symbolic AI:

符号人工智能 vs 子符号人工智能:

* {{Harvtxt|Nilsson|1998|p=7}}, who uses the term "sub-symbolic".

</ref>

</ref>

/ 参考

<ref name="GOFAI">

<ref name="GOFAI">

反对者名字「 gofai 」

{{Harvnb|Haugeland|1985|pp=112–117}}

</ref>

</ref>

/ 参考

<ref name="AI at CMU in the 60s">

<ref name="AI at CMU in the 60s">

60年代，卡内基梅隆大学的人工智能

Cognitive simulation, [[Allen Newell|Newell]] and [[Herbert A. Simon|Simon]], AI at [[Carnegie Mellon University|CMU]] (then called [[Carnegie Tech]]):

Cognitive simulation, Newell and Simon, AI at CMU (then called Carnegie Tech):

认知模拟，纽威尔和西蒙，卡内基大学(当时称为卡内基技术学院)的人工智能:

* {{Harvnb|McCorduck|2004|pp=139–179, 245–250, 322–323 (EPAM)}}

* {{Harvnb|Crevier|1993|pp=145–149}}

</ref>

</ref>

/ 参考

<ref name="Soar">

<ref name="Soar">

反战组织「翱翔」

[[Soar (cognitive architecture)|Soar]] (history):

Soar (history):

翱翔(历史) :

* {{Harvnb|McCorduck|2004|pp=450–451}}

* {{Harvnb|Crevier|1993|pp=258–263}}

</ref>

</ref>

/ 参考

<ref name="AI at Stanford in the 60s">

<ref name="AI at Stanford in the 60s">

60年代斯坦福大学的人工智能研究

[[John McCarthy (computer scientist)|McCarthy]] and AI research at [[Stanford Artificial Intelligence Laboratory|SAIL]] and [[SRI International]]:

McCarthy and AI research at SAIL and SRI International:

麦卡锡和人工智能研究机构 SAIL 和 SRI International:

* {{Harvnb|McCorduck|2004|pp=251–259}}

* {{Harvnb|Crevier|1993}}

</ref>

</ref>

/ 参考

<ref name="AI at Edinburgh and France in the 60s">

<ref name="AI at Edinburgh and France in the 60s">

在60年代的爱丁堡和法国

AI research at [[University of Edinburgh|Edinburgh]] and in France, birth of [[Prolog]]:

AI research at Edinburgh and in France, birth of Prolog:

爱丁堡和法国的人工智能研究，Prolog 的诞生:

* {{Harvnb|Crevier|1993|pp=193–196}}

* {{Harvnb|Howe|1994}}

</ref>

</ref>

/ 参考

<ref name="AI at MIT in the 60s">

<ref name="AI at MIT in the 60s">

60年代麻省理工学院的人工智能

AI at [[MIT]] under [[Marvin Minsky]] in the 1960s :

AI at MIT under Marvin Minsky in the 1960s :

上世纪60年代，马文•明斯基(Marvin Minsky)领导下的麻省理工学院(MIT)人工智能课程:

* {{Harvnb|McCorduck|2004|pp=259–305}}

* {{Harvnb|Crevier|1993|pp=83–102, 163–176}}

* {{Harvnb|Russell|Norvig|2003|p=19}}

</ref>

</ref>

/ 参考

<ref name="Cyc">

<ref name="Cyc">

他们的名字叫“ cyc”

[[Cyc]]:

Cyc:

Cyc:

* {{Harvnb|McCorduck|2004|p=489}}, who calls it "a determinedly scruffy enterprise"

* {{Harvnb|Crevier|1993|pp=239–243}}

* {{Harvnb|Russell|Norvig|2003|p=363−365}}

* {{Harvnb|Lenat|Guha|1989}}

</ref>

</ref>

/ 参考

<ref name="Knowledge revolution">

<ref name="Knowledge revolution">

知识革命

Knowledge revolution:

Knowledge revolution:

返回文章页面知识革命:

* {{Harvnb|McCorduck|2004|pp=266–276, 298–300, 314, 421}}

* {{Harvnb|Russell|Norvig|2003|pp=22–23}}

</ref>

</ref>

/ 参考

<ref name="Embodied AI">

<ref name="Embodied AI">

反对者名字“ empressive ai”

[[Embodied agent|Embodied]] approaches to AI:

Embodied approaches to AI:

人工智能的具身化方法:

* {{Harvnb|McCorduck|2004|pp=454–462}}

* {{Harvnb|Brooks|1990}}

* {{Harvnb|Moravec|1988}}

</ref>

</ref>

/ 参考

<ref name="Revival of connectionism">

<ref name="Revival of connectionism">

联结主义的复兴

Revival of [[connectionism]]:

Revival of connectionism:

返回文章页面连接主义的复兴:

* {{Harvnb|Crevier|1993|pp=214–215}}

* {{Harvnb|Russell|Norvig|2003|p=25}}

</ref>

</ref>

/ 参考

<ref name="Computational intelligence">

<ref name="Computational intelligence">

计算机情报网

[[Computational intelligence]]

Computational intelligence

计算智能

* [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 }}

</ref>

</ref>

/ 参考

<ref name="Intelligent agents">

<ref name="Intelligent agents">

智能特工组织

The [[intelligent agent]] paradigm:

The intelligent agent paradigm:

智能代理范式:

* {{Harvnb|Russell|Norvig|2003|pp=27, 32–58, 968–972}}

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=7–21}}

* {{Harvnb|Luger|Stubblefield|2004|pp=235–240}}

* {{Harvnb|Hutter|2005|pp=125–126}}

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.

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.

本文使用的定义，在目标，行动，感知和环境方面，是由于。其他定义还包括知识和学习作为附加标准。

</ref>

</ref>

/ 参考

<ref name="Agent architectures">

<ref name="Agent architectures">

引用名称"代理建筑"

[[Agent architecture]]s, [[hybrid intelligent system]]s:

Agent architectures, hybrid intelligent systems:

代理体系结构，混合智能系统:

* {{Harvtxt|Russell|Norvig|2003|pp=27, 932, 970–972}}

* {{Harvtxt|Nilsson|1998|loc=chpt. 25}}

</ref>

</ref>

/ 参考

<ref name="Hierarchical control system">

<ref name="Hierarchical control system">

分级控制系统"

[[Hierarchical control system]]:

Hierarchical control system:

分层控制系统:

* {{Harvnb|Albus|2002}}

</ref>

</ref>

/ 参考





——工具———————————————————————————————————————————————————————————————————————————————— --

<ref name="Search">

<ref name="Search">

搜索引擎

[[Search algorithm]]s:

Search algorithms:

搜索算法:

* {{Harvnb|Russell|Norvig|2003|pp=59–189}}

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=113–163}}

* {{Harvnb|Luger|Stubblefield|2004|pp=79–164, 193–219}}

* {{Harvnb|Nilsson|1998|loc=chpt. 7–12}}

</ref>

</ref>

/ 参考

<ref name="Logic as search">

<ref name="Logic as search">

推理作为搜索”

[[Forward chaining]], [[backward chaining]], [[Horn clause]]s, and logical deduction as search:

Forward chaining, backward chaining, Horn clauses, and logical deduction as search:

正向链接、反向链接、 Horn 子句和逻辑推理作为搜索:

* {{Harvnb|Russell|Norvig|2003|pp=217–225, 280–294}}

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=~46–52}}

* {{Harvnb|Luger|Stubblefield|2004|pp=62–73}}

* {{Harvnb|Nilsson|1998|loc=chpt. 4.2, 7.2}}

</ref>

</ref>

/ 参考

<ref name="Planning as search">

<ref name="Planning as search">

计划作为搜索”

[[State space search]] and [[automated planning and scheduling|planning]]:

State space search and planning:

国家空间搜索和规划:

* {{Harvnb|Russell|Norvig|2003|pp=382–387}}

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=298–305}}

* {{Harvnb|Nilsson|1998|loc=chpt. 10.1–2}}

</ref>

</ref>

/ 参考

<ref name="Uninformed search">

<ref name="Uninformed search">

无知搜索”

Uninformed searches ([[breadth first search]], [[depth first search]] and general [[state space search]]):

Uninformed searches (breadth first search, depth first search and general state space search):

不知情的搜索(广度优先搜索搜索、深度优先搜索和一般状态空间搜索) :

* {{Harvnb|Russell|Norvig|2003|pp=59–93}}

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=113–132}}

* {{Harvnb|Luger|Stubblefield|2004|pp=79–121}}

* {{Harvnb|Nilsson|1998|loc=chpt. 8}}

</ref>

</ref>

/ 参考

<ref name="Informed search">

<ref name="Informed search">

通知搜索

[[Heuristic]] or informed searches (e.g., greedy [[best-first search|best first]] and [[A* search algorithm|A*]]):

Heuristic or informed searches (e.g., greedy best first and A*):

启发式或知情搜索(例如，贪婪最优先和 a *) :

* {{Harvnb|Russell|Norvig|2003|pp= 94–109}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=pp. 132–147}},

* {{Harvnb|Luger|Stubblefield|2004|pp= 133–150}},

* {{Harvnb|Nilsson|1998|loc=chpt. 9}},

* {{Harvnb|Poole|Mackworth|2017|loc=Section 3.6}}

</ref>

</ref>

/ 参考

<ref name="Optimization search">

<ref name="Optimization search">

最优化搜索

[[optimization (mathematics)|Optimization]] searches:

Optimization searches:

优化搜索:

* {{Harvnb|Russell|Norvig|2003|pp=110–116,120–129}}

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=56–163}}

* {{Harvnb|Luger|Stubblefield|2004|pp= 127–133}}

</ref>

</ref>

/ 参考

<ref name="Society based learning">

<ref name="Society based learning">

以学习为基础的社会

[[Artificial life]] and society based learning:

Artificial life and society based learning:

基于人工生命和社会的学习:

* {{Harvnb|Luger|Stubblefield|2004|pp=530–541}}

</ref>

</ref>

/ 参考

<ref name="Genetic programming">

<ref name="Genetic programming">

“基因编程”

[[Genetic programming]] and [[genetic algorithms]]:

Genetic programming and genetic algorithms:

遗传程序设计和遗传算法:

* {{Harvnb|Luger|Stubblefield|2004|pp=509–530}},

* {{Harvnb|Nilsson|1998|loc=chpt. 4.2}},

* {{Harvnb|Holland|1975}},

* {{Harvnb|Koza|1992}},

* {{Harvnb|Poli|Langdon|McPhee|2008}}.

</ref>

</ref>

/ 参考

<ref name="Logic">

<ref name="Logic">

”逻辑”组织

[[Logic]]:

Logic:

逻辑:

* {{Harvnb|ACM|1998|loc=~I.2.3}},

* {{Harvnb|Russell|Norvig|2003|pp=194–310}},

* {{Harvnb|Luger|Stubblefield|2004|pp=35–77}},

* {{Harvnb|Nilsson|1998|loc=chpt. 13–16}}

</ref>

</ref>

/ 参考

<ref name="Satplan">

<ref name="Satplan">

反对者名字「 satplan 」

[[Satplan]]:

Satplan:

Satplan:

* {{Harvnb|Russell|Norvig|2003|pp=402–407}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=300–301}},

* {{Harvnb|Nilsson|1998|loc=chpt. 21}}

</ref>

</ref>

/ 参考

<ref name="Symbolic learning techniques">

<ref name="Symbolic learning techniques">

象征学习技巧

[[Explanation based learning]], relevance based learning, [[inductive logic programming]], [[case based reasoning]]:

Explanation based learning, relevance based learning, inductive logic programming, case based reasoning:

基于解释的学习，基于关联的学习，归纳逻辑程序设计，基于案例推理:

* {{Harvnb|Russell|Norvig|2003|pp=678–710}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=414–416}},

* {{Harvnb|Luger|Stubblefield|2004|pp=~422–442}},

* {{Harvnb|Nilsson|1998|loc=chpt. 10.3, 17.5}}

</ref>

</ref>

/ 参考

<ref name="Propositional logic">

<ref name="Propositional logic">

推理逻辑"

[[Propositional logic]]:

Propositional logic:

命题逻辑

* {{Harvnb|Russell|Norvig|2003|pp=204–233}},

* {{Harvnb|Luger|Stubblefield|2004|pp=45–50}}

* {{Harvnb|Nilsson|1998|loc=chpt. 13}}

</ref>

</ref>

/ 参考

<ref name="First-order logic">

<ref name="First-order logic">

一阶逻辑"

[[First-order logic]] and features such as [[equality (mathematics)|equality]]:

First-order logic and features such as equality:

一阶逻辑和功能，如平等:

* {{Harvnb|ACM|1998|loc=~I.2.4}},

* {{Harvnb|Russell|Norvig|2003|pp=240–310}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=268–275}},

* {{Harvnb|Luger|Stubblefield|2004|pp=50–62}},

* {{Harvnb|Nilsson|1998|loc=chpt. 15}}

</ref>

</ref>

/ 参考

<ref name="Fuzzy logic">

<ref name="Fuzzy logic">

”模糊逻辑”

[[Fuzzy logic]]:

Fuzzy logic:

Fuzzy logic:

* {{Harvnb|Russell|Norvig|2003|pp=526–527}}

</ref>

</ref>

/ 参考

<ref name="Stochastic methods for uncertain reasoning">

<ref name="Stochastic methods for uncertain reasoning">

不确定推理的随机方法"

Stochastic methods for uncertain reasoning:

Stochastic methods for uncertain reasoning:

不确定推理的随机方法:

* {{Harvnb|ACM|1998|loc=~I.2.3}},

* {{Harvnb|Russell|Norvig|2003|pp=462–644}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=345–395}},

* {{Harvnb|Luger|Stubblefield|2004|pp=165–191, 333–381}},

* {{Harvnb|Nilsson|1998|loc=chpt. 19}}

</ref>

</ref>

/ 参考

<ref name="Bayesian networks">

<ref name="Bayesian networks">

贝叶斯网络

[[Bayesian network]]s:

Bayesian networks:

贝叶斯网络:

* {{Harvnb|Russell|Norvig|2003|pp=492–523}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=361–381}},

* {{Harvnb|Luger|Stubblefield|2004|pp=~182–190, ≈363–379}},

* {{Harvnb|Nilsson|1998|loc=chpt. 19.3–4}}

</ref>

</ref>

/ 参考

<ref name="Bayesian inference">

<ref name="Bayesian inference">

引用名称”贝叶斯推断”

[[Bayesian inference]] algorithm:

Bayesian inference algorithm:

贝叶斯推断算法:

* {{Harvnb|Russell|Norvig|2003|pp=504–519}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=361–381}},

* {{Harvnb|Luger|Stubblefield|2004|pp=~363–379}},

* {{Harvnb|Nilsson|1998|loc=chpt. 19.4 & 7}}

</ref>

</ref>

/ 参考

<ref name="Bayesian learning">

<ref name="Bayesian learning">

贝叶斯学习

[[Bayesian learning]] and the [[expectation-maximization algorithm]]:

Bayesian learning and the expectation-maximization algorithm:

贝叶斯学习和期望最大化算法:

* {{Harvnb|Russell|Norvig|2003|pp=712–724}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=424–433}},

* {{Harvnb|Nilsson|1998|loc=chpt. 20}}

</ref>

</ref>

/ 参考

<ref name="Bayesian decision networks">

<ref name="Bayesian decision networks">

贝叶斯决策网络

[[Bayesian decision theory]] and Bayesian [[decision network]]s:

Bayesian decision theory and Bayesian decision networks:

贝叶斯决策理论和贝叶斯决策网络:

* {{Harvnb|Russell|Norvig|2003|pp=597–600}}

</ref>

</ref>

/ 参考

<ref name="Stochastic temporal models">

<ref name="Stochastic temporal models">

随机时间模型”

Stochastic temporal models:

Stochastic temporal models:

随机时间模型:

* {{Harvnb|Russell|Norvig|2003|pp=537–581}}

[[Dynamic Bayesian network]]s:

Dynamic Bayesian networks:

动态贝叶斯网络:

* {{Harvnb|Russell|Norvig|2003|pp=551–557}}

[[Hidden Markov model]]:

Hidden Markov model:

隐马尔可夫模型

* {{Harv|Russell|Norvig|2003|pp=549–551}}

[[Kalman filter]]s:

Kalman filters:

卡尔曼滤波器:

* {{Harvnb|Russell|Norvig|2003|pp=551–557}}

</ref>

</ref>

/ 参考

<ref name="Decisions theory and analysis">

<ref name="Decisions theory and analysis">

决策理论和分析

[[decision theory]] and [[decision analysis]]:

decision theory and decision analysis:

决策理论和决策分析:

* {{Harvnb|Russell|Norvig|2003|pp=584–597}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=381–394}}

</ref>

</ref>

/ 参考

<ref name="Markov decision process" >

<ref name="Markov decision process" >

马尔科夫决策过程

[[Markov decision process]]es and dynamic [[decision network]]s:

Markov decision processes and dynamic decision networks:

马尔可夫决策过程和动态决策网络:

* {{Harvnb|Russell|Norvig|2003|pp=613–631}}

</ref>

</ref>

/ 参考

<ref name="Game theory and mechanism design">

<ref name="Game theory and mechanism design">

博弈论与机制设计”

[[Game theory]] and [[mechanism design]]:

Game theory and mechanism design:

博弈论与机制设计:

* {{Harvnb|Russell|Norvig|2003|pp=631–643}}

</ref>

</ref>

/ 参考

<ref name="Classifiers">

<ref name="Classifiers">

”分类器”

Statistical learning methods and [[classifier (mathematics)|classifiers]]:

Statistical learning methods and classifiers:

统计学习方法和分类器:

* {{Harvnb|Russell|Norvig|2003|pp=712–754}},

* {{Harvnb|Luger|Stubblefield|2004|pp=453–541}}

</ref>

</ref>

/ 参考

<ref name="Kernel methods">

<ref name="Kernel methods">

内核方法"

[[kernel methods]] such as the [[support vector machine]]:

kernel methods such as the support vector machine:

内核方法，比如支持向量机:

* {{Harvnb|Russell|Norvig|2003|pp=749–752}}

</ref>

</ref>

/ 参考

<ref name="K-nearest neighbor algorithm">

<ref name="K-nearest neighbor algorithm">

最近邻算法”

[[K-nearest neighbor algorithm]]:

K-nearest neighbor algorithm:

最近邻居法:

* {{Harvnb|Russell|Norvig|2003|pp=733–736}}

</ref>

</ref>

/ 参考

<ref name="Gaussian mixture model">

<ref name="Gaussian mixture model">

”高斯混合模型”

[[Gaussian mixture model]]:

Gaussian mixture model:

高斯混合模型:

* {{Harvnb|Russell|Norvig|2003|pp=725–727}}

</ref>

</ref>

/ 参考

<ref name="Naive Bayes classifier">

<ref name="Naive Bayes classifier">

自然分类器"

[[Naive Bayes classifier]]:

Naive Bayes classifier:

朴素贝叶斯分类器

* {{Harvnb|Russell|Norvig|2003|p=718}}

</ref>

</ref>

/ 参考

<ref name="Decision tree">

<ref name="Decision tree">

决策树

[[Alternating decision tree|Decision tree]]:

Decision tree:

决策树:

* {{Harvnb|Russell|Norvig|2003|pp=653–664}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=403–408}},

* {{Harvnb|Luger|Stubblefield|2004|pp=408–417}}

</ref>

</ref>

/ 参考

<ref name="Classifier performance" >

<ref name="Classifier performance" >

分类器性能"

Classifier performance:

Classifier performance:

分类器性能:

* {{Harvnb|van der Walt|Bernard|2006}}

</ref>

</ref>

/ 参考

<ref name="Neural networks">

<ref name="Neural networks">

“神经网络”

Neural networks and connectionism:

Neural networks and connectionism:

神经网络与连接主义:

* {{Harvnb|Russell|Norvig|2003|pp=736–748}},

* {{Harvnb|Poole|Mackworth|Goebel|1998|pp=408–414}},

* {{Harvnb|Luger|Stubblefield|2004|pp=453–505}},

* {{Harvnb|Nilsson|1998|loc=chpt. 3}}

</ref>

</ref>

/ 参考

<ref name="Backpropagation">

<ref name="Backpropagation">

反向传播法

[[Backpropagation]]:

Backpropagation:

返回文章页面反向传播:

* {{Harvnb|Russell|Norvig|2003|pp=744–748}},

* {{Harvnb|Luger|Stubblefield|2004|pp=467–474}},

* {{Harvnb|Nilsson|1998|loc=chpt. 3.3}}

</ref>

</ref>

/ 参考

<ref name="Feedforward neural networks">

<ref name="Feedforward neural networks">

反馈名称“前馈神经网络”

[[Feedforward neural network]]s, [[perceptron]]s and [[radial basis network]]s:

Feedforward neural networks, perceptrons and radial basis networks:

前馈神经网络，感知器和径向基网络:

* {{Harvnb|Russell|Norvig|2003|pp=739–748, 758}}

* {{Harvnb|Luger|Stubblefield|2004|pp=458–467}}

</ref>

</ref>

/ 参考

<ref name="Recurrent neural networks">

<ref name="Recurrent neural networks">

反馈神经网络"

[[Recurrent neural networks]], [[Hopfield nets]]:

Recurrent neural networks, Hopfield nets:

回归神经网络 Hopfield 网络:

* {{Harvnb|Russell|Norvig|2003|p=758}}

* {{Harvnb|Luger|Stubblefield|2004|pp=474–505}}

</ref>

</ref>

/ 参考

<ref name="Learning in neural networks">

<ref name="Learning in neural networks">

在神经网络中学习

[[Competitive learning]], [[Hebbian theory|Hebbian]] coincidence learning, [[Hopfield network]]s and attractor networks:

Competitive learning, Hebbian coincidence learning, Hopfield networks and attractor networks:

竞争学习，Hebbian 巧合学习，Hopfield 网络和吸引子网络:

* {{Harvnb|Luger|Stubblefield|2004|pp=474–505}}

</ref>

</ref>

/ 参考

<ref name="Hierarchical temporal memory">

<ref name="Hierarchical temporal memory">

层级暂时记忆”

[[Hierarchical temporal memory]]:

Hierarchical temporal memory:

分级暂存记忆:

* {{Harvnb|Hawkins|Blakeslee|2005}}

</ref>

</ref>

/ 参考



</ref>-->

/ ref --





! ——进展——————————————————————————————————————————————————————————————————————————————————————————————

<ref name="Turing test">

<ref name="Turing test">

文档名称“图灵测试”

The [[Turing test]]: 

The Turing test: 

图灵测试: br /

Turing's original publication:

Turing's original publication:

图灵的原始出版物:

* {{Harvnb|Turing|1950}}

Historical influence and philosophical implications:

Historical influence and philosophical implications:

历史影响和哲学含义:

* {{Harvnb|Haugeland|1985|pp=6–9}}

* {{Harvnb|Crevier|1993|p=24}}

* {{Harvnb|McCorduck|2004|pp=70–71}}

* {{Harvnb|Russell|Norvig|2003|pp=2–3 and 948}}

</ref>

</ref>

/ 参考



</ref> -->

/ ref --

<ref name="Mathematical definitions of intelligence">

<ref name="Mathematical definitions of intelligence">

情报的数学定义"

Mathematical definitions of intelligence:

Mathematical definitions of intelligence:

智力的数学定义:

* {{harvnb|Hernandez-Orallo|2000}}

* {{harvnb|Dowe|Hajek|1997}}

* {{harvnb|Hernandez-Orallo|Dowe|2010}}

</ref>

</ref>

/ 参考





——哲学———————————————————————————————————————————————————————————————————————————————————————————————— --



</ref>-->

/ ref --

<ref name="Dartmouth proposal">

<ref name="Dartmouth proposal">

达特茅斯建议书

Dartmouth proposal:

Dartmouth proposal:

返回文章页面达特茅斯求婚:

* {{Harvnb|McCarthy|Minsky|Rochester|Shannon|1955}} (the original proposal)

* {{Harvnb|Crevier|1993|p=49}} (historical significance)

</ref>

</ref>

/ 参考

<ref name="Physical symbol system hypothesis">

<ref name="Physical symbol system hypothesis">

”物理符号系统假说”

The [[physical symbol system]]s hypothesis:

The physical symbol systems hypothesis:

物理符号系统假说:

* {{Harvnb|Newell|Simon|1976|p=116}}

* {{Harvnb|McCorduck|2004|p=153}}

* {{Harvnb|Russell|Norvig|2003|p=18}}

</ref>

</ref>

/ 参考

<ref name="Dreyfus' critique">

<ref name="Dreyfus' critique">

反对者名字“德雷福斯批评”

[[Dreyfus' critique of artificial intelligence]]:

Dreyfus' critique of artificial intelligence:

德雷福斯对人工智能的批判:

* {{Harvnb|Dreyfus|1972}}, {{Harvnb|Dreyfus|Dreyfus|1986}}

* {{Harvnb|Crevier|1993|pp=120–132}}

* {{Harvnb|McCorduck|2004|pp=211–239}}

* {{Harvnb|Russell|Norvig|2003|pp=950–952}},

</ref>

</ref>

/ 参考

<ref name="Gödel himself">

<ref name="Gödel himself">

<ref name="Gödel himself">

{{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 "certain fact".

: 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 "certain fact".

在这个演讲中，Kurt g del 使用不完备性定理得出以下结论: (a)人类的思维不是一致的有限机器，或者(b)存在不能决定是否存在解的丢番图方程。德尔认为(b)是不可信的，因此似乎相信人类的大脑并不等同于一个有限的机器，也就是说，它的力量超过任何有限的机器。他认识到这只是一个猜想，因为人们永远无法反驳(b)。然而，他认为这个选言式的结论是一个“确定的事实”。

</ref>

</ref>

/ 参考

<ref name="The mathematical objection">

<ref name="The mathematical objection">

数学异议”

The Mathematical Objection:

The Mathematical Objection:

数学上的异议:

* {{Harvnb|Russell|Norvig|2003|p=949}}

* {{Harvnb|McCorduck|2004|pp=448–449}}

Making the Mathematical Objection:

Making the Mathematical Objection:

提出数学异议:

* {{Harvnb|Lucas|1961}}

* {{Harvnb|Penrose|1989}}

Refuting Mathematical Objection:

Refuting Mathematical Objection:

驳斥数学异议:

* {{Harvnb|Turing|1950}} under "(2) The Mathematical Objection"

* {{Harvnb|Hofstadter|1979}}

Background:

Background:

背景:

* {{Harvnb|Ref=none|Gödel|1931}}, {{Harvnb|Ref=none|Church|1936}}, {{Harvnb|Ref=none|Kleene|1935}}, {{Harvnb|Ref=none|Turing|1937}}

</ref>

</ref>

/ 参考

<ref name="Searle's strong AI">

<ref name="Searle's strong AI">

沙尔强大的人工智能

This version is from {{Harvtxt|Searle|1999}}, and is also quoted in {{Harvnb|Dennett|1991|p=435}}. Searle's original formulation was "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." {{Harv|Searle|1980|p=1}}. Strong AI is defined similarly by {{Harvtxt|Russell|Norvig|2003|p=947}}: "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."

This version is from , and is also quoted in . Searle's original formulation was "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." . Strong AI is defined similarly by : "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."

这个版本是从，也是在引用。Searle 最初的构想是“经过适当编程的计算机实际上是一种思维，从这个意义上说，只要编写了正确的程序，计算机就可以理解并拥有其他认知状态。”.强人工智能的定义与此类似: “认为机器可以智能地行动(或者更好地说，仿佛它们是智能的)的断言被哲学家称为‘弱人工智能’假说，而认为机器这样做实际上是在思考(而不是模拟思考)的断言则被称为‘强人工智能’假说。”

</ref>

</ref>

/ 参考

<ref name="Chinese room">

<ref name="Chinese room">

「中文房间」

Searle's [[Chinese room]] argument:

Searle's Chinese room argument:

塞尔的中文房间论点:

* {{Harvnb|Searle|1980}}. Searle's original presentation of the thought experiment.

* {{Harvnb|Searle|1999}}.

Discussion:

Discussion:

讨论:

* {{Harvnb|Russell|Norvig|2003|pp=958–960}}

* {{Harvnb|McCorduck|2004|pp=443–445}}

* {{Harvnb|Crevier|1993|pp=269–271}}

</ref>

</ref>

/ 参考





——预测———————————————————————————————————————————————————————————————————————————————————————————————— --

<ref name="Robot rights">

<ref name="Robot rights">

机器人版权“

[[Robot rights]]:

Robot rights:

返回文章页面机器人版权:

* {{Harvnb|Russell|Norvig|2003|p=964}}

* {{Harvnb|''BBC News''|2006}}

Prematurity of:

Prematurity of:

早产儿:

* {{Harvnb|Henderson|2007}}

In fiction:

In fiction:

在小说中:

* {{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]].

</ref>

</ref>

/ 参考



</ref>-->

/ ref --

<ref name="Weizenbaum's critique">

<ref name="Weizenbaum's critique">

裁判员名字「魏岑鲍姆批评」

[[Joseph Weizenbaum]]'s critique of AI:

Joseph Weizenbaum's critique of AI:

约瑟夫·维森鲍姆对人工智能的批判:

* {{Harvnb|Weizenbaum|1976}}

* {{Harvnb|Crevier|1993|pp=132–144}}

* {{Harvnb|McCorduck|2004|pp=356–373}}

* {{Harvnb|Russell|Norvig|2003|p=961}}

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.

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.

1976年，Weizenbaum (开发了第一个聊天机器人程序 ELIZA 的人工智能研究员)认为，人工智能的滥用有可能使人的生命贬值。

</ref>

</ref>

/ 参考

<ref name=Singularity>

<ref name=Singularity>

引用名称 singularity

[[Technological singularity]]:

Technological singularity:

技术奇异点:

* {{Harvnb|Vinge|1993}}

* {{Harvnb|Kurzweil|2005}}

* {{Harvnb|Russell|Norvig|2003|p=963}}

</ref>

</ref>

/ 参考

<ref name="recurse">

<ref name="recurse">

Recurse"

{{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.}}

</ref>

</ref>

/ 参考

<ref name="Transhumanism">

<ref name="Transhumanism">

反对者名字“超人主义”

[[Transhumanism]]:

Transhumanism:

返回文章页面超人主义:

* {{Harvnb|Moravec|1988}}

* {{Harvnb|Kurzweil|2005}}

* {{Harvnb|Russell|Norvig|2003|p=963}}

</ref>

</ref>

/ 参考

<ref name="AI as evolution">

<ref name="AI as evolution">

进化论，人工智能

AI as evolution:

AI as evolution:

人工智能与进化:

* [[Edward Fredkin]] is quoted in {{Harvtxt|McCorduck|2004|p=401}}.

* {{Harvnb|Butler|1863}}

* {{Harvnb|Dyson|1998}}

</ref>

</ref>

/ 参考

}}

}}

}}

=== AI textbooks ===

=== AI textbooks ===

人工智能课本

{{refbegin|30em}}

* {{cite book |ref=harv

| last=Hutter |first=Marcus |author-link=Marcus Hutter |year=2005

| last=Hutter |first=Marcus |author-link=Marcus Hutter |year=2005

作者链接: 马库斯 · 哈特2005

| title=Universal Artificial Intelligence

| title=Universal Artificial Intelligence

通用人工智能

| isbn=978-3-540-22139-5

| isbn=978-3-540-22139-5

| isbn 978-3-540-22139-5

| publisher=Springer

| publisher=Springer

出版商斯普林格

| location=Berlin

| location=Berlin

| 地点: 柏林

| title-link=AIXI }}

| title-link=AIXI }}

| title-link AIXI }

* {{cite book

|ref=harv

|ref=harv

不会有事的

|last=Jackson

|last=Jackson

杰克逊

|first=Philip

|first=Philip

第一个菲利普

|author-link=Philip C. Jackson, Jr.

|author-link=Philip C. Jackson, Jr.

作者链接小菲利普 · c · 杰克逊。

|year=1985

|year=1985

1985年

|title=Introduction to Artificial Intelligence

|title=Introduction to Artificial Intelligence

人工智能简介

|isbn=978-0-486-24864-6

|isbn=978-0-486-24864-6

[国际标准图书编号978-0-486-24864-6]

|publisher=Dover

|publisher=Dover

| 出版商 / Dover

|edition=2nd

|edition=2nd

第二版

|url-access=registration

|url-access=registration

访问注册

|url=https://archive.org/details/introductiontoar1985jack

|url=https://archive.org/details/introductiontoar1985jack

Https://archive.org/details/introductiontoar1985jack

}}

}}

}}

* {{cite book

|ref=harv

|ref=harv

不会有事的

|last1=Luger

|last1=Luger

1 Luger

|first1=George

|first1=George

首先，乔治

|author-link=George Luger

|author-link=George Luger

| 作者链接: George Luger

|last2=Stubblefield

|last2=Stubblefield

2 Stubblefield

|first2=William

|first2=William

| first2威廉

|author2-link=William Stubblefield

|author2-link=William Stubblefield

威廉 · 斯塔布尔菲尔德

|year=2004

|year=2004

2004年

|title=Artificial Intelligence: Structures and Strategies for Complex Problem Solving

|title=Artificial Intelligence: Structures and Strategies for Complex Problem Solving

人工智能: 复杂问题解决的结构和策略

|publisher=Benjamin/Cummings

|publisher=Benjamin/Cummings

出版商 benjamin / cummings

|edition=5th

|edition=5th

第五版

|isbn=978-0-8053-4780-7

|isbn=978-0-8053-4780-7

[国际标准图书编号978-0-8053-4780-7]

|url=https://archive.org/details/artificialintell0000luge

|url=https://archive.org/details/artificialintell0000luge

Https://archive.org/details/artificialintell0000luge

|url-access=registration

|url-access=registration

访问注册

}}

}}

}}

* {{cite book

| last=Neapolitan |first=Richard |last2=Jiang |first2=Xia |year=2018|authorlink1=Richard Neapolitan

| last=Neapolitan |first=Richard |last2=Jiang |first2=Xia |year=2018|authorlink1=Richard Neapolitan

那不勒斯人 | 第一个 Richard | 最后2个 Jiang | 第一个2个 Xia | 2018年 | 作者: Richard Neapolitan

| title=Artificial Intelligence: With an Introduction to Machine Learning

| title=Artificial Intelligence: With an Introduction to Machine Learning

人工智能: 机器学习入门

| publisher=Chapman & Hall/CRC

| publisher=Chapman & Hall/CRC

| 出版商 Chapman & hall / crc

| isbn= 978-1-138-50238-3

| isbn= 978-1-138-50238-3

[国际标准图书馆编号978-1-138-50238-3]

| url=https://www.crcpress.com/Contemporary-Artificial-Intelligence-Second-Edition/Neapolitan-Jiang/p/book/9781138502383

| url=https://www.crcpress.com/Contemporary-Artificial-Intelligence-Second-Edition/Neapolitan-Jiang/p/book/9781138502383

Https://www.crcpress.com/contemporary-artificial-intelligence-second-edition/neapolitan-jiang/p/book/9781138502383

}}

}}

}}

* {{cite book |ref=harv

| last=Nilsson |first=Nils |author-link=Nils Nilsson (researcher) |year=1998

| last=Nilsson |first=Nils |author-link=Nils Nilsson (researcher) |year=1998

Nils Nilsson (研究员) | 1998年

| title=Artificial Intelligence: A New Synthesis

| title=Artificial Intelligence: A New Synthesis

人工智能: 一种新的综合

|url=https://archive.org/details/artificialintell0000nils

|url=https://archive.org/details/artificialintell0000nils

Https://archive.org/details/artificialintell0000nils

|url-access=registration

|url-access=registration

访问注册

| publisher=Morgan Kaufmann

| publisher=Morgan Kaufmann

出版商摩根 · 考夫曼

| isbn=978-1-55860-467-4

| isbn=978-1-55860-467-4

[国际标准图书编号978-1-55860-467-4]

}}

}}

}}

* {{Russell Norvig 2003}}.

* {{Cite book |ref=harv

| first = Stuart J.

| first = Stuart J.

首先是斯图尔特 · j。

| last = Russell

| last = Russell

拉塞尔

| first2 = Peter

| first2 = Peter

第二名: 彼得

| last2 = Norvig

| last2 = Norvig

2 Norvig

| title = [[Artificial Intelligence: A Modern Approach]] 

| title = Artificial Intelligence: A Modern Approach 

人工智能: 一种现代的方法

| year = 2009

| year = 2009

2009年

| edition = 3rd

| edition = 3rd

第三版

| publisher = Prentice Hall

| publisher = Prentice Hall

出版商 Prentice Hall

| location = Upper Saddle River, New Jersey

| location = Upper Saddle River, New Jersey

| 位置: 新泽西州上萨德尔河

| isbn = 978-0-13-604259-4

| isbn = 978-0-13-604259-4

[国际标准图书编号978-0-13-604259-4]

| author-link=Stuart J. Russell

| author-link=Stuart J. Russell

作者链接斯图尔特 · j · 拉塞尔

| author2-link=Peter Norvig

| author2-link=Peter Norvig

| author2-link Peter Norvig

| pages=

| pages=

页数

}}.

}}.

}}.

* {{cite book |ref = harv

|first1 = David

|first1 = David

第一名: 大卫

|last1 = Poole

|last1 = Poole

最后1个普尔

|author-link = David Poole (researcher)

|author-link = David Poole (researcher)

作者链接大卫 · 普尔(研究员)

|first2 = Alan

|first2 = Alan

第二名: 艾伦

|last2 = Mackworth

|last2 = Mackworth

麦克沃斯

|author2-link = Alan Mackworth

|author2-link = Alan Mackworth

| author2-link 艾伦 · 麦克沃思

|first3 = Randy

|first3 = Randy

第三名: 兰迪

|last3 = Goebel

|last3 = Goebel

最后3格贝尔

|author3-link = Randy Goebel

|author3-link = Randy Goebel

| author3-link Randy Goebel

|year = 1998

|year = 1998

1998年

|title = Computational Intelligence: A Logical Approach

|title = Computational Intelligence: A Logical Approach

计算智能: 逻辑方法

|publisher = Oxford University Press

|publisher = Oxford University Press

牛津大学出版社

|location = New York

|location = New York

| 地点: 纽约

|isbn = 978-0-19-510270-3

|isbn = 978-0-19-510270-3

| isbn 978-0-19-510270-3

|url = https://archive.org/details/computationalint00pool

|url = https://archive.org/details/computationalint00pool

Https://archive.org/details/computationalint00pool

}}

}}

}}

* {{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 }}

* {{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 }}

* {{cite book

| last=Bundy |first=Alan |author-link=Alan Bundy |year=1980

| last=Bundy |first=Alan |author-link=Alan Bundy |year=1980

1980年

| title=Artificial Intelligence: An Introductory Course

| title=Artificial Intelligence: An Introductory Course

人工智能: 入门课程

| publisher = Edinburgh University Press|edition=2nd

| publisher = Edinburgh University Press|edition=2nd

| 出版商爱丁堡大学出版社 | 第二版

| isbn=978-0-85224-410-4

| isbn=978-0-85224-410-4

[国际标准图书编号978-0-85224-410-4]

}}

}}

}}

* {{cite book |ref=harv

|first1=David |last1=Poole |author-link=David Poole (researcher)

|first1=David |last1=Poole |author-link=David Poole (researcher)

作者链接大卫 · 普尔(研究员)

|first2=Alan |last2=Mackworth |author2-link=Alan Mackworth

|first2=Alan |last2=Mackworth |author2-link=Alan Mackworth

作者: 艾伦 · 麦克沃思

|year=2017

|year=2017

2017年

|title=Artificial Intelligence: Foundations of Computational Agents

|title=Artificial Intelligence: Foundations of Computational Agents

人工智能: 计算机代理的基础

|publisher = Cambridge University Press|edition=2nd

|publisher = Cambridge University Press|edition=2nd

出版商: 剑桥大学出版社

|isbn=978-1-107-19539-4

|isbn=978-1-107-19539-4

[国际标准图书编号978-1-107-19539-4]

|url=http://artint.info/index.html

|url=http://artint.info/index.html

Http://artint.info/index.html

}}

}}

}}

{{refend}}

=== History of AI ===

=== History of AI ===

人工智能的历史

{{refbegin|30em}}

* {{Crevier 1993}}.

* {{McCorduck 2004}}.

* {{cite book

| last=Newquist |first=HP |author-link=HP Newquist |year=1994

| last=Newquist |first=HP |author-link=HP Newquist |year=1994

纽奎斯特 | 第一惠普 | 作者林克 · 纽奎斯特 | 1994年

| title=The Brain Makers: Genius, Ego, And Greed In The Quest For Machines That Think

| title=The Brain Makers: Genius, Ego, And Greed In The Quest For Machines That Think

大脑制造者: 寻找思考机器的天才、自我和贪婪

| publisher=Macmillan/SAMS |location=New York

| publisher=Macmillan/SAMS |location=New York

| 出版商 macmillan / sams | 位置: 纽约

| isbn= 978-0-672-30412-5 |ref=harv

| isbn= 978-0-672-30412-5 |ref=harv

| isbn 978-0-672-30412-5 | ref harv

}}

}}

}}

* {{cite book

| last=Nilsson |first=Nils |author-link=Nils Nilsson (researcher) |year=2009

| last=Nilsson |first=Nils |author-link=Nils Nilsson (researcher) |year=2009

作者链接 Nils Nilsson (研究员) | 2009年

| title=The Quest for Artificial Intelligence: A History of Ideas and Achievements

| title=The Quest for Artificial Intelligence: A History of Ideas and Achievements

人工智能的探索: 思想和成就的历史

| publisher=Cambridge University Press |location=New York

| publisher=Cambridge University Press |location=New York

出版商剑桥大学出版社 | 位置纽约

| isbn=978-0-521-12293-1

| isbn=978-0-521-12293-1

[国际标准图书编号978-0-521-12293-1]

}}

}}

}}

{{refend}}

=== Other sources ===

=== Other sources ===

其他来源

{{refbegin|30em}}

* {{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 }}

* {{cite web

|ref = {{harvid|ACM|1998}}

|ref =

不会

|publisher = [[Association for Computing Machinery|ACM]]

|publisher = ACM

| 出版商 ACM

|year = 1998

|year = 1998

1998年

|title = ACM Computing Classification System: Artificial intelligence

|title = ACM Computing Classification System: Artificial intelligence

ACM 电脑分类系统: 人工智能

|url = http://www.acm.org/class/1998/I.2.html

|url = http://www.acm.org/class/1998/I.2.html

Http://www.acm.org/class/1998/i.2.html

|accessdate = 30 August 2007

|accessdate = 30 August 2007

2007年8月30日

|url-status = dead

|url-status = dead

状态死机

|archiveurl = https://web.archive.org/web/20071012025921/http://www.acm.org/class/1998/I.2.html

|archiveurl = https://web.archive.org/web/20071012025921/http://www.acm.org/class/1998/I.2.html

| archiveurl https://web.archive.org/web/20071012025921/http://www.acm.org/class/1998/i.2.html

|archivedate = 12 October 2007

|archivedate = 12 October 2007

2007年10月12日

|df = dmy-all

|df = dmy-all

我不会放过你的

}}

}}

}}

* {{cite book |ref=harv

| last1=Goodman |first1=Joanna |author-link=Joanna Goodman

| last1=Goodman |first1=Joanna |author-link=Joanna Goodman

乔安娜作者链接: 乔安娜 · 古德曼

| year=2016

| year=2016

2016年

| title=Robots in Law: How Artificial Intelligence is Transforming Legal Services

| title=Robots in Law: How Artificial Intelligence is Transforming Legal Services

法律中的机器人: 人工智能如何改变法律服务

| publisher=Ark Group |edition=1st

| publisher=Ark Group |edition=1st

| 出版商方舟集团 | 第一版

| isbn=978-1-78358-264-8

| isbn=978-1-78358-264-8

[国际标准图书馆编号978-1-78358-264-8]

| url=https://www.ark-group.com/product/robots-law-how-artificial-intelligence-transforming-legal-services

| url=https://www.ark-group.com/product/robots-law-how-artificial-intelligence-transforming-legal-services

Https://www.ark-group.com/product/robots-law-how-artificial-intelligence-transforming-legal-services

}}

}}

}}

* {{cite encyclopedia

|ref=harv

|ref=harv

不会有事的

|last=Albus

|last=Albus

最后的阿不思

|first=J. S.

|first=J. S.

首先是 j。美国。

|year=2002

|year=2002

2002年

|pages=11–20

|pages=11–20

第11-20页

|title=4-D/RCS: A Reference Model Architecture for Intelligent Unmanned Ground Vehicles

|title=4-D/RCS: A Reference Model Architecture for Intelligent Unmanned Ground Vehicles

| title 4-d / rcs: 智能无人地面车辆参考模型体系结构

|editor1-last=Gerhart

|editor1-last=Gerhart

| 编辑1-last Gerhart

|editor-first=G.

|editor-first=G.

| 编辑-第一个 g。

|editor2-last=Gunderson

|editor2-last=Gunderson

| 编辑2-last Gunderson

|editor2-first=R.

|editor2-first=R.

| 编辑2-first r。

|editor3-last=Shoemaker

|editor3-last=Shoemaker

最后一个鞋匠

|editor3-first=C.

|editor3-first=C.

3-first c.

|encyclopedia=Proceedings of the SPIE AeroSense Session on Unmanned Ground Vehicle Technology

|encyclopedia=Proceedings of the SPIE AeroSense Session on Unmanned Ground Vehicle Technology

美国国家科学院院刊航空感应会议关于无人地面载具技术

|volume=3693

|volume=3693

第3693卷

|url=http://www.isd.mel.nist.gov/documents/albus/4DRCS.pdf

|url=http://www.isd.mel.nist.gov/documents/albus/4DRCS.pdf

Http://www.isd.mel.nist.gov/documents/albus/4drcs.pdf

|archive-url=https://web.archive.org/web/20040725051856/http://www.isd.mel.nist.gov/documents/albus/4DRCS.pdf

|archive-url=https://web.archive.org/web/20040725051856/http://www.isd.mel.nist.gov/documents/albus/4DRCS.pdf

| 档案-网址 https://web.archive.org/web/20040725051856/http://www.isd.mel.nist.gov/documents/albus/4drcs.pdf

|url-status=dead

|url-status=dead

状态死机

|archive-date=25 July 2004

|archive-date=25 July 2004

| 档案-日期2004年7月25日

|df=

|df=

我不会让你失望的

|bibcode=2002SPIE.4715..303A

|bibcode=2002SPIE.4715..303A

| bibcode 2002SPIE. 4715. . 303 a

|doi=10.1117/12.474462

|doi=10.1117/12.474462

10.1117 / 12.474462

|citeseerx=10.1.1.15.14

|citeseerx=10.1.1.15.14

10.1.1.15.14

|chapter=4D/RCS: A reference model architecture for intelligent unmanned ground vehicles

|chapter=4D/RCS: A reference model architecture for intelligent unmanned ground vehicles

| 第4d / rcs: 智能无人地面车辆参考模型体系结构

|series=Unmanned Ground Vehicle Technology IV

|series=Unmanned Ground Vehicle Technology IV

系列无人地面载具

}}

}}

}}

* {{Cite book

| last = Aleksander | first= Igor | authorlink = Igor Aleksander

| last = Aleksander | first= Igor | authorlink = Igor Aleksander

最后 | 第一个 Igor | 作者链接 Igor Aleksander

| year=1995

| year=1995

1995年

| title= Artificial Neuroconsciousness: An Update

| title= Artificial Neuroconsciousness: An Update

人工神经意识: 更新

| publisher=IWANN

| publisher=IWANN

出版商 IWANN

| url = http://www.ee.ic.ac.uk/research/neural/publications/iwann.html

| url = http://www.ee.ic.ac.uk/research/neural/publications/iwann.html

Http://www.ee.ic.ac.uk/research/neural/publications/iwann.html

| archiveurl = https://web.archive.org/web/19970302014628/http://www.ee.ic.ac.uk/research/neural/publications/iwann.html

| archiveurl = https://web.archive.org/web/19970302014628/http://www.ee.ic.ac.uk/research/neural/publications/iwann.html

| archiveurl https://web.archive.org/web/19970302014628/http://www.ee.ic.ac.uk/research/neural/publications/iwann.html

| archivedate = 2 March 1997

| archivedate = 2 March 1997

1997年3月2日

| ref = harv

| ref = harv

不会有事的

}} [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}}.

}} [http://dblp.uni-trier.de/rec/bibtex/conf/iwann/Aleksander95 BibTex] .

[}}[ http://dblp.uni-trier.de/rec/BibTex/conf/iwann/aleksander95 / BibTex ].

* {{cite encyclopedia |ref=harv

| last=Bach |first=Joscha |year=2008 |pages=63–74

| last=Bach |first=Joscha |year=2008 |pages=63–74

最后巴赫 | 第一约沙 | 2008年 | 第63-74页

| title=Seven Principles of Synthetic Intelligence

| title=Seven Principles of Synthetic Intelligence

7 Principles of Synthetic Intelligence | title 7 Principles of Synthetic Intelligence

| editor1-last=Wang |editor1-first=Pei |editor2-last=Goertzel |editor2-first=Ben |editor3-last=Franklin |editor3-first=Stan

| editor1-last=Wang |editor1-first=Pei |editor2-last=Goertzel |editor2-first=Ben |editor3-last=Franklin |editor3-first=Stan

[参考译文][参考译文][参考译文][参考译文][参考译文][参考译文][参考译文]

| work=Artificial General Intelligence, 2008: Proceedings of the First AGI Conference

| work=Artificial General Intelligence, 2008: Proceedings of the First AGI Conference

| 工作人工通用智能，2008: 第一次 AGI 会议记录

| publisher=IOS Press |isbn=978-1-58603-833-5

| publisher=IOS Press |isbn=978-1-58603-833-5

| 出版商 IOS 出版社 | isbn 978-1-58603-833-5

| url=https://books.google.com/books?id=a_ZR81Z25z0C&pg=PA63

| url=https://books.google.com/books?id=a_ZR81Z25z0C&pg=PA63

Https://books.google.com/books?id=a_zr81z25z0c&pg=pa63

}}

}}

}}

* {{cite news |ref={{harvid|''BBC News''|2006}}

| date=21 December 2006

| date=21 December 2006

2006年12月21日

| title=Robots could demand legal rights |work=BBC News

| title=Robots could demand legal rights |work=BBC News

机器人可以要求合法权利 | BBC 新闻

| url=http://news.bbc.co.uk/2/hi/technology/6200005.stm |accessdate=3 February 2011

| url=http://news.bbc.co.uk/2/hi/technology/6200005.stm |accessdate=3 February 2011

Http://news.bbc.co.uk/2/hi/technology/6200005.stm : 2011年2月3日

}}

}}

}}

* {{cite journal |ref=harv

| last=Brooks |first=Rodney |authorlink=Rodney Brooks |year=1990

| last=Brooks |first=Rodney |authorlink=Rodney Brooks |year=1990

罗德尼 · 布鲁克斯，1990年

| title=Elephants Don't Play Chess

| title=Elephants Don't Play Chess

大象不下国际象棋

| journal=Robotics and Autonomous Systems |volume=6 | issue=1–2 |pages=3–15

| journal=Robotics and Autonomous Systems |volume=6 | issue=1–2 |pages=3–15

机器人学与自主系统 | 第六卷 | 第1-2期 | 第3-15页

| doi=10.1016/S0921-8890(05)80025-9

| doi=10.1016/S0921-8890(05)80025-9

10.1016 / S0921-8890(05)80025-9

| 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

| 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

Http://people.csail.mit.edu/brooks/papers/elephants.pdf https://web.archive.org/web/20070809020912/http://people.csail.mit.edu/brooks/papers/elephants.pdf

| archivedate=9 August 2007 |url-status=live

| archivedate=9 August 2007 |url-status=live

2007年8月9日

| citeseerx=10.1.1.588.7539 }}

| citeseerx=10.1.1.588.7539 }}

10.1.1.588.7539}

* {{cite encyclopedia |ref=harv

| last=Brooks |first=R. A. |year=1991 |pages=225–239

| last=Brooks |first=R. A. |year=1991 |pages=225–239

| 最后的布鲁克斯 | 最初的 r。答:。1991年，第225-239页

| title=How to build complete creatures rather than isolated cognitive simulators

| title=How to build complete creatures rather than isolated cognitive simulators

如何建造完整的生物而不是孤立的认知模拟器

| editor-last=VanLehn |editor-first=K.

| editor-last=VanLehn |editor-first=K.

| 编辑-最后一个 VanLehn | 编辑-第一个 k。

| encyclopedia=Architectures for Intelligence |location=Hillsdale, NJ |publisher=Lawrence Erlbaum Associates

| encyclopedia=Architectures for Intelligence |location=Hillsdale, NJ |publisher=Lawrence Erlbaum Associates

| 情报百科全书架构 | 位置希尔斯代尔，新泽西 | 出版商 Lawrence Erlbaum Associates

|citeseerx=10.1.1.52.9510}}

|citeseerx=10.1.1.52.9510}}

10.1.1.52.9510}

* {{cite journal

|ref=harv

|ref=harv

不会有事的

|last=Buchanan

|last=Buchanan

最后的布坎南

|first=Bruce G.

|first=Bruce G.

首先是布鲁斯 · g。

|year=2005

|year=2005

2005年

|pages=53–60

|pages=53–60

第53-60页

|title=A (Very) Brief History of Artificial Intelligence

|title=A (Very) Brief History of Artificial Intelligence

人工智能简史

|journal=AI Magazine

|journal=AI Magazine

人工智能杂志

|url=http://www.aaai.org/AITopics/assets/PDF/AIMag26-04-016.pdf

|url=http://www.aaai.org/AITopics/assets/PDF/AIMag26-04-016.pdf

Http://www.aaai.org/aitopics/assets/pdf/aimag26-04-016.pdf

|archiveurl=https://web.archive.org/web/20070926023314/http://www.aaai.org/AITopics/assets/PDF/AIMag26-04-016.pdf

|archiveurl=https://web.archive.org/web/20070926023314/http://www.aaai.org/AITopics/assets/PDF/AIMag26-04-016.pdf

| archiveurl https://web.archive.org/web/20070926023314/http://www.aaai.org/aitopics/assets/pdf/aimag26-04-016.pdf

|archivedate=26 September 2007

|archivedate=26 September 2007

2007年9月26日

|url-status=dead

|url-status=dead

状态死机

|df=dmy

|df=dmy

我不会让你失望的

}}

}}

}}

* {{cite news |ref=harv

| last=Butler |first=Samuel |authorlink=Samuel Butler (novelist) |date=13 June 1863

| last=Butler |first=Samuel |authorlink=Samuel Butler (novelist) |date=13 June 1863

塞缪尔 · 巴特勒(小说家)1863年6月13日

| title=Darwin among the Machines

| title=Darwin among the Machines

标题: 机器中的达尔文

| work=[[The Press]] |location=Christchurch, New Zealand |department=Letters to the Editor

| work=The Press |location=Christchurch, New Zealand |department=Letters to the Editor

| 工作 | 新闻 | 位置基督城 | 给编辑的信

| url=http://www.nzetc.org/tm/scholarly/tei-ButFir-t1-g1-t1-g1-t4-body.html |accessdate=16 October 2014

| url=http://www.nzetc.org/tm/scholarly/tei-ButFir-t1-g1-t1-g1-t4-body.html |accessdate=16 October 2014

Http://www.nzetc.org/tm/scholarly/tei-butfir-t1-g1-t1-g1-t4-body.html : 2014年10月16日

| via=Victoria University of Wellington

| via=Victoria University of Wellington

惠灵顿维多利亚大学

}}

}}

}}

* {{cite web |ref=harv

|url = https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence

|url = https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence

Https://www.bloomberg.com/news/articles/2015-12-08/why-2015-was-a-breakthrough-year-in-artificial-intelligence

|title = Why 2015 Was a Breakthrough Year in Artificial Intelligence

|title = Why 2015 Was a Breakthrough Year in Artificial Intelligence

为什么2015年是人工智能的突破之年

|last = Clark

|last = Clark

最后的克拉克

|first = Jack

|first = Jack

先是杰克

|website = Bloomberg News

|website = Bloomberg News

彭博新闻网

|date = 8 December 2015

|date = 8 December 2015

2015年12月8日

|access-date = 23 November 2016

|access-date = 23 November 2016

| 2016年11月23日

|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.

|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.

经过5年人工智能领域的悄然突破，2015年成为了具有里程碑意义的一年。计算机比以往更聪明，学习速度更快。

|url-status = live

|url-status = live

状态直播

|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

|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

| 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

|archivedate = 23 November 2016

|archivedate = 23 November 2016

2016年11月23日

|df = dmy-all

|df = dmy-all

我不会放过你的

}}

}}

}}

* {{cite news |ref={{harvid|''CNN''|2006}}

| title=AI set to exceed human brain power

| title=AI set to exceed human brain power

| 人工智能将超越人脑能力

| work=CNN |date=26 July 2006

| work=CNN |date=26 July 2006

2006年7月26日

| url=http://www.cnn.com/2006/TECH/science/07/24/ai.bostrom/

| url=http://www.cnn.com/2006/TECH/science/07/24/ai.bostrom/

Http://www.cnn.com/2006/tech/science/07/24/ai.bostrom/

| archiveurl= https://web.archive.org/web/20080219001624/http://www.cnn.com/2006/TECH/science/07/24/ai.bostrom/

| archiveurl= https://web.archive.org/web/20080219001624/http://www.cnn.com/2006/TECH/science/07/24/ai.bostrom/

| archiveurl https://web.archive.org/web/20080219001624/http://www.cnn.com/2006/tech/science/07/24/ai.bostrom/

| archivedate=19 February 2008 |url-status=live

| archivedate=19 February 2008 |url-status=live

2008年2月19日

}}

}}

}}

* {{cite book |ref=harv

| last=Dennett | first=Daniel | author-link=Daniel Dennett

| last=Dennett | first=Daniel | author-link=Daniel Dennett

丹尼特丹尼特丹尼特丹尼尔丹尼尔丹尼特丹尼尔丹尼特丹尼尔丹尼特丹尼尔丹尼特丹尼尔丹尼特

| year=1991

| year=1991

1991年

| title=Consciousness Explained

| title=Consciousness Explained

意识的解释

| publisher=The Penguin Press

| publisher=The Penguin Press

企鹅出版社

| isbn= 978-0-7139-9037-9

| isbn= 978-0-7139-9037-9

[国际标准图书编号978-0-7139-9037-9]

| title-link=Consciousness Explained }}

| title-link=Consciousness Explained }}

| 标题-链接意识解释}

* {{cite book |ref=harv

-->* {{cite book |ref=harv

-- * { cite book | ref harv

|first1=Pedro |last1=Domingos |author-link=Pedro Domingos

|first1=Pedro |last1=Domingos |author-link=Pedro Domingos

| first1 Pedro | last1 Domingos | 作者链接 Pedro Domingos

|year=2015

|year=2015

2015年

|title=The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World

|title=The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World

大师级算法: 探索终极学习机器将如何改造我们的世界

|publisher = Basic Books

|publisher = Basic Books

| 出版商 Basic Books

|isbn=978-0-465-06192-1

|isbn=978-0-465-06192-1

[国际标准图书编号978-0-465-06192-1]

|title-link=The Master Algorithm }}

|title-link=The Master Algorithm }}

| title-link The Master Algorithm }

* {{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 }}

* {{cite book |ref=harv

| last=Dreyfus | first=Hubert | authorlink = Hubert Dreyfus

| last=Dreyfus | first=Hubert | authorlink = Hubert Dreyfus

作者: 休伯特 · 德雷福斯

| year = 1972

| year = 1972

1972年

| title = What Computers Can't Do

| title = What Computers Can't Do

计算机不能做什么

| publisher = MIT Press | location = New York

| publisher = MIT Press | location = New York

| 出版商麻省理工学院出版社 | 位置纽约

| isbn = 978-0-06-011082-6

| isbn = 978-0-06-011082-6

[国际标准图书编号978-0-06-011082-6]

| title-link=What Computers Can't Do }}

| title-link=What Computers Can't Do }}

| title-link What Computers can’t Do }

* {{cite book |ref = harv

|last = Dreyfus

|last = Dreyfus

最后一个德雷福斯

|first = Hubert

|first = Hubert

首先是休伯特

|authorlink = Hubert Dreyfus

|authorlink = Hubert Dreyfus

作者: 休伯特 · 德雷福斯

|last2 = Dreyfus

|last2 = Dreyfus

最后2名路易达孚

|first2 = Stuart

|first2 = Stuart

| first2 Stuart

|year = 1986

|year = 1986

1986年

|title = Mind over Machine: The Power of Human Intuition and Expertise in the Era of the Computer

|title = Mind over Machine: The Power of Human Intuition and Expertise in the Era of the Computer

心智胜过机器: 计算机时代人类直觉和专业知识的力量

|publisher = Blackwell

|publisher = Blackwell

| 出版商 Blackwell

|location = Oxford, UK

|location = Oxford, UK

| 位置: 牛津，英国

|isbn = 978-0-02-908060-3

|isbn = 978-0-02-908060-3

[国际标准图书编号978-0-02-908060-3]

|url = https://archive.org/details/mindovermachinep00drey

|url = https://archive.org/details/mindovermachinep00drey

Https://archive.org/details/mindovermachinep00drey

}}

}}

}}

* {{cite book |ref=harv

| last=Dreyfus | first=Hubert | authorlink = Hubert Dreyfus

| last=Dreyfus | first=Hubert | authorlink = Hubert Dreyfus

作者: 休伯特 · 德雷福斯

| year =1992

| year =1992

1992年

| title = What Computers ''Still'' Can't Do

| title = What Computers Still Can't Do

计算机仍然不能做什么

| publisher = MIT Press | location = New York

| publisher = MIT Press | location = New York

| 出版商麻省理工学院出版社 | 位置纽约

| isbn=978-0-262-54067-4

| isbn=978-0-262-54067-4

[国际标准图书编号978-0-262-54067-4]

}}

}}

}}

* {{cite book

|ref=harv

|ref=harv

不会有事的

|last=Dyson

|last=Dyson

戴森

|first=George

|first=George

先是乔治

|authorlink=George Dyson (science historian)

|authorlink=George Dyson (science historian)

乔治 · 戴森(科学历史学家)

|year=1998

|year=1998

1998年

|title=Darwin among the Machines

|title=Darwin among the Machines

标题: 机器中的达尔文

|publisher=Allan Lane Science

|publisher=Allan Lane Science

| 出版人 Allan Lane Science

|isbn=978-0-7382-0030-9

|isbn=978-0-7382-0030-9

[国际标准图书馆编号978-0-7382-0030-9]

|url=https://archive.org/details/darwinamongmachi00dyso

|url=https://archive.org/details/darwinamongmachi00dyso

Https://archive.org/details/darwinamongmachi00dyso

}}

}}

}}

* {{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}}

* {{cite book |ref=harv

| last=Edelson |first=Edward |year=1991

| last=Edelson |first=Edward |year=1991

1991年

| title=The Nervous System

| title=The Nervous System

神经系统

|url=https://archive.org/details/nervoussystem0000edel

|url=https://archive.org/details/nervoussystem0000edel

Https://archive.org/details/nervoussystem0000edel

|url-access=registration

|url-access=registration

访问注册

| publisher=Chelsea House |location=New York |isbn=978-0-7910-0464-7

| publisher=Chelsea House |location=New York |isbn=978-0-7910-0464-7

| 出版商切尔西之家! -- 所以 worldcat，最初在这里 remmel nunn-- | 位置纽约 | isbn 978-0-7910-0464-7

}}

}}

}}

* {{cite book |ref=harv

| last=Fearn

| last=Fearn

最后的恐惧

| first = Nicholas

| first = Nicholas

| first = Nicholas

| year =2007

| year =2007

2007年

| title= The Latest Answers to the Oldest Questions: A Philosophical Adventure with the World's Greatest Thinkers

| title= The Latest Answers to the Oldest Questions: A Philosophical Adventure with the World's Greatest Thinkers

最古老问题的最新答案: 世界上最伟大思想家的哲学探险

| publisher = Grove Press

| publisher = Grove Press

出版商: 格罗夫出版社

| location=New York |isbn=978-0-8021-1839-4

| location=New York |isbn=978-0-8021-1839-4

| 位置纽约 | isbn 978-0-8021-1839-4

}}

}}

}}

* {{cite book |ref=harv

| last = Gladwell | first = Malcolm | authorlink= Malcolm Gladwell

| last = Gladwell | first = Malcolm | authorlink= Malcolm Gladwell

2012年10月12日 | 最后一个马尔科姆·格拉德威尔 | 第一个 Malcolm | 作者 / 链接

| year = 2005

| year = 2005

2005年

| title = Blink

| title = Blink

标题: 眨眼

| isbn = 978-0-316-17232-5

| isbn = 978-0-316-17232-5

[国际标准图书编号978-0-316-17232-5]

| publisher = Little, Brown and Co. | location = New York

| publisher = Little, Brown and Co. | location = New York

| 出版商 Little，Brown and co. | 位置: 纽约

| title-link = Blink (book) }}

| title-link = Blink (book) }}

| title-link Blink (book)}

* {{cite conference | ref=harv

| last=Gödel |first=Kurt |authorlink=Kurt Gödel |year=1951

| last=Gödel |first=Kurt |authorlink=Kurt Gödel |year=1951

1951年

| title=Some basic theorems on the foundations of mathematics and their implications

| title=Some basic theorems on the foundations of mathematics and their implications

关于数学基础的一些基本定理及其意义

| conference=Gibbs Lecture

| conference=Gibbs Lecture

会议吉布斯讲座

}} In {{cite book

}} In {{cite book

}在 br / { cite book

| editor-last=Feferman |editor-first=Solomon |editorlink=Solomon Feferman |year=1995 |pages=304–23

| editor-last=Feferman |editor-first=Solomon |editorlink=Solomon Feferman |year=1995 |pages=304–23

| 编辑-最后费尔曼 | 编辑-第一所罗门 | 编辑链接所罗门费尔曼 | 1995年 | 第304-23页

| title=Kurt Gödel: Collected Works, Vol. III: Unpublished Essays and Lectures

| title=Kurt Gödel: Collected Works, Vol. III: Unpublished Essays and Lectures

库尔特 · 德尔: 作品集，第卷。三: 未发表的文章和讲座

| publisher=Oxford University Press |isbn=978-0-19-514722-3

| publisher=Oxford University Press |isbn=978-0-19-514722-3

牛津大学出版社 | isbn 978-0-19-514722-3

}}

}}

}}

* {{cite book |ref=harv

| last=Haugeland | first=John | author-link = John Haugeland

| last=Haugeland | first=John | author-link = John Haugeland

作者链接: 约翰 · 豪格兰德

| year = 1985

| year = 1985

1985年

| title = Artificial Intelligence: The Very Idea

| title = Artificial Intelligence: The Very Idea

人工智能: 最重要的理念

| publisher=MIT Press| location= Cambridge, Mass.

| publisher=MIT Press| location= Cambridge, Mass.

麻省理工学院出版社 | 位置: 马萨诸塞州剑桥。

| isbn=978-0-262-08153-5

| isbn=978-0-262-08153-5

[国际标准图书馆编号978-0-262-08153-5]

}}

}}

}}

* {{cite book |ref=harv

| last=Hawkins | first=Jeff | author-link=Jeff Hawkins

| last=Hawkins | first=Jeff | author-link=Jeff Hawkins

作者链接杰夫 · 霍金斯

| last2=Blakeslee | first2=Sandra

| last2=Blakeslee | first2=Sandra

2 Blakeslee | first2 Sandra

| year=2005

| year=2005

2005年

| title=On Intelligence

| title=On Intelligence

关于智力

| publisher=Owl Books | location=New York, NY

| publisher=Owl Books | location=New York, NY

| 出版商 Owl Books | 位置: 纽约，纽约

| isbn=978-0-8050-7853-4

| isbn=978-0-8050-7853-4

[国际标准图书馆编号978-0-8050-7853-4]

| title-link=On Intelligence }}

| title-link=On Intelligence }}

| title-link On Intelligence }

* {{cite news |ref=harv

| last=Henderson |first=Mark |date=24 April 2007

| last=Henderson |first=Mark |date=24 April 2007

2007年4月24日

| title=Human rights for robots? We're getting carried away

| title=Human rights for robots? We're getting carried away

| 题目: 机器人的人权？我们太激动了

| url=http://www.thetimes.co.uk/tto/technology/article1966391.ece

| url=http://www.thetimes.co.uk/tto/technology/article1966391.ece

Http://www.thetimes.co.uk/tto/technology/article1966391.ece

| work=The Times Online | location=London

| work=The Times Online | location=London

纽约时报在线 | 位置: 伦敦

}}

}}

}}

* {{cite journal |ref=harv

| last=Hernandez-Orallo |first=Jose |year=2000

| last=Hernandez-Orallo |first=Jose |year=2000

最后赫尔南德斯-奥拉罗 | 第一何塞 | 2000年

| title=Beyond the Turing Test

| title=Beyond the Turing Test

超越图灵测试

| journal=Journal of Logic, Language and Information |volume=9 |issue=4 |pages=447–466

| journal=Journal of Logic, Language and Information |volume=9 |issue=4 |pages=447–466

逻辑、语言与信息杂志 | 第9卷 | 第4期 | 第447-466页

| doi=10.1023/A:1008367325700

| doi=10.1023/A:1008367325700

10.1023 / a: 1008367325700

}}

}}

}}

* {{cite journal |ref=harv

| last1=Hernandez-Orallo |first1=J. |last2=Dowe |first2=D. L. |year=2010

| last1=Hernandez-Orallo |first1=J. |last2=Dowe |first2=D. L. |year=2010

| 最后一次赫尔南德斯-奥拉罗 | 初次1 j。2 d.2010年

| title=Measuring Universal Intelligence: Towards an Anytime Intelligence Test

| title=Measuring Universal Intelligence: Towards an Anytime Intelligence Test

测量普遍智力: 走向随时智力测试

| journal=Artificial Intelligence |volume=174 |issue=18 |pages=1508–1539

| journal=Artificial Intelligence |volume=174 |issue=18 |pages=1508–1539

人工智能杂志 | 第174卷 | 第18期 | 第1508-1539页

| doi=10.1016/j.artint.2010.09.006

| doi=10.1016/j.artint.2010.09.006

10.1016 / j.artint. 2010.09.006

|citeseerx=10.1.1.295.9079}}

|citeseerx=10.1.1.295.9079}}

10.1.1.295.9079}

* {{cite journal |ref=harv

| last=Hinton |first=G. E. |year=2007

| last=Hinton |first=G. E. |year=2007

最后辛顿 | 第一个 g。2007年

| title=Learning multiple layers of representation

| title=Learning multiple layers of representation

学习多层次的表现

| journal=Trends in Cognitive Sciences |volume=11 | issue=10 |pages=428–434 | doi=10.1016/j.tics.2007.09.004

| journal=Trends in Cognitive Sciences |volume=11 | issue=10 |pages=428–434 | doi=10.1016/j.tics.2007.09.004

认知科学趋势 | 第11卷 | 第10期 | 第428-434页 | doi 10.1016 / j.tics. 2007.09.004

| pmid=17921042 }}

| pmid=17921042 }}

17921042}

* {{cite book |ref=harv

| last=Hofstadter | first = Douglas | author-link = Douglas Hofstadter

| last=Hofstadter | first = Douglas | author-link = Douglas Hofstadter

侯世达: 2012年3月15日

| year = 1979

| year = 1979

1979年

| title = Gödel, Escher, Bach: an Eternal Golden Braid

| title = Gödel, Escher, Bach: an Eternal Golden Braid

巴赫: 永恒的金色辫子

| isbn=978-0-394-74502-2

| isbn=978-0-394-74502-2

[国际标准图书编号978-0-394-74502-2]

| publisher=Vintage Books

| publisher=Vintage Books

出版商 Vintage Books

| location=New York, NY

| location=New York, NY

纽约，纽约

| title-link=Gödel, Escher, Bach }}

| title-link=Gödel, Escher, Bach }}

| title-link=Gödel, Escher, Bach }}

* {{cite book

|ref=harv

|ref=harv

不会有事的

|last=Holland

|last=Holland

去年荷兰

|first=John H.

|first=John H.

首先是约翰 · h。

|year=1975

|year=1975

1975年

|title=Adaptation in Natural and Artificial Systems

|title=Adaptation in Natural and Artificial Systems

自然和人工系统中的适应

|publisher=University of Michigan Press

|publisher=University of Michigan Press

出版商密西根大学出版社

|isbn=978-0-262-58111-0

|isbn=978-0-262-58111-0

[国际标准图书馆编号978-0-262-58111-0]

|url-access=registration

|url-access=registration

访问注册

|url=https://archive.org/details/adaptationinnatu00holl

|url=https://archive.org/details/adaptationinnatu00holl

Https://archive.org/details/adaptationinnatu00holl

}}

}}

}}

* {{cite web |ref=harv

| first = J. | last = Howe

| first = J. | last = Howe

首先是 j。最后豪

| date = November 1994

| date = November 1994

1994年11月

| title = Artificial Intelligence at Edinburgh University: a Perspective

| title = Artificial Intelligence at Edinburgh University: a Perspective

爱丁堡大学的人工智能: 一个远景

| url=http://www.inf.ed.ac.uk/about/AIhistory.html | accessdate=30 August 2007

| url=http://www.inf.ed.ac.uk/about/AIhistory.html | accessdate=30 August 2007

Http://www.inf.ed.ac.uk/about/aihistory.html : 2007年8月30日

}}

}}

}}

* {{cite book |ref=harv

| last=Hutter |first=M. |year=2012

| last=Hutter |first=M. |year=2012

| 最后的哈特 | 第一个 m。2012年

| title=Theoretical Foundations of Artificial General Intelligence

| title=Theoretical Foundations of Artificial General Intelligence

人工智能的理论基础

| chapter=One Decade of Universal Artificial Intelligence

| chapter=One Decade of Universal Artificial Intelligence

通用人工智能的十年

| volume=4 | pages=67–88 |series=Atlantis Thinking Machines

| volume=4 | pages=67–88 |series=Atlantis Thinking Machines

| 第4卷 | 第67-88页 | 亚特兰蒂斯思考机器系列

| doi=10.2991/978-94-91216-62-6_5 |isbn=978-94-91216-61-9

| doi=10.2991/978-94-91216-62-6_5 |isbn=978-94-91216-61-9

10.2991 / 978-94-91216-62-65 | isbn 978-94-91216-61-9

| citeseerx=10.1.1.228.8725 }}

| citeseerx=10.1.1.228.8725 }}

10.1.1.228.8725}

* {{cite book |ref=harv

-->* {{cite book |ref=harv

-- * { cite book | ref harv

| last=Kahneman | first=Daniel | author-link=Daniel Kahneman

| last=Kahneman | first=Daniel | author-link=Daniel Kahneman

作者: 丹尼尔 · 卡尼曼

| last2=Slovic | first2= D.

| last2=Slovic | first2= D.

2 | Slovic | first2 d.

| last3=Tversky | first3=Amos | author3-link=Amos Tversky

| last3=Tversky | first3=Amos | author3-link=Amos Tversky

| last 3 Tversky | first3 Amos | author3-link Amos Tversky

| year=1982

| year=1982

1982年

| title=Judgment under uncertainty: Heuristics and biases

| title=Judgment under uncertainty: Heuristics and biases

不确定条件下的判断: 启发式和偏见

| journal=Science | volume=185 | issue=4157 | pages=1124–31 | publisher=Cambridge University Press | location=New York

| journal=Science | volume=185 | issue=4157 | pages=1124–31 | publisher=Cambridge University Press | location=New York

科学杂志 | 第185卷 | 第4157期 | 第1124-31页 | 出版商剑桥大学出版社 | 位置纽约

| isbn=978-0-521-28414-1

| isbn=978-0-521-28414-1

[国际标准图书编号978-0-521-28414-1]

| pmid=17835457 | doi=10.1126/science.185.4157.1124 }}

| pmid=17835457 | doi=10.1126/science.185.4157.1124 }}

10.1126 / science. 185.4157.1124}}

* {{cite journal |ref=harv

| last=Kaplan |first=Andreas

| last=Kaplan |first=Andreas

最后的卡普兰 | 第一安德烈亚斯

| last2=Haenlein | first2= Michael

| last2=Haenlein | first2= Michael

最后2个 Haenlein 最初2个 Michael

| title=Siri, Siri in my Hand, who's the Fairest in the Land? On the Interpretations, Illustrations and Implications of Artificial Intelligence

| title=Siri, Siri in my Hand, who's the Fairest in the Land? On the Interpretations, Illustrations and Implications of Artificial Intelligence

谁是世界上最美丽的女人？论人工智能的解释、实例及其意义

| journal=Business Horizons | volume=62 | pages=15–25 | doi=10.1016/j.bushor.2018.08.004 | year=2019 }}

| journal=Business Horizons | volume=62 | pages=15–25 | doi=10.1016/j.bushor.2018.08.004 | year=2019 }}

商业视野杂志 | 第62卷 | 第15-25页 | doi 10.1016 / j.bushor. 2018.08.004 | year 2019}

* {{cite magazine |ref=harv

| last=Katz |first=Yarden |date=1 November 2012

| last=Katz |first=Yarden |date=1 November 2012

2012年11月1日

| title=Noam Chomsky on Where Artificial Intelligence Went Wrong

| title=Noam Chomsky on Where Artificial Intelligence Went Wrong

诺姆 · 乔姆斯基: 人工智能哪里出了问题

| magazine=The Atlantic

| magazine=The Atlantic

美国《大西洋月刊》

| 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

| 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

Https://www.theatlantic.com/technology/archive/2012/11/noam-chomsky-on-where-artificial-intelligence-went-wrong/261637/?single_page=true : 2014年10月26日

}}

}}

}}

* {{cite web |ref={{harvid|''Kismet''}}

| title=Kismet

| title=Kismet

命运

| publisher=MIT Artificial Intelligence Laboratory, Humanoid Robotics Group

| publisher=MIT Artificial Intelligence Laboratory, Humanoid Robotics Group

麻省理工学院人工智能实验室，人形机器人集团

| url=http://www.ai.mit.edu/projects/humanoid-robotics-group/kismet/kismet.html |accessdate=25 October 2014

| url=http://www.ai.mit.edu/projects/humanoid-robotics-group/kismet/kismet.html |accessdate=25 October 2014

Http://www.ai.mit.edu/projects/humanoid-robotics-group/kismet/kismet.html : 2014年10月25日

}}

}}

}}

* {{cite book |ref=harv

| last=Koza |first=John R. |year=1992

| last=Koza |first=John R. |year=1992

1992年，约翰 · r

| title=Genetic Programming (On the Programming of Computers by Means of Natural Selection)

| title=Genetic Programming (On the Programming of Computers by Means of Natural Selection)

遗传程序设计(论计算机通过自然选择的程序设计)

| publisher=MIT Press |isbn=978-0-262-11170-6

| publisher=MIT Press |isbn=978-0-262-11170-6

| 出版商麻省理工学院出版社 | isbn 978-0-262-11170-6

| bibcode=1992gppc.book.....K }}

| bibcode=1992gppc.book.....K }}

1992gppc. book... k }

* {{Cite journal |ref=harv

-->* {{Cite journal |ref=harv

-- * { Cite journal | ref harv

| first = G. | last=Kolata

| first = G. | last=Kolata

| 第一个 g | 最后一个 Kolata

| year=1982

| year=1982

1982年

| title=How can computers get common sense?

| title=How can computers get common sense?

| 题目计算机如何获得常识？

| journal=Science | issue= 4566| pages=1237–1238

| journal=Science | issue= 4566| pages=1237–1238

科学杂志 | 第4566期 | 第1237-1238页

| doi = 10.1126/science.217.4566.1237

| doi = 10.1126/science.217.4566.1237

10.1126 / science. 217.4566.1237

| volume = 217 |pmid=17837639

| volume = 217 |pmid=17837639

217 | pmid 17837639

| bibcode=1982Sci...217.1237K}}

| bibcode=1982Sci...217.1237K}}

1982Sci... 217.1237 k }

* {{cite journal |ref=harv

| last1=Kumar | first1=Gulshan

| last1=Kumar | first1=Gulshan

| last1=Kumar | first1=Gulshan

| last2=Kumar | first2=Krishan

| last2=Kumar | first2=Krishan

2 Kumar | first2 Krishan

| title=The Use of Artificial-Intelligence-Based Ensembles for Intrusion Detection: A Review

| title=The Use of Artificial-Intelligence-Based Ensembles for Intrusion Detection: A Review

| 题目: 基于人工智能的集成在入侵检测中的应用: 综述

| journal=Applied Computational Intelligence and Soft Computing

| journal=Applied Computational Intelligence and Soft Computing

应用计算智能和软计算

| year=2012

| year=2012

2012年

| volume=2012

| volume=2012

2012年

| pages=1–20

| pages=1–20

第1-20页

| doi=10.1155/2012/850160

| doi=10.1155/2012/850160

10.1155 / 2012 / 850160

| doi-access=free

| doi-access=free

免费访问

}}

}}

}}

* {{cite book |ref=harv

| last=Kurzweil | first=Ray | author-link=Ray Kurzweil

| last=Kurzweil | first=Ray | author-link=Ray Kurzweil

最后一个库兹韦尔 | 第一个雷 | 作者链接雷 · 库兹韦尔

| year=1999

| year=1999

1999年

| title=The Age of Spiritual Machines

| title=The Age of Spiritual Machines

精神机器时代

| publisher=Penguin Books

| publisher=Penguin Books

企鹅出版社

| isbn=978-0-670-88217-5

| isbn=978-0-670-88217-5

[国际标准图书编号978-0-670-88217-5]

| title-link=The Age of Spiritual Machines }}

| title-link=The Age of Spiritual Machines }}

| title-link The Age of Spiritual Machines }

* {{cite book |ref=harv

| last=Kurzweil | first=Ray | author-link=Ray Kurzweil

| last=Kurzweil | first=Ray | author-link=Ray Kurzweil

最后一个库兹韦尔 | 第一个雷 | 作者链接雷 · 库兹韦尔

| year=2005

| year=2005

2005年

| title=The Singularity is Near

| title=The Singularity is Near

标题奇点迫近

| publisher=Penguin Books

| publisher=Penguin Books

企鹅出版社

| isbn=978-0-670-03384-3

| isbn=978-0-670-03384-3

| isbn 978-0-670-03384-3

| title-link=The Singularity is Near }}

| title-link=The Singularity is Near }}

| title-link 奇点迫近}

* {{cite book |ref=harv

| last=Lakoff | first=George | author-link=George Lakoff

| last=Lakoff | first=George | author-link=George Lakoff

最后拉考夫 | 第一个乔治 | 作者链接乔治拉考夫

| last2=Núñez | first2=Rafael E. | author2-link=Rafael E. Núñez| year=2000

| last2=Núñez | first2=Rafael E. | author2-link=Rafael E. Núñez| year=2000

2000年2月2日 | 最后2秒 | 第一2个 Rafael e. | 作者2-link Rafael e. n E. | 2000年

| title=Where Mathematics Comes From: How the Embodied Mind Brings Mathematics into Being

| title=Where Mathematics Comes From: How the Embodied Mind Brings Mathematics into Being

数学从何而来: 具身思维如何使数学成为现实

| publisher=Basic Books

| publisher=Basic Books

| 出版商 Basic Books

| isbn= 978-0-465-03771-1

| isbn= 978-0-465-03771-1

[国际标准图书馆编号978-0-465-03771-1]

| title-link=Where Mathematics Comes From }}

| title-link=Where Mathematics Comes From }}

| title-link Where Mathematics Comes From }

* {{Cite journal |ref=harv

| last1=Langley |first1=Pat |year=2011

| last1=Langley |first1=Pat |year=2011

2011年1月1日

| title=The changing science of machine learning

| title=The changing science of machine learning

不断变化的机器学习科学

| journal=[[Machine Learning (journal)|Machine Learning]]

| journal=Machine Learning

机器学习》杂志

| volume=82 |issue=3 |pages=275–279

| volume=82 |issue=3 |pages=275–279

第82卷，第3期，第275-279页

| doi=10.1007/s10994-011-5242-y

| doi=10.1007/s10994-011-5242-y

10.1007 / s10994-011-5242-y

|doi-access=free

|doi-access=free

免费访问

}}

}}

}}

* {{cite techreport |ref=harv

| last=Law |first=Diane |date=June 1994

| last=Law |first=Diane |date=June 1994

最后的法律 | 第一个黛安 | 日期1994年6月

| title=Searle, Subsymbolic Functionalism and Synthetic Intelligence

| title=Searle, Subsymbolic Functionalism and Synthetic Intelligence

塞尔，次符号功能主义和综合智能

| institution=University of Texas at Austin |page=AI94-222

| institution=University of Texas at Austin |page=AI94-222

机构德克萨斯州大学奥斯汀分校 | 第 AI94-222页

| citeseerx=10.1.1.38.8384

| citeseerx=10.1.1.38.8384

10.1.1.38.8384

}}

}}

}}

* {{cite techreport |ref=harv

| last1=Legg |first1=Shane |last2=Hutter |first2=Marcus |date=15 June 2007

| last1=Legg |first1=Shane |last2=Hutter |first2=Marcus |date=15 June 2007

2007年6月15日

| title=A Collection of Definitions of Intelligence

| title=A Collection of Definitions of Intelligence

文章标题: 智慧的定义集

| institution=[[IDSIA]] |number=07-07 |arxiv=0706.3639

| institution=IDSIA |number=07-07 |arxiv=0706.3639

机构 IDSIA | 07-07 | arxiv 0706.3639

|bibcode=2007arXiv0706.3639L}}

|bibcode=2007arXiv0706.3639L}}

|bibcode=2007arXiv0706.3639L}}

* {{cite book |ref=harv

| last=Lenat | first=Douglas | author-link=Douglas Lenat

| last=Lenat | first=Douglas | author-link=Douglas Lenat

作者链接道格拉斯 · 莱纳特

| last2=Guha | first2=R. V.

| last2=Guha | first2=R. V.

2 Guha | first2 r.五。

| year = 1989

| year = 1989

1989年

| title = Building Large Knowledge-Based Systems

| title = Building Large Knowledge-Based Systems

建造大型知识推理系统

| publisher = Addison-Wesley

| publisher = Addison-Wesley

出版商 Addison-Wesley

| isbn=978-0-201-51752-1

| isbn=978-0-201-51752-1

[国际标准图书编号978-0-201-51752-1]

}}

}}

}}

* {{Cite book |ref=harv

| last=Lighthill |first=James |author-link=James Lighthill |year=1973

| last=Lighthill |first=James |author-link=James Lighthill |year=1973

作者链接: 詹姆斯 · 莱特希尔1973年

| contribution= Artificial Intelligence: A General Survey

| contribution= Artificial Intelligence: A General Survey

人工智能: 一般调查

| title=Artificial Intelligence: a paper symposium

| title=Artificial Intelligence: a paper symposium

人工智能: 论文研讨会

| publisher=Science Research Council

| publisher=Science Research Council

科学研究委员会

}}

}}

}}

* {{cite book |ref=harv

| last=Lucas | first= John | author-link = John Lucas (philosopher)

| last=Lucas | first= John | author-link = John Lucas (philosopher)

约翰 · 卢卡斯(哲学家)

| year = 1961

| year = 1961

1961年

| contribution=Minds, Machines and Gödel

| contribution=Minds, Machines and Gödel

投稿: 思想，机器和 g del

| editor-last = Anderson | editor-first =A.R.

| editor-last = Anderson | editor-first =A.R.

| 编辑-最后一个安德森 | 编辑-第一个 a.r。

| title=Minds and Machines

| title=Minds and Machines

文章标题: 思想与机器

| url = http://users.ox.ac.uk/~jrlucas/Godel/mmg.html | accessdate=30 August 2007

| url = http://users.ox.ac.uk/~jrlucas/Godel/mmg.html | accessdate=30 August 2007

Http://users.ox.ac.uk/~jrlucas/godel/mmg.html : 2007年8月30日

| archiveurl= https://web.archive.org/web/20070819165214/http://users.ox.ac.uk/~jrlucas/Godel/mmg.html| archivedate= 19 August 2007 | url-status=live

| archiveurl= https://web.archive.org/web/20070819165214/http://users.ox.ac.uk/~jrlucas/Godel/mmg.html| archivedate= 19 August 2007 | url-status=live

Https://web.archive.org/web/20070819165214/http://users.ox.ac.uk/~jrlucas/godel/mmg.html| 2007年8月19日

}}

}}

}}

* {{cite journal |ref=harv

| last1=Lungarella |first1=M. |last2=Metta |first2=G. |last3=Pfeifer |first3=R. |last4=Sandini |first4=G. |year=2003

| last1=Lungarella |first1=M. |last2=Metta |first2=G. |last3=Pfeifer |first3=R. |last4=Sandini |first4=G. |year=2003

1 | Lungarella | first1 m.2 Metta | first2 g.3 Pfeifer | first3 r.最后4个 Sandini 最初4个 g。2003年

| title=Developmental robotics: a survey

| title=Developmental robotics: a survey

发展机器人学: 一项调查

| journal=Connection Science |volume=15 | issue=4 |pages=151–190 |citeseerx=10.1.1.83.7615 | doi=10.1080/09540090310001655110

| journal=Connection Science |volume=15 | issue=4 |pages=151–190 |citeseerx=10.1.1.83.7615 | doi=10.1080/09540090310001655110

15 | issue 4 | pages 151-190 | citeserx 10.1.1.83.7615 | doi 10.1080 / 09540090310001655110

}}

}}

}}

* {{cite web

|ref=harv

|ref=harv

不会有事的

|last=Maker

|last=Maker

最后一个制造者

|first=Meg Houston

|first=Meg Houston

首先是梅格 · 休斯顿

|year=2006

|year=2006

2006年

|title=AI@50: AI Past, Present, Future

|title=AI@50: AI Past, Present, Future

50: AI 过去，现在，未来

|location=Dartmouth College

|location=Dartmouth College

| 位置达特茅斯学院

|url=http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html

|url=http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html

Http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html

|archive-url=https://web.archive.org/web/20070103222615/http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html

|archive-url=https://web.archive.org/web/20070103222615/http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html

| 档案-网址 https://web.archive.org/web/20070103222615/http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html

|url-status=dead

|url-status=dead

状态死机

|archive-date=3 January 2007

|archive-date=3 January 2007

| 档案-日期2007年1月3日

|accessdate=16 October 2008

|accessdate=16 October 2008

2008年10月16日

|df=

|df=

我不会让你失望的

}}

}}

}}

* {{cite news |ref=harv

| last=Markoff |first=John | date=16 February 2011

| last=Markoff |first=John | date=16 February 2011

2011年2月16日修正2011年2月24日

| title=Computer Wins on 'Jeopardy!': Trivial, It's Not |work=The New York Times

| title=Computer Wins on 'Jeopardy!': Trivial, It's Not |work=The New York Times

电脑赢得“危险边缘” ！《纽约时报》 : 微不足道，这不是工作

| url=https://www.nytimes.com/2011/02/17/science/17jeopardy-watson.html |accessdate=25 October 2014

| url=https://www.nytimes.com/2011/02/17/science/17jeopardy-watson.html |accessdate=25 October 2014

Https://www.nytimes.com/2011/02/17/science/17jeopardy-watson.html : 2014年10月25日

}}

}}

}}

* {{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 }}.

* {{cite journal |ref=harv

| last1 = McCarthy | first1 = John | author-link = John McCarthy (computer scientist)

| last1 = McCarthy | first1 = John | author-link = John McCarthy (computer scientist)

约翰 · 麦卡锡(计算机科学家)

| last2 = Hayes | first2=P. J.

| last2 = Hayes | first2=P. J.

2 | last 2 | Hayes | first2 p.J.

| year = 1969

| year = 1969

1969年

| title= Some philosophical problems from the standpoint of artificial intelligence

| title= Some philosophical problems from the standpoint of artificial intelligence

从人工智能的角度看一些哲学问题

| journal =Machine Intelligence | volume= 4 | pages = 463–502

| journal =Machine Intelligence | volume= 4 | pages = 463–502

机器智能 | 第四卷 | 第463-502页

| url=http://www-formal.stanford.edu/jmc/mcchay69.html | accessdate=30 August 2007

| url=http://www-formal.stanford.edu/jmc/mcchay69.html | accessdate=30 August 2007

Http://www-formal.stanford.edu/jmc/mcchay69.html : 2007年8月30日

| 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}}

| 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}}

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}

* {{cite web

|ref = harv

|ref = harv

不会有事的

|last = McCarthy

|last = McCarthy

最后麦卡锡

|first = John

|first = John

第一个约翰

|authorlink = John McCarthy (computer scientist)

|authorlink = John McCarthy (computer scientist)

约翰 · 麦卡锡(计算机科学家)

|title = What Is Artificial Intelligence?

|title = What Is Artificial Intelligence?

什么是人工智能？

|date = 12 November 2007

|date = 12 November 2007

2007年11月12日

|url = http://www-formal.stanford.edu/jmc/whatisai/whatisai.html

|url = http://www-formal.stanford.edu/jmc/whatisai/whatisai.html

Http://www-formal.stanford.edu/jmc/whatisai/whatisai.html

|url-status = dead

|url-status = dead

状态死机

|archiveurl = https://web.archive.org/web/20151118212402/http://www-formal.stanford.edu/jmc/whatisai/whatisai.html

|archiveurl = https://web.archive.org/web/20151118212402/http://www-formal.stanford.edu/jmc/whatisai/whatisai.html

| archiveurl https://web.archive.org/web/20151118212402/http://www-formal.stanford.edu/jmc/whatisai/whatisai.html

|archivedate = 18 November 2015

|archivedate = 18 November 2015

2015年11月18日

|df = dmy-all

|df = dmy-all

我不会放过你的

}}

}}

}}

* {{cite book |ref=harv

| last=Minsky | first=Marvin | author-link=Marvin Minsky

| last=Minsky | first=Marvin | author-link=Marvin Minsky

最后一个明斯基 | 第一个马文 | 作者链接马文明斯基

| year = 1967

| year = 1967

1967年

| title = Computation: Finite and Infinite Machines

| title = Computation: Finite and Infinite Machines

计算: 有限和无限机器

|url=https://archive.org/details/computationfinit0000mins

|url=https://archive.org/details/computationfinit0000mins

Https://archive.org/details/computationfinit0000mins

|url-access=registration

|url-access=registration

访问注册

| publisher = Prentice-Hall | location=Englewood Cliffs, N.J.

| publisher = Prentice-Hall | location=Englewood Cliffs, N.J.

| 出版商 Prentice-Hall | 位置: 恩格尔伍德克利夫斯，新泽西州。

| isbn=978-0-13-165449-5

| isbn=978-0-13-165449-5

| isbn 978-0-13-165449-5

}}

}}

}}

* {{cite book |ref=harv

| last=Minsky | first=Marvin | author-link=Marvin Minsky

| last=Minsky | first=Marvin | author-link=Marvin Minsky

最后一个明斯基 | 第一个马文 | 作者链接马文明斯基

| year = 2006

| year = 2006

2006年

| title = The Emotion Machine

| title = The Emotion Machine

标题: 情感机器

| publisher = Simon & Schusterl | location=New York, NY

| publisher = Simon & Schusterl | location=New York, NY

| 出版商 Simon & schuster | 位置: 纽约，纽约

| isbn=978-0-7432-7663-4

| isbn=978-0-7432-7663-4

[国际标准图书编号978-0-7432-7663-4]

| title-link=The Emotion Machine }}

| title-link=The Emotion Machine }}

| title-link The Emotion Machine }

* {{cite book |ref=harv

| last=Moravec | first=Hans | author-link=Hans Moravec

| last=Moravec | first=Hans | author-link=Hans Moravec

| last=Moravec | first=Hans | author-link=Hans Moravec

| year = 1988

| year = 1988

1988年

| title = Mind Children

| title = Mind Children

标题: 小心孩子

|url=https://archive.org/details/mindchildrenfutu00mora

|url=https://archive.org/details/mindchildrenfutu00mora

Https://archive.org/details/mindchildrenfutu00mora

|url-access=registration

|url-access=registration

访问注册

| publisher = Harvard University Press

| publisher = Harvard University Press

哈佛大学出版社

| isbn=978-0-674-57616-2

| isbn=978-0-674-57616-2

[国际标准图书馆编号978-0-674-57616-2]

}}

}}

}}

* {{cite web |ref=harv

| last=Norvig |first=Peter |authorlink=Peter Norvig |date=25 June 2012

| last=Norvig |first=Peter |authorlink=Peter Norvig |date=25 June 2012

2012年6月25日---- 页面元数据，最后修改

| title=On Chomsky and the Two Cultures of Statistical Learning

| title=On Chomsky and the Two Cultures of Statistical Learning

乔姆斯基与两种统计学习文化

| publisher=Peter Norvig

| publisher=Peter Norvig

出版商 Peter Norvig

| url=http://norvig.com/chomsky.html

| url=http://norvig.com/chomsky.html

Http://norvig.com/chomsky.html

| archiveurl=https://web.archive.org/web/20141019223259/http://norvig.com/chomsky.html

| archiveurl=https://web.archive.org/web/20141019223259/http://norvig.com/chomsky.html

| archiveurl https://web.archive.org/web/20141019223259/http://norvig.com/chomsky.html

| archivedate=19 October 2014 |url-status=live

| archivedate=19 October 2014 |url-status=live

2014年10月19日

}}

}}

}}

* {{cite book |ref={{harvid|NRC|1999}}

| author=NRC (United States National Research Council) | authorlink=United States National Research Council

| author=NRC (United States National Research Council) | authorlink=United States National Research Council

作者 NRC (美国国家研究委员会)

| year=1999

| year=1999

1999年

| chapter=Developments in Artificial Intelligence

| chapter=Developments in Artificial Intelligence

人工智能的发展

| title=Funding a Revolution: Government Support for Computing Research

| title=Funding a Revolution: Government Support for Computing Research

资助一场革命: 政府对计算机研究的支持

| publisher=National Academy Press

| publisher=National Academy Press

美国国家科学院出版社

}}

}}

}}

* {{cite book |ref=harv

| last=Needham | first=Joseph | authorlink = Joseph Needham

| last=Needham | first=Joseph | authorlink = Joseph Needham

作者: 约瑟夫 · 李约瑟

| year=1986

| year=1986

1986年

| title=Science and Civilization in China: Volume 2

| title=Science and Civilization in China: Volume 2

中国的科学与文明: 第二卷

| publisher=Caves Books Ltd.

| publisher=Caves Books Ltd.

| 出版商洞穴图书有限公司。

| title-link=Science and Civilization in China }}

| title-link=Science and Civilization in China }}

| 题目链接中国的科学与文明}

* {{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 }}.

* {{Cite journal |ref=harv

| last=Nilsson |first=Nils |author-link = Nils Nilsson (researcher) |year=1983

| last=Nilsson |first=Nils |author-link = Nils Nilsson (researcher) |year=1983

| 最后尼尔森 | 第一个尼尔斯 | 作者链接尼尔斯尼尔森(研究员) | 1983年

| title=Artificial Intelligence Prepares for 2001

| title=Artificial Intelligence Prepares for 2001

人工智能为2001年做准备

| journal=AI Magazine |volume=1 |number=1

| journal=AI Magazine |volume=1 |number=1

人工智能杂志 | 第一卷 | 第一期

| url=https://ai.stanford.edu/~nilsson/OnlinePubs-Nils/General%20Essays/AIMag04-04-002.pdf

| url=https://ai.stanford.edu/~nilsson/OnlinePubs-Nils/General%20Essays/AIMag04-04-002.pdf

Https://ai.stanford.edu/~nilsson/onlinepubs-nils/general%20essays/aimag04-04-002.pdf

}} Presidential Address to the [[Association for the Advancement of Artificial Intelligence]].

}} Presidential Address to the Association for the Advancement of Artificial Intelligence.

美国总统的美国人工智能协会地址。

* {{cite book |ref=harv

| last1=O'Brien |first1=James |last2=Marakas |first2=George |year=2011

| last1=O'Brien |first1=James |last2=Marakas |first2=George |year=2011

2011年1月1日

| title=Management Information Systems |publisher=McGraw-Hill/Irwin |edition=10th

| title=Management Information Systems |publisher=McGraw-Hill/Irwin |edition=10th

| 题目: 管理信息系统 | 出版商 mcgraw-hill / irwin | 第10版

| isbn=978-0-07-337681-3

| isbn=978-0-07-337681-3

[国际标准图书编号978-0-07-337681-3]

}}

}}

}}

* {{cite journal |ref=harv

| last=O'Connor |first=Kathleen Malone |year=1994

| last=O'Connor |first=Kathleen Malone |year=1994

1994年，凯瑟琳 · 马龙

| title=The alchemical creation of life (takwin) and other concepts of Genesis in medieval Islam

| title=The alchemical creation of life (takwin) and other concepts of Genesis in medieval Islam

中世纪伊斯兰教的炼金术创造生命(takwin)和创世纪的其他概念

| pages=1–435 | publisher=University of Pennsylvania

| pages=1–435 | publisher=University of Pennsylvania

| 第1-435页 | 出版商宾夕法尼亚大学

| url=http://repository.upenn.edu/dissertations/AAI9503804

| url=http://repository.upenn.edu/dissertations/AAI9503804

Http://repository.upenn.edu/dissertations/aai9503804

}}

}}

}}

* {{cite journal |ref=harv

| last=Oudeyer |first=P-Y. |year=2010

| last=Oudeyer |first=P-Y. |year=2010

| 最后一个 Oudeyer | 第一个 p-y。2010年

| title=On the impact of robotics in behavioral and cognitive sciences: from insect navigation to human cognitive development

| title=On the impact of robotics in behavioral and cognitive sciences: from insect navigation to human cognitive development

机器人技术对行为和认知科学的影响: 从昆虫导航到人类认知发展

| journal=IEEE Transactions on Autonomous Mental Development |volume=2 |issue=1 |pages=2–16

| journal=IEEE Transactions on Autonomous Mental Development |volume=2 |issue=1 |pages=2–16

自主智力发展杂志 | 第2卷 | 第1期 | 第2-16页

| url=http://www.pyoudeyer.com/IEEETAMDOudeyer10.pdf | doi=10.1109/tamd.2009.2039057

| url=http://www.pyoudeyer.com/IEEETAMDOudeyer10.pdf | doi=10.1109/tamd.2009.2039057

Http://www.pyoudeyer.com/ieeetamdoudeyer10.pdf 10.1109 / tamd. 2009.2039057

}}

}}

}}

* {{cite book |ref=harv

| last=Penrose |first=Roger |author-link=Roger Penrose |year=1989

| last=Penrose |first=Roger |author-link=Roger Penrose |year=1989

最后一个彭罗斯 | 第一个罗杰 | 作者链接罗杰彭罗斯 | 1989年

| title=The Emperor's New Mind: Concerning Computer, Minds and The Laws of Physics

| title=The Emperor's New Mind: Concerning Computer, Minds and The Laws of Physics

皇帝的新头脑: 关于计算机，头脑和物理定律

| publisher=[[Oxford University Press]]

| publisher=Oxford University Press

牛津大学出版社

| isbn=978-0-19-851973-7

| isbn=978-0-19-851973-7

[国际标准图书编号978-0-19-851973-7]

}}

}}

}}

* {{cite book |ref=harv

-->* {{cite book |ref=harv

-- * { cite book | ref harv

| last1=Poli |first1=R. |last2=Langdon |first2=W. B. |last3=McPhee |first3=N. F. |year=2008

| last1=Poli |first1=R. |last2=Langdon |first2=W. B. |last3=McPhee |first3=N. F. |year=2008

1 Poli | first1 r.最后2个兰登，最初2个 w。乙。3 McPhee | first3 n.2008年

| title=A Field Guide to Genetic Programming |publisher=Lulu.com |isbn=978-1-4092-0073-4

| title=A Field Guide to Genetic Programming |publisher=Lulu.com |isbn=978-1-4092-0073-4

遗传编程实地指南 | 出版商 lulu. com | isbn 978-1-4092-0073-4

| url=http://www.gp-field-guide.org.uk/ |via=gp-field-guide.org.uk

| url=http://www.gp-field-guide.org.uk/ |via=gp-field-guide.org.uk

Http://www.gp-field-guide.org.uk/ gp-field-guide.org.uk

}}

}}

}}

* {{cite journal

|ref=harv

|ref=harv

不会有事的

|last=Rajani

|last=Rajani

最后的拉贾尼

|first=Sandeep

|first=Sandeep

第一个 Sandeep

|year=2011

|year=2011

2011年

|title=Artificial Intelligence – Man or Machine

|title=Artificial Intelligence – Man or Machine

| 题目: 人工智能-人还是机器

|journal=International Journal of Information Technology and Knowledge Management

|journal=International Journal of Information Technology and Knowledge Management

国际信息技术与知识管理杂志

|volume=4

|volume=4

第四卷

|issue=1

|issue=1

第一期

|pages=173–176

|pages=173–176

第173-176页

|url=http://www.csjournals.com/IJITKM/PDF%204-1/35.Sandeep%20Rajani.pdf

|url=http://www.csjournals.com/IJITKM/PDF%204-1/35.Sandeep%20Rajani.pdf

Http://www.csjournals.com/ijitkm/pdf%204-1/35.sandeep%20rajani.pdf

|url-status=dead

|url-status=dead

状态死机

|archiveurl=https://web.archive.org/web/20130118095844/http://www.csjournals.com/IJITKM/PDF%204-1/35.Sandeep%20Rajani.pdf

|archiveurl=https://web.archive.org/web/20130118095844/http://www.csjournals.com/IJITKM/PDF%204-1/35.Sandeep%20Rajani.pdf

| archiveurl https://web.archive.org/web/20130118095844/http://www.csjournals.com/ijitkm/pdf%204-1/35.sandeep%20rajani.pdf

|archivedate=18 January 2013

|archivedate=18 January 2013

2013年1月18日

|df=

|df=

我不会让你失望的

}}

}}

}}

* 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. 567–576, November 2001.

* 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. 21–23, October 2000.

* {{Cite journal

|ref=harv

|ref=harv

不会有事的

|last=Searle

|last=Searle

最后 Searle

|first=John

|first=John

第一个约翰

|author-link=John Searle

|author-link=John Searle

作者链接约翰 · 塞尔

|year=1980

|year=1980

1980年

|title=Minds, Brains and Programs

|title=Minds, Brains and Programs

文章标题: 思想，大脑和程序

|journal=Behavioral and Brain Sciences

|journal=Behavioral and Brain Sciences

行为与脑科学杂志

|volume=3

|volume=3

第三卷

|issue=3

|issue=3

第三期

|pages=417–457

|pages=417–457

第417-457页

|doi=10.1017/S0140525X00005756

|doi=10.1017/S0140525X00005756

10.1017 / s0140525x0005756

|df=

|df=

我不会让你失望的

|url=http://cogprints.org/7150/1/10.1.1.83.5248.pdf

|url=http://cogprints.org/7150/1/10.1.1.83.5248.pdf

Http://cogprints.org/7150/1/10.1.1.83.5248.pdf

}}

}}

}}

* {{cite book |ref = harv

|last = Searle

|last = Searle

最后 Searle

|first = John

|first = John

第一个约翰

|author-link = John Searle

|author-link = John Searle

作者链接约翰 · 塞尔

|year = 1999

|year = 1999

1999年

|title = Mind, language and society

|title = Mind, language and society

文章标题: 思想，语言和社会

|publisher = Basic Books

|publisher = Basic Books

| 出版商 Basic Books

|location = New York, NY

|location = New York, NY

纽约，纽约

|isbn = 978-0-465-04521-1

|isbn = 978-0-465-04521-1

[国际标准图书馆编号978-0-465-04521-1]

|oclc = 231867665

|oclc = 231867665

231867665

|url = https://archive.org/details/mindlanguagesoci00sear

|url = https://archive.org/details/mindlanguagesoci00sear

Https://archive.org/details/mindlanguagesoci00sear

}}

}}

}}

* {{cite book |ref=harv

| last=Shapiro | first= Stuart C. | editor-first=Stuart C. | editor-last=Shapiro

| last=Shapiro | first= Stuart C. | editor-first=Stuart C. | editor-last=Shapiro

最后一个夏皮罗 | 第一个斯图尔特 c. | 编辑-第一个斯图尔特 c. | 编辑-最后一个夏皮罗

| year=1992

| year=1992

1992年

| contribution=Artificial Intelligence

| contribution=Artificial Intelligence

人工智能

| title=Encyclopedia of Artificial Intelligence | edition=2nd | pages=54–57

| title=Encyclopedia of Artificial Intelligence | edition=2nd | pages=54–57

人工智能百科全书 | 第二版 | 第54-57页

| url=http://www.cse.buffalo.edu/~shapiro/Papers/ai.pdf

| url=http://www.cse.buffalo.edu/~shapiro/Papers/ai.pdf

Http://www.cse.buffalo.edu/~shapiro/papers/ai.pdf

| publisher=John Wiley | location=New York

| publisher=John Wiley | location=New York

| 出版人约翰 · 威利 | 位置: 纽约

| isbn=978-0-471-50306-4

| isbn=978-0-471-50306-4

[国际标准图书编号978-0-471-50306-4]

}}

}}

}}

* {{cite book |ref=harv

| last=Simon | first = H. A. | author-link=Herbert A. Simon

| last=Simon | first = H. A. | author-link=Herbert A. Simon

最后的西蒙 | 第一个 h. a。| 作者链接赫伯特·西蒙

| year = 1965

| year = 1965

1965年

| title=The Shape of Automation for Men and Management

| title=The Shape of Automation for Men and Management

男性和管理自动化的形态

|url=https://archive.org/details/shapeofautomatio00simo

|url=https://archive.org/details/shapeofautomatio00simo

Https://archive.org/details/shapeofautomatio00simo

|url-access=registration

|url-access=registration

访问注册

| publisher = Harper & Row | location = New York

| publisher = Harper & Row | location = New York

| 出版商 Harper & Row | 位置: 纽约

}}

}}

}}

* {{cite web |ref=harv

| last=Skillings | first=Jonathan

| last=Skillings | first=Jonathan

最后的技能 | 第一个乔纳森

| url=http://news.cnet.com/Getting-machines-to-think-like-us/2008-11394_3-6090207.html

| url=http://news.cnet.com/Getting-machines-to-think-like-us/2008-11394_3-6090207.html

Http://news.cnet.com/getting-machines-to-think-like-us/2008-11394_3-6090207.html

| title=Getting Machines to Think Like Us

| title=Getting Machines to Think Like Us

让机器像我们一样思考

| work=cnet

| work=cnet

我会在 cnet 工作

| date=3 July 2006

| date=3 July 2006

2006年7月3日

| accessdate=3 February 2011

| accessdate=3 February 2011

2011年2月3日

}}

}}

}}

* {{cite conference |ref=harv

| last=Solomonoff |first=Ray |authorlink=Ray Solomonoff |year=1956

| last=Solomonoff |first=Ray |authorlink=Ray Solomonoff |year=1956

作者: Ray Solomonoff 1956年

| title=An Inductive Inference Machine

| title=An Inductive Inference Machine

归纳推理机

| conference=Dartmouth Summer Research Conference on Artificial Intelligence

| conference=Dartmouth Summer Research Conference on Artificial Intelligence

达特茅斯夏季人工智能研究会议

| url=http://world.std.com/~rjs/indinf56.pdf |via=std.com, pdf scanned copy of the original

| url=http://world.std.com/~rjs/indinf56.pdf |via=std.com, pdf scanned copy of the original

Http://world.std.com/~rjs/indinf56.pdf : http: / / www.std. com / pdf

}} Later published as {{cite book

}} Later published as {{cite book

}}后来作为 br / { cite book 出版

| last=Solomonoff |first=Ray |year=1957 |pages=56–62

| last=Solomonoff |first=Ray |year=1957 |pages=56–62

最后所罗门诺夫 | 第一射线 | 1957年 | 第56-62页

| chapter=An Inductive Inference Machine

| chapter=An Inductive Inference Machine

归纳推理机

| title=IRE Convention Record |volume=Section on Information Theory, part 2

| title=IRE Convention Record |volume=Section on Information Theory, part 2

信息理论部分，第二部分

}}

}}

}}

* {{cite conference |ref=harv

| last=Tao |first=Jianhua |first2=Tieniu |last2=Tan |year=2005

| last=Tao |first=Jianhua |first2=Tieniu |last2=Tan |year=2005

2 Tieniu | last 2 Tan | year 2005

| conference=Affective Computing: A Review

| conference=Affective Computing: A Review

会议情感计算: 回顾

| booktitle=Affective Computing and Intelligent Interaction |volume=[[LNCS]] 3784 |pages=981–995

| booktitle=Affective Computing and Intelligent Interaction |volume=LNCS 3784 |pages=981–995

| 书名情感计算和智能交互 | 卷 LNCS 3784 | 页981-995

|publisher=Springer |doi=10.1007/11573548

|publisher=Springer |doi=10.1007/11573548

| 出版商 Springer | doi 10.1007 / 11573548

}}

}}

}}

* {{cite journal |ref=harv

| last=Tecuci |first=Gheorghe |date=March–April 2012

| last=Tecuci |first=Gheorghe |date=March–April 2012

2012年3-4月

| title=Artificial Intelligence

| title=Artificial Intelligence

人工智能

| journal=Wiley Interdisciplinary Reviews: Computational Statistics

| journal=Wiley Interdisciplinary Reviews: Computational Statistics

杂志 Wiley 跨学科评论: 计算机数据

| volume=4 |issue=2 |pages=168–180 |doi=10.1002/wics.200

| volume=4 |issue=2 |pages=168–180 |doi=10.1002/wics.200

第四卷，第二期，第168-180页，页数10.1002 / wics. 200

}}

}}

}}

* {{cite book

|ref=harv

|ref=harv

不会有事的

|last=Thro

|last=Thro

最后一次

|first=Ellen

|first=Ellen

首先是艾伦

|year=1993

|year=1993

1993年

|title=Robotics: The Marriage of Computers and Machines

|title=Robotics: The Marriage of Computers and Machines

机器人技术: 计算机与机器的联姻

|location=New York

|location=New York

| 地点: 纽约

|publisher=Facts on File

|publisher=Facts on File

文件中的事实

|isbn=978-0-8160-2628-9

|isbn=978-0-8160-2628-9

[国际标准图书编号978-0-8160-2628-9]

|url=https://archive.org/details/isbn_9780816026289

|url=https://archive.org/details/isbn_9780816026289

Https://archive.org/details/isbn_9780816026289

}}

}}

}}

* {{Turing 1950}}.

* {{cite web

|ref=harv

|ref=harv

不会有事的

|last=van der Walt

|last=van der Walt

最后一个范德沃尔特

|first=Christiaan

|first=Christiaan

第一个克里斯蒂安

|last2=Bernard

|last2=Bernard

最后2个 Bernard

|first2=Etienne

|first2=Etienne

| first2 Etienne

|year=2006

|year=2006

2006年

|title=Data characteristics that determine classifier performance

|title=Data characteristics that determine classifier performance

| 决定分类器性能的数据特征

|url=http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf

|url=http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf

Http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf

|accessdate=5 August 2009

|accessdate=5 August 2009

2009年8月5日

|url-status=dead

|url-status=dead

状态死机

|archiveurl=https://web.archive.org/web/20090325194051/http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf

|archiveurl=https://web.archive.org/web/20090325194051/http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf

| archiveurl https://web.archive.org/web/20090325194051/http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf

|archivedate=25 March 2009

|archivedate=25 March 2009

2009年3月25日

|df=

|df=

我不会让你失望的

}}

}}

}}

* {{cite journal | ref=harv

| last=Vinge | first=Vernor | authorlink=Vernor Vinge

| last=Vinge | first=Vernor | authorlink=Vernor Vinge

最后一个 Vinge | 第一个 Vernor | authorlink Vernor Vinge

| year=1993

| year=1993

1993年

| title=The Coming Technological Singularity: How to Survive in the Post-Human Era

| title=The Coming Technological Singularity: How to Survive in the Post-Human Era

即将到来的技术奇异点: 如何在后人类时代生存

| 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

| 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

视觉21: 网络时代的跨学科科学与工程杂志 | 第11页 | http://www-rohan.sdsu.edu/faculty/vinge/misc/singularity.html

| bibcode=1993vise.nasa...11V }}

| bibcode=1993vise.nasa...11V }}

1993 vise. nasa... 11V }

* {{cite book |ref=harv

| last1=Wason | first1=P. C. | author-link=Peter Cathcart Wason

| last1=Wason | first1=P. C. | author-link=Peter Cathcart Wason

| last 1 Wason | first1 p.作者链接: Peter Cathcart Wason

| last2=Shapiro | first2=D.

| last2=Shapiro | first2=D.

2 Shapiro | first2 d.

| editor=Foss, B. M.

| editor=Foss, B. M.

编辑 Foss，B.m。

| year=1966

| year=1966

1966年

| title=New horizons in psychology

| title=New horizons in psychology

心理学的新视野

|chapter-url=https://archive.org/details/newhorizonsinpsy0000foss

|chapter-url=https://archive.org/details/newhorizonsinpsy0000foss

| 章节-网址 https://archive.org/details/newhorizonsinpsy0000foss

|chapter-url-access=registration

|chapter-url-access=registration

| chapter-url-access registration

| location=Harmondsworth | publisher=Penguin

| location=Harmondsworth | publisher=Penguin

| 地址 Harmondsworth | 出版商 Penguin

| chapter=Reasoning

| chapter=Reasoning

推理 | 第一章

}}

}}

}}

* {{cite book |ref=harv

| last=Weizenbaum | first = Joseph | authorlink=Joseph Weizenbaum

| last=Weizenbaum | first = Joseph | authorlink=Joseph Weizenbaum

2012年3月15日 | 约瑟夫·维森鲍姆

| year = 1976

| year = 1976

1976年

| title = Computer Power and Human Reason

| title = Computer Power and Human Reason

计算机能力与人类理性

| publisher = W.H. Freeman & Company | location = San Francisco

| publisher = W.H. Freeman & Company | location = San Francisco

出版商 w.h。弗里曼公司 | 地点: 旧金山

| isbn = 978-0-7167-0464-5

| isbn = 978-0-7167-0464-5

| isbn 978-0-7167-0464-5

| title-link=Computer Power and Human Reason }}

| title-link=Computer Power and Human Reason }}

| title-link 计算机能力和人类理性}

* {{cite journal |ref=harv

| last1=Weng |first1=J. |last2=McClelland |last3=Pentland |first3=A. |last4=Sporns |first4=O.

| last1=Weng |first1=J. |last2=McClelland |last3=Pentland |first3=A. |last4=Sporns |first4=O.

最后1个翁最初1个 j。最后2个麦克利兰最后3个彭特兰最初3个 a。最后4个运动项目。

| last5=Stockman |first5=I. |last6=Sur |first6=M. |last7=Thelen |first7=E. |year=2001

| last5=Stockman |first5=I. |last6=Sur |first6=M. |last7=Thelen |first7=E. |year=2001

| 最后5个斯托克曼 | 最初5个。6:00.7 Thelen | first7 e.2001年

| url=http://www.cse.msu.edu/dl/SciencePaper.pdf |via=msu.edu | doi= 10.1126/science.291.5504.599

| url=http://www.cse.msu.edu/dl/SciencePaper.pdf |via=msu.edu | doi= 10.1126/science.291.5504.599

Http://www.cse.msu.edu/dl/sciencepaper.pdf 10.1126 / science. 291.5504.599

| pmid=11229402 | title=Autonomous mental development by robots and animals |journal=Science |volume=291 | issue=5504 |pages=599–600

| pmid=11229402 | title=Autonomous mental development by robots and animals |journal=Science |volume=291 | issue=5504 |pages=599–600

机器人和动物的自主智力开发 | 科学杂志 | 第291卷 | 第5504期 | 第599-600页

}}

}}

}}

* {{cite web |ref=harv

|url=http://www-formal.stanford.edu/jmc/whatisai/node3.html

|url=http://www-formal.stanford.edu/jmc/whatisai/node3.html

Http://www-formal.stanford.edu/jmc/whatisai/node3.html

|title=Applications of AI

|title=Applications of AI

| 人工智能的应用

|website=www-formal.stanford.edu

|website=www-formal.stanford.edu

网站 www-formal.stanford.edu

|access-date=25 September 2016}}

|access-date=25 September 2016}}

| access-date 25 September 2016}

{{refend}}

== Further reading ==

== Further reading ==

进一步阅读

{{refbegin|30em}}

* DH Author, 'Why Are There Still So Many Jobs? The History and Future of Workplace Automation' (2015) 29(3) Journal of Economic Perspectives 3.

* [[Margaret Boden|Boden, Margaret]], ''Mind As Machine'', [[Oxford University Press]], 2006.

* [[Kenneth Cukier|Cukier, Kenneth]], "Ready for Robots? How to Think about the Future of AI", ''[[Foreign Affairs]]'', vol. 98, no. 4 (July/August 2019), pp. 192–98. [[George Dyson (science historian)|George Dyson]], historian of computing, writes (in what might be called "Dyson's Law") that "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." (p. 197.) Computer scientist [[Alex Pentland]] writes: "Current [[machine learning|AI machine-learning]] [[algorithm]]s are, at their core, dead simple stupid. They work, but they work by brute force." (p. 198.)

* [[Pedro Domingos|Domingos, Pedro]], "Our Digital Doubles: AI will serve our species, not control it", ''[[Scientific American]]'', vol. 319, no. 3 (September 2018), pp. 88–93.

* [[Alison Gopnik|Gopnik, Alison]], "Making AI More Human: Artificial intelligence has staged a revival by starting to incorporate what we know about how children learn", ''[[Scientific American]]'', vol. 316, no. 6 (June 2017), pp. 60–65.

* Johnston, John (2008) ''The Allure of Machinic Life: Cybernetics, Artificial Life, and the New AI'', MIT Press.

* [[Christof Koch|Koch, Christof]], "Proust among the Machines", ''[[Scientific American]]'', vol. 321, no. 6 (December 2019), pp. 46–49. [[Christof Koch]] doubts the possibility of "intelligent" machines attaining [[consciousness]], because "[e]ven the most sophisticated [[brain simulation]]s are unlikely to produce conscious [[feelings]]." (p. 48.) According to Koch, "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." (p. 49.)

* [[Gary Marcus|Marcus, Gary]], "Am I Human?: Researchers need new ways to distinguish artificial intelligence from the natural kind", ''[[Scientific American]]'', vol. 316, no. 3 (March 2017), pp. 58–63. A stumbling block to AI has been an incapacity for reliable [[disambiguation]]. An example is the "pronoun disambiguation problem": a machine has no way of determining to whom or what a [[pronoun]] in a sentence refers. (p. 61.)

* 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)].

* [[George Musser]], "[[Artificial Imagination]]: How machines could learn [[creativity]] and [[common sense]], among other human qualities", ''[[Scientific American]]'', vol. 320, no. 5 (May 2019), pp. 58–63.

* Myers, Courtney Boyd ed. (2009). [https://www.forbes.com/2009/06/22/singularity-robots-computers-opinions-contributors-artificial-intelligence-09_land.html "The AI Report"]. ''Forbes'' June 2009

* {{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 }}

* Scharre, Paul, "Killer Apps: The Real Dangers of an AI Arms Race", ''[[Foreign Affairs]]'', vol. 98, no. 3 (May/June 2019), pp. 135–44. "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." (p. 140.)

* {{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}}

* {{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}}

* Sun, R. & Bookman, L. (eds.), ''Computational Architectures: Integrating Neural and Symbolic Processes''. Kluwer Academic Publishers, Needham, MA. 1994.

* {{cite web

|url=http://www.technologyreview.com/news/533686/2014-in-computing-breakthroughs-in-artificial-intelligence/

|url=http://www.technologyreview.com/news/533686/2014-in-computing-breakthroughs-in-artificial-intelligence/

Http://www.technologyreview.com/news/533686/2014-in-computing-breakthroughs-in-artificial-intelligence/

|title=2014 in Computing: Breakthroughs in Artificial Intelligence

|title=2014 in Computing: Breakthroughs in Artificial Intelligence

2014年《计算机: 人工智能的突破》

|author=Tom Simonite

|author=Tom Simonite

作者: Tom Simonite

|date=29 December 2014

|date=29 December 2014

2014年12月29日

|work=MIT Technology Review

|work=MIT Technology Review

麻省理工学院技术评论

|accessdate=

|accessdate=

访问日期

}}

}}

}}

* [[Adam Tooze|Tooze, Adam]], "Democracy and Its Discontents", ''[[The New York Review of Books]]'', vol. LXVI, no. 10 (6 June 2019), pp. 52–53, 56–57. "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." (pp. 56–57.)

{{refend}}

== External links ==

== External links ==

外部链接



======================= =============================-->

======================= =============================-->

{{Sister project links|voy=no|species=no|d=Q11660|v=Portal:Artificial intelligence|n=no|s=no|c=Category:Artificial intelligence|wikt=artificial intelligence}}

* {{IEP|art-inte|Artificial Intelligence}}

* {{cite SEP |url-id=logic-ai |title=Logic and Artificial Intelligence |last=Thomason |first=Richmond}}

* [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.

* [https://www.bbc.co.uk/programmes/p003k9fc Artificial Intelligence], BBC Radio 4 discussion with John Agar, Alison Adam & Igor Aleksander (''In Our Time'', Dec. 8, 2005)

{{Navboxes

{{Navboxes

{导航框

|list=

|list=

名单

{{John McCarthy navbox}}

{{philosophy of mind}}

{{philosophy of science}}

{{Evolutionary computation}}

{{Computable knowledge}}

{{Computer science}}

{{emerging technologies|topics=yes|infocom=yes}}

{{Robotics}}

}}

}}

}}

{{Existential_risk_from_artificial_intelligence}}

{{Philosophy of mind}}

{{Cybernetics}}

{{Computer science}}

{{Evolutionary computation}}

{{emerging technologies|topics=yes|infocom=yes}}

{{Glossaries of science and engineering}}

{{Authority control}}

{{DEFAULTSORT:Artificial Intelligence}}

[[Category:Artificial intelligence| ]]



!-请离开空白的空间作为标准 --

[[Category:Cybernetics]]

Category:Cybernetics

类别: 控制论

[[Category:Formal sciences]]

Category:Formal sciences

类别: 正规科学

[[Category:Technology in society]]

Category:Technology in society

类别: 社会中的技术

[[Category:Computational neuroscience]]

Category:Computational neuroscience

类别: 计算神经科学

[[Category:Emerging technologies]]

Category:Emerging technologies

类别: 新兴技术

[[Category:Unsolved problems in computer science]]

Category:Unsolved problems in computer science

类别: 计算机科学中未解决的问题

[[Category:Computational fields of study]]

Category:Computational fields of study

类别: 研究的计算领域

<noinclude>

This page was moved from [[wikipedia:en:Artificial intelligence]]. Its edit history can be viewed at [[人工智能/edithistory]]</noinclude>

[[Category:待整理页面]]

Moonscar

1,568

个编辑

更改

人工智能 (查看源代码)

2020年5月6日 (三) 18:28的版本

导航菜单

搜索