"AI" redirects here. For other uses, see
Ai.
Artificial intelligence (AI) is the intelligence of machines and the branch of computer science that aims to create it. AI textbooks define the field as "the study and design of intelligent agents"[1] where an intelligent agent is a system that perceives its environment and takes actions that maximize its chances of success.[2] John McCarthy, who coined the term in 1955,[3] defines it as "the science and engineering of making intelligent machines."[4]
AI research is highly technical and specialized, deeply divided into subfields that often fail to communicate with each other.[5] 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. There are subfields which are focussed on the solution of specific problems, on one of several possible approaches, on the use of widely differing tools and towards the accomplishment of particular applications. The central problems of AI include such traits as reasoning, knowledge, planning, learning, communication, perception and the ability to move and manipulate objects.[6] General intelligence (or "strong AI") is still among the field's long term goals.[7] Currently popular approaches include statistical methods, computational intelligence and traditional symbolic AI. There are an enormous number of tools used in AI, including versions of search and mathematical optimization, logic, methods based on probability and economics, and many others.
The field was founded on the claim that a central property of humans, intelligence—the sapience of Homo sapiens—can be so precisely described that it can be simulated by a machine.[8] This raises philosophical issues about the nature of the mind and the ethics of creating artificial beings, issues which have been addressed by myth, fiction and philosophy since antiquity.[9] Artificial intelligence has been the subject of optimism,[10] but has also suffered setbacks[11] and, today, has become an essential part of the technology industry, providing the heavy lifting for many of the most difficult problems in computer science.[12]
Thinking machines and artificial beings appear in Greek myths, such as Talos of Crete, the bronze robot of Hephaestus, and Pygmalion's Galatea.[13] Human likenesses believed to have intelligence were built in every major civilization: animated cult images were worshipped in Egypt and Greece[14] and humanoid automatons were built by Yan Shi, Hero of Alexandria and Al-Jazari.[15] It was also widely believed that artificial beings had been created by Jābir ibn Hayyān, Judah Loew and Paracelsus.[16] By the 19th and 20th centuries, artificial beings had become a common feature in fiction, as in Mary Shelley's Frankenstein or Karel Čapek's R.U.R. (Rossum's Universal Robots).[17] Pamela McCorduck argues that all of these are examples of an ancient urge, as she describes it, "to forge the gods".[9] 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 (imaginable) act of mathematical deduction.[18][19] 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.[20]
The field of AI research was founded at a conference on the campus of Dartmouth College in the summer of 1956.[21] The attendees, including John McCarthy, Marvin Minsky, Allen Newell and Herbert Simon, became the leaders of AI research for many decades.[22] They and their students wrote programs that were, to most people, simply astonishing:[23] Computers were solving word problems in algebra, proving logical theorems and speaking English.[24] By the middle of the 1960s, research in the U.S. was heavily funded by the Department of Defense[25] and laboratories had been established around the world.[26] 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".[27]
They had failed to recognize the difficulty of some of the problems they faced.[28] 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, when funding for projects was hard to find, would later be called the "AI winter".[29]
In the early 1980s, AI research was revived by the commercial success of expert systems,[30] 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.[31] 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.[32]
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.[12] 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.[33]
On 11 May 1997, Deep Blue became the first computer chess-playing system to beat a reigning world chess champion, Garry Kasparov.[34] In 2005, a Stanford robot won the DARPA Grand Challenge by driving autonomously for 131 miles along an unrehearsed desert trail.[35] Two years later, a team from CMU won the DARPA Urban Challenge when their vehicle autonomously navigated 55 miles in an Urban environment while adhering to traffic hazards and all traffic laws.[36] 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.[37]
The leading-edge definition of artificial intelligence research is changing over time. One pragmatic definition is: "AI research is that which computing scientists do not know how to do cost-effectively today." For example, in 1956 optical character recognition (OCR) was considered AI, but today, sophisticated OCR software with a context-sensitive spell checker and grammar checker software comes for free with most image scanners. No one would any longer consider already-solved computing science problems like OCR "artificial intelligence" today.
Low-cost entertaining chess-playing software is commonly available for tablet computers. DARPA no longer provides significant funding for chess-playing computing system development. The Kinect which provides a 3D body–motion interface for the Xbox 360 uses algorithms that emerged from lengthy AI research,[38] but few consumers realize the technology source.
AI applications are no longer the exclusive domain of U.S. Department of Defense R&D, but are now commonplace consumer items and inexpensive intelligent toys.
In common usage, the term "AI" no longer seems to apply to off-the-shelf solved computing-science problems, which may have originally emerged out of years of AI research.
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.[6]
Early AI researchers developed algorithms that imitated the step-by-step reasoning that humans use when they solve puzzles or make logical deductions.[39] By the late 1980s and '90s, AI research had also developed highly successful methods for dealing with uncertain or incomplete information, employing concepts from probability and economics.[40]
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.[41]
Human beings solve most of their problems using fast, intuitive judgments rather than the conscious, step-by-step deduction that early AI research was able to model.[42] 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 human and animal brains that give rise to this skill; statistical approaches to AI mimic the probabilistic nature of the human ability to guess.
An ontology represents knowledge as a set of concepts within a domain and the relationships between those concepts.
Knowledge representation[43] and knowledge engineering[44] 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;[45] situations, events, states and time;[46] causes and effects;[47] knowledge about knowledge (what we know about what other people know);[48] and many other, less well researched domains. A representation of "what exists" is an ontology (borrowing a word from traditional philosophy), of which the most general are called upper ontologies.[49]
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[50] 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.[51]
- 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.[52] 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"[53] or an art critic can take one look at a statue and instantly realize that it is a fake.[54] These are intuitions or tendencies that are represented in the brain non-consciously and sub-symbolically.[55] 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.[55]
Intelligent agents must be able to set goals and achieve them.[56] 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.[57]
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.[58] 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.[59]
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.[60]
Machine learning[61] has been central to AI research from the beginning.[62] In 1956, at the original Dartmouth AI summer conference, Ray Solomonoff wrote a report on unsupervised probabilistic machine learning: "An Inductive Inference Machine".[63] 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[64] the agent is rewarded for good responses and punished for bad ones. These 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.[65]
Natural language processing[66] 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 Internet texts. Some straightforward applications of natural language processing include information retrieval (or text mining) and machine translation.[67]
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 users input much more efficient.
The field of robotics[68] is closely related to AI. Intelligence is required for robots to be able to handle such tasks as object manipulation[69] and navigation, with sub-problems of localization (knowing where you are), mapping (learning what is around you) and motion planning (figuring out how to get there).[70]
Machine perception[71] is the ability to use input from sensors (such as cameras, microphones, sonar and others more exotic) to deduce aspects of the world. Computer vision[72] is the ability to analyze visual input. A few selected subproblems are speech recognition,[73] facial recognition and object recognition.[74]
Kismet, a robot with rudimentary social skills
[75]
Affective computing is the study and development of systems and devices that can recognize, interpret, process, and simulate human affects.[76][77] It is an interdisciplinary field spanning computer sciences, psychology, and cognitive science.[78] While the origins of the field may be traced as far back as to early philosophical enquiries into emotion,[79] the more modern branch of computer science originated with Rosalind Picard's 1995 paper[80] on affective computing.[81][82] 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[83] 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 imagination.[citation needed]
Main articles:
Strong AI and
AI-completeMost researchers hope 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.[7] A few believe that anthropomorphic features like artificial consciousness or an artificial brain may be required for such a project.[84][85]
Many of the problems above are considered AI-complete: to solve one problem, you must solve them all. For example, even a straightforward, specific task like machine translation requires that the machine follow the author's argument (reason), know what is being talked about (knowledge), and faithfully reproduce the author's intention (social intelligence). Machine translation, therefore, is believed to be AI-complete: it may require strong AI to be done as well as humans can do it.[86]
There is no established unifying theory or paradigm that guides AI research. Researchers disagree about many issues.[87] 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?[88] 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?[89] Can intelligence be reproduced using high-level symbols, similar to words and ideas? Or does it require "sub-symbolic" processing?[90] 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,[91] a term which has since been adopted by some non-GOFAI researchers.[92][93]
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.[20] 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: CMU, 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".[94] 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.[95] 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 80s.[96][97]
- 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.[88] His laboratory at Stanford (SAIL) focused on using formal logic to solve a wide variety of problems, including knowledge representation, planning and learning.[98] Logic was also 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.[99]
- "Anti-logic" or "scruffy"
- Researchers at MIT (such as Marvin Minsky and Seymour Papert)[100] 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).[89] 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.[101]
- Knowledge-based
- When computers with large memories became available around 1970, researchers from all three traditions began to build knowledge into AI applications.[102] This "knowledge revolution" led to the development and deployment of expert systems (introduced by Edward Feigenbaum), the first truly successful form of AI software.[30] 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.[90]
- 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.[103] Their work revived the non-symbolic viewpoint of the early cybernetics researchers of the 50s 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
- Interest in neural networks and "connectionism" was revived by David Rumelhart and others in the middle 1980s.[104] These and other sub-symbolic approaches, such as fuzzy systems and evolutionary computation, are now studied collectively by the emerging discipline of computational intelligence.[105]
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."[33] Critiques argue that these techniques are too focussed on particular problems and have failed to address the long term goal of general intelligence.[106]
- 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.[2]
- Agent architectures and cognitive architectures
- Researchers have designed systems to build intelligent systems out of interacting intelligent agents in a multi-agent system.[107] 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.[108] Rodney Brooks' subsumption architecture was an early proposal for such a hierarchical system.[109]
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.
Many problems in AI can be solved in theory by intelligently searching through many possible solutions:[110] 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.[111] Planning algorithms search through trees of goals and subgoals, attempting to find a path to a target goal, a process called means-ends analysis.[112] Robotics algorithms for moving limbs and grasping objects use local searches in configuration space.[69] Many learning algorithms use search algorithms based on optimization.
Simple exhaustive searches[113] 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.[114]
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.[115]
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)[116] and evolutionary algorithms (such as genetic algorithms and genetic programming).[117]
Logic[118] 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[119] and inductive logic programming is a method for learning.[120]
Several different forms of logic are used in AI research. Propositional or sentential logic[121] is the logic of statements which can be true or false. First-order logic[122] also allows the use of quantifiers and predicates, and can express facts about objects, their properties, and their relations with each other. Fuzzy logic,[123] 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[124] 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[51] 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;[45] situation calculus, event calculus and fluent calculus (for representing events and time);[46] causal calculus;[47] belief calculus; and modal logics.[48]
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.[125]
Bayesian networks[126] are a very general tool that can be used for a large number of problems: reasoning (using the Bayesian inference algorithm),[127] learning (using the expectation-maximization algorithm),[128] planning (using decision networks)[129] and perception (using dynamic Bayesian networks).[130] 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).[130]
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,[131] information value theory.[57] These tools include models such as Markov decision processes,[132] dynamic decision networks,[130] game theory and mechanism design.[133]
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.[134]
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,[135] kernel methods such as the support vector machine,[136] k-nearest neighbor algorithm,[137] Gaussian mixture model,[138] naive Bayes classifier,[139] and decision tree.[140] 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.[141]
A neural network is an interconnected group of nodes, akin to the vast network of
neurons in the
human brain.
The study of artificial neural networks[135] began in the decade before the field 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.[142]
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.[143] Among recurrent networks, the most famous is the Hopfield net, a form of attractor network, which was first described by John Hopfield in 1982.[144] Neural networks can be applied to the problem of intelligent control (for robotics) or learning, using such techniques as Hebbian learning and competitive learning.[145]
Hierarchical temporal memory is an approach that models some of the structural and algorithmic properties of the neocortex.[146]
Control theory, the grandchild of cybernetics, has many important applications, especially in robotics.[147]
AI researchers have developed several specialized languages for AI research, including Lisp[148] and Prolog.[149]
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.[150]
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.[151]
The broad classes of outcome for an AI test are[152]:
- 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 is optimal,[153] performance at chess is super-human and nearing strong super-human (see Computer chess#Computers versus humans) 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.[154] Two major advantages of mathematical definitions are their applicability to nonhuman intelligences and their absence of a requirement for human testers.
An
automated online assistant providing customer service on a web page – one of many very primitive applications of artificial intelligence.
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.[155]
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, driverless 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[156] 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.[157]
Artificial intelligence, by claiming to be able to recreate the capabilities of the human mind, is both a challenge and an inspiration for philosophy. Are there limits to how intelligent machines can be? Is there an essential difference between human intelligence and artificial intelligence? Can a machine have a mind and consciousness? A few of the most influential answers to these questions are given below.[158]
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.[150]
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.[159]
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 intelligences consist of formal operations on symbols.[160] 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.)[161][162]
Gödel's incompleteness theorem: A formal system (such as a computer program) cannot prove all true statements.[163] Roger Penrose is among those who claim that Gödel's theorem limits what machines can do. (See The Emperor's New Mind.)[164]
Searle's strong AI hypothesis: "The appropriately programmed computer with the right inputs and outputs would thereby have a mind in exactly the same sense human beings have minds."[165] 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.[166]
The artificial brain argument: The brain can be simulated. 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.[85]
Artificial Intelligence is a common topic in both science fiction and projections about the future of technology and society. The existence of an artificial intelligence that rivals human intelligence raises difficult ethical issues, and the potential power of the technology inspires both hopes and fears.
In fiction, Artificial Intelligence has appeared fulfilling many roles, including a servant (R2D2 in Star Wars), a law enforcer (K.I.T.T. "Knight Rider"), a comrade (Lt. Commander Data in Star Trek: The Next Generation), a conqueror/overlord (The Matrix), a dictator (With Folded Hands), a benevolent provider/de facto ruler (The Culture), an assassin (Terminator), a sentient race (Battlestar Galactica/Transformers/Mass Effect), an extension to human abilities (Ghost in the Shell) and the savior of the human race (R. Daneel Olivaw in Isaac Asimov's Robot series).
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, including the films I Robot, Blade Runner and A.I.: Artificial Intelligence, in which humanoid machines have the ability to feel human 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.[167] The subject is profoundly discussed in the 2010 documentary film Plug & Pray.[168]
Martin Ford, author of The Lights in the Tunnel: Automation, Accelerating Technology and the Economy of the Future,[169] 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[170] 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.[171]
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[172] 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.[173]
Many futurists believe that artificial intelligence will ultimately transcend the limits of progress. 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. He also predicts that by 2045 artificial intelligence will reach a point where it is able to improve itself at a rate that far exceeds anything conceivable in the past, a scenario that science fiction writer Vernor Vinge named the "singularity".[174]
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.[175] 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.
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.[176]
Pamela McCorduck writes that all these scenarios are expressions of the ancient human desire to, as she calls it, "forge the gods".[9]
- ^ Definition of AI as the study of intelligent agents:
- ^ a b The intelligent agent paradigm:
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.
- ^ 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's definition of AI:
- ^ 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 This list of intelligent traits is based on the topics covered by the major AI textbooks, including:
- ^ a b General intelligence (strong AI) is discussed in popular introductions to AI:
- ^ See the Dartmouth proposal, under Philosophy, below.
- ^ a b c This is a central idea of Pamela McCorduck's Machines That 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)
- ^ 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.
- ^ a b AI applications widely used behind the scenes:
- ^ AI in myth:
- ^ Cult images as artificial intelligence:
These were the first machines to be believed to have true intelligence and consciousness. Hermes Trismegistus expressed the common belief that with these statues, craftsman had reproduced "the true nature of the gods", their sensus and spiritus. McCorduck makes the connection between sacred automatons and Mosaic law (developed around the same time), which expressly forbids the worship of robots (McCorduck 2004, pp. 6–9)
- ^ Humanoid automata:
Yan Shi:
Hero of Alexandria:
Al-Jazari:
Wolfgang von Kempelen:
- ^ Artificial beings:
Jābir ibn Hayyān's Takwin:
Judah Loew's Golem:
Paracelsus' Homunculus:
- ^ AI in early science fiction.
- ^ This insight, that digital computers can simulate any process of formal reasoning, is known as the Church–Turing thesis.
- ^ Formal reasoning:
- ^ a b AI's immediate precursors:
See also Cybernetics and early neural networks (in History of artificial intelligence). Among the researchers who laid the foundations of AI were Alan Turing, John Von Neumann, Norbert Wiener, Claude Shannon, Warren McCullough, Walter Pitts and Donald Hebb.
- ^ Dartmouth conference:
- ^ Hegemony of the Dartmouth conference attendees:
- ^ 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):
The programs described are 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:
- ^ AI in England:
- ^ Optimism of early AI:
- ^ See The problems (in History of artificial intelligence)
- ^ First AI Winter, Mansfield Amendment, Lighthill report
- ^ 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
- ^ Boom of the 1980s: rise of expert systems, Fifth Generation Project, Alvey, MCC, SCI:
- ^ Second AI winter:
- ^ a b Formal methods are now preferred ("Victory of the neats"):
- ^ McCorduck 2004, pp. 480–483
- ^ DARPA Grand Challenge – home page
- ^ "Welcome". Archive.darpa.mil. http://archive.darpa.mil/grandchallenge/. Retrieved 31 October 2011.
- ^ Markoff, John (16 February 2011). "On 'Jeopardy!' Watson Win Is All but Trivial". The New York Times. http://www.nytimes.com/2011/02/17/science/17jeopardy-watson.html.
- ^ Kinect's AI breakthrough explained
- ^ 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:
- ^ Intractability and efficiency and the combinatorial explosion:
- ^ Psychological evidence of sub-symbolic reasoning:
- ^ 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:
- ^ a b Representing categories and relations: Semantic networks, description logics, inheritance (including frames and scripts):
- ^ a b Representing events and time:Situation calculus, event calculus, fluent calculus (including solving the frame problem):
- ^ a b Causal calculus:
- ^ a b Representing knowledge about knowledge: Belief calculus, modal logics:
- ^ Ontology:
- ^ Qualification problem:
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"):
- ^ Breadth of commonsense knowledge:
- ^ Dreyfus & Dreyfus 1986
- ^ Gladwell 2005
- ^ a b Expert knowledge as embodied intuition:
- ^ 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:
- ^ Classical planning:
- ^ Planning and acting in non-deterministic domains: conditional planning, execution monitoring, replanning and continuous planning:
- ^ Multi-agent planning and emergent behavior:
- ^ 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
- ^ Alan Turing discussed the centrality of learning as early as 1950, in his classic paper Computing Machinery and Intelligence. (Turing 1950)
- ^ (pdf scanned copy of the original) (version published in 1957, An Inductive Inference Machine," IRE Convention Record, Section on Information Theory, Part 2, pp. 56–62)
- ^ Reinforcement learning:
- ^ Computational learning theory:
- ^ Natural language processing:
- ^ Applications of natural language processing, including information retrieval (i.e. text mining) and machine translation:
- ^ Robotics:
- ^ a b Moving and configuration space:
- ^ Robotic mapping (localization, etc):
- ^ Machine perception:
- ^ Computer vision:
- ^ Speech recognition:
- ^ Object recognition:
- ^ "Kismet". MIT Artificial Intelligence Laboratory, Humanoid Robotics Group. http://www.ai.mit.edu/projects/humanoid-robotics-group/kismet/kismet.html.
- ^ Thro, Ellen (1993). Robotics. New York.
- ^ Edelson, Edward (1991). The Nervous System. New York: Remmel Nunn.
- ^ Tao, Jianhua; Tieniu Tan (2005). "Affective Computing: A Review". Affective Computing and Intelligent Interaction. LNCS 3784. Springer. pp. 981–995. DOI:10.1007/11573548.
- ^ James, William (1884). "What is Emotion". Mind 9: 188–205. DOI:10.1093/mind/os-IX.34.188. Cited by Tao and Tan.
- ^ "Affective Computing" MIT Technical Report #321 (Abstract), 1995
- ^ Kleine-Cosack, Christian (October 2006). "Recognition and Simulation of Emotions" (PDF). Archived from the original on May 28, 2008. http://web.archive.org/web/20080528135730/http://ls12-www.cs.tu-dortmund.de/~fink/lectures/SS06/human-robot-interaction/Emotion-RecognitionAndSimulation.pdf. Retrieved May 13, 2008. "The introduction of emotion to computer science was done by Pickard (sic) who created the field of affective computing."
- ^ Diamond, David (December 2003). "The Love Machine; Building computers that care". Wired. http://www.wired.com/wired/archive/11.12/love.html. Retrieved May 13, 2008. "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:
- ^ Gerald Edelman, Igor Aleksander and others have both 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
A few of the people who make some form of the argument:
The most extreme form of this argument (the brain replacement scenario) was put forward by Clark Glymour in the mid-70s and was touched on by Zenon Pylyshyn and John Searle in 1980.
- ^ 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).
- ^ a b 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 McCathy's indifference to biological models. Kolata quotes McCarthy as writing: "This is AI, so we don't care if it's psychologically real"[1]. 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 Neats vs. scruffies:
- ^ a b Symbolic vs. sub-symbolic AI:
- ^ Haugeland 1985, p. 255.
- ^ http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.38.8384&rep=rep1&type=pdf
- ^ Pei Wang (2008). Artificial general intelligence, 2008: proceedings of the First AGI Conference. IOS Press. p. 63. ISBN 978-1-58603-833-5. http://books.google.com/books?id=a_ZR81Z25z0C&pg=PA63. Retrieved 31 October 2011.
- ^ 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):
- ^ Soar (history):
- ^ McCarthy and AI research at SAIL and SRI International:
- ^ AI research at Edinburgh and in France, birth of Prolog:
- ^ AI at MIT under Marvin Minsky in the 1960s :
- ^ Cyc:
- ^ Knowledge revolution:
- ^ Embodied approaches to AI:
- ^ Revival of connectionism:
- ^ Computational intelligence
- ^ Pat Langley, "The changing science of machine learning", Machine Learning, Volume 82, Number 3, 275–279, doi:10.1007/s10994-011-5242-y
- ^ Agent architectures, hybrid intelligent systems:
- ^ Hierarchical control system:
- ^ Subsumption architecture:
- ^ Search algorithms:
- ^ Forward chaining, backward chaining, Horn clauses, and logical deduction as search:
- ^ State space search and planning:
- ^ Uninformed searches (breadth first search, depth first search and general state space search):
- ^ Heuristic or informed searches (e.g., greedy best first and A*):
- ^ Optimization searches:
- ^ Artificial life and society based learning:
- ^ Genetic programming and genetic algorithms:
- Luger & Stubblefield 2004, pp. 509–530,
- Nilsson 1998, chpt. 4.2.
- Holland, John H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. ISBN 0-262-58111-6.
- Koza, John R. (1992). Genetic Programming. MIT Press. ISBN 0-262-11170-5.
- Poli, R., Langdon, W. B., McPhee, N. F. (2008). A Field Guide to Genetic Programming. Lulu.com, freely available from http://www.gp-field-guide.org.uk/. ISBN 978-1-4092-0073-4.
- ^ Logic:
- ^ Satplan:
- ^ Explanation based learning, relevance based learning, inductive logic programming, case based reasoning:
- ^ Propositional logic:
- ^ 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:
- ^ Subjective logic:
- ^ 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:
- ^ Bayesian inference algorithm:
- ^ Bayesian learning and the expectation-maximization algorithm:
- ^ Bayesian decision theory and Bayesian decision networks:
- ^ a b c Stochastic temporal models:
Dynamic Bayesian networks:
Hidden Markov model:
Kalman filters:
- ^ decision theory and decision analysis:
- ^ Markov decision processes and dynamic decision networks:
- ^ Game theory and mechanism design:
- ^ Statistical learning methods and classifiers:
- ^ a b Neural networks and connectionism:
- ^ kernel methods such as the support vector machine, Kernel methods:
- ^ K-nearest neighbor algorithm:
- ^ Gaussian mixture model:
- ^ Naive Bayes classifier:
- ^ Decision tree:
- ^ Classifier performance:
- ^ Backpropagation:
- ^ Feedforward neural networks, perceptrons and radial basis networks:
- ^ Recurrent neural networks, Hopfield nets:
- ^ Competitive learning, Hebbian coincidence learning, Hopfield networks and attractor networks:
- ^ Hierarchical temporal memory:
- ^ Control theory:
- ^ Lisp:
- ^ Prolog:
- ^ a b The Turing test:
Turing's original publication:
Historical influence and philosophical implications:
- ^ Subject matter expert Turing test:
- ^ Cite error: Invalid
<ref> tag; no text was provided for refs named Progress_in_Artificial_Intelligence; see the help page.
- ^ Game AI:
- ^ Mathematical definitions of intelligence:
- ^ "AI set to exceed human brain power" (web article). CNN. 26 July 2006. http://www.cnn.com/2006/TECH/science/07/24/ai.bostrom/. Retrieved 26 February 2008.
- ^ Brooks, R.A., "How to build complete creatures rather than isolated cognitive simulators," in K. VanLehn (ed.), Architectures for Intelligence, pp. 225–239, Lawrence Erlbaum Associates, Hillsdale, NJ, 1991.
- ^ Hacking Roomba » Search Results » atmel
- ^ Philosophy of AI. All of these positions in this section are mentioned in standard discussions of the subject, such as:
- ^ Dartmouth proposal:
- ^ The physical symbol systems hypothesis:
- ^ 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:
- ^ This is a paraphrase of the relevant implication of Gödel's theorems.
- ^ The Mathematical Objection:
Making the Mathematical Objection:
Refuting Mathematical Objection:
Background:
- Gödel 1931, Church 1936, Kleene 1935, Turing 1937
- ^ 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:
Discussion:
- ^ Robot rights:
Prematurity of:
In fiction:
- ^ Independent documentary Plug & Pray, featuring Joseph Weizenbaum and Raymond Kurzweil
- ^ Ford, Martin R. (2009), The Lights in the Tunnel: Automation, Accelerating Technology and the Economy of the Future, Acculant Publishing, ISBN 978-1448659814, http://www.thelightsinthetunnel.com. (e-book available free online.)
- ^ "Machine Learning: A Job Killer?"
- ^ AI could decrease the demand for human labor:
- ^ In the early 70s, 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 (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.
- ^ Technological singularity:
- ^ Transhumanism:
- ^ AI as evolution:
- Luger, George; Stubblefield, William (2004). Artificial Intelligence: Structures and Strategies for Complex Problem Solving (5th ed.). The Benjamin/Cummings Publishing Company, Inc.. ISBN 0-8053-4780-1. http://www.cs.unm.edu/~luger/ai-final/tocfull.html.
- Neapolitan, Richard; Jiang, Xia (2012). Contemporary Artificial Intelligence. Chapman & Hall/CRC. ISBN 978-143984-469-4. http://www.crcpress.com/product/isbn/9781439844694.
- Nilsson, Nils (1998). Artificial Intelligence: A New Synthesis. Morgan Kaufmann Publishers. ISBN 978-1-55860-467-4.
- 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, http://aima.cs.berkeley.edu/
- Poole, David; Mackworth, Alan; Goebel, Randy (1998). Computational Intelligence: A Logical Approach. New York: Oxford University Press. ISBN 0-19-510270-3. http://www.cs.ubc.ca/spider/poole/ci.html.
- Winston, Patrick Henry (1984). Artificial Intelligence. Reading, Massachusetts: Addison-Wesley. ISBN 0-201-08259-4.
- 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, MA: A. K. Peters, Ltd., ISBN 1-56881-205-1, http://www.pamelamc.com/html/machines_who_think.html
Nilsson, Nils (2010), The Quest for Artificial Intelligence: A History of Ideas and Achievements, New York, NY: Cambridge University Press, ISBN 978052112293
- "ACM Computing Classification System: Artificial intelligence". ACM. 1998. http://www.acm.org/class/1998/I.2.html. Retrieved 30 August 2007.
- Aleksander, Igor (1995). Artificial Neuroconsciousness: An Update. IWANN. Archived from the original on 2 March 1997. http://web.archive.org/web/19970302014628/http://www.ee.ic.ac.uk/research/neural/publications/iwann.html. BibTex Internet Archive
- Brooks, Rodney (1990). "Elephants Don't Play Chess" (PDF). Robotics and Autonomous Systems 6: 3–15. DOI:10.1016/S0921-8890(05)80025-9. http://people.csail.mit.edu/brooks/papers/elephants.pdf. Retrieved 30 August 2007. .
- Buchanan, Bruce G. (2005). "A (Very) Brief History of Artificial Intelligence" (PDF). AI Magazine: 53–60. http://www.aaai.org/AITopics/assets/PDF/AIMag26-04-016.pdf. Retrieved 30 August 2007.
- Dennett, Daniel (1991). Consciousness Explained. The Penguin Press. ISBN 0-7139-9037-6.
- Dreyfus, Hubert (1972). What Computers Can't Do. New York: MIT Press. ISBN 0-06-011082-1.
- Dreyfus, Hubert (1979). What Computers Still Can't Do. New York: MIT Press. ISBN 0-262-04134-0.
- 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.
- Dreyfus, Hubert (1992). What Computers Still Can't Do. New York: MIT Press. ISBN 0-262-54067-3.
- Edelman, Gerald (23 November 2007). "Gerald Edelman – Neural Darwinism and Brain-based Devices". Talking Robots. http://lis.epfl.ch/resources/podcast/2007/11/gerald-edelman-neural-darwinism-and.html.
- 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.
- Forster, Dion (2006). "Self validating consciousness in strong artificial intelligence: An African theological contribution". Pretoria: University of South Africa. http://www.spirituality.org.za/files/D%20Forster%20doctorate.pdf.
- Gladwell, Malcolm (2005). Blink. New York: Little, Brown and Co.. ISBN 0-316-17232-4.
- Haugeland, John (1985). Artificial Intelligence: The Very Idea. Cambridge, Mass.: MIT Press. ISBN 0-262-08153-9.
- Hawkins, Jeff; Blakeslee, Sandra (2005). On Intelligence. New York, NY: Owl Books. ISBN 0-8050-7853-3.
- Hofstadter, Douglas (1979). Gödel, Escher, Bach: an Eternal Golden Braid. New York, NY: Vintage Books. ISBN 0-394-74502-7.
- Howe, J. (November 1994). "Artificial Intelligence at Edinburgh University: a Perspective". http://www.inf.ed.ac.uk/about/AIhistory.html. Retrieved 30 August 2007. .
- Kahneman, Daniel; Slovic, D.; Tversky, Amos (1982). Judgment under uncertainty: Heuristics and biases. New York: Cambridge University Press. ISBN 0-521-28414-7.
- Kolata, G. (1982). "How can computers get common sense?". Science 217 (4566): 1237–1238. DOI:10.1126/science.217.4566.1237. PMID 17837639.
- Kurzweil, Ray (1999). The Age of Spiritual Machines. Penguin Books. ISBN 0-670-88217-8.
- Kurzweil, Ray (2005). The Singularity is Near. Penguin Books. ISBN 0-670-03384-7.
- Lakoff, George (1987). Women, Fire, and Dangerous Things: What Categories Reveal About the Mind. University of Chicago Press. ISBN 0-226-46804-6.
- 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. .
- Lenat, Douglas; Guha, R. V. (1989). Building Large Knowledge-Based Systems. Addison-Wesley. ISBN 0-201-51752-3.
- Lighthill, Professor Sir James (1973). "Artificial Intelligence: A General Survey". Artificial Intelligence: a paper symposium. Science Research Council.
- Lucas, John (1961). "Minds, Machines and Gödel". In Anderson, A.R.. Minds and Machines. http://users.ox.ac.uk/~jrlucas/Godel/mmg.html. Retrieved 30 August 2007.
- Maker, Meg Houston (2006). "AI@50: AI Past, Present, Future". Dartmouth College. http://www.engagingexperience.com/2006/07/ai50_ai_past_pr.html. Retrieved 16 October 2008.
- McCarthy, John; Minsky, Marvin; Rochester, Nathan; Shannon, Claude (1955). "A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence". http://www-formal.stanford.edu/jmc/history/dartmouth/dartmouth.html. Retrieved 30 August 2007. .
- McCarthy, John; Hayes, P. J. (1969). "Some philosophical problems from the standpoint of artificial intelligence". Machine Intelligence 4: 463–502. http://www-formal.stanford.edu/jmc/mcchay69.html. Retrieved 30 August 2007.
- McCarthy, John (12 November 2007). "What Is Artificial Intelligence?". http://www-formal.stanford.edu/jmc/whatisai/whatisai.html.
- Minsky, Marvin (1967). Computation: Finite and Infinite Machines. Englewood Cliffs, N.J.: Prentice-Hall. ISBN 0-13-165449-7.
- Minsky, Marvin (2006). The Emotion Machine. New York, NY: Simon & Schusterl. ISBN 0-7432-7663-9.
- Moravec, Hans (1976). "The Role of Raw Power in Intelligence". http://www.frc.ri.cmu.edu/users/hpm/project.archive/general.articles/1975/Raw.Power.html. Retrieved 30 August 2007.
- Moravec, Hans (1988). Mind Children. Harvard University Press. ISBN 0-674-57616-0.
- 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..
- Newell, Allen; Simon, H. A. (1963). "GPS: A Program that Simulates Human Thought". In Feigenbaum, E.A.; Feldman, J.. Computers and Thought. New York: McGraw-Hill.
- Newell, Allen; Simon, H. A. (1976). "Computer Science as Empirical Inquiry: Symbols and Search". Communications of the ACM. 19. http://www.rci.rutgers.edu/~cfs/472_html/AI_SEARCH/PSS/PSSH4.html. .
- Nilsson, Nils (1983), "Artificial Intelligence Prepares for 2001", AI Magazine 1 (1), http://ai.stanford.edu/~nilsson/OnlinePubs-Nils/General%20Essays/AIMag04-04-002.pdf , Presidential Address to the Association for the Advancement of Artificial Intelligence.
- Penrose, Roger (1989). The Emperor's New Mind: Concerning Computer, Minds and The Laws of Physics. Oxford University Press. ISBN 0-19-851973-7.
- Searle, John (1980). "Minds, Brains and Programs". Behavioral and Brain Sciences 3 (3): 417–457. DOI:10.1017/S0140525X00005756. http://www.bbsonline.org/documents/a/00/00/04/84/bbs00000484-00/bbs.searle2.html.
- Searle, John (1999). Mind, language and society. New York, NY: Basic Books. ISBN 0-465-04521-9. OCLC 43689264 231867665 43689264.
- Serenko, Alexander; Detlor, Brian (2004). "Intelligent agents as innovations". AI and Society 18 (4): 364–381. DOI:10.1007/s00146-004-0310-5. http://foba.lakeheadu.ca/serenko/papers/Serenko_Detlor_AI_and_Society.pdf.
- Serenko, Alexander; Ruhi, Umar; Cocosila, Mihail (2007). "Unplanned effects of intelligent agents on Internet use: Social Informatics approach". AI and Society 21 (1–2): 141–166. DOI:10.1007/s00146-006-0051-8. http://foba.lakeheadu.ca/serenko/papers/AI_Society_Serenko_Social_Impacts_of_Agents.pdf.
- Shapiro, Stuart C. (1992). "Artificial Intelligence". In Shapiro, Stuart C.. Encyclopedia of Artificial Intelligence (2nd ed.). New York: John Wiley. pp. 54–57. ISBN 0-471-50306-1. http://www.cse.buffalo.edu/~shapiro/Papers/ai.pdf.
- Simon, H. A. (1965). The Shape of Automation for Men and Management. New York: Harper & Row.
- Skillings, Jonathan (3 July 2006). "Getting Machines to Think Like Us". cnet. http://news.cnet.com/Getting-machines-to-think-like-us/2008-11394_3-6090207.html. Retrieved 3 February 2011.
- Tecuci, Gheorghe (March/April 2012). "Artificial Intelligence". Wiley Interdisciplinary Reviews: Computational Statistics (Wiley) 4 (2): 168-180. DOI:10.1002/wics.200.
- Turing, Alan (October 1950), "Computing Machinery and Intelligence", Mind LIX (236): 433–460, DOI:10.1093/mind/LIX.236.433, ISSN 0026-4423, http://loebner.net/Prizef/TuringArticle.html, retrieved 2008-08-18 .
- van der Walt, Christiaan; Bernard, Etienne (2006<!––year is presumed based on acknowledgements at the end of the article––>). "Data characteristics that determine classifier performance" (PDF). http://www.patternrecognition.co.za/publications/cvdwalt_data_characteristics_classifiers.pdf. Retrieved 5 August 2009.
- Vinge, Vernor (1993). "The Coming Technological Singularity: How to Survive in the Post-Human Era". http://www-rohan.sdsu.edu/faculty/vinge/misc/singularity.html.
- Wason, P. C.; Shapiro, D. (1966). "Reasoning". In Foss, B. M.. New horizons in psychology. Harmondsworth: Penguin.
- Weizenbaum, Joseph (1976). Computer Power and Human Reason. San Francisco: W.H. Freeman & Company. ISBN 0-7167-0464-1.
- 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
- Serenko, Alexander (2010). "The development of an AI journal ranking based on the revealed preference approach" (PDF). Journal of Informetrics 4 (4): 447–459. DOI:10.1016/j.joi.2010.04.001. http://foba.lakeheadu.ca/serenko/papers/JOI_Serenko_AI_Journal_Ranking_Published.pdf.
- Sun, R. & Bookman, L. (eds.), Computational Architectures: Integrating Neural and Symbolic Processes. Kluwer Academic Publishers, Needham, MA. 1994.
![[icon]](http://web.archive.org./web/20130112132536/http://en.wikipedia.org/wiki/File:Wiki_letter_w_cropped.svg){kind=small}
