Artificial intelligence: Difference between revisions

Content deleted Content added

Inline

Revision as of 17:34, 6 March 2018

Artificial intelligence (AI, also machine intelligence, MI) is intelligence demonstrated by machines, in contrast to the natural intelligence (NI) displayed by humans and other animals. In computer science AI research is defined as the study of "intelligent agents": any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals.^[1] Colloquially, the term "artificial intelligence" is applied when a machine mimics "cognitive" functions that humans associate with other human minds, such as "learning" and "problem solving".^[2] See glossary of artificial intelligence.

The scope of AI is disputed: as machines become increasingly capable, tasks considered as requiring "intelligence" are often removed from the definition, a phenomenon known as the AI effect, leading to the quip "AI is whatever hasn't been done yet."^[3] For instance, optical character recognition is frequently excluded from "artificial intelligence", having become a routine technology.^[4] Capabilities generally classified as AI as of 2017^[update] include successfully understanding human speech,^[5] competing at the highest level in strategic game systems (such as chess and Go^[6]), autonomous cars, intelligent routing in content delivery networks, military simulations, and interpreting complex data, including images and videos.

Artificial intelligence was founded as an academic discipline in 1956, and in the years since has experienced several waves of optimism,^[7]^[8] followed by disappointment and the loss of funding (known as an "AI winter"),^[9]^[10] followed by new approaches, success and renewed funding.^[8]^[11] For most of its history, AI research has been divided into subfields that often fail to communicate with each other.^[12] These sub-fields are based on technical considerations, such as particular goals (e.g. "robotics" or "machine learning"),^[13] the use of particular tools ("logic" or "neural networks"), or deep philosophical differences.^[14]^[15]^[16] Subfields have also been based on social factors (particular institutions or the work of particular researchers).^[12]

The traditional problems (or goals) of AI research include reasoning, knowledge, planning, learning, natural language processing, perception and the ability to move and manipulate objects.^[13] General intelligence is among the field's long-term goals.^[17] Approaches include statistical methods, computational intelligence, and traditional symbolic AI. Many tools are used in AI, including versions of search and mathematical optimization, neural networks and methods based on statistics, probability and economics. The AI field draws upon computer science, mathematics, psychology, linguistics, philosophy and many others.

The field was founded on the claim that human intelligence "can be so precisely described that a machine can be made to simulate it".^[18] This raises philosophical arguments about the nature of the mind and the ethics of creating artificial beings endowed with human-like intelligence, issues which have been explored by myth, fiction and philosophy since antiquity.^[19] Some people also consider AI to be a danger to humanity if it progresses unabatedly.^[20] Others believe that AI, unlike previous technological revolutions, will create a risk of mass unemployment.^[21]

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.^[22]^[11]

History

While thought-capable artificial beings appeared as storytelling devices in antiquity,^[23] the idea of actually trying to build a machine to perform useful reasoning may have begun with Ramon Llull (c. 1300 CE). With his Calculus ratiocinator, Gottfried Leibniz extended the concept of the calculating machine (Wilhelm Schickard engineered the first one around 1623), intending to perform operations on concepts rather than numbers.^[24] Since the 19th century, artificial beings are common in fiction, as in Mary Shelley's Frankenstein or Karel Čapek's R.U.R. (Rossum's Universal Robots).^[25]

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.^[26]^{[page needed]} Along with concurrent discoveries in neurobiology, information theory and cybernetics, this led researchers to consider the possibility of building an electronic brain.^[27] The first work that is now generally recognized as AI was McCullouch and Pitts' 1943 formal design for Turing-complete "artificial neurons".^[24]

The field of AI research was born at a workshop at Dartmouth College in 1956.^[28] 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.^[29] They and their students produced programs that the press described as "astonishing":^[30] computers were learning checkers strategies (c. 1954)^[31] (and by 1959 were reportedly playing better than the average human),^[32] solving word problems in algebra, proving logical theorems (Logic Theorist, first run c. 1956) and speaking English.^[33] By the middle of the 1960s, research in the U.S. was heavily funded by the Department of Defense^[34] and laboratories had been established around the world.^[35] 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".^[7]

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^[36] 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",^[9] a period when obtaining funding for AI projects was difficult.

In the early 1980s, AI research was revived by the commercial success of expert systems,^[37] 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.^[8] 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.^[10]

In the late 1990s and early 21st century, AI began to be used for logistics, data mining, medical diagnosis and other areas.^[22] The success was due to increasing computational power (see Moore's law), greater emphasis on solving specific problems, new ties between AI and other fields and a commitment by researchers to mathematical methods and scientific standards.^[38] Deep Blue became the first computer chess-playing system to beat a reigning world chess champion, Garry Kasparov on 11 May 1997.^[39]

Advanced statistical techniques (loosely known as deep learning), access to large amounts of data and faster computers enabled advances in machine learning and perception.^{[citation needed]} By the mid 2010s, machine learning applications were used throughout the world.^{[citation needed]} In 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.^[40] The Kinect, which provides a 3D body–motion interface for the Xbox 360 and the Xbox One use algorithms that emerged from lengthy AI research^[41] as do intelligent personal assistants in smartphones.^[42] 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.^[6]^[43] In the 2017 Future of Go Summit, AlphaGo won a three-game match with Ke Jie,^[44] who at the time continuously held the world No. 1 ranking for two years.^[45]^[46] This marked the completion of a significant milestone in the development of Artificial Intelligence as Go is an extremely complex game, more so than Chess.

According to Bloomberg's Jack Clark, 2015 was a landmark year for artificial intelligence, with the number of software projects that use AI within Google increased from a "sporadic usage" in 2012 to more than 2,700 projects. Clark also presents factual data indicating that error rates in image processing tasks have fallen significantly since 2011.^[47] 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.^[11] 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.^[47]

Problems

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

Reasoning, problem solving

Early researchers developed algorithms that imitated step-by-step reasoning that humans use when they solve puzzles or make logical deductions.^[48] By the late 1980s and 1990s, AI research had developed methods for dealing with uncertain or incomplete information, employing concepts from probability and economics.^[49]

For difficult problems, algorithms can require enormous computational resources—most experience a "combinatorial explosion": the amount of memory or computer time required becomes astronomical for problems of a certain size. The search for more efficient problem-solving algorithms is a high priority.^[50]

Human beings ordinarily use fast, intuitive judgments rather than step-by-step deduction that early AI research was able to model.^[51] AI has progressed using "sub-symbolic" problem solving: embodied agent approaches emphasize the importance of sensorimotor skills to higher reasoning; neural net research attempts to simulate the structures inside the brain that give rise to this skill; statistical approaches to AI mimic the human ability to guess.

Knowledge representation

Knowledge representation^[52] and knowledge engineering^[53] are central to AI research. Many of the problems machines are expected to solve will require extensive knowledge about the world. Among the things that AI needs to represent are: objects, properties, categories and relations between objects;^[54] situations, events, states and time;^[55] causes and effects;^[56] knowledge about knowledge (what we know about what other people know);^[57] and many other, less well researched domains. A representation of "what exists" is an 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.^[58] The most general ontologies are called upper ontologies, which attempt to provide a foundation for all other knowledge^[59] by acting as mediators between domain ontologies that cover specific knowledge about a particular knowledge domain (field of interest or area of concern). Such formal knowledge representations are suitable for content-based indexing and retrieval, scene interpretation, clinical decision support, knowledge discovery via automated reasoning (inferring new statements based on explicitly stated knowledge), etc. Video events are often represented as SWRL rules, which can be used, among others, to automatically generate subtitles for constrained videos.^[60]

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 identified this problem in 1969^[61] 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.^[62]
The 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.^[63] A major goal is to have the computer understand enough concepts to be able to learn by reading from sources like the Internet, and thus be able to add to its own ontology.^{[citation needed]}
The 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"^[64] or an art critic can take one look at a statue and realize that it is a fake.^[65] These are non-conscious and sub-symbolic intuitions or tendencies in the human brain.^[66] 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.^[66]

Planning

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

Intelligent agents must be able to set goals and achieve them.^[67] 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.^[68]

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.^[69] 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.^[70]

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

Learning

Machine learning, a fundamental concept of AI research since the field's inception,^[72] is the study of computer algorithms that improve automatically through experience.^[73]^[74]

Unsupervised learning is the ability to find patterns in a stream of input. Supervised learning includes both classification and numerical regression. Classification is used to determine what category something belongs in, after seeing 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^[75] 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. These three types of learning can be analyzed in terms of decision theory, using concepts like utility. The mathematical analysis of machine learning algorithms and their performance is a branch of theoretical computer science known as computational learning theory.^{[citation needed]}

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.).^[76]^[77]^[78]^[79]

Natural language processing

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

Natural language processing^[80] 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^[81] and machine translation.^[82]

A common method of processing and extracting meaning from natural language is through semantic indexing. Although these indexes require a large volume of user input, it is expected that increases in processor speeds and decreases in data storage costs will result in greater efficiency.

Perception

Machine perception^[83] is the ability to use input from sensors (such as cameras, microphones, tactile sensors, sonar and others) to deduce aspects of the world. Computer vision^[84] is the ability to analyze visual input. A few selected subproblems are speech recognition,^[85] facial recognition and object recognition.^[86]

Motion and manipulation

The field of robotics^[87] is closely related to AI. Intelligence is required for robots to handle tasks such as object manipulation^[88] and navigation, with sub-problems such as localization, mapping, and motion planning. These systems require that an agent is able to: Be spatially cognizant of its surroundings, learn from and build a map of its environment, figure out how to get from one point in space to another, and execute that movement (which often involves compliant motion, a process where movement requires maintaining physical contact with an object).^[89]^[90]

Social intelligence

Affective computing is the study and development of systems that can recognize, interpret, process, and simulate human affects.^[92]^[93] It is an interdisciplinary field spanning computer sciences, psychology, and cognitive science.^[94] While the origins of the field may be traced as far back as the early philosophical inquiries into emotion,^[95] the more modern branch of computer science originated with Rosalind Picard's 1995 paper^[96] on "affective computing".^[97]^[98] A motivation for the research is the ability to simulate empathy, where the machine would be able to interpret human emotions and adapts its behavior to give an appropriate response to those emotions.

Emotion and social skills^[99] are important to an intelligent agent for two reasons. First, being able to predict the actions of others by understanding their motives and emotional states allow an agent to make better decisions. Concepts such as game theory, decision theory, necessitate that an agent be able to detect and model human emotions. Second, in an effort to facilitate human–computer interaction, an intelligent machine may want to display emotions (even if it does not experience those emotions itself) to appear more sensitive to the emotional dynamics of human interaction.

Creativity

A sub-field of AI addresses creativity both theoretically (the philosophical psychological perspective) and practically (the specific implementation of systems that generate novel and useful outputs).

General intelligence

Many researchers think that their work will eventually be incorporated into a machine with artificial general intelligence, combining all the skills mentioned above and even exceeding human ability in most or all these areas.^[17]^[100] A few believe that anthropomorphic features like artificial consciousness or an artificial brain may be required for such a project.^[101]^[102]

Many of the problems above also require that general intelligence be solved. 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", but all of these problems need to be solved simultaneously in order to reach human-level machine performance.

Approaches

There is no established unifying theory or paradigm that guides AI research. Researchers disagree about many issues.^[103] 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?^[14] 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?^[15] Can intelligence be reproduced using high-level symbols, similar to words and ideas? Or does it require "sub-symbolic" processing?^[16] John Haugeland, who coined the term GOFAI (Good Old-Fashioned Artificial Intelligence), also proposed that AI should more properly be referred to as synthetic intelligence,^[104] a term which has since been adopted by some non-GOFAI researchers.^[105]^[106]

Stuart Shapiro divides AI research into three approaches, which he calls computational psychology, computational philosophy, and computer science. Computational psychology is used to make computer programs that mimic human behavior.^[107] Computational philosophy, is used to develop an adaptive, free-flowing computer mind.^[107] Implementing computer science serves the goal of creating computers that can perform tasks that only people could previously accomplish.^[107] Together, the humanesque behavior, mind, and actions make up artificial intelligence.

Cybernetics and brain simulation

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.^[27] By 1960, this approach was largely abandoned, although elements of it would be revived in the 1980s.

Symbolic

When access to digital computers became possible in the middle 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 each one developed its own style of research. John Haugeland named these approaches to AI "good old fashioned AI" or "GOFAI".^[108] During the 1960s, symbolic approaches had achieved great success at simulating high-level thinking in small demonstration programs. Approaches based on cybernetics or neural networks were abandoned or pushed into the background.^[109] 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.

Cognitive simulation

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.^[110]^[111]

Logic-based

Unlike Newell and Simon, 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 of whether people used the same algorithms.^[14] His laboratory at Stanford (SAIL) focused on using formal logic to solve a wide variety of problems, including knowledge representation, planning and learning.^[112] 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.^[113]

Anti-logic or scruffy

Researchers at MIT (such as Marvin Minsky and Seymour Papert)^[114] 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).^[15] 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.^[115]

Knowledge-based

When computers with large memories became available around 1970, researchers from all three traditions began to build knowledge into AI applications.^[116] This "knowledge revolution" led to the development and deployment of expert systems (introduced by Edward Feigenbaum), the first truly successful form of AI software.^[37] The knowledge revolution was also driven by the realization that enormous amounts of knowledge would be required by many simple AI applications.

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 perception, robotics, learning and pattern recognition. A number of researchers began to look into "sub-symbolic" approaches to specific AI problems.^[16] Sub-symbolic methods manage to approach intelligence without specific representations of knowledge.

Embodied 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.^[117] Their work revived the non-symbolic viewpoint 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.

Computational intelligence and soft computing

Interest in neural networks and "connectionism" was revived by David Rumelhart and others in the middle of the 1980s.^[118] 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, evolutionary computation and many statistical tools. The application of soft computing to AI is studied collectively by the emerging discipline of computational intelligence.^[119]

Statistical

In the 1990s, AI researchers developed sophisticated mathematical tools to solve specific subproblems. These tools are truly scientific, in the sense that their results are both measurable and verifiable, and they have been responsible for many of AI's recent successes. The shared mathematical language has also permitted a high level of collaboration with more established fields (like mathematics, economics or operations research). Stuart Russell and Peter Norvig describe this movement as nothing less than a "revolution" and "the victory of the neats".^[38] Critics argue that these techniques (with few exceptions^[120]) are too focused on particular problems and have failed to address the long-term goal of general intelligence.^[121] There is an ongoing debate about the relevance and validity of statistical approaches in AI, exemplified in part by exchanges between Peter Norvig and Noam Chomsky.^[122]^[123]

Integrating the approaches

Intelligent agent paradigm: An intelligent agent is a system that perceives its environment and takes actions which 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 gives researchers license to study isolated problems and find solutions that are both verifiable and useful, without agreeing on one single approach. An agent that solves a specific problem can use any approach that works – some agents are symbolic and logical, some are sub-symbolic 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. The intelligent agent paradigm became widely accepted during the 1990s.^[124]

Agent architectures and cognitive architectures: Researchers have designed systems to build intelligent systems out of interacting intelligent agents in a multi-agent system.^[125] A system with both symbolic and sub-symbolic components is a hybrid intelligent system, and the study of such systems is artificial intelligence systems integration. 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 modelling.^[126] Rodney Brooks' subsumption architecture was an early proposal for such a hierarchical system.^{[citation needed]}

Tools

In the course of 60 or so years of research, AI has developed a large number of 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

Many problems in AI can be solved in theory by intelligently searching through many possible solutions:^[127] 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.^[128] Planning algorithms search through trees of goals and subgoals, attempting to find a path to a target goal, a process called means-ends analysis.^[129] Robotics algorithms for moving limbs and grasping objects use local searches in configuration space.^[88] Many learning algorithms use search algorithms based on optimization.

Simple exhaustive searches^[130] 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.^[131] Heuristics limit the search for solutions into a smaller sample size.^[89]

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

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). Forms of evolutionary computation include swarm intelligence algorithms (such as ant colony or particle swarm optimization)^[133] and evolutionary algorithms (such as genetic algorithms, gene expression programming, and genetic programming).^[134]

Logic

Logic^[135] 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^[136] and inductive logic programming is a method for learning.^[137]

Several different forms of logic are used in AI research. Propositional or sentential logic^[138] is the logic of statements which can be true or false. First-order logic^[139] also allows the use of quantifiers and predicates, and can express facts about objects, their properties, and their relations with each other. Fuzzy logic,^[140] is a version of first-order logic which allows the truth of a statement to be represented as a value between 0 and 1, rather than simply True (1) or False (0). Fuzzy systems can be used for uncertain reasoning and have been widely used in modern industrial and consumer product control systems. Subjective logic^{[citation needed]} models uncertainty in a different and more explicit manner than fuzzy-logic: a given binomial opinion satisfies belief + disbelief + uncertainty = 1 within a Beta distribution. By this method, ignorance can be distinguished from probabilistic statements that an agent makes with high confidence.

Default logics, non-monotonic logics and circumscription^[62] 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, such as: description logics;^[54] situation calculus, event calculus and fluent calculus (for representing events and time);^[55] causal calculus;^[56] belief calculus;^[141] and modal logics.^[57]

Probabilistic 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.^[142]

Bayesian networks^[143] are a very general tool that can be used for a large number of problems: reasoning (using the Bayesian inference algorithm),^[144] learning (using the expectation-maximization algorithm),^[145] planning (using decision networks)^[146] and perception (using dynamic Bayesian networks).^[147] 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).^[147]

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,^[148] and information value theory.^[68] These tools include models such as Markov decision processes,^[149] dynamic decision networks,^[147] game theory and mechanism design.^[150]

Classifiers and statistical learning methods

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

A classifier can be trained in various ways; there are many statistical and machine learning approaches. The most widely used classifiers are the neural network,^[152] kernel methods such as the support vector machine,^[153] k-nearest neighbor algorithm,^[154] Gaussian mixture model,^[155] naive Bayes classifier,^[156] and decision tree.^[157] The performance of these classifiers have been compared over a wide range of tasks. Classifier performance depends greatly on the characteristics of the data to be classified. There is no single classifier that works best on all given problems; this is also referred to as the "no free lunch" theorem. Determining a suitable classifier for a given problem is still more an art than science.^[158]

Artificial neural networks

Neural networks are rough simplifications of the neurons in the human brain. The study of non-learning artificial neural networks^[152] 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.

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.^[159] Neural networks can be applied to the problem of intelligent control (for robotics) or learning, using such techniques as Hebbian learning, GMDH or competitive learning.^[160]

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,^[161]^[162] and was introduced to neural networks by Paul Werbos.^[163]^[164]^[165]

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

In short, 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".^[167]

Deep feedforward neural networks

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.^[168] Deep learning has transformed many important subfields of artificial intelligence, including computer vision, speech recognition, natural language processing and others.^[169]^[170]^[168]

According to one overview,^[171] the expression "Deep Learning" was introduced to the Machine Learning community by Rina Dechter in 1986^[172] and gained traction after Igor Aizenberg and colleagues introduced it to Artificial Neural Networks in 2000.^[173] The first functional Deep Learning networks were published by Alexey Grigorevich Ivakhnenko and V. G. Lapa in 1965.^[174]^{[page needed]} These networks are trained one layer at a time. Ivakhnenko's 1971 paper^[175] 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.^[176] 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.^[177]

Deep learning often uses convolutional neural networks (CNNs), whose origins can be traced back to the Neocognitron introduced by Kunihiko Fukushima in 1980.^[178] 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.^[179] Since 2011, fast implementations of CNNs on GPUs have won many visual pattern recognition competitions.^[168]

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

Deep recurrent neural networks

Early on, deep learning was also applied to sequence learning with recurrent neural networks (RNNs)^[181] which are in theory Turing complete^[182] 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.^[168] RNNs can be trained by gradient descent^[183]^[184]^[185] but suffer from the vanishing gradient problem.^[169]^[186] 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.^[187]

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.^[188] LSTM is often trained by Connectionist Temporal Classification (CTC).^[189] At Google, Microsoft and Baidu this approach has revolutionised speech recognition.^[190]^[191]^[192] 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.^[193] Google also used LSTM to improve machine translation,^[194] Language Modeling^[195] and Multilingual Language Processing.^[196] LSTM combined with CNNs also improved automatic image captioning^[197] and a plethora of other applications.

Languages

Early symbolic AI inspired Lisp^[198] and Prolog,^[199] which dominated early AI programming. Modern AI development often uses mainstream languages such as Python or C++,^[200] or niche languages such as Wolfram Language.^[201]

Evaluating progress

In 1950, Alan Turing proposed a general procedure to test the intelligence of an agent now known as the Turing test. This procedure allows almost all the major problems of artificial intelligence to be tested. However, it is a very difficult challenge and at present all agents fail.^[202]

Artificial intelligence can also be evaluated on specific problems such as small problems in chemistry, hand-writing recognition and game-playing. Such tests have been termed subject matter expert Turing tests. Smaller problems provide more achievable goals and there are an ever-increasing number of positive results.^{[citation needed]}

For example, performance at draughts (i.e. checkers) is optimal,^{[citation needed]} performance at chess is high-human and nearing super-human (see computer chess: computers versus human) and performance at many everyday tasks (such as recognizing a face or crossing a room without bumping into something) is sub-human.

A quite different approach measures machine intelligence through tests which are developed from mathematical definitions of intelligence. Examples of these kinds of tests start in the late nineties devising intelligence tests using notions from Kolmogorov complexity and data compression.^[203] Two major advantages of mathematical definitions are their applicability to nonhuman intelligences and their absence of a requirement for human testers.

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

Applications

AI is relevant to any intellectual task.^[205] 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.^[206]

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, prediction of judicial decisions^[207] and targeting online advertisements.^[205]^[208]^[209]

With social media sites overtaking TV as a source for news for young people and news organisations increasingly reliant on social media platforms for generating distribution,^[210] major publishers now use artificial intelligence (AI) technology to post stories more effectively and generate higher volumes of traffic.^[211]

Competitions and prizes

There are a number of competitions and prizes to promote research in artificial intelligence. The main areas promoted are: general machine intelligence, conversational behavior, data-mining, robotic cars, robot soccer and games.

Healthcare

Artificial intelligence is breaking into the healthcare industry by assisting doctors. According to Bloomberg Technology, Microsoft has developed AI to help doctors find the right treatments for cancer.^[212] 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.^[213] Another study is using artificial intelligence to try and 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.^[214]

According to CNN, there was a recent study by surgeons at the Children's National Medical Center in Washington which 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.^[215] IBM has created its own artificial intelligence computer, the IBM Watson, which has beaten human intelligence (at some levels). Watson not only won at the game show Jeopardy! against former champions,^[216] but, was declared a hero after successfully diagnosing a women who was suffering from leukemia.^[217]

Automotive

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 driverless cars. A few companies involved with AI include Tesla, Google, and Apple.^[218]

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

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.^[220] 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.^[221]

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.^[222] 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.^[223]

Another factor that is influencing the ability for 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.^[224]The programing of the car in these situations is crucial to a successful driver-less automobile.

Finance, Economics, and Business

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 USA set-up a Fraud Prevention Task force to counter the unauthorised use of debit cards. Programs like Kasisto and Moneystream are using AI in financial services.

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.^[225] In August 2001, robots beat humans in a simulated financial trading competition.^[226] AI has also reduced fraud and financial crimes by monitoring behavioral patterns of users for any abnormal changes or anomalies.^[227]

The use of AI machines in the market in applications such as online trading and decision making has changed major economic theories.^[228] 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.

With the major growth in data streams, many businesses are turning to intelligent systems and infrastructure - or Enterprise Computation - for a strong analytics strategy. Two of the most relevant artificial intelligence applications are natural language understanding and automated machine learning. This allows business staff to have the ability to access data and analytics across complex organizational structures. Such processes then allows staff to be able to ask questions of data and retrieve instant results and visualizations, powered by sophisticated AI automation.^[229]

Video games

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).^[230]^[231]

Platforms

A platform (or "computing platform") is defined as "some sort of hardware architecture or software framework (including application frameworks), that allows software to run". As Rodney Brooks pointed out many years ago,^[232] it is not just the artificial intelligence software that defines the AI features of the platform, but rather the actual platform itself that affects the AI that results, i.e., there needs to be work in AI problems on real-world platforms rather than in isolation.

A wide variety of platforms has allowed different aspects of AI to develop, ranging from expert systems such as Cyc to deep-learning frameworks to robot platforms such as the Roomba with open interface.^[233] Recent advances in deep artificial neural networks and distributed computing have led to a proliferation of software libraries, including Deeplearning4j, TensorFlow, Theano and Torch.

Collective AI is a platform architecture that combines individual AI into a collective entity, in order to achieve global results from individual behaviors.^[234]^[235] With its collective structure, developers can crowdsource information and extend the functionality of existing AI domains on the platform for their own use, as well as continue to create and share new domains and capabilities for the wider community and greater good.^[236] As developers continue to contribute, the overall platform grows more intelligent and is able to perform more requests, providing a scalable model for greater communal benefit.^[235] Organizations like SoundHound Inc. and the Harvard John A. Paulson School of Engineering and Applied Sciences have used this collaborative AI model.^[237]^[235]

Education in AI

A McKinsey Global Institute study found a shortage of 1.5 million highly trained data and AI professionals and managers^[238] and a number of private bootcamps have developed programs to meet that demand, including free programs like The Data Incubator or paid programs like General Assembly.^[239]

Partnership on AI

Amazon, Google, Facebook, IBM, and Microsoft have established a non-profit partnership to formulate best practices on artificial intelligence technologies, advance the public's understanding, and to serve as a platform about artificial intelligence.^[240] They stated: "This partnership on AI will conduct research, organize discussions, provide thought leadership, consult with relevant third parties, respond to questions from the public and media, and create educational material that advance the understanding of AI technologies including machine perception, learning, and automated reasoning."^[240] Apple joined other tech companies as a founding member of the Partnership on AI in January 2017. The corporate members will make financial and research contributions to the group, while engaging with the scientific community to bring academics onto the board.^[241]^[235]

Philosophy and ethics

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

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

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

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, and represents the position of most working AI researchers.^[242]

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.^[243] 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.)^[244]^[245]

Gödelian arguments: Gödel himself,^[246] 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.^[247] However, the modern consensus in the scientific and mathematical community is that these "Gödelian arguments" fail.^[248]^[249]^[250]

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

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 risks and moral reasoning

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

Machines with intelligence have the potential to use their intelligence to make ethical decisions. Research in this area includes "machine ethics", "artificial moral agents", and the study of "malevolent vs. friendly AI".

Existential risk

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.
— Stephen Hawking^[252]

A common concern about the development of artificial intelligence is the potential threat it could pose to humanity. This concern has recently gained attention after mentions by celebrities including Stephen Hawking, Bill Gates,^[253] and Elon Musk.^[254] A group of prominent tech titans including Peter Thiel, Amazon Web Services and Musk have committed $1billion to OpenAI a nonprofit company aimed at championing responsible AI development.^[255] 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.^[256]

In his book Superintelligence, Nick Bostrom provides an argument that artificial intelligence will pose a threat to mankind. 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 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.

For this danger 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.^[257]^[258] Other counterarguments revolve around humans being either intrinsically or convergently valuable from the perspective of an artificial intelligence.^[259]

Concern over risk from artificial intelligence has led to some high-profile donations and investments. In January 2015, Elon Musk donated ten million dollars 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 Google DeepMind and Vicarious to "just keep an eye on what's going on with artificial intelligence.^[260] I think there is potentially a dangerous outcome there."^[261]^[262]

Development of militarized artificial intelligence is a related concern. 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.^[263]

Devaluation of humanity

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^[264] 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.^[265]

Decrease in demand for human labor

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.^[266] 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".^[267] 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".^[268]^[269]^[270] 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.^[271] Author Martin Ford and others go further and argue that a large number of 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.^[21]

Artificial moral agents

This raises the issue of how ethically the machine should behave towards both humans and other AI agents. This issue was addressed by Wendell Wallach in his book titled Moral Machines in which he introduced the concept of artificial moral agents (AMA).^[272] 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"^[273] and "Can (Ro)bots Really Be Moral".^[274] 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.^[275]

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.^[276] 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."^[277] 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"^[276] that stems from the AAAI Fall 2005 Symposium on Machine Ethics.^[277]

Malevolent and friendly AI

Political scientist Charles T. Rubin believes that AI can be neither designed nor guaranteed to be benevolent.^[278] 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.

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".^[279]

One proposal to deal with this is to ensure that the first generally intelligent AI is 'Friendly AI', and will then be able to control subsequently developed AIs. Some question whether this kind of check could really 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."^[280]

Machine consciousness, sentience and mind

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

Computationalism and functionalism

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

Strong AI hypothesis

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."^[282] 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.^[283]

Robot rights

Mary Shelley's Frankenstein considers a key issue in the ethics of artificial intelligence: 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? The idea also appears in modern science fiction, such as the film A.I.: Artificial Intelligence, in which humanoid machines have the ability to feel emotions. 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.^[284] Some critics of transhumanism argue that any hypothetical robot rights would lie on a spectrum with animal rights and human rights.^[285] The subject is profoundly discussed in the 2010 documentary film Plug & Pray.^[286]

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

Technological singularity

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.^[287] The new intelligence could thus increase exponentially and dramatically surpass humans. Science fiction writer Vernor Vinge named this scenario "singularity".^[288] 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.^[288]^[100]

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

Transhumanism

You awake one morning to find your brain has another lobe functioning. Invisible, this auxiliary lobe answers your questions with information beyond the realm of your own memory, suggests plausible courses of action, and asks questions that help bring out relevant facts. You quickly come to rely on the new lobe so much that you stop wondering how it works. You just use it. This is the dream of artificial intelligence.
— Byte, April 1985^[289]

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.^[290] This idea, called transhumanism, which has roots in Aldous Huxley and Robert Ettinger, has been illustrated in fiction as well, for example 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.

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

In fiction

Thought-capable artificial beings appeared as storytelling devices since antiquity.^[23]

The implications of a constructed machine exhibiting artificial intelligence have been a persistent theme in science fiction since the twentieth century. Early stories typically revolved around intelligent 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". Later, the SF writer Isaac Asimov developed the Three Laws of Robotics. He subsequently explored these in his many books, most notably the "Multivac" series about a super-intelligent computer of the same name. Asimov's laws are often brought up during layman discussions of machine ethics;^[292] 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.^[293]

The novel Do Androids Dream of Electric Sheep?, by Philip K. Dick, tells a science fiction story about Androids and humans clashing in a futuristic world. Elements of artificial intelligence include the empathy box, mood organ, and the androids themselves. Throughout the novel, Dick portrays the idea that human subjectivity is altered by technology created with artificial intelligence.^[294]

Nowadays AI is firmly rooted in popular culture; intelligent robots appear in innumerable works. HAL 9000, the murderous computer in charge of the Discovery One spaceship in Arthur C. Clarke's and Stanley Kubrick's 2001: A Space Odyssey (both 1968), is an example of the common "robotic rampage" archetype in science fiction movies. The Terminator (1984) and The Matrix (1999) provide additional widely familiar examples. 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.^[295]

Notes

^
Definition of AI as the study of intelligent agents:
- Poole, Mackworth & Goebel 1998, 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.
- Russell & Norvig (2003) (who prefer the term "rational agent") and write "The whole-agent view is now widely accepted in the field" (Russell & Norvig 2003, p. 55).
- Nilsson 1998
- Legg & Hutter 2007.
^ Russell & Norvig 2009, p. 2.
^ Hofstadter (1980, p. 601)
^ Schank, Roger C. (1991). "Where's the AI". AI magazine. Vol. 12, no. 4. p. 38.
^ Russell & Norvig 2009.
^ ^a ^b "AlphaGo – Google DeepMind". Archived from the original on 10 March 2016. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ ^a ^b
Optimism of early AI:
- Herbert Simon quote: Simon 1965, p. 96 quoted in Crevier 1993, p. 109.
- Marvin Minsky quote: Minsky 1967, p. 2 quoted in Crevier 1993, p. 109.
^ ^a ^b ^c
Boom of the 1980s: rise of expert systems, Fifth Generation Project, Alvey, MCC, SCI:
- McCorduck 2004, pp. 426–441
- Crevier 1993, pp. 161–162, 197–203, 211, 240
- Russell & Norvig 2003, p. 24
- NRC 1999, pp. 210–211
^ ^a ^b
First AI Winter, Mansfield Amendment, Lighthill report
- Crevier 1993, pp. 115–117
- Russell & Norvig 2003, p. 22
- NRC 1999, pp. 212–213
- Howe 1994
^ ^a ^b
Second AI winter:
- McCorduck 2004, pp. 430–435
- Crevier 1993, pp. 209–210
- NRC 1999, pp. 214–216
^ ^a ^b ^c
AI becomes hugely successful in the early 21st century
- Clark 2015 harvnb error: multiple targets (2×): CITEREFClark2015 (help)
^ ^a ^b Pamela McCorduck (2004, pp. 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."
^ ^a ^b ^c
This list of intelligent traits is based on the topics covered by the major AI textbooks, including:
^ ^a ^b ^c
Biological intelligence vs. intelligence in general:
- Russell & Norvig 2003, pp. 2–3, who make the analogy with aeronautical engineering.
- 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."
- Kolata 1982, a paper in Science, which describes McCarthy's indifference to biological models. Kolata quotes McCarthy as writing: "This is AI, so we don't care if it's psychologically real""Archived copy". Archived from the original on 7 July 2016. Retrieved 16 February 2016. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)CS1 maint: archived copy as title (link). McCarthy recently reiterated his position at the AI@50 conference where he said "Artificial intelligence is not, by definition, simulation of human intelligence" (Maker 2006).
^ ^a ^b ^c
Neats vs. scruffies:
- McCorduck 2004, pp. 421–424, 486–489
- Crevier 1993, pp. 168
- Nilsson 1983, pp. 10–11
^ ^a ^b ^c
Symbolic vs. sub-symbolic AI:
- Nilsson (1998, p. 7), who uses the term "sub-symbolic".
^ ^a ^b
General intelligence (strong AI) is discussed in popular introductions to AI:
- Kurzweil 1999 and Kurzweil 2005
^ See the Dartmouth proposal, under Philosophy, below.
^ 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." (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." (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." (McCorduck 2004, p. 3) She traces the desire back to its Hellenistic roots and calls it the urge to "forge the Gods." (McCorduck 2004, pp. 340–400)
^ "Stephen Hawking believes AI could be mankind's last accomplishment". BetaNews. 21 October 2016. Archived from the original on 28 August 2017. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ ^a ^b Ford, Martin; Colvin, Geoff (6 September 2015). "Will robots create more jobs than they destroy?". The Guardian. Retrieved 13 January 2018.
^ ^a ^b
AI applications widely used behind the scenes:
- Russell & Norvig 2003, p. 28
- Kurzweil 2005, p. 265
- NRC 1999, pp. 216–222
^ ^a ^b
AI in myth:
- McCorduck 2004, pp. 4–5
- Russell & Norvig 2003, p. 939
^ ^a ^b Russell & Norvig 2009, p. 16.
^
AI in early science fiction.
- McCorduck 2004, pp. 17–25
^
Formal reasoning:
- Berlinski, David (2000). The Advent of the Algorithm. Harcourt Books. ISBN 0-15-601391-6. OCLC 46890682.
^ ^a ^b
AI's immediate precursors:
- McCorduck 2004, pp. 51–107
- Crevier 1993, pp. 27–32
- Russell & Norvig 2003, pp. 15, 940
- Moravec 1988, p. 3
^
Dartmouth conference:
- McCorduck 2004, pp. 111–136
- Crevier 1993, pp. 47–49, who writes "the conference is generally recognized as the official birthdate of the new science."
- Russell & Norvig 2003, p. 17, who call the conference "the birth of artificial intelligence."
- NRC 1999, pp. 200–201
^
Hegemony of the Dartmouth conference attendees:
- Russell & Norvig 2003, p. 17, who write "for the next 20 years the field would be dominated by these people and their students."
- McCorduck 2004, pp. 129–130
^ Russell & Norvig 2003, p. 18.
^ Schaeffer J. (2009) Didn’t Samuel Solve That Game?. In: One Jump Ahead. Springer, Boston, MA
^ Samuel, A. L. (July 1959). "Some Studies in Machine Learning Using the Game of Checkers". IBM Journal of Research and Development. 3 (3): 210–229. doi:10.1147/rd.33.0210.
^
"Golden years" of AI (successful symbolic reasoning programs 1956–1973):
- McCorduck 2004, pp. 243–252
- Crevier 1993, pp. 52–107
- Moravec 1988, p. 9
- Russell & Norvig 2003, pp. 18–21
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.
^
DARPA pours money into undirected pure research into AI during the 1960s:
- McCorduck 2004, pp. 131
- Crevier 1993, pp. 51, 64–65
- NRC 1999, pp. 204–205
^
AI in England:
- Howe 1994
^ Lighthill 1973.
^ ^a ^b
Expert systems:
- ACM 1998, I.2.1
- Russell & Norvig 2003, pp. 22–24
- Luger & Stubblefield 2004, pp. 227–331
- Nilsson 1998, chpt. 17.4
- McCorduck 2004, pp. 327–335, 434–435
- Crevier 1993, pp. 145–62, 197–203
^ ^a ^b
Formal methods are now preferred ("Victory of the neats"):
- Russell & Norvig 2003, pp. 25–26
- McCorduck 2004, pp. 486–487
^ McCorduck 2004, pp. 480–483.
^ Markoff 2011. sfn error: multiple targets (2×): CITEREFMarkoff2011 (help)
^ Administrator. "Kinect's AI breakthrough explained". i-programmer.info. Archived from the original on 1 February 2016. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Rowinski, Dan (15 January 2013). "Virtual Personal Assistants & The Future Of Your Smartphone [Infographic]". ReadWrite. Archived from the original on 22 December 2015. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ "Artificial intelligence: Google's AlphaGo beats Go master Lee Se-dol". BBC News. 12 March 2016. Archived from the original on 26 August 2016. Retrieved 1 October 2016. {{cite news}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ "After Win in China, AlphaGo's Designers Explore New AI". 27 May 2017. Archived from the original on 2 June 2017. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ "World's Go Player Ratings". May 2017. Archived from the original on 1 April 2017. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ "柯洁迎19岁生日雄踞人类世界排名第一已两年" (in Chinese). May 2017. Archived from the original on 11 August 2017. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ ^a ^b Clark, Jack (8 December 2015). "Why 2015 Was a Breakthrough Year in Artificial Intelligence". Bloomberg News. Archived from the original on 23 November 2016. Retrieved 23 November 2016. After a half-decade of quiet breakthroughs in artificial intelligence, 2015 has been a landmark year. Computers are smarter and learning faster than ever. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^
Problem solving, puzzle solving, game playing and deduction:
- Russell & Norvig 2003, chpt. 3–9,
- Poole, Mackworth & Goebel 1998, chpt. 2,3,7,9,
- Luger & Stubblefield 2004, chpt. 3,4,6,8,
- Nilsson 1998, chpt. 7–12
^
Uncertain reasoning:
- Russell & Norvig 2003, pp. 452–644,
- Poole, Mackworth & Goebel 1998, pp. 345–395,
- Luger & Stubblefield 2004, pp. 333–381,
- Nilsson 1998, chpt. 19
^
Intractability and efficiency and the combinatorial explosion:
- Russell & Norvig 2003, pp. 9, 21–22
^
Psychological evidence of sub-symbolic reasoning:
- 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)
- 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).
- 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)
^
Knowledge representation:
- ACM 1998, I.2.4,
- Russell & Norvig 2003, pp. 320–363,
- Poole, Mackworth & Goebel 1998, pp. 23–46, 69–81, 169–196, 235–277, 281–298, 319–345,
- Luger & Stubblefield 2004, pp. 227–243,
- Nilsson 1998, chpt. 18
^
Knowledge engineering:
- Russell & Norvig 2003, pp. 260–266,
- Poole, Mackworth & Goebel 1998, pp. 199–233,
- Nilsson 1998, chpt. ≈17.1–17.4
^ ^a ^b
Representing categories and relations: Semantic networks, description logics, inheritance (including frames and scripts):
- Russell & Norvig 2003, pp. 349–354,
- Poole, Mackworth & Goebel 1998, pp. 174–177,
- Luger & Stubblefield 2004, pp. 248–258,
- Nilsson 1998, chpt. 18.3
^ ^a ^b
Representing events and time:Situation calculus, event calculus, fluent calculus (including solving the frame problem):
- Russell & Norvig 2003, pp. 328–341,
- Poole, Mackworth & Goebel 1998, pp. 281–298,
- Nilsson 1998, chpt. 18.2
^ ^a ^b
Causal calculus:
- Poole, Mackworth & Goebel 1998, pp. 335–337
^ ^a ^b
Representing knowledge about knowledge: Belief calculus, modal logics:
- Russell & Norvig 2003, pp. 341–344,
- Poole, Mackworth & Goebel 1998, pp. 275–277
^ Sikos, Leslie F. (June 2017). Description Logics in Multimedia Reasoning. Cham: Springer. doi:10.1007/978-3-319-54066-5. ISBN 978-3-319-54066-5. Archived from the original on 29 August 2017. {{cite book}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^
Ontology:
- Russell & Norvig 2003, pp. 320–328
^ Bertini, M; Del Bimbo, A; Torniai, C (2006). "Automatic annotation and semantic retrieval of video sequences using multimedia ontologies". MM ‘06 Proceedings of the 14th ACM international conference on Multimedia. 14th ACM international conference on Multimedia. Santa Barbara: ACM. pp. 679–682.
^
Qualification problem:
- McCarthy & Hayes 1969
- Russell & Norvig 2003^{[page needed]}
While McCarthy was primarily concerned with issues in the logical representation of actions, 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.
^ ^a ^b
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"):
- Russell & Norvig 2003, pp. 354–360,
- Poole, Mackworth & Goebel 1998, pp. 248–256, 323–335,
- Luger & Stubblefield 2004, pp. 335–363,
- Nilsson 1998, ~18.3.3
^
Breadth of commonsense knowledge:
- Russell & Norvig 2003, p. 21,
- Crevier 1993, pp. 113–114,
- Moravec 1988, p. 13,
- Lenat & Guha 1989 (Introduction)
^ Dreyfus & Dreyfus 1986.
^ Gladwell 2005.
^ ^a ^b
Expert knowledge as embodied intuition:
- 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)
- Gladwell 2005 (Gladwell's Blink is a popular introduction to sub-symbolic reasoning and knowledge.)
- Hawkins & Blakeslee 2005 (Hawkins argues that sub-symbolic knowledge should be the primary focus of AI research.)
^
Planning:
- ACM 1998, ~I.2.8,
- Russell & Norvig 2003, pp. 375–459,
- Poole, Mackworth & Goebel 1998, pp. 281–316,
- Luger & Stubblefield 2004, pp. 314–329,
- Nilsson 1998, chpt. 10.1–2, 22
^ ^a ^b
Information value theory:
- Russell & Norvig 2003, pp. 600–604
^
Classical planning:
- Russell & Norvig 2003, pp. 375–430,
- Poole, Mackworth & Goebel 1998, pp. 281–315,
- Luger & Stubblefield 2004, pp. 314–329,
- Nilsson 1998, chpt. 10.1–2, 22
^
Planning and acting in non-deterministic domains: conditional planning, execution monitoring, replanning and continuous planning:
- Russell & Norvig 2003, pp. 430–449
^
Multi-agent planning and emergent behavior:
- Russell & Norvig 2003, pp. 449–455
^ Alan Turing discussed the centrality of learning as early as 1950, in his classic paper "Computing Machinery and Intelligence".(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".(Solomonoff 1956)
^ This is a form of 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."
^
Learning:
- ACM 1998, I.2.6,
- Russell & Norvig 2003, pp. 649–788,
- Poole, Mackworth & Goebel 1998, pp. 397–438,
- Luger & Stubblefield 2004, pp. 385–542,
- Nilsson 1998, chpt. 3.3, 10.3, 17.5, 20
^
Reinforcement learning:
- Russell & Norvig 2003, pp. 763–788
- Luger & Stubblefield 2004, pp. 442–449
^ Weng et al. 2001.
^ Lungarella et al. 2003.
^ Asada et al. 2009.
^ Oudeyer 2010.
^
Natural language processing:
- ACM 1998, I.2.7
- Russell & Norvig 2003, pp. 790–831
- Poole, Mackworth & Goebel 1998, pp. 91–104
- Luger & Stubblefield 2004, pp. 591–632
^ "Versatile question answering systems: seeing in synthesis" Archived 1 February 2016 at the Wayback Machine, Mittal et al., IJIIDS, 5(2), 119–142, 2011
^
Applications of natural language processing, including information retrieval (i.e. text mining) and machine translation:
- Russell & Norvig 2003, pp. 840–857,
- Luger & Stubblefield 2004, pp. 623–630
^
Machine perception:
- Russell & Norvig 2003, pp. 537–581, 863–898
- Nilsson 1998, ~chpt. 6
^
Computer vision:
- ACM 1998, I.2.10
- Russell & Norvig 2003, pp. 863–898
- Nilsson 1998, chpt. 6
^
Speech recognition:
- ACM 1998, ~I.2.7
- Russell & Norvig 2003, pp. 568–578
^
Object recognition:
- Russell & Norvig 2003, pp. 885–892
^
Robotics:
- ACM 1998, I.2.9,
- Russell & Norvig 2003, pp. 901–942,
- Poole, Mackworth & Goebel 1998, pp. 443–460
^ ^a ^b
Moving and configuration space:
- Russell & Norvig 2003, pp. 916–932
^ ^a ^b Tecuci 2012.
^
Robotic mapping (localization, etc):
- Russell & Norvig 2003, pp. 908–915
^ Kismet.
^ Thro 1993.
^ Edelson 1991.
^ Tao & Tan 2005.
^ James 1884.
^ Picard 1995.
^ Kleine-Cosack 2006: "The introduction of emotion to computer science was done by Pickard (sic) who created the field of affective computing."
^ Diamond 2003: "Rosalind Picard, a genial MIT professor, is the field's godmother; her 1997 book, Affective Computing, triggered an explosion of interest in the emotional side of computers and their users."
^
Emotion and affective computing:
- Minsky 2006
^ ^a ^b ^c Roberts, Jacob (2016). "Thinking Machines: The Search for Artificial Intelligence". Distillations. 2 (2): 14–23. Archived from the original on 17 February 2017. Retrieved 17 February 2017. {{cite journal}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Gerald Edelman, Igor Aleksander and others have argued that artificial consciousness is required for strong AI. (Aleksander 1995; Edelman 2007)
^ ^a ^b
Artificial brain arguments: AI requires a simulation of the operation of the human brain
- Russell & Norvig 2003, p. 957
- Crevier 1993, pp. 271 and 279
A few of the people who make some form of the argument:
- Moravec 1988
- Kurzweil 2005, p. 262
- 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.
^ Nils Nilsson writes: "Simply put, there is wide disagreement in the field about what AI is all about" (Nilsson 1983, p. 10).
^ Haugeland 1985, p. 255.
^ Law 1994.
^ Bach 2008.
^ ^a ^b ^c Shapiro, Stuart C. (1992), "Artificial Intelligence", in Stuart C. Shapiro (ed.), Encyclopedia of Artificial Intelligence, 2nd edition (New York: John Wiley & Sons): 54–57. 4 December 2016.
^ Haugeland 1985, pp. 112–117
^ The most dramatic case of sub-symbolic AI being pushed into the background was the devastating critique of perceptrons by Marvin Minsky and Seymour Papert in 1969. See History of AI, AI winter, or Frank Rosenblatt.
^
Cognitive simulation, Newell and Simon, AI at CMU (then called Carnegie Tech):
- McCorduck 2004, pp. 139–179, 245–250, 322–323 (EPAM)
- Crevier 1993, pp. 145–149
^
Soar (history):
- McCorduck 2004, pp. 450–451
- Crevier 1993, pp. 258–263
^
McCarthy and AI research at SAIL and SRI International:
- McCorduck 2004, pp. 251–259
- Crevier 1993
^
AI research at Edinburgh and in France, birth of Prolog:
- Crevier 1993, pp. 193–196
- Howe 1994
^
AI at MIT under Marvin Minsky in the 1960s :
- McCorduck 2004, pp. 259–305
- Crevier 1993, pp. 83–102, 163–176
- Russell & Norvig 2003, p. 19
^
Cyc:
- McCorduck 2004, p. 489, who calls it "a determinedly scruffy enterprise"
- Crevier 1993, pp. 239–243
- Russell & Norvig 2003, p. 363−365
- Lenat & Guha 1989
^
Knowledge revolution:
- McCorduck 2004, pp. 266–276, 298–300, 314, 421
- Russell & Norvig 2003, pp. 22–23
^
Embodied approaches to AI:
- McCorduck 2004, pp. 454–462
- Brooks 1990
- Moravec 1988
^
Revival of connectionism:
- Crevier 1993, pp. 214–215
- Russell & Norvig 2003, p. 25
^
Computational intelligence
- IEEE Computational Intelligence Society Archived 9 May 2008 at the Wayback Machine
^ Hutter 2012.
^ Langley 2011.
^ Katz 2012.
^ Norvig 2012.
^
The intelligent agent paradigm:
- Russell & Norvig 2003, pp. 27, 32–58, 968–972
- Poole, Mackworth & Goebel 1998, pp. 7–21
- Luger & Stubblefield 2004, pp. 235–240
- Hutter 2005, pp. 125–126
The definition used in this article, in terms of goals, actions, perception and environment, is due to Russell & Norvig (2003). Other definitions also include knowledge and learning as additional criteria.
^
Agent architectures, hybrid intelligent systems:
- Russell & Norvig (2003, pp. 27, 932, 970–972)
- Nilsson (1998, chpt. 25)
^
Hierarchical control system:
- Albus 2002
^
Search algorithms:
- Russell & Norvig 2003, pp. 59–189
- Poole, Mackworth & Goebel 1998, pp. 113–163
- Luger & Stubblefield 2004, pp. 79–164, 193–219
- Nilsson 1998, chpt. 7–12
^
Forward chaining, backward chaining, Horn clauses, and logical deduction as search:
- Russell & Norvig 2003, pp. 217–225, 280–294
- Poole, Mackworth & Goebel 1998, pp. ~46–52
- Luger & Stubblefield 2004, pp. 62–73
- Nilsson 1998, chpt. 4.2, 7.2
^
State space search and planning:
- Russell & Norvig 2003, pp. 382–387
- Poole, Mackworth & Goebel 1998, pp. 298–305
- Nilsson 1998, chpt. 10.1–2
^
Uninformed searches (breadth first search, depth first search and general state space search):
- Russell & Norvig 2003, pp. 59–93
- Poole, Mackworth & Goebel 1998, pp. 113–132
- Luger & Stubblefield 2004, pp. 79–121
- Nilsson 1998, chpt. 8
^
Heuristic or informed searches (e.g., greedy best first and A*):
- Russell & Norvig 2003, pp. 94–109,
- Poole, Mackworth & Goebel 1998, pp. pp. 132–147,
- Luger & Stubblefield 2004, pp. 133–150,
- Nilsson 1998, chpt. 9,
- Poole & Mackworth 2017, Section 3.6
^
Optimization searches:
- Russell & Norvig 2003, pp. 110–116, 120–129
- Poole, Mackworth & Goebel 1998, pp. 56–163
- Luger & Stubblefield 2004, pp. 127–133
^
Artificial life and society based learning:
- Luger & Stubblefield 2004, pp. 530–541
^
Genetic programming and genetic algorithms:
- Luger & Stubblefield 2004, pp. 509–530,
- Nilsson 1998, chpt. 4.2,
- Holland 1975,
- Koza 1992,
- Poli, Langdon & McPhee 2008.
^
Logic:
- ACM 1998, ~I.2.3,
- Russell & Norvig 2003, pp. 194–310,
- Luger & Stubblefield 2004, pp. 35–77,
- Nilsson 1998, chpt. 13–16
^
Satplan:
- Russell & Norvig 2003, pp. 402–407,
- Poole, Mackworth & Goebel 1998, pp. 300–301,
- Nilsson 1998, chpt. 21
^
Explanation based learning, relevance based learning, inductive logic programming, case based reasoning:
- Russell & Norvig 2003, pp. 678–710,
- Poole, Mackworth & Goebel 1998, pp. 414–416,
- Luger & Stubblefield 2004, pp. ~422–442,
- Nilsson 1998, chpt. 10.3, 17.5
^
Propositional logic:
- Russell & Norvig 2003, pp. 204–233,
- Luger & Stubblefield 2004, pp. 45–50
- Nilsson 1998, chpt. 13
^
First-order logic and features such as equality:
- ACM 1998, ~I.2.4,
- Russell & Norvig 2003, pp. 240–310,
- Poole, Mackworth & Goebel 1998, pp. 268–275,
- Luger & Stubblefield 2004, pp. 50–62,
- Nilsson 1998, chpt. 15
^
Fuzzy logic:
- Russell & Norvig 2003, pp. 526–527
^ "The Belief Calculus and Uncertain Reasoning", Yen-Teh Hsia
^
Stochastic methods for uncertain reasoning:
- ACM 1998, ~I.2.3,
- Russell & Norvig 2003, pp. 462–644,
- Poole, Mackworth & Goebel 1998, pp. 345–395,
- Luger & Stubblefield 2004, pp. 165–191, 333–381,
- Nilsson 1998, chpt. 19
^
Bayesian networks:
- Russell & Norvig 2003, pp. 492–523,
- Poole, Mackworth & Goebel 1998, pp. 361–381,
- Luger & Stubblefield 2004, pp. ~182–190, ≈363–379,
- Nilsson 1998, chpt. 19.3–4
^
Bayesian inference algorithm:
- Russell & Norvig 2003, pp. 504–519,
- Poole, Mackworth & Goebel 1998, pp. 361–381,
- Luger & Stubblefield 2004, pp. ~363–379,
- Nilsson 1998, chpt. 19.4 & 7
^
Bayesian learning and the expectation-maximization algorithm:
- Russell & Norvig 2003, pp. 712–724,
- Poole, Mackworth & Goebel 1998, pp. 424–433,
- Nilsson 1998, chpt. 20
^
Bayesian decision theory and Bayesian decision networks:
- Russell & Norvig 2003, pp. 597–600
^ ^a ^b ^c
Stochastic temporal models:
- Russell & Norvig 2003, pp. 537–581
Dynamic Bayesian networks:
- Russell & Norvig 2003, pp. 551–557
Hidden Markov model:
- (Russell & Norvig 2003, pp. 549–551)
Kalman filters:
- Russell & Norvig 2003, pp. 551–557
^
decision theory and decision analysis:
- Russell & Norvig 2003, pp. 584–597,
- Poole, Mackworth & Goebel 1998, pp. 381–394
^
Markov decision processes and dynamic decision networks:
- Russell & Norvig 2003, pp. 613–631
^
Game theory and mechanism design:
- Russell & Norvig 2003, pp. 631–643
^
Statistical learning methods and classifiers:
- Russell & Norvig 2003, pp. 712–754,
- Luger & Stubblefield 2004, pp. 453–541
^ ^a ^b
Neural networks and connectionism:
- Russell & Norvig 2003, pp. 736–748,
- Poole, Mackworth & Goebel 1998, pp. 408–414,
- Luger & Stubblefield 2004, pp. 453–505,
- Nilsson 1998, chpt. 3
^
kernel methods such as the support vector machine:
- Russell & Norvig 2003, pp. 749–752
^
K-nearest neighbor algorithm:
- Russell & Norvig 2003, pp. 733–736
^
Gaussian mixture model:
- Russell & Norvig 2003, pp. 725–727
^
Naive Bayes classifier:
- Russell & Norvig 2003, pp. 718
^
Decision tree:
- Russell & Norvig 2003, pp. 653–664,
- Poole, Mackworth & Goebel 1998, pp. 403–408,
- Luger & Stubblefield 2004, pp. 408–417
^
Classifier performance:
- van der Walt & Bernard 2006
^
Feedforward neural networks, perceptrons and radial basis networks:
- Russell & Norvig 2003, pp. 739–748, 758
- Luger & Stubblefield 2004, pp. 458–467
^
Competitive learning, Hebbian coincidence learning, Hopfield networks and attractor networks:
- Luger & Stubblefield 2004, pp. 474–505
^ 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.
^ Griewank, Andreas (2012). Who Invented the Reverse Mode of Differentiation?. Optimization Stories, Documenta Matematica, Extra Volume ISMP (2012), 389–400.
^ Paul Werbos, "Beyond Regression: New Tools for Prediction and Analysis in the Behavioral Sciences", PhD thesis, Harvard University, 1974.
^ Paul Werbos (1982). Applications of advances in nonlinear sensitivity analysis. In System modeling and optimization (pp. 762–770). Springer Berlin Heidelberg. Online Archived 14 April 2016 at the Wayback Machine
^
Backpropagation:
- Russell & Norvig 2003, pp. 744–748,
- Luger & Stubblefield 2004, pp. 467–474,
- Nilsson 1998, chpt. 3.3
^
Hierarchical temporal memory:
- Hawkins & Blakeslee 2005
^ "Artificial intelligence can 'evolve' to solve problems". Science | AAAS. 10 January 2018. Retrieved 7 February 2018.
^ ^a ^b ^c ^d Schmidhuber, J. (2015). "Deep Learning in Neural Networks: An Overview". Neural Networks. 61: 85–117. arXiv:1404.7828. doi:10.1016/j.neunet.2014.09.003.
^ ^a ^b Ian Goodfellow, Yoshua Bengio, and Aaron Courville (2016). Deep Learning. MIT Press. Online Archived 16 April 2016 at the Wayback Machine
^ Hinton, G.; Deng, L.; Yu, D.; Dahl, G.; Mohamed, A.; Jaitly, N.; Senior, A.; Vanhoucke, V.; Nguyen, P.; Sainath, T.; Kingsbury, B. (2012). "Deep Neural Networks for Acoustic Modeling in Speech Recognition --- The shared views of four research groups". IEEE Signal Processing Magazine. 29 (6): 82–97. doi:10.1109/msp.2012.2205597.
^ Schmidhuber, Jürgen (2015). "Deep Learning". Scholarpedia. 10 (11): 32832. doi:10.4249/scholarpedia.32832. Archived from the original on 19 April 2016. {{cite journal}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)CS1 maint: unflagged free DOI (link)
^ Rina Dechter (1986). Learning while searching in constraint-satisfaction problems. University of California, Computer Science Department, Cognitive Systems Laboratory.Online Archived 19 April 2016 at the Wayback Machine
^ Igor Aizenberg, Naum N. Aizenberg, Joos P.L. Vandewalle (2000). Multi-Valued and Universal Binary Neurons: Theory, Learning and Applications. Springer Science & Business Media.
^ Ivakhnenko, Alexey (1965). Cybernetic Predicting Devices. Kiev: Naukova Dumka.
^ Ivakhnenko, Alexey (1971). "Polynomial theory of complex systems". IEEE Transactions on Systems, Man and Cybernetics (4): 364–378.
^ Hinton 2007.
^ Research, AI (23 October 2015). "Deep Neural Networks for Acoustic Modeling in Speech Recognition". airesearch.com. Retrieved 23 October 2015.
^ Fukushima, K. (1980). "Neocognitron: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position". Biological Cybernetics. 36: 193–202. doi:10.1007/bf00344251. PMID 7370364.
^ Yann LeCun (2016). Slides on Deep Learning Online Archived 23 April 2016 at the Wayback Machine
^ Silver, David; Schrittwieser, Julian; Simonyan, Karen; Antonoglou, Ioannis; Huang, Aja; Guez, Arthur; Hubert, Thomas; Baker, Lucas; Lai, Matthew; Bolton, Adrian; Chen, Yutian; Lillicrap, Timothy; Fan, Hui; Sifre, Laurent; Driessche, George van den; Graepel, Thore; Hassabis, Demis (19 October 2017). "Mastering the game of Go without human knowledge". Nature. 550 (7676): 354–359. doi:10.1038/nature24270. ISSN 0028-0836. AlphaGo Lee... 12 convolutional layers
^
Recurrent neural networks, Hopfield nets:
- Russell & Norvig 2003, p. 758
- Luger & Stubblefield 2004, pp. 474–505
^ Hyötyniemi, Heikki (1996). "Turing machines are recurrent neural networks". Proceedings of STeP '96/Publications of the Finnish Artificial Intelligence Society: 13–24.
^ P. J. Werbos. Generalization of backpropagation with application to a recurrent gas market model" Neural Networks 1, 1988.
^ 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.
^ 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.
^ Sepp Hochreiter (1991), Untersuchungen zu dynamischen neuronalen Netzen Archived 6 March 2015 at the Wayback Machine, Diploma thesis. Institut f. Informatik, Technische Univ. Munich. Advisor: J. Schmidhuber.
^ Schmidhuber, J. (1992). "Learning complex, extended sequences using the principle of history compression". Neural Computation. 4: 234–242. CiteSeerX 10.1.1.49.3934. doi:10.1162/neco.1992.4.2.234.
^ Hochreiter, Sepp; and Schmidhuber, Jürgen; Long Short-Term Memory, Neural Computation, 9(8):1735–1780, 1997
^ 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.
^ Hannun, Awni; Case, Carl; Casper, Jared; Catanzaro, Bryan; Diamos, Greg; Elsen, Erich; Prenger, Ryan; Satheesh, Sanjeev; Sengupta, Shubho; Coates, Adam; Ng, Andrew Y. (2014). "Deep Speech: Scaling up end-to-end speech recognition". arXiv:1412.5567.
^ 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.
^ Li, Xiangang; Wu, Xihong (2015). "Constructing Long Short-Term Memory based Deep Recurrent Neural Networks for Large Vocabulary Speech Recognition". arXiv:1410.4281.
^ Haşim Sak, Andrew Senior, Kanishka Rao, Françoise Beaufays and Johan Schalkwyk (September 2015): Google voice search: faster and more accurate. Archived 9 March 2016 at the Wayback Machine
^ Sutskever, Ilya; Vinyals, Oriol; Le, Quoc V. (2014). "Sequence to Sequence Learning with Neural Networks". arXiv:1409.3215.
^ Jozefowicz, Rafal; Vinyals, Oriol; Schuster, Mike; Shazeer, Noam; Wu, Yonghui (2016). "Exploring the Limits of Language Modeling". arXiv:1602.02410.
^ Gillick, Dan; Brunk, Cliff; Vinyals, Oriol; Subramanya, Amarnag (2015). "Multilingual Language Processing From Bytes". arXiv:1512.00103.
^ Vinyals, Oriol; Toshev, Alexander; Bengio, Samy; Erhan, Dumitru (2015). "Show and Tell: A Neural Image Caption Generator". arXiv:1411.4555.
^
Lisp:
- Luger & Stubblefield 2004, pp. 723–821
- Crevier 1993, pp. 59–62,
- Russell & Norvig 2003, p. 18
^
Prolog:
- Poole, Mackworth & Goebel 1998, pp. 477–491,
- Luger & Stubblefield 2004, pp. 641–676, 575–581
^ "C++ Java". infoworld.com. Retrieved 6 December 2017.
^ Ferris, Robert (7 April 2016). "How Steve Jobs' friend changed the world of math". CNBC. Retrieved 28 February 2018.
^ ^a ^b
The Turing test:
Turing's original publication:
- Turing 1950
Historical influence and philosophical implications:
- Haugeland 1985, pp. 6–9
- Crevier 1993, p. 24
- McCorduck 2004, pp. 70–71
- Russell & Norvig 2003, pp. 2–3 and 948
^
Mathematical definitions of intelligence:
^ O'Brien & Marakas 2011.
^ ^a ^b Russell & Norvig 2009, p. 1.
^ CNN 2006.
^ N. Aletras; D. Tsarapatsanis; D. Preotiuc-Pietro; V. Lampos (2016). "Predicting judicial decisions of the European Court of Human Rights: a Natural Language Processing perspective". PeerJ Computer Science. Archived from the original on 29 October 2016. {{cite journal}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ "The Economist Explains: Why firms are piling into artificial intelligence". The Economist. 31 March 2016. Archived from the original on 8 May 2016. Retrieved 19 May 2016. {{cite news}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Lohr, Steve (28 February 2016). "The Promise of Artificial Intelligence Unfolds in Small Steps". The New York Times. Archived from the original on 29 February 2016. Retrieved 29 February 2016. {{cite news}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Wakefield, Jane (15 June 2016). "Social media 'outstrips TV' as news source for young people". BBC News. Archived from the original on 24 June 2016. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Smith, Mark (22 July 2016). "So you think you chose to read this article?". BBC News. Archived from the original on 25 July 2016. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Dina Bass (20 September 2016). "Microsoft Develops AI to Help Cancer Doctors Find the Right Treatments". Bloomberg. Archived from the original on 11 May 2017. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Gallagher, James (26 January 2017). "Artificial intelligence 'as good as cancer doctors'". BBC News. Archived from the original on 26 January 2017. Retrieved 26 January 2017. {{cite news}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Remote monitoring of high-risk patients using artificial intelligence, 18 October 1994, archived from the original on 28 February 2017, retrieved 27 February 2017 {{citation}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help); Unknown parameter |inventor-first= ignored (help); Unknown parameter |inventor-last= ignored (help); Unknown parameter |inventor2-first= ignored (help); Unknown parameter |inventor2-last= ignored (help); Unknown parameter |inventor3-first= ignored (help); Unknown parameter |inventor3-last= ignored (help)
^ Senthilingam, Meera (12 May 2016). "Are Autonomous Robots Your next Surgeons?". CNN. Cable News Network. Archived from the original on 3 December 2016. Retrieved 4 December 2016. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Markoff, John (16 February 2011). "On 'Jeopardy!' Watson Win Is All but Trivial". The New York Times. Archived from the original on 22 September 2017. {{cite news}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Ng, Alfred (7 August 2016). "IBM's Watson gives proper diagnosis after doctors were stumped". NY Daily News. Archived from the original on 22 September 2017. {{cite news}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ "33 Corporations Working On Autonomous Vehicles". CB Insights. N.p., 11 August 2016. 12 November 2016.
^ 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.
^ Burgess, Matt. "The UK is about to Start Testing Self-Driving Truck Platoons". WIRED. Archived from the original on 22 September 2017. Retrieved 20 September 2017. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Davies, Alex. "World's First Self-Driving Semi-Truck Hits the Road". WIRED. Archived from the original on 28 October 2017. Retrieved 20 September 2017. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ 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
^ "Programming safety into self-driving cars". National Science Foundation. N.p., 2 February 2015. 24 October 2016.
^ 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/
^ O'Neill,, Eleanor (31 July 2016). "Accounting, automation and AI". www.icas.com. Archived from the original on 18 November 2016. Retrieved 18 November 2016. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)CS1 maint: extra punctuation (link)
^ Robots Beat Humans in Trading Battle. Archived 9 September 2009 at the Wayback Machine BBC.com (8 August 2001)
^ "CTO Corner: Artificial Intelligence Use in Financial Services – Financial Services Roundtable". Financial Services Roundtable. 2 April 2015. Archived from the original on 18 November 2016. Retrieved 18 November 2016. {{cite news}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Marwala, Tshilidzi; Hurwitz, Evan (2017). Artificial Intelligence and Economic Theory: Skynet in the Market. London: Springer. ISBN 978-3-319-66104-9.
^ "What is Enterprise Computation?". www.medium.com. Retrieved 6 March 2018.
^ "Why AI researchers like video games". The Economist. Archived from the original on 5 October 2017. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Yannakakis, G. N. (2012, May). Game AI revisited. In Proceedings of the 9th conference on Computing Frontiers (pp. 285–292). ACM.
^ Brooks 1991.
^ "Hacking Roomba". hackingroomba.com. Archived from the original on 18 October 2009. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ "A self-organizing thousand-robot swarm". www.seas.harvard.edu. 14 August 2014. Archived from the original on 4 May 2017. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ ^a ^b ^c ^d "Watch An Autonomous Robot Swarm Form 2D Starfishes". Creators.
^ Rainie, Lee; Janna; erson (8 February 2017). "Theme 2: Good things lie ahead". Archived from the original on 3 July 2017. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Lynley, Matthew. "SoundHound raises $75M to bring its voice-enabled AI everywhere". Archived from the original on 13 September 2017. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Manyika, James; Chui, Michael; Bughin, Jaques; Brown, Brad; Dobbs, Richard; Roxburgh, Charles; Byers, Angela Hung (May 2011). "Big Data: The next frontier for innovation, competition, and productivity". McKinsey Global Institute. Archived from the original on 6 March 2013. Retrieved 16 January 2016. {{cite journal}}: Cite journal requires |journal= (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ "NY gets new boot camp for data scientists: It's free but harder to get into than Harvard". Venture Beat. Archived from the original on 15 February 2016. Retrieved 21 February 2016. {{cite news}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ ^a ^b "Partnership on Artificial Intelligence to Benefit People and Society". N.p., n.d. 24 October 2016.
^ Fiegerman, Seth. "Facebook, Google, Amazon Create Group to Ease AI Concerns". CNNMoney. n.d. 4 December 2016.
^
Dartmouth proposal:
- McCarthy et al. 1955 (the original proposal)
- Crevier 1993, p. 49 (historical significance)
^
The physical symbol systems hypothesis:
- Newell & Simon 1976, p. 116
- McCorduck 2004, p. 153
- Russell & Norvig 2003, p. 18
^ 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." (Dreyfus 1992, p. 156)
^
Dreyfus' critique of artificial intelligence:
- Dreyfus 1972, Dreyfus & Dreyfus 1986
- Crevier 1993, pp. 120–132
- McCorduck 2004, pp. 211–239
- Russell & Norvig 2003, pp. 950–952,
^ 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".
^
The Mathematical Objection:
- Russell & Norvig 2003, p. 949
- McCorduck 2004, pp. 448–449
Making the Mathematical Objection:
- Lucas 1961
- Penrose 1989
Refuting Mathematical Objection:
- Turing 1950 under "(2) The Mathematical Objection"
- Hofstadter 1979
Background:
- Gödel 1931, Church 1936, Kleene 1935, Turing 1937
^ Graham Oppy (20 January 2015). "Gödel's Incompleteness Theorems". Stanford Encyclopedia of Philosophy. Retrieved 27 April 2016. These Gödelian anti-mechanist arguments are, however, problematic, and there is wide consensus that they fail.
^ Stuart J. Russell; Peter Norvig (2010). "26.1.2: Philosophical Foundations/Weak AI: Can Machines Act Intelligently?/The mathematical objection". Artificial Intelligence: A Modern Approach (3rd ed.). Upper Saddle River, NJ: Prentice Hall. ISBN 0-13-604259-7. ...even if we grant that computers have limitations on what they can prove, there is no evidence that humans are immune from those limitations.
^ 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."
^ Russel, Stuart., Daniel Dewey, and Max Tegmark. Research Priorities for Robust and Beneficial Artificial Intelligence. AI Magazine 36:4 (2015). 8 December 2016.
^ "Stephen Hawking warns artificial intelligence could end mankind". BBC News. Archived from the original on 30 October 2015. Retrieved 30 October 2015. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Holley, Peter (28 January 2015). "Bill Gates on dangers of artificial intelligence: 'I don't understand why some people are not concerned'". The Washington Post. ISSN 0190-8286. Archived from the original on 30 October 2015. Retrieved 30 October 2015. {{cite news}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Gibbs, Samuel. "Elon Musk: artificial intelligence is our biggest existential threat". the Guardian. Archived from the original on 30 October 2015. Retrieved 30 October 2015. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Post, Washington. "Tech titans like Elon Musk are spending $1 billion to save you from terminators". Archived from the original on 7 June 2016. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Müller, Vincent C.; Bostrom, Nick (2014). "Future Progress in Artificial Intelligence: A Poll Among Experts" (PDF). AI Matters. 1 (1): 9–11. doi:10.1145/2639475.2639478. Archived from the original (PDF) on 15 January 2016. {{cite journal}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ "Is artificial intelligence really an existential threat to humanity?". Bulletin of the Atomic Scientists. Archived from the original on 30 October 2015. Retrieved 30 October 2015. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ "The case against killer robots, from a guy actually working on artificial intelligence". Fusion.net. Archived from the original on 4 February 2016. Retrieved 31 January 2016. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ "Will artificial intelligence destroy humanity? Here are 5 reasons not to worry". Vox. Archived from the original on 30 October 2015. Retrieved 30 October 2015. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ "The mysterious artificial intelligence company Elon Musk invested in is developing game-changing smart computers". Tech Insider. Archived from the original on 30 October 2015. Retrieved 30 October 2015. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Clark, Jack. "Musk-Backed Group Probes Risks Behind Artificial Intelligence". Bloomberg.com. Archived from the original on 30 October 2015. Retrieved 30 October 2015. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ "Elon Musk Is Donating $10M Of His Own Money To Artificial Intelligence Research". Fast Company. Archived from the original on 30 October 2015. Retrieved 30 October 2015. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ "Stephen Hawking, Elon Musk, and Bill Gates Warn About Artificial Intelligence". Observer. Archived from the original on 30 October 2015. Retrieved 30 October 2015. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ In the early 1970s, Kenneth Colby presented a version of Weizenbaum's ELIZA known as DOCTOR which he promoted as a serious therapeutic tool. (Crevier 1993, pp. 132–144)
^
Joseph Weizenbaum's critique of AI:
- Weizenbaum 1976
- Crevier 1993, pp. 132–144
- McCorduck 2004, pp. 356–373
- 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.
^ E McGaughey, 'Will Robots Automate Your Job Away? Full Employment, Basic Income, and Economic Democracy' (2018) SSRN, part 2(3)
^ "Automation and anxiety". The Economist. 9 May 2015. Retrieved 13 January 2018.
^ Lohr, Steve (2017). "Robots Will Take Jobs, but Not as Fast as Some Fear, New Report Says". The New York Times. Retrieved 13 January 2018.
^ "The future of employment: How susceptible are jobs to computerisation?". Technological Forecasting and Social Change. 114: 254–280. 1 January 2017. doi:10.1016/j.techfore.2016.08.019. ISSN 0040-1625.
^ 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.
^ Mahdawi, Arwa (26 June 2017). "What jobs will still be around in 20 years? Read this to prepare your future". The Guardian. Retrieved 13 January 2018.
^ Wendell Wallach (2010). Moral Machines, Oxford University Press.
^ Wallach, pp 37–54.
^ Wallach, pp 55–73.
^ Wallach, Introduction chapter.
^ ^a ^b Michael Anderson and Susan Leigh Anderson (2011), Machine Ethics, Cambridge University Press.
^ ^a ^b "Machine Ethics". aaai.org. Archived from the original on 29 November 2014. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Rubin, Charles (Spring 2003). "Artificial Intelligence and Human Nature |`The New Atlantis". 1: 88–100. Archived from the original on 11 June 2012. {{cite journal}}: Cite journal requires |journal= (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Rawlinson, Kevin. "Microsoft's Bill Gates insists AI is a threat". BBC News. Archived from the original on 29 January 2015. Retrieved 30 January 2015. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Brooks, Rodney (10 November 2014). "artificial intelligence is a tool, not a threat". Archived from the original on 12 November 2014. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Horst, Steven, (2005) "The Computational Theory of Mind" in The Stanford Encyclopedia of Philosophy
^ This version is from Searle (1999), and is also quoted in 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." (Searle 1980, p. 1). Strong AI is defined similarly by 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."
^
Searle's Chinese room argument:
- Searle 1980. Searle's original presentation of the thought experiment.
- Searle 1999.
Discussion:
- Russell & Norvig 2003, pp. 958–960
- McCorduck 2004, pp. 443–445
- Crevier 1993, pp. 269–271
^
Robot rights:
- Russell & Norvig 2003, p. 964
- BBC News 2006
Prematurity of:
- Henderson 2007
In fiction:
- McCorduck (2004, p. 190-25) discusses Frankenstein and identifies the key ethical issues as scientific hubris and the suffering of the monster, i.e. robot rights.
^ Evans, Woody (2015). "Posthuman Rights: Dimensions of Transhuman Worlds". Teknokultura. Universidad Complutense, Madrid. Archived from the original on 28 December 2016. Retrieved 5 December 2016. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ maschafilm. "Content: Plug & Pray Film – Artificial Intelligence – Robots -". plugandpray-film.de. Archived from the original on 12 February 2016. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^ Omohundro, Steve (2008). The Nature of Self-Improving Artificial Intelligence. presented and distributed at the 2007 Singularity Summit, San Francisco, CA.
^ ^a ^b ^c
Technological singularity:
- Vinge 1993
- Kurzweil 2005
- Russell & Norvig 2003, p. 963
^ Lemmons, Phil (April 1985). "Artificial Intelligence". BYTE. p. 125. Archived from the original on 20 April 2015. Retrieved 14 February 2015. {{cite news}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
^
Transhumanism:
- Moravec 1988
- Kurzweil 2005
- Russell & Norvig 2003, p. 963
^
AI as evolution:
- Edward Fredkin is quoted in McCorduck (2004, p. 401).
- Butler 1863
- Dyson 1998
^ Anderson, Susan Leigh. "Asimov's "three laws of robotics" and machine metaethics." AI & Society 22.4 (2008): 477–493.
^ McCauley, Lee (2007). "AI armageddon and the three laws of robotics". Ethics and Information Technology. 9 (2): 153–164. CiteSeerX 10.1.1.85.8904. doi:10.1007/s10676-007-9138-2.
^ Galvan, Jill (1 January 1997). "Entering the Posthuman Collective in Philip K. Dick's "Do Androids Dream of Electric Sheep?"". Science Fiction Studies. 24 (3): 413–429. JSTOR 4240644.
^ Buttazzo, G. (July 2001). "Artificial consciousness: Utopia or real possibility?". Computer (IEEE). 34 (7): 24–30. doi:10.1109/2.933500. Archived from the original on 30 December 2016. Retrieved 29 December 2016. {{cite journal}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)

References

AI textbooks

Hutter, Marcus (2005). Universal Artificial Intelligence. Berlin: Springer. ISBN 978-3-540-22139-5. {{cite book}}: Invalid |ref=harv (help)
Jackson, Philip (1985). Introduction to Artificial Intelligence (2nd ed.). Dover. ISBN 0-486-24864-X. {{cite book}}: Invalid |ref=harv (help)
Luger, George; Stubblefield, William (2004). Artificial Intelligence: Structures and Strategies for Complex Problem Solving (5th ed.). Benjamin/Cummings. ISBN 0-8053-4780-1. {{cite book}}: Invalid |ref=harv (help)
Neapolitan, Richard; Jiang, Xia (2018). Artificial Intelligence: With an Introduction to Machine Learning. Chapman & Hall/CRC. ISBN 978-1-13850-238-3.
Nilsson, Nils (1998). Artificial Intelligence: A New Synthesis. Morgan Kaufmann. ISBN 978-1-55860-467-4. {{cite book}}: Invalid |ref=harv (help)
Russell, Stuart J.; Norvig, Peter (2003), Artificial Intelligence: A Modern Approach (2nd ed.), Upper Saddle River, New Jersey: Prentice Hall, ISBN 0-13-790395-2.
Russell, Stuart J.; Norvig, Peter (2009). Artificial Intelligence: A Modern Approach (3rd ed.). Upper Saddle River, New Jersey: Prentice Hall. ISBN 0-13-604259-7. {{cite book}}: Invalid |ref=harv (help).
Poole, David; Mackworth, Alan; Goebel, Randy (1998). Computational Intelligence: A Logical Approach. New York: Oxford University Press. ISBN 0-19-510270-3. {{cite book}}: Invalid |ref=harv (help)
Winston, Patrick Henry (1984). Artificial Intelligence. Reading, MA: Addison-Wesley. ISBN 0-201-08259-4.
Rich, Elaine (1983). Artificial Intelligence. McGraw-Hill. ISBN 0-07-052261-8.
Bundy, Alan (1980). Artificial Intelligence: An Introductory Course (2nd ed.). Edinburgh University Press. ISBN 0-85224-410-X.
Poole, David; Mackworth, Alan (2017). Artificial Intelligence: Foundations of Computational Agents (2nd ed.). Cambridge University Press. ISBN 9781107195394. {{cite book}}: Invalid |ref=harv (help)

History of AI

Crevier, Daniel (1993). AI: The Tumultuous Search for Artificial Intelligence. New York, NY: BasicBooks. ISBN 0-465-02997-3..
McCorduck, Pamela (2004), Machines Who Think (2nd ed.), Natick, Massachusetts: A. K. Peters, ISBN 1-5688-1205-1.
Newquist, HP (1994). The Brain Makers: Genius, Ego, And Greed In The Quest For Machines That Think. New York: Macmillan/SAMS. ISBN 0-672-30412-0.
Nilsson, Nils (2009). The Quest for Artificial Intelligence: A History of Ideas and Achievements. New York: Cambridge University Press. ISBN 978-0-521-12293-1.

Other sources

Asada, M.; Hosoda, K.; Kuniyoshi, Y.; Ishiguro, H.; Inui, T.; Yoshikawa, Y.; Ogino, M.; Yoshida, C. (2009). "Cognitive developmental robotics: a survey". IEEE Transactions on Autonomous Mental Development. 1 (1): 12–34. doi:10.1109/tamd.2009.2021702. Archived from the original on 4 October 2013. {{cite journal}}: Invalid |ref=harv (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
"ACM Computing Classification System: Artificial intelligence". ACM. 1998. Archived from the original on 12 October 2007. Retrieved 30 August 2007. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
Goodman, Joanna (2016). Robots in Law: How Artificial Intelligence is Transforming Legal Services (1st ed.). Ark Group. ISBN 978-1-78358-264-8. {{cite book}}: Invalid |ref=harv (help)
Albus, J. S. (2002). "4-D/RCS: A Reference Model Architecture for Intelligent Unmanned Ground Vehicles" (PDF). In Gerhart, G.; Gunderson, R.; Shoemaker, C. (eds.). Proceedings of the SPIE AeroSense Session on Unmanned Ground Vehicle Technology. Vol. 3693. pp. 11–20. Archived from the original (PDF) on 25 July 2004. {{cite encyclopedia}}: Invalid |ref=harv (help); Unknown parameter |dead-url= ignored (|url-status= suggested) (help)
Aleksander, Igor (1995). Artificial Neuroconsciousness: An Update. IWANN. Archived from the original on 2 March 1997. {{cite book}}: Invalid |ref=harv (help) BibTex Archived 2 March 1997 at the Wayback Machine.
Bach, Joscha (2008). Wang, Pei; Goertzel, Ben; Franklin, Stan (eds.). Seven Principles of Synthetic Intelligence. IOS Press. pp. 63–74. ISBN 978-1-58603-833-5. {{cite encyclopedia}}: |work= ignored (help); Invalid |ref=harv (help)
"Robots could demand legal rights". BBC News. 21 December 2006. Retrieved 3 February 2011.
Brooks, Rodney (1990). "Elephants Don't Play Chess" (PDF). Robotics and Autonomous Systems. 6: 3–15. doi:10.1016/S0921-8890(05)80025-9. Archived from the original (PDF) on 9 August 2007. {{cite journal}}: Invalid |ref=harv (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
Brooks, R. A. (1991). "How to build complete creatures rather than isolated cognitive simulators". In VanLehn, K. (ed.). Architectures for Intelligence. Hillsdale, NJ: Lawrence Erlbaum Associates. pp. 225–239. CiteSeerX 10.1.1.52.9510. {{cite encyclopedia}}: Invalid |ref=harv (help)
Buchanan, Bruce G. (2005). "A (Very) Brief History of Artificial Intelligence" (PDF). AI Magazine: 53–60. Archived from the original (PDF) on 26 September 2007. {{cite journal}}: Invalid |ref=harv (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
Butler, Samuel (13 June 1863). "Darwin among the Machines". Letters to the Editor. The Press. Christchurch, New Zealand. Retrieved 16 October 2014 – via Victoria University of Wellington. {{cite news}}: Invalid |ref=harv (help)
Clark, Jack (8 December 2015). "Why 2015 Was a Breakthrough Year in Artificial Intelligence". Bloomberg News. Archived from the original on 23 November 2016. Retrieved 23 November 2016. After a half-decade of quiet breakthroughs in artificial intelligence, 2015 has been a landmark year. Computers are smarter and learning faster than ever. {{cite web}}: Invalid |ref=harv (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help)</ref>
"AI set to exceed human brain power". CNN. 26 July 2006. Archived from the original on 19 February 2008. {{cite news}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
Dennett, Daniel (1991). Consciousness Explained. The Penguin Press. ISBN 0-7139-9037-6. {{cite book}}: Invalid |ref=harv (help)
Diamond, David (December 2003). "The Love Machine; Building computers that care". Wired. Archived from the original on 18 May 2008. {{cite magazine}}: Invalid |ref=harv (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
Dowe, D. L.; Hajek, A. R. (1997). "A computational extension to the Turing Test". Proceedings of the 4th Conference of the Australasian Cognitive Science Society. Archived from the original on 28 June 2011. {{cite journal}}: Invalid |ref=harv (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
Dreyfus, Hubert (1972). What Computers Can't Do. New York: MIT Press. ISBN 0-06-011082-1. {{cite book}}: Invalid |ref=harv (help)
Dreyfus, Hubert; Dreyfus, Stuart (1986). Mind over Machine: The Power of Human Intuition and Expertise in the Era of the Computer. Oxford, UK: Blackwell. ISBN 0-02-908060-6. {{cite book}}: Invalid |ref=harv (help)
Dreyfus, Hubert (1992). What Computers Still Can't Do. New York: MIT Press. ISBN 0-262-54067-3. {{cite book}}: Invalid |ref=harv (help)
Dyson, George (1998). Darwin among the Machines. Allan Lane Science. ISBN 0-7382-0030-1. {{cite book}}: Invalid |ref=harv (help)
Edelman, Gerald (23 November 2007). "Gerald Edelman – Neural Darwinism and Brain-based Devices". Talking Robots. Archived from the original on 8 October 2009. {{cite web}}: Invalid |ref=harv (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
Edelson, Edward (1991). The Nervous System. New York: Chelsea House. ISBN 978-0-7910-0464-7. {{cite book}}: Invalid |ref=harv (help)
Fearn, Nicholas (2007). The Latest Answers to the Oldest Questions: A Philosophical Adventure with the World's Greatest Thinkers. New York: Grove Press. ISBN 0-8021-1839-9. {{cite book}}: Invalid |ref=harv (help)
Gladwell, Malcolm (2005). Blink. New York: Little, Brown and Co. ISBN 0-316-17232-4. {{cite book}}: Invalid |ref=harv (help)
Gödel, Kurt (1951). Some basic theorems on the foundations of mathematics and their implications. Gibbs Lecture. {{cite conference}}: Invalid |ref=harv (help) In
Feferman, Solomon, ed. (1995). Kurt Gödel: Collected Works, Vol. III: Unpublished Essays and Lectures. Oxford University Press. pp. 304–23. ISBN 978-0-19-514722-3. {{cite book}}: Unknown parameter |editorlink= ignored (|editor-link= suggested) (help)
Haugeland, John (1985). Artificial Intelligence: The Very Idea. Cambridge, Mass.: MIT Press. ISBN 0-262-08153-9. {{cite book}}: Invalid |ref=harv (help)
Hawkins, Jeff; Blakeslee, Sandra (2005). On Intelligence. New York, NY: Owl Books. ISBN 0-8050-7853-3. {{cite book}}: Invalid |ref=harv (help)
Henderson, Mark (24 April 2007). "Human rights for robots? We're getting carried away". The Times Online. London. {{cite news}}: Invalid |ref=harv (help)
Hernandez-Orallo, Jose (2000). "Beyond the Turing Test". Journal of Logic, Language and Information. 9 (4): 447–466. doi:10.1023/A:1008367325700. {{cite journal}}: Invalid |ref=harv (help)
Hernandez-Orallo, J.; Dowe, D. L. (2010). "Measuring Universal Intelligence: Towards an Anytime Intelligence Test". Artificial Intelligence Journal. 174 (18): 1508–1539. CiteSeerX 10.1.1.295.9079. doi:10.1016/j.artint.2010.09.006. {{cite journal}}: Invalid |ref=harv (help)
Hinton, G. E. (2007). "Learning multiple layers of representation". Trends in Cognitive Sciences. 11: 428–434. doi:10.1016/j.tics.2007.09.004. {{cite journal}}: Invalid |ref=harv (help)
Hofstadter, Douglas (1979). Gödel, Escher, Bach: an Eternal Golden Braid. New York, NY: Vintage Books. ISBN 0-394-74502-7. {{cite book}}: Invalid |ref=harv (help)
Holland, John H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. ISBN 0-262-58111-6. {{cite book}}: Invalid |ref=harv (help)
Howe, J. (November 1994). "Artificial Intelligence at Edinburgh University: a Perspective". Retrieved 30 August 2007. {{cite web}}: Invalid |ref=harv (help)
Hutter, M. (2012). "One Decade of Universal Artificial Intelligence". Theoretical Foundations of Artificial General Intelligence. Atlantis Thinking Machines. Vol. 4. doi:10.2991/978-94-91216-62-6_5. ISBN 978-94-91216-61-9. {{cite book}}: Invalid |ref=harv (help)
James, William (1884). "What is Emotion". Mind. 9: 188–205. doi:10.1093/mind/os-IX.34.188. {{cite journal}}: Invalid |ref=harv (help) Cited by Tao & Tan 2005.
Kahneman, Daniel; Slovic, D.; Tversky, Amos (1982). Judgment under uncertainty: Heuristics and biases. New York: Cambridge University Press. ISBN 0-521-28414-7. {{cite book}}: Invalid |ref=harv (help)
Katz, Yarden (1 November 2012). "Noam Chomsky on Where Artificial Intelligence Went Wrong". The Atlantic. Retrieved 26 October 2014. {{cite journal}}: Invalid |ref=harv (help)
"Kismet". MIT Artificial Intelligence Laboratory, Humanoid Robotics Group. Retrieved 25 October 2014.
Koza, John R. (1992). Genetic Programming (On the Programming of Computers by Means of Natural Selection). MIT Press. ISBN 0-262-11170-5. {{cite book}}: Invalid |ref=harv (help)
Kleine-Cosack, Christian (October 2006). "Recognition and Simulation of Emotions" (PDF). Archived from the original (PDF) on 28 May 2008. {{cite web}}: Invalid |ref=harv (help)
Kolata, G. (1982). "How can computers get common sense?". Science. 217 (4566): 1237–1238. doi:10.1126/science.217.4566.1237. PMID 17837639. {{cite journal}}: Invalid |ref=harv (help)
Kumar, Gulshan; Kumar, Krishan (2012). "The Use of Artificial-Intelligence-Based Ensembles for Intrusion Detection: A Review". Applied Computational Intelligence and Soft Computing. 2012: 1–20. doi:10.1155/2012/850160. {{cite journal}}: Invalid |ref=harv (help)CS1 maint: unflagged free DOI (link)
Kurzweil, Ray (1999). The Age of Spiritual Machines. Penguin Books. ISBN 0-670-88217-8. {{cite book}}: Invalid |ref=harv (help)
Kurzweil, Ray (2005). The Singularity is Near. Penguin Books. ISBN 0-670-03384-7. {{cite book}}: Invalid |ref=harv (help)
Lakoff, George; Núñez, Rafael E. (2000). Where Mathematics Comes From: How the Embodied Mind Brings Mathematics into Being. Basic Books. ISBN 0-465-03771-2. {{cite book}}: Invalid |ref=harv (help)
Langley, Pat (2011). "The changing science of machine learning". Machine Learning. 82 (3): 275–279. doi:10.1007/s10994-011-5242-y. {{cite journal}}: Invalid |ref=harv (help)
Law, Diane (June 1994). Searle, Subsymbolic Functionalism and Synthetic Intelligence (Technical report). University of Texas at Austin. p. AI94-222. CiteSeerX 10.1.1.38.8384. {{cite tech report}}: Invalid |ref=harv (help)
Legg, Shane; Hutter, Marcus (15 June 2007). A Collection of Definitions of Intelligence (Technical report). IDSIA. arXiv:0706.3639. 07-07. {{cite tech report}}: Invalid |ref=harv (help)
Lenat, Douglas; Guha, R. V. (1989). Building Large Knowledge-Based Systems. Addison-Wesley. ISBN 0-201-51752-3. {{cite book}}: Invalid |ref=harv (help)
Lighthill, James (1973). "Artificial Intelligence: A General Survey". Artificial Intelligence: a paper symposium. Science Research Council. {{cite book}}: Invalid |ref=harv (help)
Lucas, John (1961). "Minds, Machines and Gödel". In Anderson, A.R. (ed.). Minds and Machines. Archived from the original on 19 August 2007. Retrieved 30 August 2007. {{cite book}}: Invalid |ref=harv (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
Lungarella, M.; Metta, G.; Pfeifer, R.; Sandini, G. (2003). "Developmental robotics: a survey". Connection Science. 15: 151–190. CiteSeerX 10.1.1.83.7615. doi:10.1080/09540090310001655110. {{cite journal}}: Invalid |ref=harv (help)
Maker, Meg Houston (2006). "AI@50: AI Past, Present, Future". Dartmouth College. Archived from the original on 3 January 2007. Retrieved 16 October 2008. {{cite web}}: Invalid |ref=harv (help); Unknown parameter |dead-url= ignored (|url-status= suggested) (help)
Markoff, John (16 February 2011). "Computer Wins on 'Jeopardy!': Trivial, It's Not". The New York Times. Retrieved 25 October 2014. {{cite news}}: Invalid |ref=harv (help)
McCarthy, John; Minsky, Marvin; Rochester, Nathan; Shannon, Claude (1955). "A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence". Archived from the original on 26 August 2007. Retrieved 30 August 2007. {{cite web}}: Invalid |ref=harv (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help).
McCarthy, John; Hayes, P. J. (1969). "Some philosophical problems from the standpoint of artificial intelligence". Machine Intelligence. 4: 463–502. CiteSeerX 10.1.1.85.5082. Archived from the original on 10 August 2007. Retrieved 30 August 2007. {{cite journal}}: Invalid |ref=harv (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
McCarthy, John (12 November 2007). "What Is Artificial Intelligence?". {{cite web}}: Invalid |ref=harv (help)
Minsky, Marvin (1967). Computation: Finite and Infinite Machines. Englewood Cliffs, N.J.: Prentice-Hall. ISBN 0-13-165449-7. {{cite book}}: Invalid |ref=harv (help)
Minsky, Marvin (2006). The Emotion Machine. New York, NY: Simon & Schusterl. ISBN 0-7432-7663-9. {{cite book}}: Invalid |ref=harv (help)
Moravec, Hans (1988). Mind Children. Harvard University Press. ISBN 0-674-57616-0. {{cite book}}: Invalid |ref=harv (help)
Norvig, Peter (25 June 2012). "On Chomsky and the Two Cultures of Statistical Learning". Peter Norvig. Archived from the original on 19 October 2014. {{cite web}}: Invalid |ref=harv (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
NRC (United States National Research Council) (1999). "Developments in Artificial Intelligence". Funding a Revolution: Government Support for Computing Research. National Academy Press.
Needham, Joseph (1986). Science and Civilization in China: Volume 2. Caves Books Ltd. {{cite book}}: Invalid |ref=harv (help)
Newell, Allen; Simon, H. A. (1976). "Computer Science as Empirical Inquiry: Symbols and Search". Communications of the ACM. 19 (3): 113–126. doi:10.1145/360018.360022. Archived from the original on 7 October 2008. {{cite journal}}: Invalid |ref=harv (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help).
Nilsson, Nils (1983). "Artificial Intelligence Prepares for 2001" (PDF). AI Magazine. 1 (1). {{cite journal}}: Invalid |ref=harv (help) Presidential Address to the Association for the Advancement of Artificial Intelligence.
O'Brien, James; Marakas, George (2011). Management Information Systems (10th ed.). McGraw-Hill/Irwin. ISBN 978-0-07-337681-3. {{cite book}}: Invalid |ref=harv (help)
O'Connor, Kathleen Malone (1994). "The alchemical creation of life (takwin) and other concepts of Genesis in medieval Islam". University of Pennsylvania. {{cite journal}}: Cite journal requires |journal= (help); Invalid |ref=harv (help)
Oudeyer, P-Y. (2010). "On the impact of robotics in behavioral and cognitive sciences: from insect navigation to human cognitive development" (PDF). IEEE Transactions on Autonomous Mental Development. 2 (1): 2–16. doi:10.1109/tamd.2009.2039057. {{cite journal}}: Invalid |ref=harv (help)
Penrose, Roger (1989). The Emperor's New Mind: Concerning Computer, Minds and The Laws of Physics. Oxford University Press. ISBN 0-19-851973-7. {{cite book}}: Invalid |ref=harv (help)
Picard, Rosalind (1995). Affective Computing (PDF) (Technical report). MIT. 321. {{cite tech report}}: Invalid |ref=harv (help); Unknown parameter |laysource= ignored (help); Unknown parameter |layurl= ignored (help)
Poli, R.; Langdon, W. B.; McPhee, N. F. (2008). A Field Guide to Genetic Programming. Lulu.com. ISBN 978-1-4092-0073-4 – via gp-field-guide.org.uk. {{cite book}}: Invalid |ref=harv (help)
Rajani, Sandeep (2011). "Artificial Intelligence – Man or Machine" (PDF). International Journal of Information Technology and Knowledge Management. 4 (1): 173–176. Archived from the original (PDF) on 18 January 2013. {{cite journal}}: Invalid |ref=harv (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
Searle, John (1980). "Minds, Brains and Programs". Behavioral and Brain Sciences. 3 (3): 417–457. doi:10.1017/S0140525X00005756. Archived from the original on 18 January 2010. {{cite journal}}: Invalid |ref=harv (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
Searle, John (1999). Mind, language and society. New York, NY: Basic Books. ISBN 0-465-04521-9. OCLC 231867665. {{cite book}}: Invalid |ref=harv (help)
Shapiro, Stuart C. (1992). "Artificial Intelligence". In Shapiro, Stuart C. (ed.). Encyclopedia of Artificial Intelligence (PDF) (2nd ed.). New York: John Wiley. pp. 54–57. ISBN 0-471-50306-1. {{cite book}}: Invalid |ref=harv (help)
Simon, H. A. (1965). The Shape of Automation for Men and Management. New York: Harper & Row. {{cite book}}: Invalid |ref=harv (help)
Skillings, Jonathan (3 July 2006). "Getting Machines to Think Like Us". cnet. Retrieved 3 February 2011. {{cite web}}: Invalid |ref=harv (help)
Solomonoff, Ray (1956). An Inductive Inference Machine (PDF). Dartmouth Summer Research Conference on Artificial Intelligence – via std.com, pdf scanned copy of the original. {{cite conference}}: Invalid |ref=harv (help) Later published as
Solomonoff, Ray (1957). "An Inductive Inference Machine". IRE Convention Record. Vol. Section on Information Theory, part 2. pp. 56–62.
Tao, Jianhua; Tan, Tieniu (2005). Affective Computing and Intelligent Interaction. Affective Computing: A Review. Vol. LNCS 3784. Springer. pp. 981–995. doi:10.1007/11573548. {{cite conference}}: Invalid |ref=harv (help); Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
Tecuci, Gheorghe (March–April 2012). "Artificial Intelligence". Wiley Interdisciplinary Reviews: Computational Statistics. 4 (2). Wiley: 168–180. doi:10.1002/wics.200. {{cite journal}}: Invalid |ref=harv (help)
Thro, Ellen (1993). Robotics: The Marriage of Computers and Machines. New York: Facts on File. ISBN 978-0-8160-2628-9. {{cite book}}: Invalid |ref=harv (help)
Turing, Alan (October 1950). "Computing Machinery and Intelligence". Mind. 59 (236): 433–460. doi:10.1093/mind/LIX.236.433. ISSN 1460-2113. JSTOR 2251299. S2CID 14636783.

.

van der Walt, Christiaan; Bernard, Etienne (2006). "Data characteristics that determine classifier performance" (PDF). Archived from the original (PDF) on 25 March 2009. Retrieved 5 August 2009. {{cite web}}: Invalid |ref=harv (help); Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
Vinge, Vernor (1993). "The Coming Technological Singularity: How to Survive in the Post-Human Era". {{cite web}}: Invalid |ref=harv (help)
Wason, P. C.; Shapiro, D. (1966). "Reasoning". In Foss, B. M. (ed.). New horizons in psychology. Harmondsworth: Penguin. {{cite book}}: Invalid |ref=harv (help)
Weizenbaum, Joseph (1976). Computer Power and Human Reason. San Francisco: W.H. Freeman & Company. ISBN 0-7167-0464-1. {{cite book}}: Invalid |ref=harv (help)
Weng, J.; McClelland; Pentland, A.; Sporns, O.; Stockman, I.; Sur, M.; Thelen, E. (2001). "Autonomous mental development by robots and animals" (PDF). Science. 291: 599–600. doi:10.1126/science.291.5504.599 – via msu.edu. {{cite journal}}: Invalid |ref=harv (help)
"Applications of AI". www-formal.stanford.edu. Retrieved 25 September 2016. {{cite web}}: Invalid |ref=harv (help)

External links

What Is AI? – An introduction to artificial intelligence by John McCarthy—a co-founder of the field, and the person who coined the term.
The Handbook of Artificial Intelligence Volume Ⅰ by Avron Barr and Edward A. Feigenbaum (Stanford University)
"Artificial Intelligence". Internet Encyclopedia of Philosophy.
Thomason, Richmond. "Logic and Artificial Intelligence". In Zalta, Edward N. (ed.). Stanford Encyclopedia of Philosophy.
Template:Dmoz
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.
List of AI Conferences – A list of 225 AI conferences taking place all over the world.

[Definition_of_AI-1] Definition of AI as the study of intelligent agents:
Poole, Mackworth & Goebel 1998, 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.

Russell & Norvig (2003) (who prefer the term "rational agent") and write "The whole-agent view is now widely accepted in the field" (Russell & Norvig 2003, p. 55).

Nilsson 1998

Legg & Hutter 2007.

[2] Poole, Mackworth & Goebel 1998, 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.

[3] Russell & Norvig (2003) (who prefer the term "rational agent") and write "The whole-agent view is now widely accepted in the field" (Russell & Norvig 2003, p. 55).

[4] Nilsson 1998

[5] Legg & Hutter 2007.

[FOOTNOTERussellNorvig20092-2] Russell & Norvig 2009, p. 2.

[3] Hofstadter (1980, p. 601)

[4] Schank, Roger C. (1991). "Where's the AI". AI magazine. Vol. 12, no. 4. p. 38.

[FOOTNOTERussellNorvig2009-5] Russell & Norvig 2009.

[bbc-alphago-6] "AlphaGo – Google DeepMind". Archived from the original on 10 March 2016. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)

[Optimism_of_early_AI-7] Optimism of early AI:
Herbert Simon quote: Simon 1965, p. 96 quoted in Crevier 1993, p. 109.

Marvin Minsky quote: Minsky 1967, p. 2 quoted in Crevier 1993, p. 109.

[12] Herbert Simon quote: Simon 1965, p. 96 quoted in Crevier 1993, p. 109.

[13] Marvin Minsky quote: Minsky 1967, p. 2 quoted in Crevier 1993, p. 109.

[AI_in_the_80s-8] Boom of the 1980s: rise of expert systems, Fifth Generation Project, Alvey, MCC, SCI:
McCorduck 2004, pp. 426–441

Crevier 1993, pp. 161–162, 197–203, 211, 240

Russell & Norvig 2003, p. 24

NRC 1999, pp. 210–211

[15] McCorduck 2004, pp. 426–441

[16] Crevier 1993, pp. 161–162, 197–203, 211, 240

[17] Russell & Norvig 2003, p. 24

[18] NRC 1999, pp. 210–211

[First_AI_winter-9] First AI Winter, Mansfield Amendment, Lighthill report
Crevier 1993, pp. 115–117

Russell & Norvig 2003, p. 22

NRC 1999, pp. 212–213

Howe 1994

[20] Crevier 1993, pp. 115–117

[21] Russell & Norvig 2003, p. 22

[22] NRC 1999, pp. 212–213

[23] Howe 1994

[Second_AI_winter-10] Second AI winter:
McCorduck 2004, pp. 430–435

Crevier 1993, pp. 209–210

NRC 1999, pp. 214–216

[25] McCorduck 2004, pp. 430–435

[26] Crevier 1993, pp. 209–210

[27] NRC 1999, pp. 214–216

[AI_in_2000s-11] AI becomes hugely successful in the early 21st century
Clark 2015 harvnb error: multiple targets (2×): CITEREFClark2015 (help)

[29] Clark 2015 harvnb error: multiple targets (2×): CITEREFClark2015 (help)

[Fragmentation_of_AI-12] Pamela McCorduck (2004, pp. 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."

[Problems_of_AI-13] This list of intelligent traits is based on the topics covered by the major AI textbooks, including:
Russell & Norvig 2003

Luger & Stubblefield 2004

Poole, Mackworth & Goebel 1998

Nilsson 1998

[32] Russell & Norvig 2003

[33] Luger & Stubblefield 2004

[34] Poole, Mackworth & Goebel 1998

[35] Nilsson 1998

[Biological_intelligence_vs._intelligence_in_general-14] Biological intelligence vs. intelligence in general:
Russell & Norvig 2003, pp. 2–3, who make the analogy with aeronautical engineering.

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

Kolata 1982, a paper in Science, which describes McCarthy's indifference to biological models. Kolata quotes McCarthy as writing: "This is AI, so we don't care if it's psychologically real""Archived copy". Archived from the original on 7 July 2016. Retrieved 16 February 2016. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)CS1 maint: archived copy as title (link). McCarthy recently reiterated his position at the AI@50 conference where he said "Artificial intelligence is not, by definition, simulation of human intelligence" (Maker 2006).

[37] Russell & Norvig 2003, pp. 2–3, who make the analogy with aeronautical engineering.

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

[39] Kolata 1982, a paper in Science, which describes McCarthy's indifference to biological models. Kolata quotes McCarthy as writing: "This is AI, so we don't care if it's psychologically real""Archived copy". Archived from the original on 7 July 2016. Retrieved 16 February 2016. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)CS1 maint: archived copy as title (link). McCarthy recently reiterated his position at the AI@50 conference where he said "Artificial intelligence is not, by definition, simulation of human intelligence" (Maker 2006).

[Neats_vs._scruffies-15] Neats vs. scruffies:
McCorduck 2004, pp. 421–424, 486–489

Crevier 1993, pp. 168

Nilsson 1983, pp. 10–11

[41] McCorduck 2004, pp. 421–424, 486–489

[42] Crevier 1993, pp. 168

[43] Nilsson 1983, pp. 10–11

[Symbolic_vs._sub-symbolic-16] Symbolic vs. sub-symbolic AI:
Nilsson (1998, p. 7), who uses the term "sub-symbolic".

[45] Nilsson (1998, p. 7), who uses the term "sub-symbolic".

[General_intelligence-17] General intelligence (strong AI) is discussed in popular introductions to AI:
Kurzweil 1999 and Kurzweil 2005

[47] Kurzweil 1999 and Kurzweil 2005

[18] See the Dartmouth proposal, under Philosophy, below.

[McCorduck's_thesis-19] 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." (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." (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." (McCorduck 2004, p. 3) She traces the desire back to its Hellenistic roots and calls it the urge to "forge the Gods." (McCorduck 2004, pp. 340–400)

[20] "Stephen Hawking believes AI could be mankind's last accomplishment". BetaNews. 21 October 2016. Archived from the original on 28 August 2017. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)

[guardian_jobs_debate-21] Ford, Martin; Colvin, Geoff (6 September 2015). "Will robots create more jobs than they destroy?". The Guardian. Retrieved 13 January 2018.

[AI_widely_used-22] AI applications widely used behind the scenes:
Russell & Norvig 2003, p. 28

Kurzweil 2005, p. 265

NRC 1999, pp. 216–222

[53] Russell & Norvig 2003, p. 28

[54] Kurzweil 2005, p. 265

[55] NRC 1999, pp. 216–222

[AI_in_myth-23] AI in myth:
McCorduck 2004, pp. 4–5

Russell & Norvig 2003, p. 939

[57] McCorduck 2004, pp. 4–5

[58] Russell & Norvig 2003, p. 939

[FOOTNOTERussellNorvig200916-24] Russell & Norvig 2009, p. 16.

[AI_in_early_science_fiction-25] AI in early science fiction.
McCorduck 2004, pp. 17–25

[61] McCorduck 2004, pp. 17–25

[Formal_reasoning-26] Formal reasoning:
Berlinski, David (2000). The Advent of the Algorithm. Harcourt Books. ISBN 0-15-601391-6. OCLC 46890682.

[63] Berlinski, David (2000). The Advent of the Algorithm. Harcourt Books. ISBN 0-15-601391-6. OCLC 46890682.

[AI's_immediate_precursors-27] AI's immediate precursors:
McCorduck 2004, pp. 51–107

Crevier 1993, pp. 27–32

Russell & Norvig 2003, pp. 15, 940

Moravec 1988, p. 3

[65] McCorduck 2004, pp. 51–107

[66] Crevier 1993, pp. 27–32

[67] Russell & Norvig 2003, pp. 15, 940

[68] Moravec 1988, p. 3

[Dartmouth_conference-28] Dartmouth conference:
McCorduck 2004, pp. 111–136

Crevier 1993, pp. 47–49, who writes "the conference is generally recognized as the official birthdate of the new science."

Russell & Norvig 2003, p. 17, who call the conference "the birth of artificial intelligence."

NRC 1999, pp. 200–201

[70] McCorduck 2004, pp. 111–136

[71] Crevier 1993, pp. 47–49, who writes "the conference is generally recognized as the official birthdate of the new science."

[72] Russell & Norvig 2003, p. 17, who call the conference "the birth of artificial intelligence."

[73] NRC 1999, pp. 200–201

[Hegemony_of_the_Dartmouth_conference_attendees-29] Hegemony of the Dartmouth conference attendees:
Russell & Norvig 2003, p. 17, who write "for the next 20 years the field would be dominated by these people and their students."

McCorduck 2004, pp. 129–130

[75] Russell & Norvig 2003, p. 17, who write "for the next 20 years the field would be dominated by these people and their students."

[76] McCorduck 2004, pp. 129–130

[FOOTNOTERussellNorvig200318-30] Russell & Norvig 2003, p. 18.

[31] Schaeffer J. (2009) Didn’t Samuel Solve That Game?. In: One Jump Ahead. Springer, Boston, MA

[32] Samuel, A. L. (July 1959). "Some Studies in Machine Learning Using the Game of Checkers". IBM Journal of Research and Development. 3 (3): 210–229. doi:10.1147/rd.33.0210.

[Golden_years_of_AI-33] "Golden years" of AI (successful symbolic reasoning programs 1956–1973):
McCorduck 2004, pp. 243–252

Crevier 1993, pp. 52–107

Moravec 1988, p. 9

Russell & Norvig 2003, pp. 18–21
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.

[81] McCorduck 2004, pp. 243–252

[82] Crevier 1993, pp. 52–107

[83] Moravec 1988, p. 9

[84] Russell & Norvig 2003, pp. 18–21

[AI_funding_in_the_60s-34] DARPA pours money into undirected pure research into AI during the 1960s:
McCorduck 2004, pp. 131

Crevier 1993, pp. 51, 64–65

NRC 1999, pp. 204–205

[86] McCorduck 2004, pp. 131

[87] Crevier 1993, pp. 51, 64–65

[88] NRC 1999, pp. 204–205

[AI_in_England-35] AI in England:
Howe 1994

[90] Howe 1994

[FOOTNOTELighthill1973-36] Lighthill 1973.

[Expert_systems-37] Expert systems:
ACM 1998, I.2.1

Russell & Norvig 2003, pp. 22–24

Luger & Stubblefield 2004, pp. 227–331

Nilsson 1998, chpt. 17.4

McCorduck 2004, pp. 327–335, 434–435

Crevier 1993, pp. 145–62, 197–203

[93] ACM 1998, I.2.1

[94] Russell & Norvig 2003, pp. 22–24

[95] Luger & Stubblefield 2004, pp. 227–331

[96] Nilsson 1998, chpt. 17.4

[97] McCorduck 2004, pp. 327–335, 434–435

[98] Crevier 1993, pp. 145–62, 197–203

[Formal_methods_in_AI-38] Formal methods are now preferred ("Victory of the neats"):
Russell & Norvig 2003, pp. 25–26

McCorduck 2004, pp. 486–487

[100] Russell & Norvig 2003, pp. 25–26

[101] McCorduck 2004, pp. 486–487

[FOOTNOTEMcCorduck2004480–483-39] McCorduck 2004, pp. 480–483.

[FOOTNOTEMarkoff2011-40] Markoff 2011. sfn error: multiple targets (2×): CITEREFMarkoff2011 (help)

[41] Administrator. "Kinect's AI breakthrough explained". i-programmer.info. Archived from the original on 1 February 2016. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)

[42] Rowinski, Dan (15 January 2013). "Virtual Personal Assistants & The Future Of Your Smartphone [Infographic]". ReadWrite. Archived from the original on 22 December 2015. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)

[43] "Artificial intelligence: Google's AlphaGo beats Go master Lee Se-dol". BBC News. 12 March 2016. Archived from the original on 26 August 2016. Retrieved 1 October 2016. {{cite news}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)

[44] "After Win in China, AlphaGo's Designers Explore New AI". 27 May 2017. Archived from the original on 2 June 2017. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)

[45] "World's Go Player Ratings". May 2017. Archived from the original on 1 April 2017. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)

[46] "柯洁迎19岁生日雄踞人类世界排名第一已两年" (in Chinese). May 2017. Archived from the original on 11 August 2017. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)

[:0-47] Clark, Jack (8 December 2015). "Why 2015 Was a Breakthrough Year in Artificial Intelligence". Bloomberg News. Archived from the original on 23 November 2016. Retrieved 23 November 2016. After a half-decade of quiet breakthroughs in artificial intelligence, 2015 has been a landmark year. Computers are smarter and learning faster than ever. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)

[Reasoning-48] Problem solving, puzzle solving, game playing and deduction:
Russell & Norvig 2003, chpt. 3–9,

Poole, Mackworth & Goebel 1998, chpt. 2,3,7,9,

Luger & Stubblefield 2004, chpt. 3,4,6,8,

Nilsson 1998, chpt. 7–12

[112] Russell & Norvig 2003, chpt. 3–9,

[113] Poole, Mackworth & Goebel 1998, chpt. 2,3,7,9,

[114] Luger & Stubblefield 2004, chpt. 3,4,6,8,

[115] Nilsson 1998, chpt. 7–12

[Uncertain_reasoning-49] Uncertain reasoning:
Russell & Norvig 2003, pp. 452–644,

Poole, Mackworth & Goebel 1998, pp. 345–395,

Luger & Stubblefield 2004, pp. 333–381,

Nilsson 1998, chpt. 19

[117] Russell & Norvig 2003, pp. 452–644,

[118] Poole, Mackworth & Goebel 1998, pp. 345–395,

[119] Luger & Stubblefield 2004, pp. 333–381,

[120] Nilsson 1998, chpt. 19

[Intractability-50] Intractability and efficiency and the combinatorial explosion:
Russell & Norvig 2003, pp. 9, 21–22

[122] Russell & Norvig 2003, pp. 9, 21–22

[Psychological_evidence_of_sub-symbolic_reasoning-51] Psychological evidence of sub-symbolic reasoning:
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)

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

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)

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

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

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

[Knowledge_representation-52] Knowledge representation:
ACM 1998, I.2.4,

Russell & Norvig 2003, pp. 320–363,

Poole, Mackworth & Goebel 1998, pp. 23–46, 69–81, 169–196, 235–277, 281–298, 319–345,

Luger & Stubblefield 2004, pp. 227–243,

Nilsson 1998, chpt. 18

[128] ACM 1998, I.2.4,

[129] Russell & Norvig 2003, pp. 320–363,

[130] Poole, Mackworth & Goebel 1998, pp. 23–46, 69–81, 169–196, 235–277, 281–298, 319–345,

[131] Luger & Stubblefield 2004, pp. 227–243,

[132] Nilsson 1998, chpt. 18

[Knowledge_engineering-53] Knowledge engineering:
Russell & Norvig 2003, pp. 260–266,

Poole, Mackworth & Goebel 1998, pp. 199–233,

Nilsson 1998, chpt. ≈17.1–17.4

[134] Russell & Norvig 2003, pp. 260–266,

[135] Poole, Mackworth & Goebel 1998, pp. 199–233,

[136] Nilsson 1998, chpt. ≈17.1–17.4

[Representing_categories_and_relations-54] Representing categories and relations: Semantic networks, description logics, inheritance (including frames and scripts):
Russell & Norvig 2003, pp. 349–354,

Poole, Mackworth & Goebel 1998, pp. 174–177,

Luger & Stubblefield 2004, pp. 248–258,

Nilsson 1998, chpt. 18.3

[138] Russell & Norvig 2003, pp. 349–354,

[139] Poole, Mackworth & Goebel 1998, pp. 174–177,

[140] Luger & Stubblefield 2004, pp. 248–258,

[141] Nilsson 1998, chpt. 18.3

[Representing_time-55] Representing events and time:Situation calculus, event calculus, fluent calculus (including solving the frame problem):
Russell & Norvig 2003, pp. 328–341,

Poole, Mackworth & Goebel 1998, pp. 281–298,

Nilsson 1998, chpt. 18.2

[143] Russell & Norvig 2003, pp. 328–341,

[144] Poole, Mackworth & Goebel 1998, pp. 281–298,

[145] Nilsson 1998, chpt. 18.2

[Representing_causation-56] Causal calculus:
Poole, Mackworth & Goebel 1998, pp. 335–337

[147] Poole, Mackworth & Goebel 1998, pp. 335–337

[Representing_knowledge_about_knowledge-57] Representing knowledge about knowledge: Belief calculus, modal logics:
Russell & Norvig 2003, pp. 341–344,

Poole, Mackworth & Goebel 1998, pp. 275–277

[149] Russell & Norvig 2003, pp. 341–344,

[150] Poole, Mackworth & Goebel 1998, pp. 275–277

[58] Sikos, Leslie F. (June 2017). Description Logics in Multimedia Reasoning. Cham: Springer. doi:10.1007/978-3-319-54066-5. ISBN 978-3-319-54066-5. Archived from the original on 29 August 2017. {{cite book}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)

[Ontology-59] Ontology:
Russell & Norvig 2003, pp. 320–328

[153] Russell & Norvig 2003, pp. 320–328

[60] Bertini, M; Del Bimbo, A; Torniai, C (2006). "Automatic annotation and semantic retrieval of video sequences using multimedia ontologies". MM ‘06 Proceedings of the 14th ACM international conference on Multimedia. 14th ACM international conference on Multimedia. Santa Barbara: ACM. pp. 679–682.

[Qualification_problem-61] Qualification problem:
McCarthy & Hayes 1969

Russell & Norvig 2003^{[page needed]}
While McCarthy was primarily concerned with issues in the logical representation of actions, 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.

[156] McCarthy & Hayes 1969

[157] Russell & Norvig 2003^{[page needed]}

[Default_reasoning_and_non-monotonic_logic-62] 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"):
Russell & Norvig 2003, pp. 354–360,

Poole, Mackworth & Goebel 1998, pp. 248–256, 323–335,

Luger & Stubblefield 2004, pp. 335–363,

Nilsson 1998, ~18.3.3

[159] Russell & Norvig 2003, pp. 354–360,

[160] Poole, Mackworth & Goebel 1998, pp. 248–256, 323–335,

[161] Luger & Stubblefield 2004, pp. 335–363,

[162] Nilsson 1998, ~18.3.3

[Breadth_of_commonsense_knowledge-63] Breadth of commonsense knowledge:
Russell & Norvig 2003, p. 21,

Crevier 1993, pp. 113–114,

Moravec 1988, p. 13,

Lenat & Guha 1989 (Introduction)

[164] Russell & Norvig 2003, p. 21,

[165] Crevier 1993, pp. 113–114,

[166] Moravec 1988, p. 13,

[167] Lenat & Guha 1989 (Introduction)

[FOOTNOTEDreyfusDreyfus1986-64] Dreyfus & Dreyfus 1986.

[FOOTNOTEGladwell2005-65] Gladwell 2005.

[Intuition-66] Expert knowledge as embodied intuition:
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)

Gladwell 2005 (Gladwell's Blink is a popular introduction to sub-symbolic reasoning and knowledge.)

Hawkins & Blakeslee 2005 (Hawkins argues that sub-symbolic knowledge should be the primary focus of AI research.)

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

[172] Gladwell 2005 (Gladwell's Blink is a popular introduction to sub-symbolic reasoning and knowledge.)

[173] Hawkins & Blakeslee 2005 (Hawkins argues that sub-symbolic knowledge should be the primary focus of AI research.)

[Planning-67] Planning:
ACM 1998, ~I.2.8,

Russell & Norvig 2003, pp. 375–459,

Poole, Mackworth & Goebel 1998, pp. 281–316,

Luger & Stubblefield 2004, pp. 314–329,

Nilsson 1998, chpt. 10.1–2, 22

[175] ACM 1998, ~I.2.8,

[176] Russell & Norvig 2003, pp. 375–459,

[177] Poole, Mackworth & Goebel 1998, pp. 281–316,

[178] Luger & Stubblefield 2004, pp. 314–329,

[179] Nilsson 1998, chpt. 10.1–2, 22

[Information_value_theory-68] Information value theory:
Russell & Norvig 2003, pp. 600–604

[181] Russell & Norvig 2003, pp. 600–604

[Classical_planning-69] Classical planning:
Russell & Norvig 2003, pp. 375–430,

Poole, Mackworth & Goebel 1998, pp. 281–315,

Luger & Stubblefield 2004, pp. 314–329,

Nilsson 1998, chpt. 10.1–2, 22

[183] Russell & Norvig 2003, pp. 375–430,

[184] Poole, Mackworth & Goebel 1998, pp. 281–315,

[185] Luger & Stubblefield 2004, pp. 314–329,

[186] Nilsson 1998, chpt. 10.1–2, 22

[Non-deterministic_planning-70] Planning and acting in non-deterministic domains: conditional planning, execution monitoring, replanning and continuous planning:
Russell & Norvig 2003, pp. 430–449

[188] Russell & Norvig 2003, pp. 430–449

[Multi-agent_planning-71] Multi-agent planning and emergent behavior:
Russell & Norvig 2003, pp. 449–455

[190] Russell & Norvig 2003, pp. 449–455

[72] Alan Turing discussed the centrality of learning as early as 1950, in his classic paper "Computing Machinery and Intelligence".(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".(Solomonoff 1956)

[73] This is a form of 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."

[Machine_learning-74] Learning:
ACM 1998, I.2.6,

Russell & Norvig 2003, pp. 649–788,

Poole, Mackworth & Goebel 1998, pp. 397–438,

Luger & Stubblefield 2004, pp. 385–542,

Nilsson 1998, chpt. 3.3, 10.3, 17.5, 20

[194] ACM 1998, I.2.6,

[195] Russell & Norvig 2003, pp. 649–788,

[196] Poole, Mackworth & Goebel 1998, pp. 397–438,

[197] Luger & Stubblefield 2004, pp. 385–542,

[198] Nilsson 1998, chpt. 3.3, 10.3, 17.5, 20

[Reinforcement_learning-75] Reinforcement learning:
Russell & Norvig 2003, pp. 763–788

Luger & Stubblefield 2004, pp. 442–449

[200] Russell & Norvig 2003, pp. 763–788

[201] Luger & Stubblefield 2004, pp. 442–449

[FOOTNOTEWengMcClellandPentlandSporns2001-76] Weng et al. 2001.

[FOOTNOTELungarellaMettaPfeiferSandini2003-77] Lungarella et al. 2003.

[FOOTNOTEAsadaHosodaKuniyoshiIshiguro2009-78] Asada et al. 2009.

[FOOTNOTEOudeyer2010-79] Oudeyer 2010.

[Natural_language_processing-80] Natural language processing:
ACM 1998, I.2.7

Russell & Norvig 2003, pp. 790–831

Poole, Mackworth & Goebel 1998, pp. 91–104

Luger & Stubblefield 2004, pp. 591–632

[207] ACM 1998, I.2.7

[208] Russell & Norvig 2003, pp. 790–831

[209] Poole, Mackworth & Goebel 1998, pp. 91–104

[210] Luger & Stubblefield 2004, pp. 591–632

[81] "Versatile question answering systems: seeing in synthesis" Archived 1 February 2016 at the Wayback Machine, Mittal et al., IJIIDS, 5(2), 119–142, 2011

[Applications_of_natural_language_processing-82] Applications of natural language processing, including information retrieval (i.e. text mining) and machine translation:
Russell & Norvig 2003, pp. 840–857,

Luger & Stubblefield 2004, pp. 623–630

[213] Russell & Norvig 2003, pp. 840–857,

[214] Luger & Stubblefield 2004, pp. 623–630

[Machine_perception-83] Machine perception:
Russell & Norvig 2003, pp. 537–581, 863–898

Nilsson 1998, ~chpt. 6

[216] Russell & Norvig 2003, pp. 537–581, 863–898

[217] Nilsson 1998, ~chpt. 6

[Computer_vision-84] Computer vision:
ACM 1998, I.2.10

Russell & Norvig 2003, pp. 863–898

Nilsson 1998, chpt. 6

[219] ACM 1998, I.2.10

[220] Russell & Norvig 2003, pp. 863–898

[221] Nilsson 1998, chpt. 6

[Speech_recognition-85] Speech recognition:
ACM 1998, ~I.2.7

Russell & Norvig 2003, pp. 568–578

[223] ACM 1998, ~I.2.7

[224] Russell & Norvig 2003, pp. 568–578

[Object_recognition-86] Object recognition:
Russell & Norvig 2003, pp. 885–892

[226] Russell & Norvig 2003, pp. 885–892

[Robotics-87] Robotics:
ACM 1998, I.2.9,

Russell & Norvig 2003, pp. 901–942,

Poole, Mackworth & Goebel 1998, pp. 443–460

[228] ACM 1998, I.2.9,

[229] Russell & Norvig 2003, pp. 901–942,

[230] Poole, Mackworth & Goebel 1998, pp. 443–460

[Configuration_space-88] Moving and configuration space:
Russell & Norvig 2003, pp. 916–932

[232] Russell & Norvig 2003, pp. 916–932

[FOOTNOTETecuci2012-89] Tecuci 2012.

[Robotic_mapping-90] Robotic mapping (localization, etc):
Russell & Norvig 2003, pp. 908–915

[235] Russell & Norvig 2003, pp. 908–915

[FOOTNOTE''Kismet''-91] Kismet.

[FOOTNOTEThro1993-92] Thro 1993.

[FOOTNOTEEdelson1991-93] Edelson 1991.

[FOOTNOTETaoTan2005-94] Tao & Tan 2005.

[FOOTNOTEJames1884-95] James 1884.

[FOOTNOTEPicard1995-96] Picard 1995.

[97] Kleine-Cosack 2006: "The introduction of emotion to computer science was done by Pickard (sic) who created the field of affective computing."

[98] Diamond 2003: "Rosalind Picard, a genial MIT professor, is the field's godmother; her 1997 book, Affective Computing, triggered an explosion of interest in the emotional side of computers and their users."

[Emotion_and_affective_computing-99] Emotion and affective computing:
Minsky 2006

[245] Minsky 2006

[Roberts-100] Roberts, Jacob (2016). "Thinking Machines: The Search for Artificial Intelligence". Distillations. 2 (2): 14–23. Archived from the original on 17 February 2017. Retrieved 17 February 2017. {{cite journal}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)

[Artificial_consciousness-101] Gerald Edelman, Igor Aleksander and others have argued that artificial consciousness is required for strong AI. (Aleksander 1995; Edelman 2007)

[Brain_simulation-102] Artificial brain arguments: AI requires a simulation of the operation of the human brain
Russell & Norvig 2003, p. 957

Crevier 1993, pp. 271 and 279
A few of the people who make some form of the argument:
Moravec 1988

Kurzweil 2005, p. 262

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.

[249] Russell & Norvig 2003, p. 957

[250] Crevier 1993, pp. 271 and 279

[251] Moravec 1988

[252] Kurzweil 2005, p. 262

[253] Hawkins & Blakeslee 2005

[103] Nils Nilsson writes: "Simply put, there is wide disagreement in the field about what AI is all about" (Nilsson 1983, p. 10).

[FOOTNOTEHaugeland1985255-104] Haugeland 1985, p. 255.

[FOOTNOTELaw1994-105] Law 1994.

[FOOTNOTEBach2008-106] Bach 2008.

[:2-107] Shapiro, Stuart C. (1992), "Artificial Intelligence", in Stuart C. Shapiro (ed.), Encyclopedia of Artificial Intelligence, 2nd edition (New York: John Wiley & Sons): 54–57. 4 December 2016.

[GOFAI-108] Haugeland 1985, pp. 112–117

[109] The most dramatic case of sub-symbolic AI being pushed into the background was the devastating critique of perceptrons by Marvin Minsky and Seymour Papert in 1969. See History of AI, AI winter, or Frank Rosenblatt.

[AI_at_CMU_in_the_60s-110] Cognitive simulation, Newell and Simon, AI at CMU (then called Carnegie Tech):
McCorduck 2004, pp. 139–179, 245–250, 322–323 (EPAM)

Crevier 1993, pp. 145–149

[262] McCorduck 2004, pp. 139–179, 245–250, 322–323 (EPAM)

[263] Crevier 1993, pp. 145–149

[Soar-111] Soar (history):
McCorduck 2004, pp. 450–451

Crevier 1993, pp. 258–263

[265] McCorduck 2004, pp. 450–451

[266] Crevier 1993, pp. 258–263

[AI_at_Stanford_in_the_60s-112] McCarthy and AI research at SAIL and SRI International:
McCorduck 2004, pp. 251–259

Crevier 1993

[268] McCorduck 2004, pp. 251–259

[269] Crevier 1993

[AI_at_Edinburgh_and_France_in_the_60s-113] AI research at Edinburgh and in France, birth of Prolog:
Crevier 1993, pp. 193–196

Howe 1994

[271] Crevier 1993, pp. 193–196

[272] Howe 1994

[AI_at_MIT_in_the_60s-114] AI at MIT under Marvin Minsky in the 1960s :
McCorduck 2004, pp. 259–305

Crevier 1993, pp. 83–102, 163–176

Russell & Norvig 2003, p. 19

[274] McCorduck 2004, pp. 259–305

[275] Crevier 1993, pp. 83–102, 163–176

[276] Russell & Norvig 2003, p. 19

[Cyc-115] Cyc:
McCorduck 2004, p. 489, who calls it "a determinedly scruffy enterprise"

Crevier 1993, pp. 239–243

Russell & Norvig 2003, p. 363−365

Lenat & Guha 1989

[278] McCorduck 2004, p. 489, who calls it "a determinedly scruffy enterprise"

[279] Crevier 1993, pp. 239–243

[280] Russell & Norvig 2003, p. 363−365

[281] Lenat & Guha 1989

[Knowledge_revolution-116] Knowledge revolution:
McCorduck 2004, pp. 266–276, 298–300, 314, 421

Russell & Norvig 2003, pp. 22–23

[283] McCorduck 2004, pp. 266–276, 298–300, 314, 421

[284] Russell & Norvig 2003, pp. 22–23

[Embodied_AI-117] Embodied approaches to AI:
McCorduck 2004, pp. 454–462

Brooks 1990

Moravec 1988

[286] McCorduck 2004, pp. 454–462

[287] Brooks 1990

[288] Moravec 1988

[Revival_of_connectionism-118] Revival of connectionism:
Crevier 1993, pp. 214–215

Russell & Norvig 2003, p. 25

[290] Crevier 1993, pp. 214–215

[291] Russell & Norvig 2003, p. 25

[Computational_intelligence-119] Computational intelligence
IEEE Computational Intelligence Society Archived 9 May 2008 at the Wayback Machine

[293] IEEE Computational Intelligence Society Archived 9 May 2008 at the Wayback Machine

[FOOTNOTEHutter2012-120] Hutter 2012.

[FOOTNOTELangley2011-121] Langley 2011.

[FOOTNOTEKatz2012-122] Katz 2012.

[FOOTNOTENorvig2012-123] Norvig 2012.

[Intelligent_agents-124] The intelligent agent paradigm:
Russell & Norvig 2003, pp. 27, 32–58, 968–972

Poole, Mackworth & Goebel 1998, pp. 7–21

Luger & Stubblefield 2004, pp. 235–240

Hutter 2005, pp. 125–126
The definition used in this article, in terms of goals, actions, perception and environment, is due to Russell & Norvig (2003). Other definitions also include knowledge and learning as additional criteria.

[299] Russell & Norvig 2003, pp. 27, 32–58, 968–972

[300] Poole, Mackworth & Goebel 1998, pp. 7–21

[301] Luger & Stubblefield 2004, pp. 235–240

[302] Hutter 2005, pp. 125–126

[Agent_architectures-125] Agent architectures, hybrid intelligent systems:
Russell & Norvig (2003, pp. 27, 932, 970–972)

Nilsson (1998, chpt. 25)

[304] Russell & Norvig (2003, pp. 27, 932, 970–972)

[305] Nilsson (1998, chpt. 25)

[Hierarchical_control_system-126] Hierarchical control system:
Albus 2002

[307] Albus 2002

[Search-127] Search algorithms:
Russell & Norvig 2003, pp. 59–189

Poole, Mackworth & Goebel 1998, pp. 113–163

Luger & Stubblefield 2004, pp. 79–164, 193–219

Nilsson 1998, chpt. 7–12

[309] Russell & Norvig 2003, pp. 59–189

[310] Poole, Mackworth & Goebel 1998, pp. 113–163

[311] Luger & Stubblefield 2004, pp. 79–164, 193–219

[312] Nilsson 1998, chpt. 7–12

[Logic_as_search-128] Forward chaining, backward chaining, Horn clauses, and logical deduction as search:
Russell & Norvig 2003, pp. 217–225, 280–294

Poole, Mackworth & Goebel 1998, pp. ~46–52

Luger & Stubblefield 2004, pp. 62–73

Nilsson 1998, chpt. 4.2, 7.2

[314] Russell & Norvig 2003, pp. 217–225, 280–294

[315] Poole, Mackworth & Goebel 1998, pp. ~46–52

[316] Luger & Stubblefield 2004, pp. 62–73

[317] Nilsson 1998, chpt. 4.2, 7.2

[Planning_as_search-129] State space search and planning:
Russell & Norvig 2003, pp. 382–387

Poole, Mackworth & Goebel 1998, pp. 298–305

Nilsson 1998, chpt. 10.1–2

[319] Russell & Norvig 2003, pp. 382–387

[320] Poole, Mackworth & Goebel 1998, pp. 298–305

[321] Nilsson 1998, chpt. 10.1–2

[Uninformed_search-130] Uninformed searches (breadth first search, depth first search and general state space search):
Russell & Norvig 2003, pp. 59–93

Poole, Mackworth & Goebel 1998, pp. 113–132

Luger & Stubblefield 2004, pp. 79–121

Nilsson 1998, chpt. 8

[323] Russell & Norvig 2003, pp. 59–93

[324] Poole, Mackworth & Goebel 1998, pp. 113–132

[325] Luger & Stubblefield 2004, pp. 79–121

[326] Nilsson 1998, chpt. 8

[Informed_search-131] Heuristic or informed searches (e.g., greedy best first and A*):
Russell & Norvig 2003, pp. 94–109,

Poole, Mackworth & Goebel 1998, pp. pp. 132–147,

Luger & Stubblefield 2004, pp. 133–150,

Nilsson 1998, chpt. 9,

Poole & Mackworth 2017, Section 3.6

[328] Russell & Norvig 2003, pp. 94–109,

[329] Poole, Mackworth & Goebel 1998, pp. pp. 132–147,

[330] Luger & Stubblefield 2004, pp. 133–150,

[331] Nilsson 1998, chpt. 9,

[332] Poole & Mackworth 2017, Section 3.6

[Optimization_search-132] Optimization searches:
Russell & Norvig 2003, pp. 110–116, 120–129

Poole, Mackworth & Goebel 1998, pp. 56–163

Luger & Stubblefield 2004, pp. 127–133

[334] Russell & Norvig 2003, pp. 110–116, 120–129

[335] Poole, Mackworth & Goebel 1998, pp. 56–163

[336] Luger & Stubblefield 2004, pp. 127–133

[Society_based_learning-133] Artificial life and society based learning:
Luger & Stubblefield 2004, pp. 530–541

[338] Luger & Stubblefield 2004, pp. 530–541

[Genetic_programming-134] Genetic programming and genetic algorithms:
Luger & Stubblefield 2004, pp. 509–530,

Nilsson 1998, chpt. 4.2,

Holland 1975,

Koza 1992,

Poli, Langdon & McPhee 2008.

[340] Luger & Stubblefield 2004, pp. 509–530,

[341] Nilsson 1998, chpt. 4.2,

[342] Holland 1975,

[343] Koza 1992,

[344] Poli, Langdon & McPhee 2008.

[Logic-135] Logic:
ACM 1998, ~I.2.3,

Russell & Norvig 2003, pp. 194–310,

Luger & Stubblefield 2004, pp. 35–77,

Nilsson 1998, chpt. 13–16

[346] ACM 1998, ~I.2.3,

[347] Russell & Norvig 2003, pp. 194–310,

[348] Luger & Stubblefield 2004, pp. 35–77,

[349] Nilsson 1998, chpt. 13–16

[Satplan-136] Satplan:
Russell & Norvig 2003, pp. 402–407,

Poole, Mackworth & Goebel 1998, pp. 300–301,

Nilsson 1998, chpt. 21

[351] Russell & Norvig 2003, pp. 402–407,

[352] Poole, Mackworth & Goebel 1998, pp. 300–301,

[353] Nilsson 1998, chpt. 21

[Symbolic_learning_techniques-137] Explanation based learning, relevance based learning, inductive logic programming, case based reasoning:
Russell & Norvig 2003, pp. 678–710,

Poole, Mackworth & Goebel 1998, pp. 414–416,

Luger & Stubblefield 2004, pp. ~422–442,

Nilsson 1998, chpt. 10.3, 17.5

[355] Russell & Norvig 2003, pp. 678–710,

[356] Poole, Mackworth & Goebel 1998, pp. 414–416,

[357] Luger & Stubblefield 2004, pp. ~422–442,

[358] Nilsson 1998, chpt. 10.3, 17.5

[Propositional_logic-138] Propositional logic:
Russell & Norvig 2003, pp. 204–233,

Luger & Stubblefield 2004, pp. 45–50

Nilsson 1998, chpt. 13

[360] Russell & Norvig 2003, pp. 204–233,

[361] Luger & Stubblefield 2004, pp. 45–50

[362] Nilsson 1998, chpt. 13

[First-order_logic-139] First-order logic and features such as equality:
ACM 1998, ~I.2.4,

Russell & Norvig 2003, pp. 240–310,

Poole, Mackworth & Goebel 1998, pp. 268–275,

Luger & Stubblefield 2004, pp. 50–62,

Nilsson 1998, chpt. 15

[364] ACM 1998, ~I.2.4,

[365] Russell & Norvig 2003, pp. 240–310,

[366] Poole, Mackworth & Goebel 1998, pp. 268–275,

[367] Luger & Stubblefield 2004, pp. 50–62,

[368] Nilsson 1998, chpt. 15

[Fuzzy_logic-140] Fuzzy logic:
Russell & Norvig 2003, pp. 526–527

[370] Russell & Norvig 2003, pp. 526–527

[141] "The Belief Calculus and Uncertain Reasoning", Yen-Teh Hsia

[Stochastic_methods_for_uncertain_reasoning-142] Stochastic methods for uncertain reasoning:
ACM 1998, ~I.2.3,

Russell & Norvig 2003, pp. 462–644,

Poole, Mackworth & Goebel 1998, pp. 345–395,

Luger & Stubblefield 2004, pp. 165–191, 333–381,

Nilsson 1998, chpt. 19

[373] ACM 1998, ~I.2.3,

[374] Russell & Norvig 2003, pp. 462–644,

[375] Poole, Mackworth & Goebel 1998, pp. 345–395,

[376] Luger & Stubblefield 2004, pp. 165–191, 333–381,

[377] Nilsson 1998, chpt. 19

[Bayesian_networks-143] Bayesian networks:
Russell & Norvig 2003, pp. 492–523,

Poole, Mackworth & Goebel 1998, pp. 361–381,

Luger & Stubblefield 2004, pp. ~182–190, ≈363–379,

Nilsson 1998, chpt. 19.3–4

[379] Russell & Norvig 2003, pp. 492–523,

[380] Poole, Mackworth & Goebel 1998, pp. 361–381,

[381] Luger & Stubblefield 2004, pp. ~182–190, ≈363–379,

[382] Nilsson 1998, chpt. 19.3–4

[Bayesian_inference-144] Bayesian inference algorithm:
Russell & Norvig 2003, pp. 504–519,

Poole, Mackworth & Goebel 1998, pp. 361–381,

Luger & Stubblefield 2004, pp. ~363–379,

Nilsson 1998, chpt. 19.4 & 7

[384] Russell & Norvig 2003, pp. 504–519,

[385] Poole, Mackworth & Goebel 1998, pp. 361–381,

[386] Luger & Stubblefield 2004, pp. ~363–379,

[387] Nilsson 1998, chpt. 19.4 & 7

[Bayesian_learning-145] Bayesian learning and the expectation-maximization algorithm:
Russell & Norvig 2003, pp. 712–724,

Poole, Mackworth & Goebel 1998, pp. 424–433,

Nilsson 1998, chpt. 20

[389] Russell & Norvig 2003, pp. 712–724,

[390] Poole, Mackworth & Goebel 1998, pp. 424–433,

[391] Nilsson 1998, chpt. 20

[Bayesian_decision_networks-146] Bayesian decision theory and Bayesian decision networks:
Russell & Norvig 2003, pp. 597–600

[393] Russell & Norvig 2003, pp. 597–600

[Stochastic_temporal_models-147] Stochastic temporal models:
Russell & Norvig 2003, pp. 537–581
Dynamic Bayesian networks:
Russell & Norvig 2003, pp. 551–557
Hidden Markov model:
(Russell & Norvig 2003, pp. 549–551)
Kalman filters:
Russell & Norvig 2003, pp. 551–557

[395] Russell & Norvig 2003, pp. 537–581

[396] Russell & Norvig 2003, pp. 551–557

[397] (Russell & Norvig 2003, pp. 549–551)

[398] Russell & Norvig 2003, pp. 551–557

[Decisions_theory_and_analysis-148] sion theory and decision analysis:
Russell & Norvig 2003, pp. 584–597,

Poole, Mackworth & Goebel 1998, pp. 381–394

[400] Russell & Norvig 2003, pp. 584–597,

[401] Poole, Mackworth & Goebel 1998, pp. 381–394

[Markov_decision_process-149] Markov decision processes and dynamic decision networks:
Russell & Norvig 2003, pp. 613–631

[403] Russell & Norvig 2003, pp. 613–631

[Game_theory_and_mechanism_design-150] Game theory and mechanism design:
Russell & Norvig 2003, pp. 631–643

[405] Russell & Norvig 2003, pp. 631–643

[Classifiers-151] Statistical learning methods and classifiers:
Russell & Norvig 2003, pp. 712–754,

Luger & Stubblefield 2004, pp. 453–541

[407] Russell & Norvig 2003, pp. 712–754,

[408] Luger & Stubblefield 2004, pp. 453–541

[Neural_networks-152] Neural networks and connectionism:
Russell & Norvig 2003, pp. 736–748,

Poole, Mackworth & Goebel 1998, pp. 408–414,

Luger & Stubblefield 2004, pp. 453–505,

Nilsson 1998, chpt. 3

[410] Russell & Norvig 2003, pp. 736–748,

[411] Poole, Mackworth & Goebel 1998, pp. 408–414,

[412] Luger & Stubblefield 2004, pp. 453–505,

[413] Nilsson 1998, chpt. 3

[Kernel_methods-153] rnel methods such as the support vector machine:
Russell & Norvig 2003, pp. 749–752

[415] Russell & Norvig 2003, pp. 749–752

[K-nearest_neighbor_algorithm-154] K-nearest neighbor algorithm:
Russell & Norvig 2003, pp. 733–736

[417] Russell & Norvig 2003, pp. 733–736

[Gaussian_mixture_model-155] Gaussian mixture model:
Russell & Norvig 2003, pp. 725–727

[419] Russell & Norvig 2003, pp. 725–727

[Naive_Bayes_classifier-156] Naive Bayes classifier:
Russell & Norvig 2003, pp. 718

[421] Russell & Norvig 2003, pp. 718

[Decision_tree-157] Decision tree:
Russell & Norvig 2003, pp. 653–664,

Poole, Mackworth & Goebel 1998, pp. 403–408,

Luger & Stubblefield 2004, pp. 408–417

[423] Russell & Norvig 2003, pp. 653–664,

[424] Poole, Mackworth & Goebel 1998, pp. 403–408,

[425] Luger & Stubblefield 2004, pp. 408–417

[Classifier_performance-158] Classifier performance:
van der Walt & Bernard 2006

[427] van der Walt & Bernard 2006

[Feedforward_neural_networks-159] Feedforward neural networks, perceptrons and radial basis networks:
Russell & Norvig 2003, pp. 739–748, 758

Luger & Stubblefield 2004, pp. 458–467

[429] Russell & Norvig 2003, pp. 739–748, 758

[430] Luger & Stubblefield 2004, pp. 458–467

[Learning_in_neural_networks-160] Competitive learning, Hebbian coincidence learning, Hopfield networks and attractor networks:
Luger & Stubblefield 2004, pp. 474–505

[432] Luger & Stubblefield 2004, pp. 474–505

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

[grie2012-162] Griewank, Andreas (2012). Who Invented the Reverse Mode of Differentiation?. Optimization Stories, Documenta Matematica, Extra Volume ISMP (2012), 389–400.

[WERBOS1974-163] Paul Werbos, "Beyond Regression: New Tools for Prediction and Analysis in the Behavioral Sciences", PhD thesis, Harvard University, 1974.

[werbos1982-164] Paul Werbos (1982). Applications of advances in nonlinear sensitivity analysis. In System modeling and optimization (pp. 762–770). Springer Berlin Heidelberg. Online Archived 14 April 2016 at the Wayback Machine

[Backpropagation-165] Backpropagation:
Russell & Norvig 2003, pp. 744–748,

Luger & Stubblefield 2004, pp. 467–474,

Nilsson 1998, chpt. 3.3

[438] Russell & Norvig 2003, pp. 744–748,

[439] Luger & Stubblefield 2004, pp. 467–474,

[440] Nilsson 1998, chpt. 3.3

[Hierarchical_temporal_memory-166] Hierarchical temporal memory:
Hawkins & Blakeslee 2005

[442] Hawkins & Blakeslee 2005

[167] "Artificial intelligence can 'evolve' to solve problems". Science | AAAS. 10 January 2018. Retrieved 7 February 2018.

[schmidhuber2015-168] Schmidhuber, J. (2015). "Deep Learning in Neural Networks: An Overview". Neural Networks. 61: 85–117. arXiv:1404.7828. doi:10.1016/j.neunet.2014.09.003.

[goodfellow2016-169] Ian Goodfellow, Yoshua Bengio, and Aaron Courville (2016). Deep Learning. MIT Press. Online Archived 16 April 2016 at the Wayback Machine

[HintonDengYu2012-170] Hinton, G.; Deng, L.; Yu, D.; Dahl, G.; Mohamed, A.; Jaitly, N.; Senior, A.; Vanhoucke, V.; Nguyen, P.; Sainath, T.; Kingsbury, B. (2012). "Deep Neural Networks for Acoustic Modeling in Speech Recognition --- The shared views of four research groups". IEEE Signal Processing Magazine. 29 (6): 82–97. doi:10.1109/msp.2012.2205597.

[scholarpedia-171] Schmidhuber, Jürgen (2015). "Deep Learning". Scholarpedia. 10 (11): 32832. doi:10.4249/scholarpedia.32832. Archived from the original on 19 April 2016. {{cite journal}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)CS1 maint: unflagged free DOI (link)

[dechter1986-172] Rina Dechter (1986). Learning while searching in constraint-satisfaction problems. University of California, Computer Science Department, Cognitive Systems Laboratory.Online Archived 19 April 2016 at the Wayback Machine

[aizenberg2000-173] Igor Aizenberg, Naum N. Aizenberg, Joos P.L. Vandewalle (2000). Multi-Valued and Universal Binary Neurons: Theory, Learning and Applications. Springer Science & Business Media.

[174] Ivakhnenko, Alexey (1965). Cybernetic Predicting Devices. Kiev: Naukova Dumka.

[ivak1971-175] Ivakhnenko, Alexey (1971). "Polynomial theory of complex systems". IEEE Transactions on Systems, Man and Cybernetics (4): 364–378.

[FOOTNOTEHinton2007-176] Hinton 2007.

[177] Research, AI (23 October 2015). "Deep Neural Networks for Acoustic Modeling in Speech Recognition". airesearch.com. Retrieved 23 October 2015.

[FUKU1980-178] Fukushima, K. (1980). "Neocognitron: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position". Biological Cybernetics. 36: 193–202. doi:10.1007/bf00344251. PMID 7370364.

[lecun2016slides-179] Yann LeCun (2016). Slides on Deep Learning Online Archived 23 April 2016 at the Wayback Machine

[Nature2017-180] Silver, David; Schrittwieser, Julian; Simonyan, Karen; Antonoglou, Ioannis; Huang, Aja; Guez, Arthur; Hubert, Thomas; Baker, Lucas; Lai, Matthew; Bolton, Adrian; Chen, Yutian; Lillicrap, Timothy; Fan, Hui; Sifre, Laurent; Driessche, George van den; Graepel, Thore; Hassabis, Demis (19 October 2017). "Mastering the game of Go without human knowledge". Nature. 550 (7676): 354–359. doi:10.1038/nature24270. ISSN 0028-0836. AlphaGo Lee... 12 convolutional layers

[Recurrent_neural_networks-181] Recurrent neural networks, Hopfield nets:
Russell & Norvig 2003, p. 758

Luger & Stubblefield 2004, pp. 474–505

[458] Russell & Norvig 2003, p. 758

[459] Luger & Stubblefield 2004, pp. 474–505

[182] Hyötyniemi, Heikki (1996). "Turing machines are recurrent neural networks". Proceedings of STeP '96/Publications of the Finnish Artificial Intelligence Society: 13–24.

[183] P. J. Werbos. Generalization of backpropagation with application to a recurrent gas market model" Neural Networks 1, 1988.

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

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

[hochreiter1991-186] Sepp Hochreiter (1991), Untersuchungen zu dynamischen neuronalen Netzen Archived 6 March 2015 at the Wayback Machine, Diploma thesis. Institut f. Informatik, Technische Univ. Munich. Advisor: J. Schmidhuber.

[SCHMID1992-187] Schmidhuber, J. (1992). "Learning complex, extended sequences using the principle of history compression". Neural Computation. 4: 234–242. CiteSeerX 10.1.1.49.3934. doi:10.1162/neco.1992.4.2.234.

[lstm-188] Hochreiter, Sepp; and Schmidhuber, Jürgen; Long Short-Term Memory, Neural Computation, 9(8):1735–1780, 1997

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

[hannun2014-190] Hannun, Awni; Case, Carl; Casper, Jared; Catanzaro, Bryan; Diamos, Greg; Elsen, Erich; Prenger, Ryan; Satheesh, Sanjeev; Sengupta, Shubho; Coates, Adam; Ng, Andrew Y. (2014). "Deep Speech: Scaling up end-to-end speech recognition". arXiv:1412.5567.

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

[liwu2015-192] Li, Xiangang; Wu, Xihong (2015). "Constructing Long Short-Term Memory based Deep Recurrent Neural Networks for Large Vocabulary Speech Recognition". arXiv:1410.4281.

[sak2015-193] Haşim Sak, Andrew Senior, Kanishka Rao, Françoise Beaufays and Johan Schalkwyk (September 2015): Google voice search: faster and more accurate. Archived 9 March 2016 at the Wayback Machine

[sutskever2014-194] Sutskever, Ilya; Vinyals, Oriol; Le, Quoc V. (2014). "Sequence to Sequence Learning with Neural Networks". arXiv:1409.3215.

[vinyals2016-195] Jozefowicz, Rafal; Vinyals, Oriol; Schuster, Mike; Shazeer, Noam; Wu, Yonghui (2016). "Exploring the Limits of Language Modeling". arXiv:1602.02410.

[gillick2015-196] Gillick, Dan; Brunk, Cliff; Vinyals, Oriol; Subramanya, Amarnag (2015). "Multilingual Language Processing From Bytes". arXiv:1512.00103.

[vinyals2015-197] Vinyals, Oriol; Toshev, Alexander; Bengio, Samy; Erhan, Dumitru (2015). "Show and Tell: A Neural Image Caption Generator". arXiv:1411.4555.

[Lisp-198] Lisp:
Luger & Stubblefield 2004, pp. 723–821

Crevier 1993, pp. 59–62,

Russell & Norvig 2003, p. 18

[477] Luger & Stubblefield 2004, pp. 723–821

[478] Crevier 1993, pp. 59–62,

[479] Russell & Norvig 2003, p. 18

[Prolog-199] Prolog:
Poole, Mackworth & Goebel 1998, pp. 477–491,

Luger & Stubblefield 2004, pp. 641–676, 575–581

[481] Poole, Mackworth & Goebel 1998, pp. 477–491,

[482] Luger & Stubblefield 2004, pp. 641–676, 575–581

[C++-200] "C++ Java". infoworld.com. Retrieved 6 December 2017.

[201] Ferris, Robert (7 April 2016). "How Steve Jobs' friend changed the world of math". CNBC. Retrieved 28 February 2018.

[Turing_test-202] The Turing test:
Turing's original publication:
Turing 1950
Historical influence and philosophical implications:
Haugeland 1985, pp. 6–9

Crevier 1993, p. 24

McCorduck 2004, pp. 70–71

Russell & Norvig 2003, pp. 2–3 and 948

[486] Turing 1950

[487] Haugeland 1985, pp. 6–9

[488] Crevier 1993, p. 24

[489] McCorduck 2004, pp. 70–71

[490] Russell & Norvig 2003, pp. 2–3 and 948

[Mathematical_definitions_of_intelligence-203] Mathematical definitions of intelligence:
Hernandez-Orallo 2000

Dowe & Hajek 1997

Hernandez-Orallo & Dowe 2010

[492] Hernandez-Orallo 2000

[493] Dowe & Hajek 1997

[494] Hernandez-Orallo & Dowe 2010

[FOOTNOTEO'BrienMarakas2011-204] O'Brien & Marakas 2011.

[FOOTNOTERussellNorvig20091-205] Russell & Norvig 2009, p. 1.

[FOOTNOTE''CNN''2006-206] CNN 2006.

[ecthr2016-207] N. Aletras; D. Tsarapatsanis; D. Preotiuc-Pietro; V. Lampos (2016). "Predicting judicial decisions of the European Court of Human Rights: a Natural Language Processing perspective". PeerJ Computer Science. Archived from the original on 29 October 2016. {{cite journal}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)

[208] "The Economist Explains: Why firms are piling into artificial intelligence". The Economist. 31 March 2016. Archived from the original on 8 May 2016. Retrieved 19 May 2016. {{cite news}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)

[209] Lohr, Steve (28 February 2016). "The Promise of Artificial Intelligence Unfolds in Small Steps". The New York Times. Archived from the original on 29 February 2016. Retrieved 29 February 2016. {{cite news}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

[15]

[16]

[17]

[18]

[19]

[20]

[21]

[22]

[23]

[24]

[25]

[26]

[27]

[28]

[29]

[30]

[31]

[32]

[33]

[34]

[35]

[36]

[37]

[38]

[39]

[40]

[41]

[42]

[43]

[44]

[45]

[46]

[47]

[48]

[49]

[50]

[51]

[52]

[53]

[54]

[55]

[56]

[57]

[58]

[59]

[60]

[61]

[62]

[63]

[64]

[65]

[66]

[67]

[68]

[69]

[70]

[71]

[72]

[73]

[74]

[75]

[76]

[77]

[78]

[79]

[80]

[81]

[82]

[83]

[84]

[85]

[86]

[87]

[88]

[89]

[90]

[91]

[92]

[93]

[94]

[95]

[96]

[97]

[98]

[99]

[100]

@@ Line 395: / Line 395: @@
 Another factor that is influencing the ability for 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/</ref>The programing of the car in these situations is crucial to a successful driver-less automobile.
-=== Finance and Economics ===
+=== Finance, Economics, and Business ===
 [[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 USA set-up a Fraud Prevention Task force to counter the unauthorised use of debit cards. Programs like Kasisto and Moneystream are using AI in financial services.
@@ Line 401: / Line 401: @@
 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. 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]].
+With the major growth in data streams, many businesses are turning to intelligent systems and infrastructure - or Enterprise Computation - for a strong analytics strategy. Two of the most relevant artificial intelligence applications are [[natural language understanding]] and [[automated machine learning]]. This allows business staff to have the ability to access data and analytics across complex organizational structures. Such processes then allows staff to be able to ask questions of data and retrieve instant results and visualizations, powered by sophisticated AI automation.<ref>{{cite web|url=https://medium.com/wolfram-events/what-is-enterprise-computation-f962478b4448 |title=What is Enterprise Computation? |website=www.medium.com |accessdate=6 March 2018}}</ref>
 === Video games ===

v t e Existential risk from artificial intelligence
Concepts	AGI AI alignment AI capability control AI safety AI takeover Consequentialism Effective accelerationism Ethics of artificial intelligence Existential risk from artificial general intelligence Friendly artificial intelligence Instrumental convergence Intelligence explosion Longtermism Machine ethics Suffering risks Superintelligence Technological singularity
Organizations	Alignment Research Center Center for AI Safety Center for Applied Rationality Center for Human-Compatible Artificial Intelligence Centre for the Study of Existential Risk EleutherAI Future of Humanity Institute Future of Life Institute Google DeepMind Humanity+ Institute for Ethics and Emerging Technologies Leverhulme Centre for the Future of Intelligence Machine Intelligence Research Institute OpenAI
People	Scott Alexander Sam Altman Yoshua Bengio Nick Bostrom Paul Christiano Eric Drexler Sam Harris Stephen Hawking Dan Hendrycks Geoffrey Hinton Bill Joy Shane Legg Elon Musk Steve Omohundro Huw Price Martin Rees Stuart J. Russell Jaan Tallinn Max Tegmark Frank Wilczek Roman Yampolskiy Eliezer Yudkowsky
Other	Statement on AI risk of extinction Human Compatible Open letter on artificial intelligence (2015) Our Final Invention The Precipice Superintelligence: Paths, Dangers, Strategies Do You Trust This Computer? Artificial Intelligence Act
Category

v t e Philosophy of mind
Philosophers	G. E. M. Anscombe Aristotle Armstrong Thomas Aquinas J. L. Austin Alexander Bain George Berkeley Henri Bergson Ned Block Franz Brentano C. D. Broad Tyler Burge David Chalmers Patricia Churchland Paul Churchland Andy Clark Dharmakirti Donald Davidson Daniel Dennett René Descartes Fred Dretske Fodor Goldman Martin Heidegger David Hume Edmund Husserl William James Frank Cameron Jackson Immanuel Kant David Lewis (philosopher) John Locke Gottfried Wilhelm Leibniz Maurice Merleau-Ponty Marvin Minsky Thomas Nagel Alva Noë Derek Parfit Plato Hilary Putnam Richard Rorty Gilbert Ryle John Searle Wilfrid Sellars Baruch Spinoza Alan Turing Michael Tye Vasubandhu Ludwig Wittgenstein Stephen Yablo Zhuangzi more...
Theories	Behaviorism Biological naturalism Dualism Eliminative materialism Emergent materialism Epiphenomenalism Functionalism Interactionism Naïve realism Neurophenomenology Neutral monism New mysterianism Nondualism Occasionalism Parallelism Phenomenalism Phenomenology Physicalism Type physicalism Property dualism Representational Solipsism Substance dualism
Concepts	Abstract object Chinese room Creativity Cognition Cognitive closure Concept Consciousness Hard problem of consciousness Hypostatic abstraction Idea Identity Intelligence Artificial Human Intentionality Introspection Intuition Language of thought Mental event Mental image Mental process Mental property Mental representation Mind Mind–body problem Pain Problem of other minds Propositional attitude Qualia Tabula rasa Understanding Zombie
Related	Metaphysics Philosophy of artificial intelligence / information / perception / self
Category Philosophers category Project Task Force

v t e Computer science
Note: This template roughly follows the 2012 ACM Computing Classification System.
Hardware	Printed circuit board Peripheral Integrated circuit Very Large Scale Integration Systems on Chip (SoCs) Energy consumption (Green computing) Electronic design automation Hardware acceleration Processor Size / Form
Computer systems organization	Computer architecture Computational complexity Dependability Embedded system Real-time computing
Networks	Network architecture Network protocol Network components Network scheduler Network performance evaluation Network service
Software organization	Interpreter Middleware Virtual machine Operating system Software quality
Software notations and tools	Programming paradigm Programming language Compiler Domain-specific language Modeling language Software framework Integrated development environment Software configuration management Software library Software repository
Software development	Control variable Software development process Requirements analysis Software design Software construction Software deployment Software engineering Software maintenance Programming team Open-source model
Theory of computation	Model of computation Stochastic Formal language Automata theory Computability theory Computational complexity theory Logic Semantics
Algorithms	Algorithm design Analysis of algorithms Algorithmic efficiency Randomized algorithm Computational geometry
Mathematics of computing	Discrete mathematics Probability Statistics Mathematical software Information theory Mathematical analysis Numerical analysis Theoretical computer science
Information systems	Database management system Information storage systems Enterprise information system Social information systems Geographic information system Decision support system Process control system Multimedia information system Data mining Digital library Computing platform Digital marketing World Wide Web Information retrieval
Security	Cryptography Formal methods Security hacker Security services Intrusion detection system Hardware security Network security Information security Application security
Human–computer interaction	Interaction design Social computing Ubiquitous computing Visualization Accessibility
Concurrency	Concurrent computing Parallel computing Distributed computing Multithreading Multiprocessing
Artificial intelligence	Natural language processing Knowledge representation and reasoning Computer vision Automated planning and scheduling Search methodology Control method Philosophy of artificial intelligence Distributed artificial intelligence
Machine learning	Supervised learning Unsupervised learning Reinforcement learning Multi-task learning Cross-validation
Graphics	Animation Rendering Photograph manipulation Graphics processing unit Mixed reality Virtual reality Image compression Solid modeling
Applied computing	Quantum Computing E-commerce Enterprise software Computational mathematics Computational physics Computational chemistry Computational biology Computational social science Computational engineering Differentiable computing Computational healthcare Digital art Electronic publishing Cyberwarfare Electronic voting Video games Word processing Operations research Educational technology Document management
Category Outline Glossaries

v t e Evolutionary computation
Main Topics	Evolutionary algorithm Evolutionary data mining Evolutionary multimodal optimization Human-based evolutionary computation Interactive evolutionary computation
Algorithms	Cellular evolutionary algorithm Covariance Matrix Adaptation Evolution Strategy (CMA-ES) Cultural algorithm Differential evolution Evolutionary programming Genetic algorithm Genetic programming Gene expression programming Evolution strategy Natural evolution strategy Neuroevolution Learning classifier system
Related techniques	Swarm intelligence Ant colony optimization Bees algorithm Cuckoo search Particle swarm optimization Bacterial Colony Optimization
Metaheuristic methods	Firefly algorithm Harmony search Gaussian adaptation Memetic algorithm
Related topics	Artificial development Artificial intelligence Artificial life Digital organism Evolutionary robotics Fitness function Fitness landscape Fitness approximation Genetic operators Interactive evolutionary computation No free lunch in search and optimization Machine learning Mating pool Program synthesis
Journals	Evolutionary Computation (journal)