Artificial intelligence (AI) is the intelligence exhibited by machines or software. It is also the name of the academic field of study which studies how to create computers and computer software that are capable of intelligent behavior. Major AI researchers and textbooks define this field as "the study and design of intelligent agents", in which an intelligent agent is a system that perceives its environment and takes actions that maximize its chances of success. John McCarthy, who coined the term in 1955, defines it as "the science and engineering of making intelligent machines". AI research is highly technical and specialized, and is deeply divided into subfields that often fail to communicate with each other. Some of the division is due to social and cultural factors: subfields have grown up around particular institutions and the work of individual researchers. AI research is also divided by several technical issues. Some subfields focus on the solution of specific problems. Others focus on one of several possible approaches or on the use of a particular tool or towards the accomplishment of particular applications.
The central problems (or goals) of AI research include reasoning, knowledge, planning, learning, natural language processing (communication), perception and the ability to move and manipulate objects. General intelligence is still among the field's long-term goals. Currently popular approaches include statistical methods, computational intelligence and traditional symbolic AI. There are a large number of tools used in AI, including versions of search and mathematical optimization, logic, methods based on probability and economics, and many others. The AI field is interdisciplinary, in which a number of sciences and professions converge, including computer science, mathematics, psychology, linguistics, philosophy and neuroscience, as well as other specialized fields such as artificial psychology. The field was founded on the claim that a central property of humans, human intelligence—the sapience of Homo sapiens—"can be so precisely described that a machine can be made to simulate it." This raises philosophical issues about the nature of the mind and the ethics of creating artificial beings endowed with human-like intelligence, issues which have been addressed by myth, fiction and philosophy since antiquity. Artificial intelligence has been the subject of tremendous optimism but has also suffered stunning setbacks. Today it has become an essential part of the technology industry, providing the heavy lifting for many of the most challenging problems in computer science.
- History 1
- Deduction, reasoning, problem solving 2.1.1
- Knowledge representation 2.1.2
- Planning 2.1.3
- Learning 2.1.4
- Natural language processing (communication) 2.1.5
- Perception 2.1.6
- Motion and manipulation 2.1.7
Long-term goals 2.1.8
- Social intelligence 22.214.171.124
- Creativity 126.96.36.199
- General intelligence 188.8.131.52
- Cybernetics and brain simulation 2.2.1
- Symbolic 2.2.2
- Sub-symbolic 2.2.3
- Statistical 2.2.4
- Integrating the approaches 2.2.5
- Search and optimization 2.3.1
- Logic 2.3.2
- Probabilistic methods for uncertain reasoning 2.3.3
- Classifiers and statistical learning methods 2.3.4
- Neural networks 2.3.5
- Control theory 2.3.6
- Languages 2.3.7
- Evaluating progress 2.4
- Goals 2.1
- Competitions and prizes 3.1
- Platforms 3.2
- Toys 3.3
Philosophy and ethics 4
- The limits of artificial general intelligence 4.1
Intelligent behaviour and machine ethics 4.2
- Machine ethics 4.2.1
- Malevolent and friendly AI 4.2.2
- Devaluation of humanity 4.2.3
- Decrease in demand for human labor 4.2.4
Machine consciousness, sentience and mind 4.3
- Consciousness 4.3.1
- Computationalism 4.3.2
- Strong AI hypothesis 4.3.3
- Robot rights 4.3.4
- Technological singularity 4.4.1
- Transhumanism 4.4.2
- Existential Risk 4.5
- In fiction 5
- Notes 6
- AI textbooks 7.1
- History of AI 7.2
- Other sources 7.3
- Further reading 8
- External links 9
Thinking machines and artificial beings appear in  Stories of these creatures and their fates discuss many of the same hopes, fears and ethical concerns that are presented by artificial intelligence. Mechanical or "formal" reasoning has been developed by philosophers and mathematicians since antiquity. The study of logic led directly to the invention of the programmable digital electronic computer, based on the work of mathematician Alan Turing and others. Turing's theory of computation suggested that a machine, by shuffling symbols as simple as "0" and "1", could simulate any conceivable act of mathematical deduction. This, along with concurrent discoveries in neurology, information theory and cybernetics, inspired a small group of researchers to begin to seriously consider the possibility of building an electronic brain. The field of AI research was founded at a conference on the campus of Dartmouth College in the summer of 1956. The attendees, including John McCarthy, Marvin Minsky, Allen Newell, Arthur Samuel, and Herbert Simon, became the leaders of AI research for many decades. They and their students wrote programs that were, to most people, simply astonishing: computers were winning at checkers, solving word problems in algebra, proving logical theorems and speaking English. By the middle of the 1960s, research in the U.S. was heavily funded by the Department of Defense and laboratories had been established around the world. AI's founders were profoundly optimistic about the future of the new field: Herbert Simon predicted that "machines will be capable, within twenty years, of doing any work a man can do" and Marvin Minsky agreed, writing that "within a generation ... the problem of creating 'artificial intelligence' will substantially be solved". They had failed to recognize the difficulty of some of the problems they faced. In 1974, in response to the criticism of Sir James Lighthill and ongoing pressure from the US Congress to fund more productive projects, both the U.S. and British governments cut off all undirected exploratory research in AI. The next few years would later be called an "AI winter", a period when funding for AI projects was hard to find. In the early 1980s, AI research was revived by the commercial success of expert systems, a form of AI program that simulated the knowledge and analytical skills of one or more 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 in the field. However, beginning with the collapse of the Lisp Machine market in 1987, AI once again fell into disrepute, and a second, longer lasting AI winter began. In the 1990s and early 21st century, AI achieved its greatest successes, albeit somewhat behind the scenes. Artificial intelligence is used for logistics, data mining, medical diagnosis and many other areas throughout the technology industry. The success was due to several factors: the increasing computational power of computers (see Moore's law), a greater emphasis on solving specific subproblems, the creation of new ties between AI and other fields working on similar problems, and a new commitment by researchers to solid mathematical methods and rigorous scientific standards. On 11 May 1997, Deep Blue became the first computer chess-playing system to beat a reigning world chess champion, Garry Kasparov. In February 2011, 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. The Kinect, which provides a 3D body–motion interface for the Xbox 360 and the Xbox One, uses algorithms that emerged from lengthy AI research as do intelligent personal assistants in smartphones.
The general problem of simulating (or creating) intelligence has been broken down into a number of specific sub-problems. These consist of particular traits or capabilities that researchers would like an intelligent system to display. The traits described below have received the most attention.
Deduction, reasoning, problem solving
Early AI researchers developed algorithms that imitated the step-by-step reasoning that humans use when they solve puzzles or make logical deductions. By the late 1980s and 1990s, AI research had also developed highly successful methods for dealing with uncertain or incomplete information, employing concepts from probability and economics. For difficult problems, most of these algorithms can require enormous computational resources – most experience a "combinatorial explosion": the amount of memory or computer time required becomes astronomical when the problem goes beyond a certain size. The search for more efficient problem-solving algorithms is a high priority for AI research.
Human beings solve most of their problems using fast, intuitive judgements rather than the conscious, step-by-step deduction that early AI research was able to model. AI has made some progress at imitating this kind of "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 probabilistic nature of the human ability to guess.
Knowledge representation and knowledge engineering 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; situations, events, states and time; causes and effects; knowledge about knowledge (what we know about what other people know); and many other, less well researched domains. A representation of "what exists" is an ontology: the set of objects, relations, concepts and so on that the machine knows about. The most general are called upper ontologies, which attempt to provide a foundation for all other knowledge.
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 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.
- The breadth of commonsense knowledge
- The number of atomic facts that the average person knows is astronomical. 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. 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.
- 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" or an art critic can take one look at a statue and instantly realize that it is a fake. These are intuitions or tendencies that are represented in the brain non-consciously and sub-symbolically. 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.
Intelligent agents must be able to set goals and achieve them. They need a way to visualize the future (they must have 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 the available choices.
In classical planning problems, the agent can assume that it is the only thing acting on the world and it can be certain what the consequences of its actions may be. However, if the agent is not the only actor, it must periodically ascertain whether the world matches its predictions and it must change its plan as this becomes necessary, requiring the agent to reason under uncertainty.
Machine learning is the study of computer algorithms that improve automatically through experience and has been central to AI research since the field's inception.
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 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.
Within developmental robotics, developmental learning approaches were elaborated for lifelong cumulative acquisition of repertoires of novel skills by a robot, through autonomous self-exploration and social interaction with human teachers, and using guidance mechanisms such as active learning, maturation, motor synergies, and imitation.
Natural language processing (communication)
Natural language processing gives machines the ability to read and understand the languages that humans speak. 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 (or text mining), question answering and machine translation.
A common method of processing and extracting meaning from natural language is through semantic indexing. Increases in processing speeds and the drop in the cost of data storage makes indexing large volumes of abstractions of the user's input much more efficient.
Machine perception is the ability to use input from sensors (such as cameras, microphones, tactile sensors, sonar and others more exotic) to deduce aspects of the world. Computer vision is the ability to analyze visual input. A few selected subproblems are speech recognition, facial recognition and object recognition.
Motion and manipulation
The field of robotics is closely related to AI. Intelligence is required for robots to be able to handle such tasks as object manipulation and navigation, with sub-problems of localization (knowing where you are, or finding out where other things are), mapping (learning what is around you, building a map of the environment), and motion planning (figuring out how to get there) or path planning (going from one point in space to another point, which may involve compliant motion – where the robot moves while maintaining physical contact with an object).
Among the long-term goals in the research pertaining to artificial intelligence are: (1) Social intelligence, (2) Creativity, and (3) General intelligence.
Affective computing is the study and development of systems and devices that can recognize, interpret, process, and simulate human affects. It is an interdisciplinary field spanning computer sciences, psychology, and cognitive science. While the origins of the field may be traced as far back as to early philosophical inquiries into emotion, the more modern branch of computer science originated with Rosalind Picard's 1995 paper on affective computing. A motivation for the research is the ability to simulate empathy. The machine should interpret the emotional state of humans and adapt its behaviour to them, giving an appropriate response for those emotions.
Emotion and social skills play two roles for an intelligent agent. First, it must be able to predict the actions of others, by understanding their motives and emotional states. (This involves elements of game theory, decision theory, as well as the ability to model human emotions and the perceptual skills to detect emotions.) Also, in an effort to facilitate human-computer interaction, an intelligent machine might want to be able to display emotions—even if it does not actually experience them itself—in order to appear sensitive to the emotional dynamics of human interaction.
A sub-field of AI addresses creativity both theoretically (from a philosophical and psychological perspective) and practically (via specific implementations of systems that generate outputs that can be considered creative, or systems that identify and assess creativity). Related areas of computational research are Artificial intuition and Artificial thinking.
Many researchers think that their work will eventually be incorporated into a machine with general intelligence (known as strong AI), combining all the skills above and exceeding human abilities at most or all of them. A few believe that anthropomorphic features like artificial consciousness or an artificial brain may be required for such a project.
Many of the problems above may require general intelligence to be considered solved. For example, even a straightforward, specific task like machine translation requires that the 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 intention (social intelligence). A problem like machine translation is considered "AI-complete". In order to solve this particular problem, you must solve all the problems.
There is no established unifying theory or paradigm that guides AI research. Researchers disagree about many issues. A few of the most long standing questions that have remained unanswered are these: should artificial intelligence simulate natural intelligence by studying psychology or neurology? Or is human biology as irrelevant to AI research as bird biology is to aeronautical engineering? Can intelligent behavior be described using simple, elegant principles (such as logic or optimization)? Or does it necessarily require solving a large number of completely unrelated problems? Can intelligence be reproduced using high-level symbols, similar to words and ideas? Or does it require "sub-symbolic" processing? 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, a term which has since been adopted by some non-GOFAI researchers.
Cybernetics and brain simulation
In the 1940s and 1950s, a number of researchers explored the connection between neurology, information theory, and cybernetics. Some of them built machines that used electronic networks to exhibit rudimentary intelligence, such as W. Grey Walter's turtles and the Johns Hopkins Beast. Many of these researchers gathered for meetings of the Teleological Society at Princeton University and the Ratio Club in England. By 1960, this approach was largely abandoned, although elements of it would be revived in the 1980s.
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". 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. 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.
- 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. His laboratory at Stanford (SAIL) focused on using formal logic to solve a wide variety of problems, including knowledge representation, planning and learning. Logic was also the focus of the work at the University of Edinburgh and elsewhere in Europe which led to the development of the programming language Prolog and the science of logic programming.
- "Anti-logic" or "scruffy"
- Researchers at MIT (such as Marvin Minsky and Seymour Papert) found that solving difficult problems in vision and natural language processing required ad-hoc solutions – they argued that there was no simple and general principle (like logic) that would capture all the aspects of intelligent behavior. Roger Schank described their "anti-logic" approaches as "scruffy" (as opposed to the "neat" paradigms at CMU and Stanford). Commonsense knowledge bases (such as Doug Lenat's Cyc) are an example of "scruffy" AI, since they must be built by hand, one complicated concept at a time.
- When computers with large memories became available around 1970, researchers from all three traditions began to build knowledge into AI applications. This "knowledge revolution" led to the development and deployment of expert systems (introduced by Edward Feigenbaum), the first truly successful form of AI software. The knowledge revolution was also driven by the realization that enormous amounts of knowledge would be required by many simple AI applications.
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.
- Bottom-up, embodied, situated, behavior-based or nouvelle AI
- Researchers from the related field of robotics, such as Rodney Brooks, rejected symbolic AI and focused on the basic engineering problems that would allow robots to move and survive. Their work revived the non-symbolic 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 1980s. 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 enough. 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.
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." Critics argue that these techniques (with few exceptions) are too focused on particular problems and have failed to address the long-term goal of general intelligence. 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.
Integrating the approaches
- Intelligent agent paradigm
- An 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.
- Agent architectures and cognitive architectures
- Researchers have designed systems to build intelligent systems out of interacting intelligent agents in a multi-agent system. 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. Rodney Brooks' subsumption architecture was an early proposal for such a hierarchical system.
In the course of 50 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: Reasoning can be reduced to performing a search. For example, logical proof can be viewed as searching for a path that leads from premises to conclusions, where each step is the application of an inference rule. Planning algorithms search through trees of goals and subgoals, attempting to find a path to a target goal, a process called means-ends analysis. Robotics algorithms for moving limbs and grasping objects use local searches in configuration space. Many learning algorithms use search algorithms based on optimization.
Simple exhaustive searches 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 eliminate choices that are unlikely to lead to the goal (called "pruning the search tree"). Heuristics supply the program with a "best guess" for the path on which the solution lies. Heuristics limit the search for solutions into a smaller sample size.
A very different kind of search came to prominence in the 1990s, based on the mathematical theory of optimization. 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.
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) and evolutionary algorithms (such as genetic algorithms, gene expression programming, and genetic programming).
Logic is used for knowledge representation and problem solving, but it can be applied to other problems as well. For example, the satplan algorithm uses logic for planning and inductive logic programming is a method for learning.
Several different forms of logic are used in AI research. Propositional or sentential logic is the logic of statements which can be true or false. First-order logic also allows the use of quantifiers and predicates, and can express facts about objects, their properties, and their relations with each other. Fuzzy logic, 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 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 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; situation calculus, event calculus and fluent calculus (for representing events and time); causal calculus; belief calculus; and modal logics.
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.
Bayesian networks are a very general tool that can be used for a large number of problems: reasoning (using the Bayesian inference algorithm), learning (using the expectation-maximization algorithm), planning (using decision networks) and perception (using dynamic Bayesian networks). Probabilistic algorithms can also be used for filtering, prediction, smoothing and finding explanations for streams of data, helping perception systems to analyze processes that occur over time (e.g., hidden Markov models or Kalman filters).
A key concept from the science of economics is "utility": a measure of how valuable something is to an intelligent agent. Precise mathematical tools have been developed that analyze how an agent can make choices and plan, using decision theory, decision analysis, and information value theory. These tools include models such as Markov decision processes, dynamic decision networks, game theory and mechanism design.
Classifiers and statistical learning methods
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.
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, kernel methods such as the support vector machine, k-nearest neighbor algorithm, Gaussian mixture model, naive Bayes classifier, and decision tree. 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.
The study of artificial neural networks began in the decade before the field of AI research was founded, in the work of Walter Pitts and Warren McCullough. Other important early researchers were Frank Rosenblatt, who invented the perceptron and Paul Werbos who developed the backpropagation algorithm.
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). Among the most popular feedforward networks are perceptrons, multi-layer perceptrons and radial basis networks. Among recurrent networks, the most famous is the Hopfield net, a form of attractor network, which was first described by John Hopfield in 1982. Neural networks can be applied to the problem of intelligent control (for robotics) or learning, using such techniques as Hebbian learning and competitive learning.
Hierarchical temporal memory is an approach that models some of the structural and algorithmic properties of the neocortex. The term "deep learning" gained traction in the mid-2000s after a publication by Geoffrey Hinton and Ruslan Salakhutdinov showed how a many-layered feedforward neural network could be effectively pre-trained one layer at a time, treating each layer in turn as an unsupervised restricted Boltzmann machine, then using supervised backpropagation for fine-tuning.
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.
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.
One classification for outcomes of an AI test is:
- Optimal: it is not possible to perform better.
- Strong super-human: performs better than all humans.
- Super-human: performs better than most humans.
- Sub-human: performs worse than most humans.
For example, performance at draughts (i.e. checkers) is optimal, performance at chess is super-human and nearing strong 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. 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 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.
Artificial intelligence techniques are pervasive and are too numerous to list. Frequently, when a technique reaches mainstream use, it is no longer considered artificial intelligence; this phenomenon is described as the AI effect. An area that artificial intelligence has contributed greatly to is intrusion detection.
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.
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, 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, albeit PC-based but still an entire real-world system, to various robot platforms such as the widely available Roomba with open interface.
AIBO, the first robotic pet, grew out of Sony's Computer Science Laboratory (CSL). Famed engineer Toshitada Doi is credited as AIBO's original progenitor: in 1994 he had started work on robots with artificial intelligence expert Masahiro Fujita, at CSL. Doi's friend, the artist Hajime Sorayama, was enlisted to create the initial designs for the AIBO's body. Those designs are now part of the permanent collections of Museum of Modern Art and the Smithsonian Institution, with later versions of AIBO being used in studies in Carnegie Mellon University. In 2006, AIBO was added into Carnegie Mellon University's "Robot Hall of Fame".
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"?
- Turing's "polite convention"
- We need not decide if a machine can "think"; we need only decide if a machine can act as intelligently as a human being. This approach to the philosophical problems associated with artificial intelligence forms the basis of the Turing test.
- The Dartmouth 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.
- Newell and Simon's physical symbol system hypothesis
- "A physical symbol system has the necessary and sufficient means of general intelligent action." Newell and Simon argue that intelligence consists of formal operations on symbols. Hubert Dreyfus argued that, on the contrary, human expertise depends on unconscious instinct rather than conscious symbol manipulation and on having a "feel" for the situation rather than explicit symbolic knowledge. (See Dreyfus' critique of AI.)
- Gödelian arguments
- Gödel himself, John Lucas (in 1961) and Roger Penrose (in a more detailed argument from 1989 onwards) argued that humans are not reducible to Turing machines. The detailed arguments are complex, but in essence they derive from Kurt Gödel's 1931 proof in his first incompleteness theorem that it is always possible to create statements that a formal system could not prove. A human being, however, can (with some thought) see the truth of these "Gödel statements". Any Turing program designed to search for these statements can have its methods reduced to a formal system, and so will always have a "Gödel statement" derivable from its program which it can never discover. However, if humans are indeed capable of understanding mathematical truth, it doesn't seem possible that we could be limited in the same way. This is quite a general result, if accepted, since it can be shown that hardware neural nets, and computers based on random processes (e.g. annealing approaches) and quantum computers based on entangled qubits (so long as they involve no new physics) can all be reduced to Turing machines. All they do is reduce the complexity of the tasks, not permit new types of problems to be solved. Roger Penrose speculates that there may be new physics involved in our brain, perhaps at the intersection of gravity and quantum mechanics at the Planck scale. This argument, if accepted does not rule out the possibility of true artificial intelligence, but means it has to be biological in basis or based on new physical principles. The argument has been followed up by many counter arguments, and then Roger Penrose has replied to those with counter counter examples, and it is now an intricate complex debate. For details see Philosophy of artificial intelligence: Lucas, Penrose and Gödel
- The artificial brain argument
- The brain can be simulated by machines and because brains are intelligent, simulated brains must also be intelligent; thus machines can be intelligent. Hans Moravec, Ray Kurzweil and others have argued that it is technologically feasible to copy the brain directly into hardware and software, and that such a simulation will be essentially identical to the original.
- The AI effect
- Machines are already intelligent, but observers have failed to recognize it. When Deep Blue beat Gary 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 can not. This is known as the AI Effect: "AI is whatever hasn't been done yet."
Intelligent behaviour and machine ethics
As a minimum, an AI system must be able to reproduce aspects of human intelligence. 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). For Wallach, AMAs have become a part of the research landscape of artificial intelligence as guided by its two central questions which he identifies as "Does Humanity Want Computers Making Moral Decisions" and "Can (Ro)bots Really Be Moral". For Wallach the question is not centered on the issue of whether machines can demonstrate the equivalent of moral behavior in contrast to the constraints which society may place on the development of AMAs.
The field of machine ethics is concerned with giving machines ethical principles, or a procedure for discovering a way to resolve the ethical dilemmas they might encounter, enabling them to function in an ethically responsible manner through their own ethical decision making. The field was delineated in the AAAI Fall 2005 Symposium on Machine Ethics: "Past research concerning the relationship between technology and ethics has largely focused on responsible and irresponsible use of technology by human beings, with a few people being interested in how human beings ought to treat machines. In all cases, only human beings have engaged in ethical reasoning. The time has come for adding an ethical dimension to at least some machines. Recognition of the ethical ramifications of behavior involving machines, as well as recent and potential developments in machine autonomy, necessitate this. In contrast to computer hacking, software property issues, privacy issues and other topics normally ascribed to computer ethics, machine ethics is concerned with the behavior of machines towards human users and other machines. Research in machine ethics is key to alleviating concerns with autonomous systems — it could be argued that the notion of autonomous machines without such a dimension is at the root of all fear concerning machine intelligence. Further, investigation of machine ethics could enable the discovery of problems with current ethical theories, advancing our thinking about Ethics." Machine ethics is sometimes referred to as machine morality, computational ethics or computational morality. A variety of perspectives of this nascent field can be found in the collected edition "Machine Ethics"  that stems from the AAAI Fall 2005 Symposium on Machine Ethics.
Malevolent and friendly AI
Political scientist Charles T. Rubin believes that AI can be neither designed nor guaranteed to be benevolent. He argues that "any sufficiently advanced benevolence may be indistinguishable from malevolence." Humans should not assume machines or robots would treat us favorably, because there is no a priori reason to believe that they would be sympathetic to our system of morality, which has evolved along with our particular biology (which AIs would not share). Hyper-intelligent software may not necessarily decide to support the continued existence of mankind, 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".
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."
Devaluation of humanity
Joseph Weizenbaum wrote that AI applications can not, by definition, successfully simulate genuine human empathy and that the use of AI technology in fields such as customer service or psychotherapy was deeply misguided. Weizenbaum was also bothered that AI researchers (and some philosophers) were willing to view the human mind as nothing more than a computer program (a position now known as computationalism). To Weizenbaum these points suggest that AI research devalues human life.
Decrease in demand for human labor
Martin Ford, author of The Lights in the Tunnel: Automation, Accelerating Technology and the Economy of the Future, and others argue that specialized artificial intelligence applications, robotics and other forms of automation will ultimately result in significant unemployment as machines begin to match and exceed the capability of workers to perform most routine and repetitive jobs. Ford predicts that many knowledge-based occupations—and in particular entry level jobs—will be increasingly susceptible to automation via expert systems, machine learning and other AI-enhanced applications. AI-based applications may also be used to amplify the capabilities of low-wage offshore workers, making it more feasible to outsource knowledge work.
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.
There are no objective criteria for knowing whether an intelligent agent is sentient – that it has conscious experiences. We assume that other people do because we do and they tell us that they do, but this is only a subjective determination. The lack of any hard criteria is known as the "hard problem" in the theory of consciousness. The problem applies not only to other people but to the higher animals and, by extension, to AI agents.
Computationalism is the idea that "the human mind or the human brain (or both) is an information processing system and that thinking is a form of computing". AI, or implementing machines with human intelligence was founded on the claim that "a central property of humans, intelligence can be so precisely described that a machine can be made to simulate it". A program can then be derived from this human computer and implemented into an artificial one to create efficient artificial intelligence. This program would act upon a set of outputs that result from set inputs of the internal memory of the computer, that is, the machine can only act with what it has implemented in it to start with. A long term goal for AI researchers is to provide machines with a deep understanding of the many abilities of a human being to replicate a general intelligence or STRONG AI, defined as a machine surpassing human abilities to perform the skills implanted in it, a scary thought to many, who fear losing control of such a powerful machine. Obstacles for researchers are mainly time contstraints. That is, AI scientists cannot establish much of a database for commonsense knowledge because it must be ontologically crafted into the machine which takes up a tremendous amount of time. To combat this, AI research looks to have the machine able to understand enough concepts in order to add to its own ontology, but how can it do this when machine ethics is primarily concerned with behavior of machines towards humans or other machines, limiting the extent of developing AI. In order to function like a common human AI must also display, "the ability to solve subsymbolic commonsense knowledge tasks such as how artists can tell statues are fake or how chess masters don’t move certain spots to avoid exposure," but by developing machines who can do it all AI research is faced with the difficulty of potentially putting a lot of people out of work, while on the economy side of things businesses would boom from efficiency, thus forcing AI into a bottleneck trying to developing self improving machines.
Strong AI hypothesis
Searle's strong AI hypothesis states that "The appropriately programmed computer with the right inputs and outputs would thereby have a mind in exactly the same sense human beings have minds." John 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.
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. The subject is profoundly discussed in the 2010 documentary film Plug & Pray.
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.
If research into Strong AI produced sufficiently intelligent software, it might be able to reprogram and improve itself. The improved software would be even better at improving itself, leading to recursive self-improvement. The new intelligence could thus increase exponentially and dramatically surpass humans. Science fiction writer Vernor Vinge named this scenario "singularity". Technological singularity is when accelerating progress in technologies will cause a runaway effect wherein artificial intelligence will exceed human intellectual capacity and control, thus radically changing or even ending civilization. Because the capabilities of such an intelligence may be impossible to comprehend, the technological singularity is an occurrence beyond which events are unpredictable or even unfathomable.
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.
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
- What Is AI? – An introduction to artificial intelligence by John McCarthy—a co-founder of the field, and the guy who coined the term.
- The Handbook of Artificial Intelligence Volume Ⅰ by Avron Barr and Edward A. Feigenbaum (Stanford University)
- Artificial Intelligence entry in the Internet Encyclopedia of Philosophy
- Logic and Artificial Intelligence entry by Richmond Thomason in the Stanford Encyclopedia of Philosophy
- AI at 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.
- TechCast Article Series, John Sagi, Framing Consciousness
- Boden, Margaret, Mind As Machine, Oxford University Press, 2006
- Johnston, John (2008) "The Allure of Machinic Life: Cybernetics, Artificial Life, and the New AI", MIT Press
- Myers, Courtney Boyd ed. (2009). The AI Report. Forbes June 2009
- Sun, R. & Bookman, L. (eds.), Computational Architectures: Integrating Neural and Symbolic Processes. Kluwer Academic Publishers, Needham, MA. 1994.
- BibTex Archived 2 March 1997 at the Wayback Machine.
- Cited by Tao & Tan 2005.
- Presidential Address to the Association for the Advancement of Artificial Intelligence.
Later published as
History of AI
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.
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
- Although there is some controversy on this point (see Crevier (1993, p. 50)), McCarthy states unequivocally "I came up with the term" in a c|net interview. (Skillings 2006) McCarthy first used the term in the proposal for the Dartmouth conference, which appeared in 1955. (McCarthy et al. 1955)
McCarthy's definition of AI:
- McCarthy 2007
- 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."
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
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 McCorduck 2004, pp. 340–400)
- The optimism referred to includes the predictions of early AI researchers (see optimism in the history of AI) as well as the ideas of modern transhumanists such as Ray Kurzweil.
- The "setbacks" referred to include the ALPAC report of 1966, the abandonment of perceptrons in 1970, the Lighthill Report of 1973 and the collapse of the Lisp machine market in 1987.
AI applications widely used behind the scenes:
- Russell & Norvig 2003, p. 28
- Kurzweil 2005, p. 265
- NRC 1999, pp. 216–222
AI in myth:
- McCorduck 2004, pp. 4–5
- Russell & Norvig 2003, p. 939
Cult images as artificial intelligence:
- Crevier (1993, p. 1) (statue of Amun)
- McCorduck (2004, pp. 6–9)
- Needham 1986, p. 53
- McCorduck 2004, p. 6
- McCorduck 2004, p. 17
Jābir ibn Hayyān's Takwin:
- O'Connor 1994
- McCorduck 2004, pp. 15–16
- Buchanan 2005, p. 50
- McCorduck 2004, pp. 13–14
AI in early science fiction.
- McCorduck 2004, pp. 17–25
- This insight, that digital computers can simulate any process of formal reasoning, is known as the Church–Turing thesis.
AI's immediate precursors:
- McCorduck 2004, pp. 51–107
- Crevier 1993, pp. 27–32
- Russell & Norvig 2003, pp. 15, 940
- Moravec 1988, p. 3
- 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 and Norvig write "it was astonishing whenever a computer did anything kind of smartish." Russell & Norvig 2003, p. 18
"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
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
- Optimism of early AI:
- See The problems (in History of artificial intelligence)
- Lighthill 1973.
First AI Winter, Mansfield Amendment, Lighthill report
- Crevier 1993, pp. 115–117
- Russell & Norvig 2003, p. 22
- NRC 1999, pp. 212–213
- Howe 1994
- 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
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
Second AI winter:
- McCorduck 2004, pp. 430–435
- Crevier 1993, pp. 209–210
- NRC 1999, pp. 214–216
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.
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
- 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)
- 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
- Russell & Norvig 2003, pp. 260–266,
- Poole, Mackworth & Goebel 1998, pp. 199–233,
- Nilsson 1998, chpt. ~17.1–17.4
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
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
- Poole, Mackworth & Goebel 1998, pp. 335–337
Representing knowledge about knowledge: Belief calculus, modal logics:
- Russell & Norvig 2003, pp. 341–344,
- Poole, Mackworth & Goebel 1998, pp. 275–277
- Russell & Norvig 2003, pp. 320–328
- McCarthy & Hayes 1969
- Russell & Norvig 2003
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
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.)
- 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
Information value theory:
- Russell & Norvig 2003, pp. 600–604
- 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
- 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."
- 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
- 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)
- Russell & Norvig 2003, pp. 763–788
- Luger & Stubblefield 2004, pp. 442–449
Computational learning theory:
- CITATION IN PROGRESS.
- 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", 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
- Russell & Norvig 2003, pp. 537–581, 863–898
- Nilsson 1998, ~chpt. 6
- ACM 1998, I.2.10
- Russell & Norvig 2003, pp. 863–898
- Nilsson 1998, chpt. 6
- ACM 1998, ~I.2.7
- Russell & Norvig 2003, pp. 568–578
- Russell & Norvig 2003, pp. 885–892
- ACM 1998, I.2.9,
- Russell & Norvig 2003, pp. 901–942,
- Poole, Mackworth & Goebel 1998, pp. 443–460
Moving and configuration space:
- Russell & Norvig 2003, pp. 916–932
- Tecuci 2012.
Robotic mapping (localization, etc):
- Russell & Norvig 2003, pp. 908–915
- 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
- Gerald Edelman, Igor Aleksander and others have argued that artificial consciousness is required for strong AI. (Aleksander 1995; Edelman 2007)
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
- Moravec 1988
- Kurzweil 2005, p. 262
- Hawkins & Blakeslee 2005
- AI complete: Shapiro 1992, p. 9
- Nils Nilsson writes: "Simply put, there is wide disagreement in the field about what AI is all about" (Nilsson 1983, p. 10).
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 accomplioshed, 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". 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:
- McCorduck 2004, pp. 421–424, 486–489
- Crevier 1993, pp. 168
- Nilsson 1983, pp. 10–11
Symbolic vs. sub-symbolic AI:
- Nilsson (1998, p. 7), who uses the term "sub-symbolic".
- Haugeland 1985, p. 255.
- Law 1994.
- Bach 2008.
- 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
- 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
- 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
- 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
- IEEE Computational Intelligence Society
- Hutter 2012.
- Langley 2011.
- Katz 2012.
- Norvig 2012.
Agent architectures, hybrid intelligent systems:
- Russell & Norvig (2003, pp. 27, 932, 970–972)
- Nilsson (1998, chpt. 25)
Hierarchical control system:
- Albus 2002
- CITATION IN PROGRESS.
- 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
- 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.
- ACM 1998, ~I.2.3,
- Russell & Norvig 2003, pp. 194–310,
- Luger & Stubblefield 2004, pp. 35–77,
- Nilsson 1998, chpt. 13–16
- 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
- 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
- Russell & Norvig 2003, pp. 526–527
- CITATION IN PROGRESS.
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
- 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
Stochastic temporal models:
- Russell & Norvig 2003, pp. 537–581
- Russell & Norvig 2003, pp. 551–557
- (Russell & Norvig 2003, pp. 549–551)
- 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
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
- Russell & Norvig 2003, pp. 653–664,
- Poole, Mackworth & Goebel 1998, pp. 403–408,
- Luger & Stubblefield 2004, pp. 408–417
- van der Walt & Bernard 2006
- Russell & Norvig 2003, pp. 744–748,
- Luger & Stubblefield 2004, pp. 467–474,
- Nilsson 1998, chpt. 3.3
Feedforward neural networks, perceptrons and radial basis networks:
- Russell & Norvig 2003, pp. 739–748, 758
- Luger & Stubblefield 2004, pp. 458–467
Recurrent neural networks, Hopfield nets:
- Russell & Norvig 2003, p. 758
- Luger & Stubblefield 2004, pp. 474–505
Competitive learning, Hebbian coincidence learning, Hopfield networks and attractor networks:
- Luger & Stubblefield 2004, pp. 474–505
Hierarchical temporal memory:
- Hawkins & Blakeslee 2005
- Hinton 2007.
- ACM 1998, ~I.2.8,
- Russell & Norvig 2003, pp. 926–932
- Luger & Stubblefield 2004, pp. 723–821
- Crevier 1993, pp. 59–62,
- Russell & Norvig 2003, p. 18
- Poole, Mackworth & Goebel 1998, pp. 477–491,
- Luger & Stubblefield 2004, pp. 641–676, 575–581
The Turing test:
Turing's original publication:
- Turing 1950
- Haugeland 1985, pp. 6–9
- Crevier 1993, p. 24
- McCorduck 2004, pp. 70–71
- Russell & Norvig 2003, pp. 2–3 and 948
Subject matter expert Turing test:
- CITATION IN PROGRESS.
- Rajani 2011.
- CITATION IN PROGRESS.
Mathematical definitions of intelligence:
- Hernandez-Orallo 2000
- Dowe & Hajek 1997
- Hernandez-Orallo & Dowe 2010
- O'Brien & Marakas 2011.
- Kumar & Kumar 2012
- Brooks 1991.
- 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
- Lucas 1961
- Penrose 1989
- Turing 1950 under "(2) The Mathematical Objection"
- Hofstadter 1979
- Gödel 1931, Church 1936, Kleene 1935, Turing 1937
- Beyond the Doubting of a Shadow, A Reply to Commentaries on Shadows of the Mind, Roger Penrose 1996 The links to the original articles he responds to there are easily found in the Wayback machine: Can Physics Provide a Theory of Consciousness? Barnard J. Bars, Penrose's Gödelian Argument etc.
- Wendell Wallach (2010). Moral Machines, Oxford University Press.
- Wallach, pp 37–54.
- Wallach, pp 55–73.
- Wallach, Introduction chapter.
- Michael Anderson and Susan Leigh Anderson (2011), Machine Ethics, Cambridge University Press.
- 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
AI could decrease the demand for human labor:
- Russell & Norvig 2003, pp. 960–961
- 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.
- Russell & Norvig 2003, pp. 958–960
- McCorduck 2004, pp. 443–445
- Crevier 1993, pp. 269–271
- Russell & Norvig 2003, p. 964
- 2006BBC News
- Henderson 2007
- Vinge 1993
- Kurzweil 2005
- Russell & Norvig 2003, p. 963
- 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
Since then, AI has become firmly rooted in popular culture.
The implications of artificial intelligence have been a persistent theme in science fiction. 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 which he subsequently explored in a long series of robot stories. These laws have since gained some traction in genuine AI research.
The possibility that Artificial Intelligence may come to be a threat to mankind cannot be eliminated, should new discoveries be made, but with regards to current research, there is little evidence for the possibility of a superintelligent computer coming into existence at all.
There is also no connection between superintelligence and the desire to destroy all of humanity. It is unclear where this assumption comes from, as the logical conclusion would be to assist humanity. This irrational belief in the inherent malevolence and hostility of artificial intelligence may be the result of human guilt or ignorance, and its causes should be further explored.
Development of militarized artificial intelligence is a cause for concern. Currently 50 countries are in the process of researching and developing battlefield robots. Among them are major powers such as the United States, China, Russia, and the United Kingdom. The Google-owned company Boston Dynamics has already created Atlas, a 6 foot tall humanoid robot capable of moving across rugged terrain. Bill Gates has stated that this advancement in technology is a major threat. According to Gates, the next ten years will show big improvements in visual and speech understanding in computers, and combined with the increased mobility of machines like Atlas, will lead to extensive use of machines. Elon Musk combats this threat by supporting research of artificial intelligence. 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. He also funds companies developing artificial intelligence such as Google DeepMind and Vicarious in order to “just keep an eye on what’s going on with artificial intelligence. I think there is potentially a dangerous outcome there.”
The belief in the rise of Artificial Intelligence heightened during the mid-twentieth century. The rate at which technological advances were being made lead to the assumption of the possibility of man being able to create intelligence that could rival his own. But after decades of research, a notable example, Simon and Newell’s General Problem Solver, the only “intelligence” computers have been able to display is that of logical or mathematical problem solving, puzzles and theorems and pattern recognition. At this, AI has proven to be very effective. However, complex real-world problems remain well beyond the grasp of computers. Humans themselves have been unable to solve these issues and so cannot program something to do the same. They cannot provide it with the instructions it must follow or even delineate the goals it must achieve. Technology as it now exists can only work with what it is given. Superintelligence is certainly impossible if something lacks the capacity to do more than perform computations and store and organize information.
No matter how advanced a machine is, it cannot rely on itself, or another machine, for repairs and assistance. Humanity, therefore, is necessary for the preservation of artificial intelligence. A supercomputer that extinguished humanity would be extinguishing itself. Such a computer, with above-human intelligence, would undoubtedly realize this, and keep humanity alive to ensure the perpetuation of its kind. Some argue that other machines could be built to aid these computers, but those machines in turn would need repairs. The creation of self-service machines is impossible for the foreseeable future, making it impossible for artificial intelligence to exist without humanity.
However, for AIs to pose a threat, AIs must be superintelligent, meaning they have to surpass the intelligence of modern humans. While many people in the technological and scientific world, such as Bostrom, find this threat very plausible, much scientific evidence proves otherwise. Current AIs have neither the capacity to surpass our intelligence nor the ability to come together and find the initiative to undermine mankind. In order to exceed human intelligence, computers would first have to achieve human intelligence – a feat which would be very difficult. For a computer to mimic on the human brain, its processors would need to be based on neurons, which are extremely intricate and variable. Modeling a computer after another computer is simple – the processes simply must be copied. The human brain, however, cannot simply be copied, and any slight error or miscalculation would result in a wildly inaccurate product.
An AI's capacity for malevolence would be dependent upon a capacity to match human intelligence and evolve and develop intelligence of its own. A Seattle AI system has been made intelligent enough to answer the average 11th grade SAT questions. This would exhibit the potential for the AI to possess a degree of human-level intelligence, a prerequisite for its ability to evolve and potentially take over mankind.
In his book, Superintelligence, Nick Bostrom provides a detailed argument for the threat Artificial Intelligence may prove to mankind. He states that there are a series of phases as to how an AI system can achieve world dominance. The Pre-Criticality Phase entails the creation of the seed AI. The seed AI is dependent from human intervening and can improve its own intelligence until it reaches phase two, the Recursive Self-Improvement Phase. In this phase, the AI becomes better at designing itself than the human programmers are capable of - surpassing human intelligence itself. In phase two, the AI could develop such superpowers such as (1) intelligence amplification (2) strategizing (3) social manipulation and (4) hacking. After a phase two, the AI could reach the Covert Preparation Phase, where it uses its new skills of strategizing to achieve more long term goals. It may begin to mask their abilities. Thus, the AI reaches a final phase 4, the Overt Implementation Phase which is when the AI might “strike” and cause threat, eliminating the human species and any opposition humans may have set forth to prepare. A possibility of the destruction that could ensue would be major habitat destruction. A major aspect of an AI being a threat to mankind stems from its magnitude of capability to destroy compared to other agents with possibly different goals..Elon Musk and ,Bill Gates, Stephen HawkingA common concern about the development of artificial intelligence is the potential threat it could pose to mankind, possibly to its very existence. The issue has come to gain popular attention, especially in light of concerns expressed by individuals such as
"The development of full artificial intelligence could spell the end of the human race." -Stephen Hawking
In the 1980s artist 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.
. Dune and the science-fiction series Ghost in the Shell manga, has been illustrated in fiction as well, for example in the Robert Ettinger and Aldous Huxley, which has roots in transhumanism This idea, called