Categories
Artificial Intelligence Cloud Data Science - Big Data History

Limited hangout

“A limited hangout or partial hangout is, according to former special assistant to the Deputy Director of the Central Intelligence Agency Victor Marchetti, “spy jargon for a favorite and frequently used gimmick of the clandestine professionals. When their veil of secrecy is shredded and they can no longer rely on a phony cover story to misinform the public, they resort to admitting—sometimes even volunteering—some of the truth while still managing to withhold the key and damaging facts in the case. The public, however, is usually so intrigued by the new information that it never thinks to pursue the matter further.”[1][2] (WP)

Modified limited hangout

“In a March 22, 1973, meeting between president Richard NixonJohn DeanJohn EhrlichmanJohn Mitchell, and H. R. Haldeman, Ehrlichman incorporated the term into a new and related one, “modified limited hangout“.[3][4]

The phrase was coined in the following exchange:[5]” (WP)

PRESIDENT: You think, you think we want to, want to go this route now? And the — let it hang out, so to speak?

DEAN: Well, it’s, it isn’t really that —
HALDEMAN: It’s a limited hang out.
DEAN: It’s a limited hang out.
EHRLICHMAN: It’s a modified limited hang out.

PRESIDENT: Well, it’s only the questions of the thing hanging out publicly or privately.

“Before this exchange, the discussion captures Nixon outlining to Dean the content of a report that Dean would create, laying out a misleading view of the role of the White House staff in events surrounding the Watergate burglary. In Ehrlichman’s words: “And the report says, ‘Nobody was involved,'”. The document would then be shared with the United States Senate Watergate Committee investigating the affair. The report would serve the administration’s goals by protecting the President, providing documentary support for his false statements should information come to light that contradicted his stated position. Further, the group discusses having information on the report leaked by those on the Committee sympathetic to the President, to put exculpatory information into the public sphere.[5]” (WP)

“The phrase has been cited as a summation of the strategy of mixing partial admissions with misinformation and resistance to further investigation, and is used in political commentary to accuse people or groups of following a Nixon-like strategy.[6]” (WP) However, this “strategy” has been used since time immemorial.

“Writing in The Washington PostMary McGrory described a statement by Pope John Paul II regarding sexual abuse by priests as a “modified, limited hangout”.[7] (WP)

See also

References

  1. ^ Victor Marchetti (August 14, 1978) The Spotlight
  2. ^ “720 F2d 631 Hunt v. Liberty Lobby Dc”. OpenJurist. 1983-11-28. Retrieved 2016-07-13.
  3. ^ Frost/Nixon: The Complete Interviews. David Frost, Richard Nixon. Paradine Television, 1977.
  4. ^ Safire, William (26 March 1989). “On Language; In Nine Little Words”New York Times. Retrieved 23 June 2013.
  5. a b “Transcript of a recording of a meeting among the president, John Dean, John Erlichman, H. R. Haldeman, and John Mitchell on March 22, 1973 from 1:57 to 3:43 p.m.” History and Politics Out Loud. Retrieved 2006-08-27.
  6. ^ Carrol, Jon (2002-05-01). “The Richard Nixon playbook”San Francisco Chronicle. Retrieved 2006-08-27.
  7. ^ McGrory, Mary (2002-04-25). “From Rome, A ‘Limited Hangout'”The Washington Post. Washington, D.C. p. A29. Retrieved 2010-04-30.

Categories

” (WP)

Sources:

Fair Use Sources:

Categories
History

This Year in History

Know your History, It repeats itself! See also Timeline of the History of Computers and This Year in History

History in the year of:

Sources:

Fair Use Sources:

Categories
Artificial Intelligence Cloud Data Science - Big Data Software Engineering

AI – Artificial intelligence

“AI” redirects here. For other uses, see AI (disambiguation) and Artificial intelligence (disambiguation).

See also: Artificial Intelligence (AI) Coined – 1955 AD

” (WP)

Artificial intelligence (AI) is intelligence demonstrated by machines, unlike the natural intelligence displayed by humans and animals, which involves consciousness and emotionality. The distinction between the former and the latter categories is often revealed by the acronym chosen. ‘Strong’ AI is usually labelled as artificial general intelligence (AGI) while attempts to emulate ‘natural’ intelligence have been called artificial biological intelligence (ABI). Leading AI textbooks define the field as the study of “intelligent agents“: any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals.[3] Colloquially, the term “artificial intelligence” is often used to describe machines that mimic “cognitive” functions that humans associate with the human mind, such as “learning” and “problem solving”.[4]

As machines become increasingly capable, tasks considered to require “intelligence” are often removed from the definition of AI, a phenomenon known as the AI effect.[5] A quip in Tesler’s Theorem says “AI is whatever hasn’t been done yet.”[6] For instance, optical character recognition is frequently excluded from things considered to be AI,[7] having become a routine technology.[8] Modern machine capabilities generally classified as AI include successfully understanding human speech,[9] competing at the highest level in strategic game systems (such as chess and Go),[10] and also imperfect-information games like poker,[11] self-driving cars, intelligent routing in content delivery networks, and military simulations.[12]

Artificial intelligence was founded as an academic discipline in 1955, and in the years since has experienced several waves of optimism,[13][14] followed by disappointment and the loss of funding (known as an “AI winter“),[15][16] followed by new approaches, success and renewed funding.[14][17] After AlphaGo successfully defeated a professional Go player in 2015, artificial intelligence once again attracted widespread global attention.[18] For most of its history, AI research has been divided into sub-fields that often fail to communicate with each other.[19] These sub-fields are based on technical considerations, such as particular goals (e.g. “robotics” or “machine learning“),[20] the use of particular tools (“logic” or artificial neural networks), or deep philosophical differences.[23][24][25] Sub-fields have also been based on social factors (particular institutions or the work of particular researchers).[19]

The traditional problems (or goals) of AI research include reasoningknowledge representationplanninglearningnatural language processingperception and the ability to move and manipulate objects.[20] AGI is among the field’s long-term goals.[26] Approaches include statistical methodscomputational intelligence, and traditional symbolic AI. Many tools are used in AI, including versions of search and mathematical optimization, artificial neural networks, and methods based on statistics, probability and economics. The AI field draws upon computer scienceinformation engineeringmathematicspsychologylinguisticsphilosophy, and many other fields.

The field was founded on the assumption that human intelligence “can be so precisely described that a machine can be made to simulate it”.[27] This raises philosophical arguments about the mind and the ethics of creating artificial beings endowed with human-like intelligence. These issues have been explored by mythfiction and philosophy since antiquity.[32] Some people also consider AI to be a danger to humanity if it progresses unabated.[33][34] Others believe that AI, unlike previous technological revolutions, will create a risk of mass unemployment.[35]

In the twenty-first century, AI techniques have experienced a resurgence following concurrent advances in computer power, large amounts of data, and theoretical understanding; and AI techniques have become an essential part of the technology industry, helping to solve many challenging problems in computer science, software engineering and operations research.[36][17]

History

Main articles: History of artificial intelligence and Timeline of artificial intelligenceSilver didrachma from Crete depicting Talos, an ancient mythical automaton with artificial intelligence

Thought-capable artificial beings appeared as storytelling devices in antiquity,[37] and have been common in fiction, as in Mary Shelley‘s Frankenstein or Karel Čapek‘s R.U.R.[38] These characters and their fates raised many of the same issues now discussed in the ethics of artificial intelligence.[32]

The study of mechanical or “formal” reasoning began with philosophers and mathematicians in antiquity. The study of mathematical logic led directly to Alan Turing‘s theory of computation, which suggested that a machine, by shuffling symbols as simple as “0” and “1”, could simulate any conceivable act of mathematical deduction. This insight, that digital computers can simulate any process of formal reasoning, is known as the Church–Turing thesis.[39] Along with concurrent discoveries in neurobiologyinformation theory and cybernetics, this led researchers to consider the possibility of building an electronic brain. Turing proposed changing the question from whether a machine was intelligent, to “whether or not it is possible for machinery to show intelligent behaviour”.[40] The first work that is now generally recognized as AI was McCullouch and Pitts‘ 1943 formal design for Turing-complete “artificial neurons”.[41]

The field of AI research was born at a workshop at Dartmouth College in 1956,[42] where the term “Artificial Intelligence” was coined by John McCarthy to distinguish the field from cybernetics and escape the influence of the cyberneticist Norbert Wiener.[43] Attendees Allen Newell (CMU), Herbert Simon (CMU), John McCarthy (MIT), Marvin Minsky (MIT) and Arthur Samuel (IBM) became the founders and leaders of AI research.[44] They and their students produced programs that the press described as “astonishing”:[45] computers were learning checkers strategies (c. 1954)[46] (and by 1959 were reportedly playing better than the average human),[47] solving word problems in algebra, proving logical theorems (Logic Theorist, first run c. 1956) and speaking English.[48] By the middle of the 1960s, research in the U.S. was heavily funded by the Department of Defense[49] and laboratories had been established around the world.[50] AI’s founders were optimistic about the future: Herbert Simon predicted, “machines will be capable, within twenty years, of doing any work a man can do”. Marvin Minsky agreed, writing, “within a generation … the problem of creating ‘artificial intelligence’ will substantially be solved”.[13]

They failed to recognize the difficulty of some of the remaining tasks. Progress slowed and in 1974, in response to the criticism of Sir James Lighthill[51] and ongoing pressure from the US Congress to fund more productive projects, both the U.S. and British governments cut off exploratory research in AI. The next few years would later be called an “AI winter“,[15] a period when obtaining funding for AI projects was difficult.

In the early 1980s, AI research was revived by the commercial success of expert systems,[52] a form of AI program that simulated the knowledge and analytical skills of human experts. By 1985, the market for AI had reached over a billion dollars. At the same time, Japan’s fifth generation computer project inspired the U.S and British governments to restore funding for academic research.[14] However, beginning with the collapse of the Lisp Machine market in 1987, AI once again fell into disrepute, and a second, longer-lasting hiatus began.[16]

The development of metal–oxide–semiconductor (MOS) very-large-scale integration (VLSI), in the form of complementary MOS (CMOS) transistor technology, enabled the development of practical artificial neural network (ANN) technology in the 1980s. A landmark publication in the field was the 1989 book Analog VLSI Implementation of Neural Systems by Carver A. Mead and Mohammed Ismail.[53]

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

In 2011, in a Jeopardy! quiz show exhibition match, IBM‘s question answering systemWatson, defeated the two greatest Jeopardy! champions, Brad Rutter and Ken Jennings, by a significant margin.[56] Faster computers, algorithmic improvements, and access to large amounts of data enabled advances in machine learning and perception; data-hungry deep learning methods started to dominate accuracy benchmarks around 2012.[57] 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[58] as do intelligent personal assistants in smartphones.[59] In March 2016, AlphaGo won 4 out of 5 games of Go in a match with Go champion Lee Sedol, becoming the first computer Go-playing system to beat a professional Go player without handicaps.[10][60] In the 2017 Future of Go SummitAlphaGo won a three-game match with Ke Jie,[61] who at the time continuously held the world No. 1 ranking for two years.[62][63] Deep Blue‘s Murray Campbell called AlphaGo’s victory “the end of an era… board games are more or less done[64] and it’s time to move on.”[65] This marked the completion of a significant milestone in the development of Artificial Intelligence as Go is a relatively complex game, more so than Chess. AlphaGo was later improved, generalized to other games like chess, with AlphaZero;[66] and MuZero[67] to play many different video games, that were previously handled separately,[68] in addition to board games. Other programs handle imperfect-information games; such as for poker at a superhuman level, Pluribus (poker bot)[69] and Cepheus (poker bot).[11] See: General game playing.

According to Bloomberg’s Jack Clark, 2015 was a landmark year for artificial intelligence, with the number of software projects that use AI within Google increased from a “sporadic usage” in 2012 to more than 2,700 projects. Clark also presents factual data indicating the improvements of AI since 2012 supported by lower error rates in image processing tasks.[70] He attributes this to an increase in affordable neural networks, due to a rise in cloud computing infrastructure and to an increase in research tools and datasets.[17] Other cited examples include Microsoft’s development of a Skype system that can automatically translate from one language to another and Facebook’s system that can describe images to blind people.[70] In a 2017 survey, one in five companies reported they had “incorporated AI in some offerings or processes”.[71][72] Around 2016, China greatly accelerated its government funding; given its large supply of data and its rapidly increasing research output, some observers believe it may be on track to becoming an “AI superpower”.[73][74]

By 2020, Natural Language Processing systems such as the enormous GPT-3 (then by far the largest artificial neural network) were matching human performance on pre-existing benchmarks, albeit without the system attaining commonsense understanding of the contents of the benchmarks.[75] DeepMind’s AlphaFold 2 (2020) demonstrated the ability to determine, in hours rather than months, the 3D structure of a protein. Facial recognition advanced to where, under some circumstances, some systems claim to have a 99% accuracy rate.[76]

Basics

Computer science defines AI research as the study of “intelligent agents“: any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals.[3] A more elaborate definition characterizes AI as “a system’s ability to correctly interpret external data, to learn from such data, and to use those learnings to achieve specific goals and tasks through flexible adaptation.”[77]

A typical AI analyzes its environment and takes actions that maximize its chance of success.[3] An AI’s intended utility function (or goal) can be simple (“1 if the AI wins a game of Go, 0 otherwise”) or complex (“Perform actions mathematically similar to ones that succeeded in the past”). Goals can be explicitly defined or induced. If the AI is programmed for “reinforcement learning“, goals can be implicitly induced by rewarding some types of behavior or punishing others.[a] Alternatively, an evolutionary system can induce goals by using a “fitness function” to mutate and preferentially replicate high-scoring AI systems, similar to how animals evolved to innately desire certain goals such as finding food.[78] Some AI systems, such as nearest-neighbor, instead of reason by analogy, these systems are not generally given goals, except to the degree that goals are implicit in their training data.[79] Such systems can still be benchmarked if the non-goal system is framed as a system whose “goal” is to successfully accomplish its narrow classification task.[80]

AI often revolves around the use of algorithms. An algorithm is a set of unambiguous instructions that a mechanical computer can execute.[b] A complex algorithm is often built on top of other, simpler, algorithms. A simple example of an algorithm is the following (optimal for first player) recipe for play at tic-tac-toe:[81]

  1. If someone has a “threat” (that is, two in a row), take the remaining square. Otherwise,
  2. if a move “forks” to create two threats at once, play that move. Otherwise,
  3. take the center square if it is free. Otherwise,
  4. if your opponent has played in a corner, take the opposite corner. Otherwise,
  5. take an empty corner if one exists. Otherwise,
  6. take any empty square.

Many AI algorithms are capable of learning from data; they can enhance themselves by learning new heuristics (strategies, or “rules of thumb”, that have worked well in the past), or can themselves write other algorithms. Some of the “learners” described below, including Bayesian networks, decision trees, and nearest-neighbor, could theoretically, (given infinite data, time, and memory) learn to approximate any function, including which combination of mathematical functions would best describe the world.[citation needed] These learners could therefore derive all possible knowledge, by considering every possible hypothesis and matching them against the data. In practice, it is seldom possible to consider every possibility, because of the phenomenon of “combinatorial explosion“, where the time needed to solve a problem grows exponentially. Much of AI research involves figuring out how to identify and avoid considering a broad range of possibilities unlikely to be beneficial.[82][83] For example, when viewing a map and looking for the shortest driving route from Denver to New York in the East, one can in most cases skip looking at any path through San Francisco or other areas far to the West; thus, an AI wielding a pathfinding algorithm like A* can avoid the combinatorial explosion that would ensue if every possible route had to be ponderously considered.[84]

The earliest (and easiest to understand) approach to AI was symbolism (such as formal logic): “If an otherwise healthy adult has a fever, then they may have influenza“. A second, more general, approach is Bayesian inference: “If the current patient has a fever, adjust the probability they have influenza in such-and-such way”. The third major approach, extremely popular in routine business AI applications, are analogizers such as SVM and nearest-neighbor: “After examining the records of known past patients whose temperature, symptoms, age, and other factors mostly match the current patient, X% of those patients turned out to have influenza”. A fourth approach is harder to intuitively understand, but is inspired by how the brain’s machinery works: the artificial neural network approach uses artificial “neurons” that can learn by comparing itself to the desired output and altering the strengths of the connections between its internal neurons to “reinforce” connections that seemed to be useful. These four main approaches can overlap with each other and with evolutionary systems; for example, neural nets can learn to make inferences, to generalize, and to make analogies. Some systems implicitly or explicitly use multiple of these approaches, alongside many other AI and non-AI algorithms; the best approach is often different depending on the problem.[85][86]

Learning algorithms work on the basis that strategies, algorithms, and inferences that worked well in the past are likely to continue working well in the future. These inferences can be obvious, such as “since the sun rose every morning for the last 10,000 days, it will probably rise tomorrow morning as well”. They can be nuanced, such as “X% of families have geographically separate species with color variants, so there is a Y% chance that undiscovered black swans exist”. Learners also work on the basis of “Occam’s razor“: The simplest theory that explains the data is the likeliest. Therefore, according to Occam’s razor principle, a learner must be designed such that it prefers simpler theories to complex theories, except in cases where the complex theory is proven substantially better.The blue line could be an example of overfitting a linear function due to random noise.

Settling on a bad, overly complex theory gerrymandered to fit all the past training data is known as overfitting. Many systems attempt to reduce overfitting by rewarding a theory in accordance with how well it fits the data, but penalizing the theory in accordance with how complex the theory is.[87] Besides classic overfitting, learners can also disappoint by “learning the wrong lesson”. A toy example is that an image classifier trained only on pictures of brown horses and black cats might conclude that all brown patches are likely to be horses.[88] A real-world example is that, unlike humans, current image classifiers often don’t primarily make judgments from the spatial relationship between components of the picture, and they learn relationships between pixels that humans are oblivious to, but that still correlate with images of certain types of real objects. Modifying these patterns on a legitimate image can result in “adversarial” images that the system misclassifies.[c][89][90]A self-driving car system may use a neural network to determine which parts of the picture seem to match previous training images of pedestrians, and then model those areas as slow-moving but somewhat unpredictable rectangular prisms that must be avoided.

Compared with humans, existing AI lacks several features of human “commonsense reasoning“; most notably, humans have powerful mechanisms for reasoning about “naïve physics” such as space, time, and physical interactions. This enables even young children to easily make inferences like “If I roll this pen off a table, it will fall on the floor”. Humans also have a powerful mechanism of “folk psychology” that helps them to interpret natural-language sentences such as “The city councilmen refused the demonstrators a permit because they advocated violence” (A generic AI has difficulty discerning whether the ones alleged to be advocating violence are the councilmen or the demonstrators[91][92][93]). This lack of “common knowledge” means that AI often makes different mistakes than humans make, in ways that can seem incomprehensible. For example, existing self-driving cars cannot reason about the location nor the intentions of pedestrians in the exact way that humans do, and instead must use non-human modes of reasoning to avoid accidents.[94][95][96]

Challenges

The cognitive capabilities of current architectures are very limited, using only a simplified version of what intelligence is really capable of. For instance, the human mind has come up with ways to reason beyond measure and logical explanations to different occurrences in life. What would have been otherwise straightforward, an equivalently difficult problem may be challenging to solve computationally as opposed to using the human mind. This gives rise to two classes of models: structuralist and functionalist. The structural models aim to loosely mimic the basic intelligence operations of the mind such as reasoning and logic. The functional model refers to the correlating data to its computed counterpart.[97]

The overall research goal of artificial intelligence is to create technology that allows computers and machines to function in an intelligent manner. The general problem of simulating (or creating) intelligence has been broken down into sub-problems. These consist of particular traits or capabilities that researchers expect an intelligent system to display. The traits described below have received the most attention.[20]

Reasoning, problem solving

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

These algorithms proved to be insufficient for solving large reasoning problems because they experienced a “combinatorial explosion”: they became exponentially slower as the problems grew larger.[82] Even humans rarely use the step-by-step deduction that early AI research could model. They solve most of their problems using fast, intuitive judgments.[100]

Knowledge representation

An ontology represents knowledge as a set of concepts within a domain and the relationships between those concepts.Main articles: Knowledge representation and Commonsense knowledge

Knowledge representation[101] and knowledge engineering[102] are central to classical AI research. Some “expert systems” attempt to gather explicit knowledge possessed by experts in some narrow domain. In addition, some projects attempt to gather the “commonsense knowledge” known to the average person into a database containing extensive knowledge about the world. Among the things a comprehensive commonsense knowledge base would contain are: objects, properties, categories and relations between objects;[103] situations, events, states and time;[104] causes and effects;[105] knowledge about knowledge (what we know about what other people know);[106] and many other, less well researched domains. A representation of “what exists” is an ontology: the set of objects, relations, concepts, and properties formally described so that software agents can interpret them. The semantics of these are captured as description logic concepts, roles, and individuals, and typically implemented as classes, properties, and individuals in the Web Ontology Language.[107] The most general ontologies are called upper ontologies, which attempt to provide a foundation for all other knowledge[108] by acting as mediators between domain ontologies that cover specific knowledge about a particular knowledge domain (field of interest or area of concern). Such formal knowledge representations can be used in content-based indexing and retrieval,[109] scene interpretation,[110] clinical decision support,[111] knowledge discovery (mining “interesting” and actionable inferences from large databases),[112] and other areas.[113]

Among the most difficult problems in knowledge representation are:Default reasoning and the qualification problemMany of the things people know take the form of “working assumptions”. For example, if a bird comes up in conversation, people typically picture a fist-sized animal that sings and flies. None of these things are true about all birds. John McCarthy identified this problem in 1969[114] 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.[115]Breadth of commonsense knowledgeThe number of atomic facts that the average person knows is very large. Research projects that attempt to build a complete knowledge base of commonsense knowledge (e.g., Cyc) require enormous amounts of laborious ontological engineering—they must be built, by hand, one complicated concept at a time.[116]Subsymbolic form of some commonsense knowledgeMuch 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”[117] or an art critic can take one look at a statue and realize that it is a fake.[118] These are non-conscious and sub-symbolic intuitions or tendencies in the human brain.[119] 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 AIcomputational intelligence, or statistical AI will provide ways to represent this knowledge.[119]

Planning

hierarchical control system is a form of control system in which a set of devices and governing software is arranged in a hierarchy.Main article: Automated planning and scheduling

Intelligent agents must be able to set goals and achieve them.[120] They need a way to visualize the future—a representation of the state of the world and be able to make predictions about how their actions will change it—and be able to make choices that maximize the utility (or “value”) of available choices.[121]

In classical planning problems, the agent can assume that it is the only system acting in the world, allowing the agent to be certain of the consequences of its actions.[122] However, if the agent is not the only actor, then it requires that the agent can reason under uncertainty. This calls for an agent that can not only assess its environment and make predictions but also evaluate its predictions and adapt based on its assessment.[123]

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

Learning

Main article: Machine learningFor this project the AI had to find the typical patterns in the colors and brushstrokes of Renaissance painter Raphael. The portrait shows the face of the actress Ornella Muti, “painted” by AI in the style of Raphael.

Machine learning (ML), a fundamental concept of AI research since the field’s inception,[d] is the study of computer algorithms that improve automatically through experience.[e][127]

Unsupervised learning is the ability to find patterns in a stream of input, without requiring a human to label the inputs first. Supervised learning includes both classification and numerical regression, which requires a human to label the input data first. Classification is used to determine what category something belongs in, and occurs after a program sees a number of examples of things from several categories. Regression is the attempt to produce a function that describes the relationship between inputs and outputs and predicts how the outputs should change as the inputs change.[127] Both classifiers and regression learners can be viewed as “function approximators” trying to learn an unknown (possibly implicit) function; for example, a spam classifier can be viewed as learning a function that maps from the text of an email to one of two categories, “spam” or “not spam”. Computational learning theory can assess learners by computational complexity, by sample complexity (how much data is required), or by other notions of optimization.[128] In reinforcement learning[129] the agent is rewarded for good responses and punished for bad ones. The agent uses this sequence of rewards and punishments to form a strategy for operating in its problem space.

Natural language processing

parse tree represents the syntactic structure of a sentence according to some formal grammar.Main article: Natural language processing

Natural language processing[130] (NLP) allows machines to read and understand human language. A sufficiently powerful natural language processing system would enable natural-language user interfaces and the acquisition of knowledge directly from human-written sources, such as newswire texts. Some straightforward applications of natural language processing include information retrievaltext miningquestion answering[131] and machine translation.[132] Many current approaches use word co-occurrence frequencies to construct syntactic representations of text. “Keyword spotting” strategies for search are popular and scalable but dumb; a search query for “dog” might only match documents with the literal word “dog” and miss a document with the word “poodle”. “Lexical affinity” strategies use the occurrence of words such as “accident” to assess the sentiment of a document. Modern statistical NLP approaches can combine all these strategies as well as others, and often achieve acceptable accuracy at the page or paragraph level. Beyond semantic NLP, the ultimate goal of “narrative” NLP is to embody a full understanding of commonsense reasoning.[133] By 2019, transformer-based deep learning architectures could generate coherent text.[134]

Perception

Main articles: Machine perceptionComputer vision, and Speech recognitionFeature detection (pictured: edge detection) helps AI compose informative abstract structures out of raw data.

Machine perception[135] is the ability to use input from sensors (such as cameras (visible spectrum or infrared), microphones, wireless signals, and active lidar, sonar, radar, and tactile sensors) to deduce aspects of the world. Applications include speech recognition,[136] facial recognition, and object recognition.[137] Computer vision is the ability to analyze visual input. Such input is usually ambiguous; a giant, fifty-meter-tall pedestrian far away may produce the same pixels as a nearby normal-sized pedestrian, requiring the AI to judge the relative likelihood and reasonableness of different interpretations, for example by using its “object model” to assess that fifty-meter pedestrians do not exist.[138]

Motion and manipulation

Main article: Robotics

AI is heavily used in robotics.[139] Advanced robotic arms and other industrial robots, widely used in modern factories, can learn from experience how to move efficiently despite the presence of friction and gear slippage.[140] A modern mobile robot, when given a small, static, and visible environment, can easily determine its location and map its environment; however, dynamic environments, such as (in endoscopy) the interior of a patient’s breathing body, pose a greater challenge. Motion planning is the process of breaking down a movement task into “primitives” such as individual joint movements. Such movement often involves compliant motion, a process where movement requires maintaining physical contact with an object.[141][142][143] Moravec’s paradox generalizes that low-level sensorimotor skills that humans take for granted are, counterintuitively, difficult to program into a robot; the paradox is named after Hans Moravec, who stated in 1988 that “it is comparatively easy to make computers exhibit adult level performance on intelligence tests or playing checkers, and difficult or impossible to give them the skills of a one-year-old when it comes to perception and mobility”.[144][145] This is attributed to the fact that, unlike checkers, physical dexterity has been a direct target of natural selection for millions of years.[146]

Social intelligence

Main article: Affective computingKismet, a robot with rudimentary social skills[147]

Moravec’s paradox can be extended to many forms of social intelligence.[148][149] Distributed multi-agent coordination of autonomous vehicles remains a difficult problem.[150] Affective computing is an interdisciplinary umbrella that comprises systems which recognize, interpret, process, or simulate human affects.[151][152][153] Moderate successes related to affective computing include textual sentiment analysis and, more recently, multimodal affect analysis (see multimodal sentiment analysis), wherein AI classifies the affects displayed by a videotaped subject.[154]

In the long run, social skills and an understanding of human emotion and game theory would be valuable to a social agent. The ability to predict the actions of others by understanding their motives and emotional states would allow an agent to make better decisions. Some computer systems mimic human emotion and expressions to appear more sensitive to the emotional dynamics of human interaction, or to otherwise facilitate human–computer interaction.[155] Similarly, some virtual assistants are programmed to speak conversationally or even to banter humorously; this tends to give naïve users an unrealistic conception of how intelligent existing computer agents actually are.[156]

General intelligence

Main articles: Artificial general intelligence and AI-complete

Historically, projects such as the Cyc knowledge base (1984–) and the massive Japanese Fifth Generation Computer Systems initiative (1982–1992) attempted to cover the breadth of human cognition. These early projects failed to escape the limitations of non-quantitative symbolic logic models and, in retrospect, greatly underestimated the difficulty of cross-domain AI. Nowadays, most current AI researchers work instead on tractable “narrow AI” applications (such as medical diagnosis or automobile navigation).[157] Many researchers predict that such “narrow AI” work in different individual domains will eventually be incorporated into a machine with artificial general intelligence (AGI), combining most of the narrow skills mentioned in this article and at some point even exceeding human ability in most or all these areas.[26][158] Many advances have general, cross-domain significance. One high-profile example is that DeepMind in the 2010s developed a “generalized artificial intelligence” that could learn many diverse Atari games on its own, and later developed a variant of the system which succeeds at sequential learning.[159][160][161] Besides transfer learning,[162] hypothetical AGI breakthroughs could include the development of reflective architectures that can engage in decision-theoretic metareasoning, and figuring out how to “slurp up” a comprehensive knowledge base from the entire unstructured Web.[163] Some argue that some kind of (currently-undiscovered) conceptually straightforward, but mathematically difficult, “Master Algorithm” could lead to AGI.[164] Finally, a few “emergent” approaches look to simulating human intelligence extremely closely, and believe that anthropomorphic features like an artificial brain or simulated child development may someday reach a critical point where general intelligence emerges.[165][166]

Many of the problems in this article may also require general intelligence, if machines are to solve the problems as well as people do. For example, even specific straightforward tasks, like machine translation, require that a machine read and write in both languages (NLP), follow the author’s argument (reason), know what is being talked about (knowledge), and faithfully reproduce the author’s original intent (social intelligence). A problem like machine translation is considered “AI-complete“, because all of these problems need to be solved simultaneously in order to reach human-level machine performance.

Approaches

No established unifying theory or paradigm guides AI research. Researchers disagree about many issues.[f] A few of the most long-standing questions that have remained unanswered are these: should artificial intelligence simulate natural intelligence by studying psychology or neurobiology? Or is human biology as irrelevant to AI research as bird biology is to aeronautical engineering?[23] Can intelligent behavior be described using simple, elegant principles (such as logic or optimization)? Or does it necessarily require solving a large number of unrelated problems?[24]

Cybernetics and brain simulation

Main articles: Cybernetics and Computational neuroscience

In the 1940s and 1950s, a number of researchers explored the connection between neurobiologyinformation 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.[168] By 1960, this approach was largely abandoned, although elements of it would be revived in the 1980s.

Symbolic

Main article: Symbolic AI

When access to digital computers became possible in the mid-1950s, AI research began to explore the possibility that human intelligence could be reduced to symbol manipulation. The research was centered in three institutions: Carnegie Mellon UniversityStanford, and MIT, and as described below, each one developed its own style of research. John Haugeland named these symbolic approaches to AI “good old fashioned AI” or “GOFAI“.[169] During the 1960s, symbolic approaches had achieved great success at simulating high-level “thinking” in small demonstration programs. Approaches based on cybernetics or artificial neural networks were abandoned or pushed into the background.[g] 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 scienceoperations 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.[170][171]

Logic-based

Unlike Simon and Newell, John McCarthy felt that machines did not need to simulate human thought, but should instead try to find the essence of abstract reasoning and problem-solving, regardless of whether people used the same algorithms.[23] His laboratory at Stanford (SAIL) focused on using formal logic to solve a wide variety of problems, including knowledge representationplanning and learning.[172] 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.[173]

Anti-logic or scruffy

Researchers at MIT (such as Marvin Minsky and Seymour Papert)[174] found that solving difficult problems in vision and natural language processing required ad hoc solutions—they argued that no simple and general principle (like logic) 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).[24] 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.[175]

Knowledge-based

When computers with large memories became available around 1970, researchers from all three traditions began to build knowledge into AI applications.[176] This “knowledge revolution” led to the development and deployment of expert systems (introduced by Edward Feigenbaum), the first truly successful form of AI software.[52] A key component of the system architecture for all expert systems is the knowledge base, which stores facts and rules that illustrate AI.[177] The knowledge revolution was also driven by the realization that enormous amounts of knowledge would be required by many simple AI applications.

Sub-symbolic

By the 1980s, progress in symbolic AI seemed to stall and many believed that symbolic systems would never be able to imitate all the processes of human cognition, especially perception, robotics, learning and pattern recognition. A number of researchers began to look into “sub-symbolic” approaches to specific AI problems.[25] Sub-symbolic methods manage to approach intelligence without specific representations of knowledge.

Embodied intelligence

This includes embodiedsituatedbehavior-based, and nouvelle AI. Researchers from the related field of robotics, such as Rodney Brooks, rejected symbolic AI and focused on the basic engineering problems that would allow robots to move and survive.[178] Their work revived the non-symbolic point of view of the early cybernetics researchers of the 1950s and reintroduced the use of control theory in AI. This coincided with the development of the embodied mind thesis in the related field of cognitive science: the idea that aspects of the body (such as movement, perception and visualization) are required for higher intelligence.

Within developmental robotics, developmental learning approaches are elaborated upon to allow robots to accumulate repertoires of novel skills through autonomous self-exploration, social interaction with human teachers, and the use of guidance mechanisms (active learning, maturation, motor synergies, etc.).[179][180][181][182]

Computational intelligence and soft computing

Interest in neural networks and “connectionism” was revived by David Rumelhart and others in the middle of the 1980s.[183] Artificial neural networks are an example of soft computing—they are solutions to problems which cannot be solved with complete logical certainty, and where an approximate solution is often sufficient. Other soft computing approaches to AI include fuzzy systemsGrey system theoryevolutionary computation and many statistical tools. The application of soft computing to AI is studied collectively by the emerging discipline of computational intelligence.[184]

Statistical

Much of traditional GOFAI got bogged down on ad hoc patches to symbolic computation that worked on their own toy models but failed to generalize to real-world results. However, around the 1990s, AI researchers adopted sophisticated mathematical tools, such as hidden Markov models (HMM), information theory, and normative Bayesian decision theory to compare or to unify competing architectures. The shared mathematical language permitted a high level of collaboration with more established fields (like mathematics, economics or operations research).[h] Compared with GOFAI, new “statistical learning” techniques such as HMM and neural networks were gaining higher levels of accuracy in many practical domains such as data mining, without necessarily acquiring a semantic understanding of the datasets. The increased successes with real-world data led to increasing emphasis on comparing different approaches against shared test data to see which approach performed best in a broader context than that provided by idiosyncratic toy models; AI research was becoming more scientific. Nowadays results of experiments are often rigorously measurable, and are sometimes (with difficulty) reproducible.[54][185] Different statistical learning techniques have different limitations; for example, basic HMM cannot model the infinite possible combinations of natural language.[186] Critics note that the shift from GOFAI to statistical learning is often also a shift away from explainable AI. In AGI research, some scholars caution against over-reliance on statistical learning, and argue that continuing research into GOFAI will still be necessary to attain general intelligence.[187][188]

Integrating the approaches

Intelligent agent paradigmAn intelligent agent is a system that perceives its environment and takes actions that maximize its chances of success. The simplest intelligent agents are programs that solve specific problems. More complicated agents include human beings and organizations of human beings (such as firms). The paradigm allows researchers to directly compare or even combine different approaches to isolated problems, by asking which agent is best at maximizing a given “goal function”. An agent that solves a specific problem can use any approach that works—some agents are symbolic and logical, some are sub-symbolic artificial neural networks and others may use new approaches. The paradigm also gives researchers a common language to communicate with other fields—such as decision theory and economics—that also use concepts of abstract agents. Building a complete agent requires researchers to address realistic problems of integration; for example, because sensory systems give uncertain information about the environment, planning systems must be able to function in the presence of uncertainty. The intelligent agent paradigm became widely accepted during the 1990s.[189]Agent architectures and cognitive architecturesResearchers have designed systems to build intelligent systems out of interacting intelligent agents in a multi-agent system.[190] A hierarchical control system provides a bridge between sub-symbolic AI at its lowest, reactive levels and traditional symbolic AI at its highest levels, where relaxed time constraints permit planning and world modeling.[191] Some cognitive architectures are custom-built to solve a narrow problem; others, such as Soar, are designed to mimic human cognition and to provide insight into general intelligence. Modern extensions of Soar are hybrid intelligent systems that include both symbolic and sub-symbolic components.[97][192]

Tools

Main article: Computational tools for artificial intelligence

Applications

Main article: Applications of artificial intelligence

AI is relevant to any intellectual task.[193] Modern artificial intelligence techniques are pervasive[194] and are too numerous to list here. Frequently, when a technique reaches mainstream use, it is no longer considered artificial intelligence; this phenomenon is described as the AI effect.[195]

High-profile examples of AI include autonomous vehicles (such as drones and self-driving cars), medical diagnosis, creating art (such as poetry), proving mathematical theorems, playing games (such as Chess or Go), search engines (such as Google Search), online assistants (such as Siri), image recognition in photographs, spam filtering, predicting flight delays,[196] prediction of judicial decisions,[197] targeting online advertisements, [193][198][199] and energy storage[200]

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

AI can also produce Deepfakes, a content-altering technology. ZDNet reports, “It presents something that did not actually occur,” Though 88% of Americans believe Deepfakes can cause more harm than good, only 47% of them believe they can be targeted. The boom of election year also opens public discourse to threats of videos of falsified politician media.[203]

Philosophy and ethics

Main articles: Philosophy of artificial intelligence and Ethics of artificial intelligence

There are three philosophical questions related to AI:[204]

  1. Whether artificial general intelligence is possible; whether a machine can solve any problem that a human being can solve using intelligence, or if there are hard limits to what a machine can accomplish.
  2. Whether intelligent machines are dangerous; how humans can ensure that machines behave ethically and that they are used ethically.
  3. Whether a machine can have a mindconsciousness and mental states in the same sense that human beings do; if a machine can be sentient, and thus deserve certain rights − and if a machine can intentionally cause harm.

The limits of artificial general intelligence

Main articles: Philosophy of artificial intelligenceTuring testPhysical symbol systems hypothesisDreyfus’ critique of artificial intelligenceThe Emperor’s New Mind, and AI effectAlan Turing’s “polite convention”One need not decide if a machine can “think”; one 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.[205]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.[206]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.[207]Hubert Dreyfus argues 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.)[i][209]Gödelian argumentsGödel himself,[210]John Lucas (in 1961) and Roger Penrose (in a more detailed argument from 1989 onwards) made highly technical arguments that human mathematicians can consistently see the truth of their own “Gödel statements” and therefore have computational abilities beyond that of mechanical Turing machines.[211] However, some people do not agree with the “Gödelian arguments”.[212][213][214]The artificial brain argumentAn argument asserting that the brain can be simulated by machines and, because brains exhibit intelligence, these simulated brains must also exhibit intelligence − ergo, machines can be intelligent. Hans MoravecRay 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.[165]The AI effectA hypothesis claiming that machines are already intelligent, but observers have failed to recognize it. For example, when Deep Blue beat Garry Kasparov in chess, the machine could be described as exhibiting intelligence. However, onlookers commonly discount the behavior of an artificial intelligence program by arguing that it is not “real” intelligence, with “real” intelligence being in effect defined as whatever behavior machines cannot do.

Ethical machines

Machines with intelligence have the potential to use their intelligence to prevent harm and minimize the risks; they may have the ability to use ethical reasoning to better choose their actions in the world. As such, there is a need for policy making to devise policies for and regulate artificial intelligence and robotics.[215] Research in this area includes machine ethicsartificial moral agentsfriendly AI and discussion towards building a human rights framework is also in talks.[216]

Joseph Weizenbaum in Computer Power and Human Reason wrote that AI applications cannot, by definition, successfully simulate genuine human empathy and that the use of AI technology in fields such as customer service or psychotherapy[j] 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.[218]

Artificial moral agents

Wendell Wallach introduced the concept of artificial moral agents (AMA) in his book Moral Machines[219] 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”[220] and “Can (Ro)bots Really Be Moral”.[221] For Wallach, the question is not centered on the issue of whether machines can demonstrate the equivalent of moral behavior, unlike the constraints which society may place on the development of AMAs.[222]

Machine ethics

Main article: Machine ethics

The field of machine ethics is concerned with giving machines ethical principles, or a procedure for discovering a way to resolve the ethical dilemmas they might encounter, enabling them to function in an ethically responsible manner through their own ethical decision making.[223] 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.”[224] 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”[223] that stems from the AAAI Fall 2005 Symposium on Machine Ethics.[224]

Malevolent and friendly AI

Main article: Friendly artificial intelligence

Political scientist Charles T. Rubin believes that AI can be neither designed nor guaranteed to be benevolent.[225] He argues that “any sufficiently advanced benevolence may be indistinguishable from malevolence.” Humans should not assume machines or robots would treat us favorably because there is no a priori reason to believe that they would be sympathetic to our system of morality, which has evolved along with our particular biology (which AIs would not share). Hyper-intelligent software may not necessarily decide to support the continued existence of humanity and would be extremely difficult to stop. This topic has also recently begun to be discussed in academic publications as a real source of risks to civilization, humans, and planet Earth.

One proposal to deal with this is to ensure that the first generally intelligent AI is ‘Friendly AI‘ and will be able to control subsequently developed AIs. Some question whether this kind of check could actually remain in place.

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

Lethal autonomous weapons are of concern. Currently, 50+ countries are researching battlefield robots, including the United States, China, Russia, and the United Kingdom. Many people concerned about risk from superintelligent AI also want to limit the use of artificial soldiers and drones.[227]

Machine consciousness, sentience and mind

Main article: Artificial consciousness

If an AI system replicates all key aspects of human intelligence, will that system also be sentient—will it have a mind which has conscious experiences? This question is closely related to the philosophical problem as to the nature of human consciousness, generally referred to as the hard problem of consciousness.

Consciousness

Main articles: Hard problem of consciousness and Theory of mind

David Chalmers identified two problems in understanding the mind, which he named the “hard” and “easy” problems of consciousness.[228] The easy problem is understanding how the brain processes signals, makes plans and controls behavior. The hard problem is explaining how this feels or why it should feel like anything at all. Human information processing is easy to explain, however human subjective experience is difficult to explain.

For example, consider what happens when a person is shown a color swatch and identifies it, saying “it’s red”. The easy problem only requires understanding the machinery in the brain that makes it possible for a person to know that the color swatch is red. The hard problem is that people also know something else—they also know what red looks like. (Consider that a person born blind can know that something is red without knowing what red looks like.)[k] Everyone knows subjective experience exists, because they do it every day (e.g., all sighted people know what red looks like). The hard problem is explaining how the brain creates it, why it exists, and how it is different from knowledge and other aspects of the brain.

Computationalism and functionalism

Main articles: Computationalism and Functionalism (philosophy of mind)

Computationalism is the position in the philosophy of mind that the human mind or the human brain (or both) is an information processing system and that thinking is a form of computing.[229] Computationalism argues that the relationship between mind and body is similar or identical to the relationship between software and hardware and thus may be a solution to the mind-body problem. This philosophical position was inspired by the work of AI researchers and cognitive scientists in the 1960s and was originally proposed by philosophers Jerry Fodor and Hilary Putnam.

Strong AI hypothesis

Main article: Chinese room

The philosophical position that John Searle has named “strong AI” states: “The appropriately programmed computer with the right inputs and outputs would thereby have a mind in exactly the same sense human beings have minds.”[l] 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.[231]

Robot rights

Main article: Robot rights

If a machine can be created that has intelligence, could it also feel? If it can feel, does it have the same rights as a human? This issue, now known as “robot rights“, is currently being considered by, for example, California’s Institute for the Future, although many critics believe that the discussion is premature.[232][233] Some critics of transhumanism argue that any hypothetical robot rights would lie on a spectrum with animal rights and human rights.[234] The subject is profoundly discussed in the 2010 documentary film Plug & Pray,[235] and many sci fi media such as Star Trek Next Generation, with the character of Commander Data, who fought being disassembled for research, and wanted to “become human”, and the robotic holograms in Voyager.

Superintelligence

Main article: Superintelligence

Are there limits to how intelligent machines—or human-machine hybrids—can be? A superintelligence, hyperintelligence, or superhuman intelligence is a hypothetical agent that would possess intelligence far surpassing that of the brightest and most gifted human mind. Superintelligence may also refer to the form or degree of intelligence possessed by such an agent.[158]

Technological singularity

Main articles: Technological singularity and Moore’s law

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.[236] The new intelligence could thus increase exponentially and dramatically surpass humans. Science fiction writer Vernor Vinge named this scenario “singularity“.[237] 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.[237][158]

Insane Google technocrat inventor 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.[237]

Transhumanism

Main article: Transhumanism

Robot designer Hans Moravec, cyberneticist Kevin Warwick, and insane Google technocrat inventor Ray Kurzweil have predicted that humans and machines will merge in the future into cyborgs that are more capable and powerful than either.[238] This insane demonic science fiction technocracy police state idea, called transhumanism, has roots in Aldous Huxley and Robert Ettinger.

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

Impact

The long-term economic effects of AI are uncertain. A survey of economists showed disagreement about whether the increasing use of robots and AI will cause a substantial increase in long-term unemployment, but they generally agree that it could be a net benefit, if productivity gains are redistributed.[240] A 2017 study by PricewaterhouseCoopers sees the People’s Republic of China gaining economically the most out of AI with 26,1% of GDP until 2030.[241] A February 2020 European Union white paper on artificial intelligence advocated for artificial intelligence for economic benefits, including “improving healthcare (e.g. making diagnosis more precise, enabling better prevention of diseases), increasing the efficiency of farming, contributing to climate change mitigation and adaptation, [and] improving the efficiency of production systems through predictive maintenance”, while acknowledging potential risks.[194]

The relationship between automation and employment is complicated. While automation eliminates old jobs, it also creates new jobs through micro-economic and macro-economic effects.[242] Unlike previous waves of automation, many middle-class jobs may be eliminated by artificial intelligence; The Economist states that “the worry that AI could do to white-collar jobs what steam power did to blue-collar ones during the Industrial Revolution” is “worth taking seriously”.[243] Subjective estimates of the risk vary widely; for example, Michael Osborne and Carl Benedikt Frey estimate 47% of U.S. jobs are at “high risk” of potential automation, while an OECD report classifies only 9% of U.S. jobs as “high risk”.[244][245][246] Jobs at extreme risk range from paralegals to fast food cooks, while job demand is likely to increase for care-related professions ranging from personal healthcare to the clergy.[247] Author Martin Ford and others go further and argue that many jobs are routine, repetitive and (to an AI) predictable; Ford warns that these jobs may be automated in the next couple of decades, and that many of the new jobs may not be “accessible to people with average capability”, even with retraining. Economists point out that in the past technology has tended to increase rather than reduce total employment, but acknowledge that “we’re in uncharted territory” with AI.[35]

The potential negative effects of AI and automation were a major issue for Andrew Yang‘s 2020 presidential campaign in the United States.[248] Irakli Beridze, Head of the Centre for Artificial Intelligence and Robotics at UNICRI, United Nations, has expressed that “I think the dangerous applications for AI, from my point of view, would be criminals or large terrorist organizations using it to disrupt large processes or simply do pure harm. [Terrorists could cause harm] via digital warfare, or it could be a combination of robotics, drones, with AI and other things as well that could be really dangerous. And, of course, other risks come from things like job losses. If we have massive numbers of people losing jobs and don’t find a solution, it will be extremely dangerous. Things like lethal autonomous weapons systems should be properly governed — otherwise there’s massive potential of misuse.”[249]

Risks of narrow AI

Main article: Workplace impact of artificial intelligence

Widespread use of artificial intelligence could have unintended consequences that are dangerous or undesirable. Scientists from the Future of Life Institute, among others, described some short-term research goals to see how AI influences the economy, the laws and ethics that are involved with AI and how to minimize AI security risks. In the long-term, the scientists have proposed to continue optimizing function while minimizing possible security risks that come along with new technologies.[250]

Some are concerned about algorithmic bias, that AI programs may unintentionally become biased after processing data that exhibits bias.[251] Algorithms already have numerous applications in legal systems. An example of this is COMPAS, a commercial program widely used by U.S. courts to assess the likelihood of a defendant becoming a recidivistProPublica claims that the average COMPAS-assigned recidivism risk level of black defendants is significantly higher than the average COMPAS-assigned risk level of white defendants.[252]

Risks of general AI

Main article: Existential risk from artificial general intelligence

Physicist Stephen HawkingMicrosoft founder Bill Gates, history professor Yuval Noah Harari, 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“.[253][254][255][256]

The development of full artificial intelligence could spell the end of the human race. Once humans develop artificial intelligence, it will take off on its own and redesign itself at an ever-increasing rate. Humans, who are limited by slow biological evolution, couldn’t compete and would be superseded.— Stephen Hawking[257]

In his book Superintelligence, philosopher Nick Bostrom provides an argument that artificial intelligence will pose a threat to humankind. He argues that sufficiently intelligent AI, if it chooses actions based on achieving some goal, will exhibit convergent behavior such as acquiring resources or protecting itself from being shut down. If this AI’s goals do not fully reflect humanity’s—one example is an AI told to compute as many digits of pi as possible—it might harm humanity in order to acquire more resources or prevent itself from being shut down, ultimately to better achieve its goal. Bostrom also emphasizes the difficulty of fully conveying humanity’s values to an advanced AI. He uses the hypothetical example of giving an AI the goal to make humans smile to illustrate a misguided attempt. If the AI in that scenario were to become superintelligent, Bostrom argues, it may resort to methods that most humans would find horrifying, such as inserting “electrodes into the facial muscles of humans to cause constant, beaming grins” because that would be an efficient way to achieve its goal of making humans smile.[258] In his book Human Compatible, AI researcher Stuart J. Russell echoes some of Bostrom’s concerns while also proposing an approach to developing provably beneficial machines focused on uncertainty and deference to humans,[259]:173 possibly involving inverse reinforcement learning.[259]:191–193

Concern over risk from artificial intelligence has led to some high-profile donations and investments. A group of prominent tech titans including Peter Thiel, Amazon Web Services and Musk have committed $1 billion to OpenAI, a nonprofit company aimed at championing responsible AI development.[260] The opinion of experts within the field of artificial intelligence is mixed, with sizable fractions both concerned and unconcerned by risk from eventual superhumanly-capable AI.[261] Other technology industry leaders believe that artificial intelligence is helpful in its current form and will continue to assist humans. Oracle CEO Mark Hurd has stated that AI “will actually create more jobs, not less jobs” as humans will be needed to manage AI systems.[262] Facebook CEO Mark Zuckerberg believes AI will “unlock a huge amount of positive things,” such as curing disease and increasing the safety of autonomous cars.[263] In January 2015, Musk donated $10 million to the Future of Life Institute to fund research on understanding AI decision making. The goal of the institute is to “grow wisdom with which we manage” the growing power of technology. Musk also funds companies developing artificial intelligence such as DeepMind and Vicarious to “just keep an eye on what’s going on with artificial intelligence.[264] I think there is potentially a dangerous outcome there.”[265][266]

For the danger of uncontrolled advanced AI to be realized, the hypothetical AI would have to overpower or out-think all of humanity, which a minority of experts argue is a possibility far enough in the future to not be worth researching.[267][268] Other counterarguments revolve around humans being either intrinsically or convergently valuable from the perspective of an artificial intelligence.[269]

Regulation

Main articles: Regulation of artificial intelligence and Regulation of algorithms

The regulation of artificial intelligence is the development of public sector policies and laws for promoting and regulating artificial intelligence (AI);[270][271] it is therefore related to the broader regulation of algorithms. The regulatory and policy landscape for AI is an emerging issue in jurisdictions globally, including in the European Union.[272] Regulation is considered necessary to both encourage AI and manage associated risks.[273][274] Regulation of AI through mechanisms such as review boards can also be seen as social means to approach the AI control problem.[275]

In fiction

Main article: Artificial intelligence in fictionThe word “robot” itself was coined by Karel Čapek in his 1921 play R.U.R., the title standing for “Rossum’s Universal Robots”

Thought-capable artificial beings appeared as storytelling devices since antiquity,[37] and have been a persistent theme in science fiction.

A common trope in these works began with Mary Shelley‘s Frankenstein, where a human creation becomes a threat to its masters. This includes such works as Arthur C. Clarke’s and Stanley Kubrick’s 2001: A Space Odyssey (both 1968), with HAL 9000, the murderous computer in charge of the Discovery One spaceship, as well as The Terminator (1984) and The Matrix (1999). In contrast, the rare loyal robots such as Gort from The Day the Earth Stood Still (1951) and Bishop from Aliens (1986) are less prominent in popular culture.[276]

Isaac Asimov introduced the Three Laws of Robotics in many books and stories, most notably the “Multivac” series about a super-intelligent computer of the same name. Asimov’s laws are often brought up during lay discussions of machine ethics;[277] while almost all artificial intelligence researchers are familiar with Asimov’s laws through popular culture, they generally consider the laws useless for many reasons, one of which is their ambiguity.[278]

Transhumanism (the merging of humans and machines) is explored in the manga Ghost in the Shell and the science-fiction series Dune. In the 1980s, artist Hajime Sorayama‘s Sexy Robots series were painted and published in Japan depicting the actual organic human form with lifelike muscular metallic skins and later “the Gynoids” book followed that was used by or influenced movie makers including George Lucas and other creatives. Sorayama never considered these organic robots to be real part of nature but always an unnatural product of the human mind, a fantasy existing in the mind even when realized in actual form.

Several works use AI to force us to confront the fundamental question of what makes us human, showing us artificial beings that have the ability to feel, and thus to suffer. This appears in Karel Čapek‘s R.U.R., the films A.I. Artificial Intelligence and Ex Machina, as well as the novel Do Androids Dream of Electric Sheep?, by Philip K. Dick. Dick considers the idea that our understanding of human subjectivity is altered by technology created with artificial intelligence.[279]

See also

Explanatory notes

  1. ^ The act of doling out rewards can itself be formalized or automated into a “reward function“.
  2. ^ Terminology varies; see algorithm characterizations.
  3. ^ Adversarial vulnerabilities can also result in nonlinear systems, or from non-pattern perturbations. Some systems are so brittle that changing a single adversarial pixel predictably induces misclassification.
  4. ^ Alan Turing discussed the centrality of learning as early as 1950, in his classic paper “Computing Machinery and Intelligence“.[125] In 1956, at the original Dartmouth AI summer conference, Ray Solomonoff wrote a report on unsupervised probabilistic machine learning: “An Inductive Inference Machine”.[126]
  5. ^ 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 Tand some performance measure P if its performance on T as measured by Pimproves with experience E.”
  6. ^ Nils Nilsson writes: “Simply put, there is wide disagreement in the field about what AI is all about.”[167]
  7. ^ 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 AIAI winter, or Frank Rosenblatt.[citation needed]
  8. ^ While such a “victory of the neats” may be a consequence of the field becoming more mature, AIMA states that in practice both neat and scruffy approaches continue to be necessary in AI research.
  9. ^ Dreyfus criticized the necessary condition of the physical symbol systemhypothesis, which he called the “psychological assumption”: “The mind can be viewed as a device operating on bits of information according to formal rules.”[208]
  10. ^ In the early 1970s, Kenneth Colby presented a version of Weizenbaum’s ELIZAknown as DOCTOR which he promoted as a serious therapeutic tool.[217]
  11. ^ This is based on Mary’s Room, a thought experiment first proposed by Frank Jackson in 1982
  12. ^ 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.”[230] 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.”

References

  1. ^ Poole, Mackworth & Goebel 1998p. 1.
  2. ^ Russell & Norvig 2003, p. 55.
  3. a b c Definition of AI as the study of intelligent agents:
  4. ^ Russell & Norvig 2009, p. 2.
  5. ^ McCorduck 2004, p. 204
  6. ^ Maloof, Mark. “Artificial Intelligence: An Introduction, p. 37” (PDF). georgetown.eduArchived (PDF) from the original on 25 August 2018.
  7. ^ “How AI Is Getting Groundbreaking Changes In Talent Management And HR Tech”. Hackernoon. Archived from the original on 11 September 2019. Retrieved 14 February 2020.
  8. ^ Schank, Roger C. (1991). “Where’s the AI”. AI magazine. Vol. 12 no. 4. p. 38.
  9. ^ Russell & Norvig 2009.
  10. a b “AlphaGo – Google DeepMind”Archived from the original on 10 March 2016.
  11. a b Bowling, Michael; Burch, Neil; Johanson, Michael; Tammelin, Oskari (9 January 2015). “Heads-up limit hold’em poker is solved”Science347 (6218): 145–149. doi:10.1126/science.1259433ISSN 0036-8075PMID 25574016.
  12. ^ Allen, Gregory (April 2020). “Department of Defense Joint AI Center – Understanding AI Technology” (PDF). AI.mil – The official site of the Department of Defense Joint Artificial Intelligence CenterArchived (PDF) from the original on 21 April 2020. Retrieved 25 April 2020.
  13. a b Optimism of early AI: * Herbert Simon quote: Simon 1965, p. 96 quoted in Crevier 1993, p. 109. * Marvin Minsky quote: Minsky 1967, p. 2 quoted in Crevier 1993, p. 109.
  14. a b c Boom of the 1980s: rise of expert systemsFifth Generation ProjectAlveyMCCSCI: * McCorduck 2004, pp. 426–441 * Crevier 1993, pp. 161–162,197–203, 211, 240 * Russell & Norvig 2003, p. 24 * NRC 1999, pp. 210–211 * Newquist 1994, pp. 235–248
  15. a b First AI WinterMansfield AmendmentLighthill report * Crevier 1993, pp. 115–117 * Russell & Norvig 2003, p. 22 * NRC 1999, pp. 212–213 * Howe 1994 * Newquist 1994, pp. 189–201
  16. a b Second AI winter: * McCorduck 2004, pp. 430–435 * Crevier 1993, pp. 209–210 * NRC 1999, pp. 214–216 * Newquist 1994, pp. 301–318
  17. a b c AI becomes hugely successful in the early 21st century * Clark 2015b
  18. ^ Haenlein, Michael; Kaplan, Andreas (2019). “A Brief History of Artificial Intelligence: On the Past, Present, and Future of Artificial Intelligence”California Management Review61 (4): 5–14. doi:10.1177/0008125619864925ISSN 0008-1256S2CID 199866730.
  19. a b Pamela McCorduck (2004, p. 424) writes of “the rough shattering of AI in subfields—vision, natural language, decision theory, genetic algorithms, robotics … and these with own sub-subfield—that would hardly have anything to say to each other.”
  20. a b c 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
  21. ^ Kolata 1982.
  22. ^ Maker 2006.
  23. a b c Biological intelligence vs. intelligence in general:
    • Russell & Norvig 2003, pp. 2–3, who make the analogy with aeronautical engineering.
    • McCorduck 2004, pp. 100–101, who writes that there are “two major branches of artificial intelligence: one aimed at producing intelligent behavior regardless of how it was accomplished, and the other aimed at modeling intelligent processes found in nature, particularly human ones.”
    • Kolata 1982, a paper in Science, which describes McCarthy’s indifference to biological models. Kolata quotes McCarthy as writing: “This is AI, so we don’t care if it’s psychologically real”.[21] McCarthy recently reiterated his position at the AI@50 conference where he said “Artificial intelligence is not, by definition, simulation of human intelligence”.[22]
  24. a b c Neats vs. scruffies: * McCorduck 2004, pp. 421–424, 486–489 * Crevier 1993, p. 168 * Nilsson 1983, pp. 10–11
  25. a b Symbolic vs. sub-symbolic AI: * Nilsson (1998, p. 7), who uses the term “sub-symbolic”.
  26. a b General intelligence (strong AI) is discussed in popular introductions to AI: * Kurzweil 1999 and Kurzweil 2005
  27. ^ See the Dartmouth proposal, under Philosophy, below.
  28. ^ McCorduck 2004, p. 34.
  29. ^ McCorduck 2004, p. xviii.
  30. ^ McCorduck 2004, p. 3.
  31. ^ McCorduck 2004, pp. 340–400.
  32. a b This is a central idea of Pamela McCorduck‘s Machines Who Think. She writes:
    • “I like to think of artificial intelligence as the scientific apotheosis of a venerable cultural tradition.”[28]
    • “Artificial intelligence in one form or another is an idea that has pervaded Western intellectual history, a dream in urgent need of being realized.”[29]
    • “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.”[30]
    She traces the desire back to its Hellenistic roots and calls it the urge to “forge the Gods.”[31]
  33. ^ “Stephen Hawking believes AI could be mankind’s last accomplishment”BetaNews. 21 October 2016. Archived from the original on 28 August 2017.
  34. ^ Lombardo P, Boehm I, Nairz K (2020). “RadioComics – Santa Claus and the future of radiology”Eur J Radiol122 (1): 108771. doi:10.1016/j.ejrad.2019.108771PMID 31835078.
  35. a b Ford, Martin; Colvin, Geoff (6 September 2015). “Will robots create more jobs than they destroy?”The GuardianArchived from the original on 16 June 2018. Retrieved 13 January 2018.
  36. a b AI applications widely used behind the scenes: * Russell & Norvig 2003, p. 28 * Kurzweil 2005, p. 265 * NRC 1999, pp. 216–222 * Newquist 1994, pp. 189–201
  37. a b AI in myth: * McCorduck 2004, pp. 4–5 * Russell & Norvig 2003, p. 939
  38. ^ AI in early science fiction. * McCorduck 2004, pp. 17–25
  39. ^ Formal reasoning: * Berlinski, David (2000). The Advent of the Algorithm. Harcourt Books. ISBN 978-0-15-601391-8OCLC 46890682Archived from the original on 26 July 2020. Retrieved 22 August 2020.
  40. ^ Turing, Alan (1948), “Machine Intelligence”, in Copeland, B. Jack (ed.), The Essential Turing: The ideas that gave birth to the computer age, Oxford: Oxford University Press, p. 412, ISBN 978-0-19-825080-7
  41. ^ Russell & Norvig 2009, p. 16.
  42. ^ Dartmouth conference: * McCorduck 2004, pp. 111–136 * Crevier 1993, pp. 47–49, who writes “the conference is generally recognized as the official birthdate of the new science.” * Russell & Norvig 2003, p. 17, who call the conference “the birth of artificial intelligence.” * NRC 1999, pp. 200–201
  43. ^ McCarthy, John (1988). “Review of The Question of Artificial Intelligence“. Annals of the History of Computing10 (3): 224–229., collected in McCarthy, John (1996). “10. Review of The Question of Artificial Intelligence“. Defending AI Research: A Collection of Essays and Reviews. CSLI., p. 73, “[O]ne of the reasons for inventing the term “artificial intelligence” was to escape association with “cybernetics”. Its concentration on analog feedback seemed misguided, and I wished to avoid having either to accept Norbert (not Robert) Wiener as a guru or having to argue with him.”
  44. ^ 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
  45. ^ Russell & Norvig 2003, p. 18: “it was astonishing whenever a computer did anything kind of smartish”
  46. ^ Schaeffer J. (2009) Didn’t Samuel Solve That Game?. In: One Jump Ahead. Springer, Boston, MA
  47. ^ Samuel, A. L. (July 1959). “Some Studies in Machine Learning Using the Game of Checkers”. IBM Journal of Research and Development3 (3): 210–229. CiteSeerX 10.1.1.368.2254doi:10.1147/rd.33.0210.
  48. ^ “Golden years” of AI (successful symbolic reasoning programs 1956–1973): * McCorduck 2004, pp. 243–252 * Crevier 1993, pp. 52–107 * Moravec 1988, p. 9 * Russell & Norvig 2003, pp. 18–21 The programs described are Arthur Samuel‘s checkers program for the IBM 701Daniel Bobrow‘s STUDENTNewell and Simon‘s Logic Theorist and Terry Winograd‘s SHRDLU.
  49. ^ DARPA pours money into undirected pure research into AI during the 1960s: * McCorduck 2004, p. 131 * Crevier 1993, pp. 51, 64–65 * NRC 1999, pp. 204–205
  50. ^ AI in England: * Howe 1994
  51. ^ Lighthill 1973.
  52. 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 * Newquist 1994, pp. 155–183
  53. ^ Mead, Carver A.; Ismail, Mohammed (8 May 1989). Analog VLSI Implementation of Neural Systems (PDF). The Kluwer International Series in Engineering and Computer Science. 80. Norwell, MA: Kluwer Academic Publishersdoi:10.1007/978-1-4613-1639-8ISBN 978-1-4613-1639-8. Archived from the original (PDF) on 6 November 2019. Retrieved 24 January 2020.
  54. a b Formal methods are now preferred (“Victory of the neats“): * Russell & Norvig 2003, pp. 25–26 * McCorduck 2004, pp. 486–487
  55. ^ McCorduck 2004, pp. 480–483.
  56. ^ Markoff 2011.
  57. ^ “Ask the AI experts: What’s driving today’s progress in AI?”McKinsey & CompanyArchived from the original on 13 April 2018. Retrieved 13 April 2018.
  58. ^ Fairhead, Harry (26 March 2011) [Update 30 March 2011]. “Kinect’s AI breakthrough explained”I ProgrammerArchived from the original on 1 February 2016.
  59. ^ Rowinski, Dan (15 January 2013). “Virtual Personal Assistants & The Future Of Your Smartphone [Infographic]”ReadWriteArchived from the original on 22 December 2015.
  60. ^ “Artificial intelligence: Google’s AlphaGo beats Go master Lee Se-dol”BBC News. 12 March 2016. Archived from the original on 26 August 2016. Retrieved 1 October 2016.
  61. ^ Metz, Cade (27 May 2017). “After Win in China, AlphaGo’s Designers Explore New AI”WiredArchived from the original on 2 June 2017.
  62. ^ “World’s Go Player Ratings”. May 2017. Archived from the original on 1 April 2017.
  63. ^ “柯洁迎19岁生日 雄踞人类世界排名第一已两年” (in Chinese). May 2017. Archived from the original on 11 August 2017.
  64. ^ “MuZero: Mastering Go, chess, shogi and Atari without rules”Deepmind. Retrieved 1 March 2021.
  65. ^ Steven Borowiec; Tracey Lien (12 March 2016). “AlphaGo beats human Go champ in milestone for artificial intelligence”Los Angeles Times. Retrieved 13 March2016.
  66. ^ Silver, David; Hubert, Thomas; Schrittwieser, Julian; Antonoglou, Ioannis; Lai, Matthew; Guez, Arthur; Lanctot, Marc; Sifre, Laurent; Kumaran, Dharshan; Graepel, Thore; Lillicrap, Timothy; Simonyan, Karen; Hassabis, Demis (7 December 2018). “A general reinforcement learning algorithm that masters chess, shogi, and go through self-play”Science362 (6419): 1140–1144. Bibcode:2018Sci…362.1140Sdoi:10.1126/science.aar6404PMID 30523106.
  67. ^ Schrittwieser, Julian; Antonoglou, Ioannis; Hubert, Thomas; Simonyan, Karen; Sifre, Laurent; Schmitt, Simon; Guez, Arthur; Lockhart, Edward; Hassabis, Demis; Graepel, Thore; Lillicrap, Timothy (23 December 2020). “Mastering Atari, Go, chess and shogi by planning with a learned model”Nature588 (7839): 604–609. arXiv:1911.08265doi:10.1038/s41586-020-03051-4ISSN 1476-4687.
  68. ^ Tung, Liam. “Google’s DeepMind artificial intelligence aces Atari gaming challenge”ZDNet. Retrieved 1 March 2021.
  69. ^ Solly, Meilan. “This Poker-Playing A.I. Knows When to Hold ‘Em and When to Fold ‘Em”SmithsonianPluribus has bested poker pros in a series of six-player no-limit Texas Hold’em games, reaching a milestone in artificial intelligence research. It is the first bot to beat humans in a complex multiplayer competition.
  70. a b Clark 2015b. “After a half-decade of quiet breakthroughs in artificial intelligence, 2015 has been a landmark year. Computers are smarter and learning faster than ever.”
  71. ^ “Reshaping Business With Artificial Intelligence”MIT Sloan Management ReviewArchived from the original on 19 May 2018. Retrieved 2 May 2018.
  72. ^ Lorica, Ben (18 December 2017). “The state of AI adoption”O’Reilly MediaArchived from the original on 2 May 2018. Retrieved 2 May 2018.
  73. ^ Allen, Gregory (6 February 2019). “Understanding China’s AI Strategy”Center for a New American SecurityArchived from the original on 17 March 2019.
  74. ^ “Review | How two AI superpowers – the U.S. and China – battle for supremacy in the field”The Washington Post. 2 November 2018. Archived from the original on 4 November 2018. Retrieved 4 November 2018.
  75. ^ Anadiotis, George (1 October 2020). “The state of AI in 2020: Democratization, industrialization, and the way to artificial general intelligence”ZDNet. Retrieved 1 March 2021.
  76. ^ Heath, Nick (11 December 2020). “What is AI? Everything you need to know about Artificial Intelligence”ZDNet. Retrieved 1 March 2021.
  77. ^ Kaplan, Andreas; Haenlein, Michael (1 January 2019). “Siri, Siri, in my hand: Who’s the fairest in the land? On the interpretations, illustrations, and implications of artificial intelligence”. Business Horizons62 (1): 15–25. doi:10.1016/j.bushor.2018.08.004.
  78. ^ Domingos 2015, Chapter 5.
  79. ^ Domingos 2015, Chapter 7.
  80. ^ Lindenbaum, M., Markovitch, S., & Rusakov, D. (2004). Selective sampling for nearest neighbor classifiers. Machine learning, 54(2), 125–152.
  81. ^ Domingos 2015, Chapter 1.
  82. a b Intractability and efficiency and the combinatorial explosion: * Russell & Norvig 2003, pp. 9, 21–22
  83. ^ Domingos 2015, Chapter 2, Chapter 3.
  84. ^ Hart, P. E.; Nilsson, N. J.; Raphael, B. (1972). “Correction to “A Formal Basis for the Heuristic Determination of Minimum Cost Paths””. SIGART Newsletter (37): 28–29. doi:10.1145/1056777.1056779S2CID 6386648.
  85. ^ Domingos 2015, Chapter 2, Chapter 4, Chapter 6.
  86. ^ “Can neural network computers learn from experience, and if so, could they ever become what we would call ‘smart’?”Scientific American. 2018. Archived from the original on 25 March 2018. Retrieved 24 March 2018.
  87. ^ Domingos 2015, Chapter 6, Chapter 7.
  88. ^ Domingos 2015, p. 286.
  89. ^ “Single pixel change fools AI programs”BBC News. 3 November 2017. Archived from the original on 22 March 2018. Retrieved 12 March 2018.
  90. ^ “AI Has a Hallucination Problem That’s Proving Tough to Fix”WIRED. 2018. Archived from the original on 12 March 2018. Retrieved 12 March 2018.
  91. ^ “Cultivating Common Sense | DiscoverMagazine.com”Discover Magazine. 2017. Archived from the original on 25 March 2018. Retrieved 24 March 2018.
  92. ^ Davis, Ernest; Marcus, Gary (24 August 2015). “Commonsense reasoning and commonsense knowledge in artificial intelligence”Communications of the ACM58 (9): 92–103. doi:10.1145/2701413S2CID 13583137Archived from the original on 22 August 2020. Retrieved 6 April 2020.
  93. ^ Winograd, Terry (January 1972). “Understanding natural language”. Cognitive Psychology3 (1): 1–191. doi:10.1016/0010-0285(72)90002-3.
  94. ^ “Don’t worry: Autonomous cars aren’t coming tomorrow (or next year)”Autoweek. 2016. Archived from the original on 25 March 2018. Retrieved 24 March 2018.
  95. ^ Knight, Will (2017). “Boston may be famous for bad drivers, but it’s the testing ground for a smarter self-driving car”MIT Technology ReviewArchived from the original on 22 August 2020. Retrieved 27 March 2018.
  96. ^ Prakken, Henry (31 August 2017). “On the problem of making autonomous vehicles conform to traffic law”Artificial Intelligence and Law25 (3): 341–363. doi:10.1007/s10506-017-9210-0.
  97. a b Lieto, Antonio; Lebiere, Christian; Oltramari, Alessandro (May 2018). “The knowledge level in cognitive architectures: Current limitations and possible developments”. Cognitive Systems Research48: 39–55. doi:10.1016/j.cogsys.2017.05.001hdl:2318/1665207S2CID 206868967.
  98. ^ 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
  99. ^ Uncertain reasoning: * Russell & Norvig 2003, pp. 452–644, * Poole, Mackworth & Goebel 1998, pp. 345–395, * Luger & Stubblefield 2004, pp. 333–381, * Nilsson 1998, chpt. 19
  100. ^ 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)
  101. ^ 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
  102. ^ Knowledge engineering: * Russell & Norvig 2003, pp. 260–266, * Poole, Mackworth & Goebel 1998, pp. 199–233, * Nilsson 1998, chpt. ≈17.1–17.4
  103. ^ Representing categories and relations: Semantic networksdescription logicsinheritance (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
  104. ^ Representing events and time:Situation calculusevent calculusfluent calculus(including solving the frame problem): * Russell & Norvig 2003, pp. 328–341, * Poole, Mackworth & Goebel 1998, pp. 281–298, * Nilsson 1998, chpt. 18.2
  105. ^ Causal calculus: * Poole, Mackworth & Goebel 1998, pp. 335–337
  106. ^ Representing knowledge about knowledge: Belief calculus, modal logics: * Russell & Norvig 2003, pp. 341–344, * Poole, Mackworth & Goebel 1998, pp. 275–277
  107. ^ Sikos, Leslie F. (June 2017). Description Logics in Multimedia Reasoning. Cham: Springer. doi:10.1007/978-3-319-54066-5ISBN 978-3-319-54066-5S2CID 3180114Archived from the original on 29 August 2017.
  108. ^ Ontology: * Russell & Norvig 2003, pp. 320–328
  109. ^ Smoliar, Stephen W.; Zhang, HongJiang (1994). “Content based video indexing and retrieval”. IEEE Multimedia1 (2): 62–72. doi:10.1109/93.311653S2CID 32710913.
  110. ^ Neumann, Bernd; Möller, Ralf (January 2008). “On scene interpretation with description logics”. Image and Vision Computing26 (1): 82–101. doi:10.1016/j.imavis.2007.08.013.
  111. ^ Kuperman, G. J.; Reichley, R. M.; Bailey, T. C. (1 July 2006). “Using Commercial Knowledge Bases for Clinical Decision Support: Opportunities, Hurdles, and Recommendations”Journal of the American Medical Informatics Association13(4): 369–371. doi:10.1197/jamia.M2055PMC 1513681PMID 16622160.
  112. ^ MCGARRY, KEN (1 December 2005). “A survey of interestingness measures for knowledge discovery”. The Knowledge Engineering Review20 (1): 39–61. doi:10.1017/S0269888905000408S2CID 14987656.
  113. ^ Bertini, M; Del Bimbo, A; Torniai, C (2006). “Automatic annotation and semantic retrieval of video sequences using multimedia ontologies”. MM ’06 Proceedings of the 14th ACM international conference on Multimedia. 14th ACM international conference on Multimedia. Santa Barbara: ACM. pp. 679–682.
  114. ^ Qualification problem: * McCarthy & Hayes 1969 * Russell & Norvig 2003[page needed] While McCarthy was primarily concerned with issues in the logical representation of actions, Russell & Norvig 2003 apply the term to the more general issue of default reasoning in the vast network of assumptions underlying all our commonsense knowledge.
  115. ^ Default reasoning and default logicnon-monotonic logicscircumscriptionclosed world assumptionabduction (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
  116. ^ Breadth of commonsense knowledge: * Russell & Norvig 2003, p. 21, * Crevier 1993, pp. 113–114, * Moravec 1988, p. 13, * Lenat & Guha 1989 (Introduction)
  117. ^ Dreyfus & Dreyfus 1986.
  118. ^ Gladwell 2005.
  119. a b Expert knowledge as embodied intuition: * Dreyfus & Dreyfus 1986 (Hubert Dreyfus is a philosopher and critic of AI who was among the first to argue that most useful human knowledge was encoded sub-symbolically. See Dreyfus’ critique of AI) * Gladwell 2005 (Gladwell’s Blink is a popular introduction to sub-symbolic reasoning and knowledge.) * Hawkins & Blakeslee 2005 (Hawkins argues that sub-symbolic knowledge should be the primary focus of AI research.)
  120. ^ 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
  121. ^ Information value theory: * Russell & Norvig 2003, pp. 600–604
  122. ^ Classical planning: * Russell & Norvig 2003, pp. 375–430, * Poole, Mackworth & Goebel 1998, pp. 281–315, * Luger & Stubblefield 2004, pp. 314–329, * Nilsson 1998, chpt. 10.1–2, 22
  123. ^ Planning and acting in non-deterministic domains: conditional planning, execution monitoring, replanning and continuous planning: * Russell & Norvig 2003, pp. 430–449
  124. ^ Multi-agent planning and emergent behavior: * Russell & Norvig 2003, pp. 449–455
  125. ^ Turing 1950.
  126. ^ Solomonoff 1956.
  127. a b 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
  128. ^ Jordan, M. I.; Mitchell, T. M. (16 July 2015). “Machine learning: Trends, perspectives, and prospects”. Science349 (6245): 255–260. Bibcode:2015Sci…349..255Jdoi:10.1126/science.aaa8415PMID 26185243S2CID 677218.
  129. ^ Reinforcement learning: * Russell & Norvig 2003, pp. 763–788 * Luger & Stubblefield 2004, pp. 442–449
  130. ^ 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
  131. ^ “Versatile question answering systems: seeing in synthesis” Archived 1 February 2016 at the Wayback Machine, Mittal et al., IJIIDS, 5(2), 119–142, 2011
  132. ^ 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
  133. ^ Cambria, Erik; White, Bebo (May 2014). “Jumping NLP Curves: A Review of Natural Language Processing Research [Review Article]”. IEEE Computational Intelligence Magazine9 (2): 48–57. doi:10.1109/MCI.2014.2307227S2CID 206451986.
  134. ^ Vincent, James (7 November 2019). “OpenAI has published the text-generating AI it said was too dangerous to share”The VergeArchived from the original on 11 June 2020. Retrieved 11 June 2020.
  135. ^ Machine perception: * Russell & Norvig 2003, pp. 537–581, 863–898 * Nilsson 1998, ~chpt. 6
  136. ^ Speech recognition: * ACM 1998, ~I.2.7 * Russell & Norvig 2003, pp. 568–578
  137. ^ Object recognition: * Russell & Norvig 2003, pp. 885–892
  138. ^ Computer vision: * ACM 1998, I.2.10 * Russell & Norvig 2003, pp. 863–898 * Nilsson 1998, chpt. 6
  139. ^ Robotics: * ACM 1998, I.2.9, * Russell & Norvig 2003, pp. 901–942, * Poole, Mackworth & Goebel 1998, pp. 443–460
  140. ^ Moving and configuration space: * Russell & Norvig 2003, pp. 916–932
  141. ^ Tecuci 2012.
  142. ^ Robotic mapping (localization, etc): * Russell & Norvig 2003, pp. 908–915
  143. ^ Cadena, Cesar; Carlone, Luca; Carrillo, Henry; Latif, Yasir; Scaramuzza, Davide; Neira, Jose; Reid, Ian; Leonard, John J. (December 2016). “Past, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age”. IEEE Transactions on Robotics32 (6): 1309–1332. arXiv:1606.05830Bibcode:2016arXiv160605830Cdoi:10.1109/TRO.2016.2624754S2CID 2596787.
  144. ^ Moravec 1988, p. 15.
  145. ^ Chan, Szu Ping (15 November 2015). “This is what will happen when robots take over the world”Archived from the original on 24 April 2018. Retrieved 23 April2018.
  146. ^ “IKEA furniture and the limits of AI”The Economist. 2018. Archived from the original on 24 April 2018. Retrieved 24 April 2018.
  147. ^ “Kismet”. MIT Artificial Intelligence Laboratory, Humanoid Robotics Group. Archived from the original on 17 October 2014. Retrieved 25 October 2014.
  148. ^ Thompson, Derek (2018). “What Jobs Will the Robots Take?”The AtlanticArchived from the original on 24 April 2018. Retrieved 24 April 2018.
  149. ^ Scassellati, Brian (2002). “Theory of mind for a humanoid robot”. Autonomous Robots12 (1): 13–24. doi:10.1023/A:1013298507114S2CID 1979315.
  150. ^ Cao, Yongcan; Yu, Wenwu; Ren, Wei; Chen, Guanrong (February 2013). “An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination”. IEEE Transactions on Industrial Informatics9 (1): 427–438. arXiv:1207.3231doi:10.1109/TII.2012.2219061S2CID 9588126.
  151. ^ Thro 1993.
  152. ^ Edelson 1991.
  153. ^ Tao & Tan 2005.
  154. ^ Poria, Soujanya; Cambria, Erik; Bajpai, Rajiv; Hussain, Amir (September 2017). “A review of affective computing: From unimodal analysis to multimodal fusion”. Information Fusion37: 98–125. doi:10.1016/j.inffus.2017.02.003hdl:1893/25490.
  155. ^ Emotion and affective computing: * Minsky 2006
  156. ^ Waddell, Kaveh (2018). “Chatbots Have Entered the Uncanny Valley”The AtlanticArchived from the original on 24 April 2018. Retrieved 24 April 2018.
  157. ^ Pennachin, C.; Goertzel, B. (2007). “Contemporary Approaches to Artificial General Intelligence”. Artificial General Intelligence. Cognitive Technologies. Berlin, Heidelberg: Springer. doi:10.1007/978-3-540-68677-4_1ISBN 978-3-540-23733-4.
  158. a b c Roberts, Jacob (2016). “Thinking Machines: The Search for Artificial Intelligence”Distillations. Vol. 2 no. 2. pp. 14–23. Archived from the original on 19 August 2018. Retrieved 20 March 2018.
  159. ^ “The superhero of artificial intelligence: can this genius keep it in check?”the Guardian. 16 February 2016. Archived from the original on 23 April 2018. Retrieved 26 April 2018.
  160. ^ Mnih, Volodymyr; Kavukcuoglu, Koray; Silver, David; Rusu, Andrei A.; Veness, Joel; Bellemare, Marc G.; Graves, Alex; Riedmiller, Martin; Fidjeland, Andreas K.; Ostrovski, Georg; Petersen, Stig; Beattie, Charles; Sadik, Amir; Antonoglou, Ioannis; King, Helen; Kumaran, Dharshan; Wierstra, Daan; Legg, Shane; Hassabis, Demis (26 February 2015). “Human-level control through deep reinforcement learning”. Nature518 (7540): 529–533. Bibcode:2015Natur.518..529Mdoi:10.1038/nature14236PMID 25719670S2CID 205242740.
  161. ^ Sample, Ian (14 March 2017). “Google’s DeepMind makes AI program that can learn like a human”the GuardianArchived from the original on 26 April 2018. Retrieved 26 April 2018.
  162. ^ “From not working to neural networking”The Economist. 2016. Archived from the original on 31 December 2016. Retrieved 26 April 2018.
  163. ^ Russell & Norvig 2009, Chapter 27. AI: The Present and Future.
  164. ^ Domingos 2015, Chapter 9. The Pieces of the Puzzle Fall into Place.
  165. a b Artificial brain arguments: AI requires a simulation of the operation of the human brain * Russell & Norvig 2003, p. 957 * Crevier 1993, pp. 271 & 279 A few of the people who make some form of the argument: * Moravec 1988 * Kurzweil 2005, p. 262 * Hawkins & Blakeslee 2005 The most extreme form of this argument (the brain replacement scenario) was put forward by Clark Glymour in the mid-1970s and was touched on by Zenon Pylyshyn and John Searle in 1980.
  166. ^ Goertzel, Ben; Lian, Ruiting; Arel, Itamar; de Garis, Hugo; Chen, Shuo (December 2010). “A world survey of artificial brain projects, Part II: Biologically inspired cognitive architectures”. Neurocomputing74 (1–3): 30–49. doi:10.1016/j.neucom.2010.08.012.
  167. ^ Nilsson 1983, p. 10.
  168. ^ AI’s immediate precursors: * McCorduck 2004, pp. 51–107 * Crevier 1993, pp. 27–32 * Russell & Norvig 2003, pp. 15, 940 * Moravec 1988, p. 3
  169. ^ Haugeland 1985, pp. 112–117
  170. ^ 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
  171. ^ Soar (history): * McCorduck 2004, pp. 450–451 * Crevier 1993, pp. 258–263
  172. ^ McCarthy and AI research at SAIL and SRI International: * McCorduck 2004, pp. 251–259 * Crevier 1993
  173. ^ AI research at Edinburgh and in France, birth of Prolog: * Crevier 1993, pp. 193–196 * Howe 1994
  174. ^ 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
  175. ^ Cyc: * McCorduck 2004, p. 489, who calls it “a determinedly scruffy enterprise” * Crevier 1993, pp. 239–243 * Russell & Norvig 2003, p. 363−365 * Lenat & Guha 1989
  176. ^ Knowledge revolution: * McCorduck 2004, pp. 266–276, 298–300, 314, 421 * Russell & Norvig 2003, pp. 22–23
  177. ^ Frederick, Hayes-Roth; William, Murray; Leonard, Adelman. “Expert systems”. AccessSciencedoi:10.1036/1097-8542.248550.
  178. ^ Embodied approaches to AI: * McCorduck 2004, pp. 454–462 * Brooks 1990 * Moravec 1988
  179. ^ Weng et al. 2001.
  180. ^ Lungarella et al. 2003.
  181. ^ Asada et al. 2009.
  182. ^ Oudeyer 2010.
  183. ^ Revival of connectionism: * Crevier 1993, pp. 214–215 * Russell & Norvig 2003, p. 25
  184. ^ Computational intelligence * IEEE Computational Intelligence SocietyArchived 9 May 2008 at the Wayback Machine
  185. ^ Hutson, Matthew (16 February 2018). “Artificial intelligence faces reproducibility crisis”Science. pp. 725–726. Bibcode:2018Sci…359..725Hdoi:10.1126/science.359.6377.725Archived from the original on 29 April 2018. Retrieved 28 April 2018.
  186. ^ Norvig 2012.
  187. ^ Langley 2011.
  188. ^ Katz 2012.
  189. ^ The intelligent agent paradigm: * Russell & Norvig 2003, pp. 27, 32–58, 968–972 * Poole, Mackworth & Goebel 1998, pp. 7–21 * Luger & Stubblefield 2004, pp. 235–240 * Hutter 2005, pp. 125–126 The definition used in this article, in terms of goals, actions, perception and environment, is due to Russell & Norvig (2003). Other definitions also include knowledge and learning as additional criteria.
  190. ^ Agent architectureshybrid intelligent systems: * Russell & Norvig (2003, pp. 27, 932, 970–972) * Nilsson (1998, chpt. 25)
  191. ^ Hierarchical control system: * Albus 2002
  192. ^ Lieto, Antonio; Bhatt, Mehul; Oltramari, Alessandro; Vernon, David (May 2018). “The role of cognitive architectures in general artificial intelligence”. Cognitive Systems Research48: 1–3. doi:10.1016/j.cogsys.2017.08.003hdl:2318/1665249S2CID 36189683.
  193. a b Russell & Norvig 2009, p. 1.
  194. a b White Paper: On Artificial Intelligence – A European approach to excellence and trust (PDF). Brussels: European Commission. 2020. p. 1. Archived (PDF)from the original on 20 February 2020. Retrieved 20 February 2020.
  195. ^ “AI set to exceed human brain power”CNN. 9 August 2006. Archived from the original on 19 February 2008.
  196. ^ Using AI to predict flight delays Archived 20 November 2018 at the Wayback Machine, Ishti.org.
  197. ^ N. Aletras; D. Tsarapatsanis; D. Preotiuc-Pietro; V. Lampos (2016). “Predicting judicial decisions of the European Court of Human Rights: a Natural Language Processing perspective”PeerJ Computer Science2: e93. doi:10.7717/peerj-cs.93.
  198. ^ “The Economist Explains: Why firms are piling into artificial intelligence”The Economist. 31 March 2016. Archived from the original on 8 May 2016. Retrieved 19 May 2016.
  199. ^ Lohr, Steve (28 February 2016). “The Promise of Artificial Intelligence Unfolds in Small Steps”The New York TimesArchived from the original on 29 February 2016. Retrieved 29 February 2016.
  200. ^ Frangoul, Anmar (14 June 2019). “A Californian business is using A.I. to change the way we think about energy storage”CNBCArchived from the original on 25 July 2020. Retrieved 5 November 2019.
  201. ^ Wakefield, Jane (15 June 2016). “Social media ‘outstrips TV’ as news source for young people”BBC NewsArchived from the original on 24 June 2016.
  202. ^ Smith, Mark (22 July 2016). “So you think you chose to read this article?”BBC NewsArchived from the original on 25 July 2016.
  203. ^ Brown, Eileen. “Half of Americans do not believe deepfake news could target them online”ZDNetArchived from the original on 6 November 2019. Retrieved 3 December 2019.
  204. ^ Zola, Andrew (12 April 2019). “Interview Prep: 40 Artificial Intelligence Questions”Springboard Blog.
  205. ^ The Turing test:
    Turing’s original publication: * Turing 1950 Historical influence and philosophical implications: * Haugeland 1985, pp. 6–9 * Crevier 1993, p. 24 * McCorduck 2004, pp. 70–71 * Russell & Norvig 2003, pp. 2–3 and 948
  206. ^ Dartmouth proposal: * McCarthy et al. 1955 (the original proposal) * Crevier 1993, p. 49 (historical significance)
  207. ^ The physical symbol systems hypothesis: * Newell & Simon 1976, p. 116 * McCorduck 2004, p. 153 * Russell & Norvig 2003, p. 18
  208. ^ Dreyfus 1992, p. 156.
  209. ^ Dreyfus’ critique of artificial intelligence: * Dreyfus 1972Dreyfus & Dreyfus 1986 * Crevier 1993, pp. 120–132 * McCorduck 2004, pp. 211–239 * Russell & Norvig 2003, pp. 950–952,
  210. ^ 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”.
  211. ^ The Mathematical Objection: * Russell & Norvig 2003, p. 949 * McCorduck 2004, pp. 448–449 Making the Mathematical Objection: * Lucas 1961 * Penrose 1989Refuting Mathematical Objection: * Turing 1950 under “(2) The Mathematical Objection” * Hofstadter 1979 Background: * Gödel 1931, Church 1936, Kleene 1935, Turing 1937
  212. ^ Graham Oppy (20 January 2015). “Gödel’s Incompleteness Theorems”Stanford Encyclopedia of PhilosophyArchived from the original on 22 April 2016. Retrieved 27 April 2016. These Gödelian anti-mechanist arguments are, however, problematic, and there is wide consensus that they fail.
  213. ^ Stuart J. RussellPeter Norvig (2010). “26.1.2: Philosophical Foundations/Weak AI: Can Machines Act Intelligently?/The mathematical objection”. Artificial Intelligence: A Modern Approach (3rd ed.). Upper Saddle River, NJ: Prentice HallISBN 978-0-13-604259-4even if we grant that computers have limitations on what they can prove, there is no evidence that humans are immune from those limitations.
  214. ^ Mark Colyvan. An introduction to the philosophy of mathematics. Cambridge University Press, 2012. From 2.2.2, ‘Philosophical significance of Gödel’s incompleteness results’: “The accepted wisdom (with which I concur) is that the Lucas-Penrose arguments fail.”
  215. ^ Iphofen, Ron; Kritikos, Mihalis (3 January 2019). “Regulating artificial intelligence and robotics: ethics by design in a digital society”. Contemporary Social Science: 1–15. doi:10.1080/21582041.2018.1563803ISSN 2158-2041.
  216. ^ “Ethical AI Learns Human Rights Framework”Voice of AmericaArchivedfrom the original on 11 November 2019. Retrieved 10 November 2019.
  217. ^ Crevier 1993, pp. 132–144.
  218. ^ Joseph Weizenbaum‘s critique of AI: * Weizenbaum 1976 * Crevier 1993, pp. 132–144 * McCorduck 2004, pp. 356–373 * Russell & Norvig 2003, p. 961 Weizenbaum (the AI researcher who developed the first chatterbot program, ELIZA) argued in 1976 that the misuse of artificial intelligence has the potential to devalue human life.
  219. ^ Wallach, Wendell (2010). Moral Machines. Oxford University Press.
  220. ^ Wallach 2010, pp. 37–54.
  221. ^ Wallach 2010, pp. 55–73.
  222. ^ Wallach 2010, “Introduction”.
  223. a b Michael Anderson and Susan Leigh Anderson (2011), Machine Ethics, Cambridge University Press.
  224. a b “Machine Ethics”aaai.org. Archived from the original on 29 November 2014.
  225. ^ Rubin, Charles (Spring 2003). “Artificial Intelligence and Human Nature”The New Atlantis1: 88–100. Archived from the original on 11 June 2012.
  226. ^ Brooks, Rodney (10 November 2014). “artificial intelligence is a tool, not a threat”. Archived from the original on 12 November 2014.
  227. ^ “Stephen Hawking, Elon Musk, and Bill Gates Warn About Artificial Intelligence”Observer. 19 August 2015. Archived from the original on 30 October 2015. Retrieved 30 October 2015.
  228. ^ Chalmers, David (1995). “Facing up to the problem of consciousness”Journal of Consciousness Studies2 (3): 200–219. Archived from the original on 8 March 2005. Retrieved 11 October 2018. See also this link Archived 8 April 2011 at the Wayback Machine
  229. ^ Horst, Steven, (2005) “The Computational Theory of Mind” Archived 11 September 2018 at the Wayback Machine in The Stanford Encyclopedia of Philosophy
  230. ^ Searle 1980, p. 1.
  231. ^ Searle’s Chinese room argument: * Searle 1980. Searle’s original presentation of the thought experiment. * Searle 1999. Discussion: * Russell & Norvig 2003, pp. 958–960 * McCorduck 2004, pp. 443–445 * Crevier 1993, pp. 269–271
  232. ^ Robot rights: * Russell & Norvig 2003, p. 964 Prematurity of: * Henderson 2007 In fiction: * McCorduck (2004, pp. 190–25) discusses Frankenstein and identifies the key ethical issues as scientific hubris and the suffering of the monster, i.e. robot rights.
  233. ^ “Robots could demand legal rights”BBC News. 21 December 2006. Archivedfrom the original on 15 October 2019. Retrieved 3 February 2011.
  234. ^ Evans, Woody (2015). “Posthuman Rights: Dimensions of Transhuman Worlds”Teknokultura12 (2). doi:10.5209/rev_TK.2015.v12.n2.49072.
  235. ^ maschafilm. “Content: Plug & Pray Film – Artificial Intelligence – Robots -“plugandpray-film.deArchived from the original on 12 February 2016.
  236. ^ Omohundro, Steve (2008). The Nature of Self-Improving Artificial Intelligence. presented and distributed at the 2007 Singularity Summit, San Francisco, CA.
  237. a b c Technological singularity: * Vinge 1993 * Kurzweil 2005 * Russell & Norvig 2003, p. 963
  238. ^ Transhumanism: * Moravec 1988 * Kurzweil 2005 * Russell & Norvig 2003, p. 963
  239. ^ AI as evolution: * Edward Fredkin is quoted in McCorduck (2004, p. 401). * Butler 1863 * Dyson 1998
  240. ^ “Robots and Artificial Intelligence”www.igmchicago.orgArchived from the original on 1 May 2019. Retrieved 3 July 2019.
  241. ^ “Sizing the prize: PwC’s Global AI Study—Exploiting the AI Revolution” (PDF). Retrieved 11 November 2020.
  242. ^ E McGaughey, ‘Will Robots Automate Your Job Away? Full Employment, Basic Income, and Economic Democracy’ (2018) SSRN, part 2(3) Archived 24 May 2018 at the Wayback Machine
  243. ^ “Automation and anxiety”The Economist. 9 May 2015. Archived from the original on 12 January 2018. Retrieved 13 January 2018.
  244. ^ Lohr, Steve (2017). “Robots Will Take Jobs, but Not as Fast as Some Fear, New Report Says”The New York TimesArchived from the original on 14 January 2018. Retrieved 13 January 2018.
  245. ^ Frey, Carl Benedikt; Osborne, Michael A (1 January 2017). “The future of employment: How susceptible are jobs to computerisation?”. Technological Forecasting and Social Change114: 254–280. CiteSeerX 10.1.1.395.416doi:10.1016/j.techfore.2016.08.019ISSN 0040-1625.
  246. ^ Arntz, Melanie, Terry Gregory, and Ulrich Zierahn. “The risk of automation for jobs in OECD countries: A comparative analysis.” OECD Social, Employment, and Migration Working Papers 189 (2016). p. 33.
  247. ^ Mahdawi, Arwa (26 June 2017). “What jobs will still be around in 20 years? Read this to prepare your future”The GuardianArchived from the original on 14 January 2018. Retrieved 13 January 2018.
  248. ^ Simon, Matt (1 April 2019). “Andrew Yang’s Presidential Bid Is So Very 21st Century”WiredArchived from the original on 24 June 2019. Retrieved 2 May2019 – via www.wired.com.
  249. ^ “Five experts share what scares them the most about AI”. 5 September 2018. Archived from the original on 8 December 2019. Retrieved 8 December 2019.
  250. ^ Russel, Stuart., Daniel Dewey, and Max Tegmark. Research Priorities for Robust and Beneficial Artificial Intelligence. AI Magazine 36:4 (2015). 8 December 2016.
  251. ^ “Commentary: Bad news. Artificial intelligence is biased”CNA. 12 January 2019. Archived from the original on 12 January 2019. Retrieved 19 June 2020.
  252. ^ Jeff Larson, Julia Angwin (23 May 2016). “How We Analyzed the COMPAS Recidivism Algorithm”ProPublicaArchived from the original on 29 April 2019. Retrieved 19 June 2020.
  253. ^ Rawlinson, Kevin (29 January 2015). “Microsoft’s Bill Gates insists AI is a threat”BBC NewsArchived from the original on 29 January 2015. Retrieved 30 January 2015.
  254. ^ Holley, Peter (28 January 2015). “Bill Gates on dangers of artificial intelligence: ‘I don’t understand why some people are not concerned'”The Washington PostISSN 0190-8286Archived from the original on 30 October 2015. Retrieved 30 October 2015.
  255. ^ Gibbs, Samuel (27 October 2014). “Elon Musk: artificial intelligence is our biggest existential threat”The GuardianArchived from the original on 30 October 2015. Retrieved 30 October 2015.
  256. ^ Churm, Philip Andrew (14 May 2019). “Yuval Noah Harari talks politics, technology and migration”euronews. Retrieved 15 November 2020.
  257. ^ Cellan-Jones, Rory (2 December 2014). “Stephen Hawking warns artificial intelligence could end mankind”BBC NewsArchived from the original on 30 October 2015. Retrieved 30 October 2015.
  258. ^ Bostrom, Nick (2015). “What happens when our computers get smarter than we are?”TED (conference)Archived from the original on 25 July 2020. Retrieved 30 January 2020.
  259. a b Russell, Stuart (8 October 2019). Human Compatible: Artificial Intelligence and the Problem of Control. United States: Viking. ISBN 978-0-525-55861-3OCLC 1083694322.
  260. ^ Post, Washington. “Tech titans like Elon Musk are spending $1 billion to save you from terminators”Archived from the original on 7 June 2016.
  261. ^ Müller, Vincent C.; Bostrom, Nick (2014). “Future Progress in Artificial Intelligence: A Poll Among Experts” (PDF). AI Matters1 (1): 9–11. doi:10.1145/2639475.2639478S2CID 8510016Archived (PDF) from the original on 15 January 2016.
  262. ^ “Oracle CEO Mark Hurd sees no reason to fear ERP AI”SearchERPArchived from the original on 6 May 2019. Retrieved 6 May 2019.
  263. ^ “Mark Zuckerberg responds to Elon Musk’s paranoia about AI: ‘AI is going to… help keep our communities safe.'”Business Insider. 25 May 2018. Archivedfrom the original on 6 May 2019. Retrieved 6 May 2019.
  264. ^ “The mysterious artificial intelligence company Elon Musk invested in is developing game-changing smart computers”Tech InsiderArchived from the original on 30 October 2015. Retrieved 30 October 2015.
  265. ^ Clark 2015a.
  266. ^ “Elon Musk Is Donating $10M Of His Own Money To Artificial Intelligence Research”Fast Company. 15 January 2015. Archived from the original on 30 October 2015. Retrieved 30 October 2015.
  267. ^ “Is artificial intelligence really an existential threat to humanity?”Bulletin of the Atomic Scientists. 9 August 2015. Archived from the original on 30 October 2015. Retrieved 30 October 2015.
  268. ^ “The case against killer robots, from a guy actually working on artificial intelligence”Fusion.netArchived from the original on 4 February 2016. Retrieved 31 January 2016.
  269. ^ “Will artificial intelligence destroy humanity? Here are 5 reasons not to worry”Vox. 22 August 2014. Archived from the original on 30 October 2015. Retrieved 30 October 2015.
  270. ^ Berryhill, Jamie; Heang, Kévin Kok; Clogher, Rob; McBride, Keegan (2019). Hello, World: Artificial Intelligence and its Use in the Public Sector (PDF). Paris: OECD Observatory of Public Sector Innovation. Archived (PDF) from the original on 20 December 2019. Retrieved 9 August 2020.
  271. ^ Barfield, Woodrow; Pagallo, Ugo (2018). Research handbook on the law of artificial intelligence. Cheltenham, UK. ISBN 978-1-78643-904-8OCLC 1039480085.
  272. ^ Law Library of Congress (U.S.). Global Legal Research Directorate, issuing body. Regulation of artificial intelligence in selected jurisdictionsLCCN 2019668143OCLC 1110727808.
  273. ^ Wirtz, Bernd W.; Weyerer, Jan C.; Geyer, Carolin (24 July 2018). “Artificial Intelligence and the Public Sector—Applications and Challenges”International Journal of Public Administration42 (7): 596–615. doi:10.1080/01900692.2018.1498103ISSN 0190-0692S2CID 158829602Archived from the original on 18 August 2020. Retrieved 22 August 2020.
  274. ^ Buiten, Miriam C (2019). “Towards Intelligent Regulation of Artificial Intelligence”European Journal of Risk Regulation10 (1): 41–59. doi:10.1017/err.2019.8ISSN 1867-299X.
  275. ^ Sotala, Kaj; Yampolskiy, Roman V (19 December 2014). “Responses to catastrophic AGI risk: a survey”Physica Scripta90 (1): 018001. doi:10.1088/0031-8949/90/1/018001ISSN 0031-8949.
  276. ^ Buttazzo, G. (July 2001). “Artificial consciousness: Utopia or real possibility?”. Computer34 (7): 24–30. doi:10.1109/2.933500.
  277. ^ Anderson, Susan Leigh. “Asimov’s “three laws of robotics” and machine metaethics.” AI & Society 22.4 (2008): 477–493.
  278. ^ McCauley, Lee (2007). “AI armageddon and the three laws of robotics”. Ethics and Information Technology9 (2): 153–164. CiteSeerX 10.1.1.85.8904doi:10.1007/s10676-007-9138-2S2CID 37272949.
  279. ^ Galvan, Jill (1 January 1997). “Entering the Posthuman Collective in Philip K. Dick’s “Do Androids Dream of Electric Sheep?””. Science Fiction Studies24 (3): 413–429. JSTOR 4240644.

AI textbooks

History of AI

Other sources

Further reading

  • DH Author, ‘Why Are There Still So Many Jobs? The History and Future of Workplace Automation’ (2015) 29(3) Journal of Economic Perspectives 3.
  • Boden, MargaretMind As MachineOxford University Press, 2006.
  • Cukier, Kenneth, “Ready for Robots? How to Think about the Future of AI”, Foreign Affairs, vol. 98, no. 4 (July/August 2019), pp. 192–98. George Dyson, historian of computing, writes (in what might be called “Dyson’s Law”) that “Any system simple enough to be understandable will not be complicated enough to behave intelligently, while any system complicated enough to behave intelligently will be too complicated to understand.” (p. 197.) Computer scientist Alex Pentland writes: “Current AI machine-learning algorithms are, at their core, dead simple stupid. They work, but they work by brute force.” (p. 198.)
  • Domingos, Pedro, “Our Digital Doubles: AI will serve our species, not control it”, Scientific American, vol. 319, no. 3 (September 2018), pp. 88–93.
  • Gopnik, Alison, “Making AI More Human: Artificial intelligence has staged a revival by starting to incorporate what we know about how children learn”, Scientific American, vol. 316, no. 6 (June 2017), pp. 60–65.
  • Johnston, John (2008) The Allure of Machinic Life: Cybernetics, Artificial Life, and the New AI, MIT Press.
  • Koch, Christof, “Proust among the Machines”, Scientific American, vol. 321, no. 6 (December 2019), pp. 46–49. Christof Koch doubts the possibility of “intelligent” machines attaining consciousness, because “[e]ven the most sophisticated brain simulations are unlikely to produce conscious feelings.” (p. 48.) According to Koch, “Whether machines can become sentient [is important] for ethical reasons. If computers experience life through their own senses, they cease to be purely a means to an end determined by their usefulness to… humans. Per GNW [the Global Neuronal Workspacetheory], they turn from mere objects into subjects… with a point of view…. Once computers’ cognitive abilities rival those of humanity, their impulse to push for legal and political rights will become irresistible – the right not to be deleted, not to have their memories wiped clean, not to suffer pain and degradation. The alternative, embodied by IIT [Integrated Information Theory], is that computers will remain only supersophisticated machinery, ghostlike empty shells, devoid of what we value most: the feeling of life itself.” (p. 49.)
  • Marcus, Gary, “Am I Human?: Researchers need new ways to distinguish artificial intelligence from the natural kind”, Scientific American, vol. 316, no. 3 (March 2017), pp. 58–63. A stumbling block to AI has been an incapacity for reliable disambiguation. An example is the “pronoun disambiguation problem”: a machine has no way of determining to whom or what a pronoun in a sentence refers. (p. 61.)
  • E McGaughey, ‘Will Robots Automate Your Job Away? Full Employment, Basic Income, and Economic Democracy’ (2018) SSRN, part 2(3) Archived 24 May 2018 at the Wayback Machine.
  • George Musser, “Artificial Imagination: How machines could learn creativity and common sense, among other human qualities”, Scientific American, vol. 320, no. 5 (May 2019), pp. 58–63.
  • Myers, Courtney Boyd ed. (2009). “The AI Report” Archived 29 July 2017 at the Wayback MachineForbes June 2009
  • Raphael, Bertram (1976). The Thinking Computer. W.H.Freeman and Company. ISBN 978-0-7167-0723-3Archived from the original on 26 July 2020. Retrieved 22 August 2020.
  • Scharre, Paul, “Killer Apps: The Real Dangers of an AI Arms Race”, Foreign Affairs, vol. 98, no. 3 (May/June 2019), pp. 135–44. “Today’s AI technologies are powerful but unreliable. Rules-based systems cannot deal with circumstances their programmers did not anticipate. Learning systems are limited by the data on which they were trained. AI failures have already led to tragedy. Advanced autopilot features in cars, although they perform well in some circumstances, have driven cars without warning into trucks, concrete barriers, and parked cars. In the wrong situation, AI systems go from supersmart to superdumb in an instant. When an enemy is trying to manipulate and hack an AI system, the risks are even greater.” (p. 140.)
  • Serenko, Alexander (2010). “The development of an AI journal ranking based on the revealed preference approach” (PDF). Journal of Informetrics4 (4): 447–459. doi:10.1016/j.joi.2010.04.001Archived (PDF) from the original on 4 October 2013. Retrieved 24 August 2013.
  • Serenko, Alexander; Michael Dohan (2011). “Comparing the expert survey and citation impact journal ranking methods: Example from the field of Artificial Intelligence”(PDF). Journal of Informetrics5 (4): 629–649. doi:10.1016/j.joi.2011.06.002Archived (PDF) from the original on 4 October 2013. Retrieved 12 September 2013.
  • Tom Simonite (29 December 2014). “2014 in Computing: Breakthroughs in Artificial Intelligence”MIT Technology Review.
  • Sun, R. & Bookman, L. (eds.), Computational Architectures: Integrating Neural and Symbolic Processes. Kluwer Academic Publishers, Needham, MA. 1994.
  • Taylor, Paul, “Insanely Complicated, Hopelessly Inadequate” (review of Brian Cantwell SmithThe Promise of Artificial Intelligence: Reckoning and Judgment, MIT, October 2019, ISBN 978 0 262 04304 5, 157 pp.; Gary Marcus and Ernest Davis, Rebooting AI: Building Artificial Intelligence We Can Trust, Ballantine, September 2019, ISBN 978 1 5247 4825 8, 304 pp.; Judea Pearl and Dana Mackenzie, The Book of Why: The New Science of Cause and Effect, Penguin, May 2019, ISBN 978 0 14 198241 0, 418 pp.), London Review of Books, vol. 43, no. 2 (21 January 2021), pp. 37–39. Paul Taylor writes (p. 39): “Perhaps there is a limit to what a computer can do without knowing that it is manipulating imperfect representations of an external reality.”
  • Tooze, Adam, “Democracy and Its Discontents”, The New York Review of Books, vol. LXVI, no. 10 (6 June 2019), pp. 52–53, 56–57. “Democracy has no clear answer for the mindless operation of bureaucratic and technological power. We may indeed be witnessing its extension in the form of artificial intelligence and robotics. Likewise, after decades of dire warning, the environmental problem remains fundamentally unaddressed…. Bureaucratic overreach and environmental catastrophe are precisely the kinds of slow-moving existential challenges that democracies deal with very badly…. Finally, there is the threat du jour: corporations and the technologies they promote.” (pp. 56–57.)

External links

Artificial intelligenceat Wikipedia’s sister projects

Categories

” (WP)

Sources:

Fair Use Sources:

Categories
Artificial Intelligence Cloud Data Science - Big Data Hardware and Electronics History Networking Operating Systems Software Engineering

Timeline of the History of Computers

Return to History or This Year in History

c. 2500 BC – Sumerian Abacus

c. 700 BC – Scytale

c. 150 BC – Antikythera Mechanism

c. 60 – Programmable Robot

c. 850 – On Deciphering Cryptographic Messages

c. 1470 – Cipher Disk

1613 – First Recorded Use of the Word Computer

1621 – Slide Rule

1703 – Binary Arithmetic

1758 – Human Computers Predict Halley’s Comet

1770 – The “Mechanical Turk”

1792 – Optical Telegraph

1801 – The Jacquard Loom

1822 – The Difference Engine

1833 – Michael Faraday discovered silver sulfide became a better conductor when heated

1836 – Electrical Telegraph

1843 – Ada Lovelace Writes a Computer Program

1843 – Fax Machine Patented

1843 – Edgar Allan Poe’s “The Gold-Bug”

1849 to early 1900s – Silicon Valley After the Gold Rush

1851 – Thomas Arithmometer

1854 – Boolean Algebra

1864 – First Electromagnetic Spam Message

1870 – Mitsubishi founded

1874 – Baudot Code

1874 – Semiconductor Diode conceived of

1876 – Ericsson Corporation founded in Sweden

1885 – Stanford University

1885 – William Burroughs’ adding machine

1890 – Herman Hollerith Tabulating the US Census

1890 – Toshiba founded in Japan

1891 – Strowger Step-by-Step Switch

1898 – Nippon Electric Limited Partnership – NEC Corporation founded in Japan

1890s to 1930s – Radio Engineering

Early 1900s – Electrical Engineering

1904 – “Diode” or Two-Element Amplifier actually invented

1904 – Three-Element Amplifier or “Triode”

1906 – Vacuum Tube or “Audion”

1907 – Lee DeForest coins the term “radio” to refer to wireless transmission when he formed his DeForest Radio Telephone Company

1909 – Charles Herrold in San Jose started first radio station in USA with regularly scheduled programming, including songs, using an arc transmitter of his own design. Herrold was one of Stanford’s earliest students and founded his own College of Wireless and Engineering in San Jose

1910 – Radio Broadcasting business pioneered by Lee DeForest with broadcast from New York of a live performance by Italian tenor Enrico Caruso

1910 – Hitachi founded in Japan

1912 – Sharp Corporation founded in Japan and takes its name from one of its founder’s first inventions, the Ever-Sharp mechanical pencil

1914 – Floating-Point Numbers

1917 – Vernam Cipher

1918 – Panasonic, then Matsushita Electric, founded in Japan

1920 – Rossum’s Universal Robots

1927 – Fritz Lang’s Metropolis

1927 – First LED

1928 – Electronic Speech Synthesis

1930 – The Enigma Machine

1931 – Differential Analyzer

1935 – Fujitsu founded as Fuji Telecommunications Equipment Manufacturing in Japan. Fujitsu is the second oldest IT company after IBM and before Hewlett-Packard

1936 – Church-Turing Thesis

1939 – Hewlett-Packard founded in a one-car garage in Palo Alto, California by Bill Hewlett and David Packard

1939 – Toshiba founded in Japan

1941Z3 Computer

1942Atanasoff-Berry Computer

1942 – Isaac Asimov’s Three Laws of Robotics

1942Seiko Corporation founded in Japan

1943ENIAC

1943Colossus

1944Delay Line Memory

1944Binary-Coded Decimal

1945Vannevar Bush‘s “As We May Think

1945EDVAC First Draft Report – The von Neumann architecture

1946 – Trackball

1946 – Williams Tube Random Access Memory

1947 – Actual Bug Found – First “debugging”

1947 – William Shockley’s Silicon Transistor

1948 – The Bit – Binary Digit 0 or 1

1948 – Curta Calculator

1948 – Manchester SSEM

1949 – Whirlwind Computer

1950 – Error-Correcting Codes (ECC)

1951 – Turing Test of Artificial Intelligence (AI)

1951 – Magnetic Tape Used for Computers

1951 – Core Memory

1951 – Microprogramming

1952 – Computer Speech Recognition

1953 – First Transistorized Computer

1955 – Artificial Intelligence (AI) Coined

1955 – Computer Proves Mathematical Theorem

1956 – First Disk Storage Unit

1956 – The Byte

1956 – Robby the Robot from Forbidden Planet

1957 – FORTRAN Programming Language

1957 – First Digital Image

1958 – The Bell 101 Modem

1958 – SAGE Computer Operational

1959 – IBM 1401 Computer

1959 – DEC PDP-1

1959 – Quicksort Algorithm

1959 – SABRE Airline Reservation System

1960 – COBOL Programming Language

1960 – Recommended Standard 232 (RS-232)

1961 – ANITA Electronic Calculator

1961 – Unimate – First Mass-Produced Robot

1961 – Time-Sharing – The Original “Cloud Computing

1961 – Shinshu Seiki Company founded in Japan (now called Seiko Epson Corporation) as a subsidiary of Seiko to supply precision parts for Seiko watches.

1962 – Spacewar! Video Game

1962 – Virtual Memory

1962 – Digital Long Distance Telephone Calls

1963 – Sketchpad Interactive Computer Graphics

1963 – ASCII Character Encoding

1963 – Seiko Corporation in Japan developed world’s first portable quartz timer (Seiko QC-951)

1964 – RAND Tablet Computer

1964 – Teletype Model 33 ASR

1964 – IBM System/360 Mainframe Computer

1964 – BASIC Programming Language

1965 – First Liquid-Crystal Display (LCD)

1965 – Fiber Optics – Optical-Fiber

1965 – DENDRAL Artificial Intelligence (AI) Research Project

1965 – ELIZA – The First “Chatbot” – 1965

1965 – Touchscreen

1966 – Star Trek Premieres

1966 – Dynamic RAM

1966 – Linear predictive coding (LPC) proposed by Fumitada Itakura of Nagoya University and Shuzo Saito of Nippon Telegraph and Telephone (NTT).[71]

1967 – Object-Oriented Programming

1967 – First ATM Machine

1967 – Head-Mounted Display

1967 – Programming for Children

1967 – The Mouse

1968 – Carterfone Decision

1968 – Software Engineering

1968 – HAL 9000 Computer from 2001: A Space Odyssey

1968 – First “Spacecraft” “Guided by Computer”

1968 – Cyberspace Coined—and Re-Coined

1968 – Mother of All Demos

1968 – Dot Matrix Printer – Shinshu Seiki (now called Seiko Epson Corporation) launched the world’s first mini-printer, the EP-101 (“EP” for Electronic Printer,) which was soon incorporated into many calculators

1968 – Interface Message Processor (IMP)

1969 – ARPANET / Internet

1969 – Digital Imaging

1969 – Network Working Group Request for Comments (RFC): 1

1969 – Utility Computing – Early “Cloud Computing

1969 – Perceptrons Book – Dark Ages of Neural Networks Artificial Intelligence (AI)

1969 – UNIX Operating System

1969 – Seiko Epson Corporation in Japan developed world’s first quartz watch timepiece (Seiko Quartz Astron 35SQ)

1970 – Fair Credit Reporting Act

1970 – Relational Databases

1970 – Floppy Disk

1971 – Laser Printer

1971 – NP-Completeness

1971 – @Mail Electronic Mail

1971 – First Microprocessor – General-Purpose CPU – “Computer on a Chip”

1971 – First Wireless Network

1972 – C Programming Language

1972 – Cray Research Supercomputers – High-Performance Computing (HPC)

1972 – Game of Life – Early Artificial Intelligence (AI) Research

1972 – HP-35 Calculator

1972 – Pong Game from Atari – Nolan Bushnell

1973 – First Cell Phone Call

1973 – Danny Cohen first demonstrated a form of packet voice as part of a flight simulator application, which operated across the early ARPANET.[69][70]

1973 – Xerox Alto from Xerox Palo Alto Research Center (PARC)

1973 – Sharp Corporation produced the first LCD calculator

1974 – Data Encryption Standard (DES)

1974 – The Institute of Electrical and Electronics Engineers (IEEE) publishes a paper entitled “A Protocol for Packet Network Interconnection”.[82]

1974 – Network Voice Protocol (NVP) tested over ARPANET in August 1974, carrying barely audible 16 kpbs CVSD encoded voice.[71]

1974 – The first successful real-time conversation over ARPANET achieved using 2.4 kpbs LPC, between Culler-Harrison Incorporated in Goleta, California, and MIT Lincoln Laboratory in Lexington, Massachusetts.[71]

1974 – First Personal Computer: The Altair 8800 Invented by MITS in Albuquerque, New Mexico

1975 – Colossal Cave Adventure – Text-based “Video” Game

1975 – The Shockwave Rider SciFi Book – A Prelude of the 21st Century Big Tech Police State

1975 – AI Medical Diagnosis – Artificial Intelligence in Medicine

1975 – BYTE Magazine

1975 – Homebrew Computer Club

1975 – The Mythical Man-Month

1975 – The name Epson was coined for the next generation of printers based on the EP-101 which was released to the public. (EPSON:E-P-SON: SON of Electronic Printer).[7] Epson America Inc. was established to sell printers for Shinshu Seiki Co.

1976 – Public Key Cryptography

1976 – Acer founded

1976 – Tandem NonStop

1976 – Dr. Dobb’s Journal

1977 – RSA Encryption

1977 – Apple II Computer

The TRS-80 Model I pictured alongside the Apple II and the Commodore PET 2001-8. These three computers constitute what Byte Magazine called the “1977 Trinity” of home computing.

1977 – Danny Cohen and Jon Postel of the USC Information Sciences Institute, and Vint Cerf of the Defense Advanced Research Projects Agency (DARPA), agree to separate IP from TCP, and create UDP for carrying real-time traffic.

1978 – First Internet Spam Message

1978 – France’s Minitel Videotext

1979 – Secret Sharing for Encryption

1979 – Dan Bricklin Invents VisiCalc Spreadsheet

1980 – Timex Sinclair ZX80 Computer

1980 – Flash Memory

1980 – RISC Microprocessors – Reduced Instruction Set Computer CPUs

1980 – Commercially Available Ethernet Invented by Robert Metcalfe of 3Com

1980 – Usenet

1981 – IBM Personal Computer – IBM PC

1981 – Simple Mail Transfer Protocol (SMTP) Email

1981 – Japan’s Fifth Generation Computer SystemsJapan

1982 – Sun Microsystems was founded on February 24, 1982.[2]

1982 – AutoCAD

1982 – First Commercial UNIX Workstation

1982 – PostScript

1982 – Microsoft and the IBM PC Clones

1982 – First CGI Sequence in Feature Film – Star Trek II: The Wrath of Khan

1982 – National Geographic Moves the Pyramids – Precursor to Photoshop

1982 – Secure Multi-Party Computation

1982 – TRON Movie

1982 – Home Computer Named Machine of the Year by Time Magazine

1983 – The Qubit – Quantum Computers

1983 – WarGames

1983 – 3-D Printing

1983 – Computerization of the Local Telephone Network

1983 – First Laptop

1983 – MIDI Computer Music Interface

1983 – Microsoft Word

1983 – Nintendo Entertainment System – Video Games

1983 – Domain Name System (DNS)

1983 – IPv4 Flag Day – TCP/IP

1984 – Text-to-Speech (TTS)

1984 – Apple Macintosh

1984 – VPL Research, Inc. – Virtual Reality (VR)

1984 – Quantum Cryptography

1984 – Telebit TrailBlazer Modems Break 9600 bps

1984 – Verilog Language

1984 – Dell founded by Michael Dell

1984 – Cisco Systems was founded in December 1984

1985 – Connection Machine – Parallelization

1985 – First Computer-Generated TV Host – Max HeadroomCGI

1985 – Zero-Knowledge Mathematical Proofs

1985 – FCC Approves Unlicensed Wireless Spread Spectrum

1985 – NSFNET National Science Foundation “Internet”

1985 – Desktop Publishing – with Macintosh, Aldus PageMaker, LaserJet, LaserWriter and PostScript

1985 – Field-Programmable Gate Array (FPGA)

1985 – GNU Manifesto from Richard Stallman

1985 – AFIS Stops a Serial Killer – Automated Fingerprint Identification System

1986 – Software Bug Fatalities

1986 – Pixar Animation Studios

1986 – D-Link Corporation founded in Taipei, Taiwan

1987 – Digital Video Editing

1987 – GIF – Graphics Interchange Format

1988 – MPEG – Moving Picture Experts Group – Coding-Compressing Audio-Video

1988 – CD-ROM

1988 – Morris Worm Internet Computer Virus

1988 – Linksys founded

1989 – World Wide Web-HTML-HTTP Invented by Tim Berners-Lee

1989 – Asus was founded in Taipei, Taiwan

1989 – SimCity Video Game

1989 – ISP Provides Internet Access to the Public

1990 – GPS Is Operational – Global Positioning System

1990 – Digital Money is Invented – DigiCash – Precursor to Bitcoin

1991 – Pretty Good Privacy (PGP)

1991 – DARPA’s Report “Computers at Risk: Safe Computing in the Information Age

1991 – Linux Kernel Operating System Invented by Linus Torvalds

1992 – Boston Dynamics Robotics Company Founded

1992 – JPEG – Joint Photographic Experts Group

1992 – First Mass-Market Web Browser NCSA Mosaic Invented by Marc Andreessen

1992 – Unicode Character Encoding

1993 – Apple Newton

1994 – First Banner Ad – Wired Magazine

1994 – RSA-129 Encryption Cracked

1995 – DVD

1995 – E-Commerce Startups – eBay, Amazon and DoubleClick Launched

1995 – AltaVista Web Search Engine

1995 – Gartner Hype Cycle

1996 – Universal Serial Bus (USB)

1996 – Juniper Networks founded

1997 – IBM Computer Is World Chess Champion

1997 – PalmPilot

1997 – E Ink

1998 – Diamond Rio MP3 Player

1998 – Google

1999 – Collaborative Software Development

1999 – Blog Is Coined

1999 – Napster P2P Music and File Sharing

2000 – USB Flash Drive

2000 – Sharp Corporation’s Mobile Communications Division created the world’s first commercial camera phone, the J-SH04, in Japan

2000 – Fortinet founded

2001 – Wikipedia

2001 – Apple iTunes

2001 – Advanced Encryption Standard (AES)

2001 – Quantum Computer Factors “15”

2002 – Home-Cleaning Robot

2003 – CAPTCHA

2004 – Product Tracking

2004 – Facebook

2004 – First International Meeting on Synthetic Biology

2005 – Video Game Enables Research into Real-World Pandemics

2006 – Apache Hadoop Makes Big Data Possible

2006 – Differential Privacy

2007 – Apple iPhone

2008 – Bitcoin

2010 – Air Force Builds Supercomputer with Gaming Consoles

2010 – Cyber Weapons

2011 – Smart Homes via the Internet of Things (IoT)

2011 – IBM Watson Wins Jeopardy!

2011 – World IPv6 Day

2011 – Social Media Enables the Arab Spring

2012 – DNA Data Storage

2013 – Algorithm Influences Prison Sentence

2013 – Subscription Software “Popularized”

2014 – Data Breaches

2014 – Over-the-Air Vehicle Software Updates

2015 – Google Releases TensorFlow

2016 – Augmented Reality Goes Mainstream

2016 – Computer Beats Master at Game of Go

~2050 -Hahahaha! – Artificial General Intelligence (AGI)

~9999 – The Limits of Computation?

Sources:

Fair Use Sources:

Categories
Artificial Intelligence Bibliography Cloud Data Science - Big Data Hardware and Electronics History Linux Networking Operating Systems Software Engineering

Bibliography of the History of Technology, Computing, IT, Internet and Programming

Return to Timeline of the History of Computers or History

Books

Alexander, Charles C. Holding the Line: The Eisenhower Era, 1952–1961. Bloomington: Indiana University Press, 1975.

Baran, Paul.“Packet Switching.” In Fundamentals of Digital Switching. 2d ed. Edited by John C. McDonald. New York: Plenum Press, 1990.

Barry, John A. Technobabble. Cambridge: MIT Press, 1991.

Bell, C. Gordon, Alan Kotok, Thomas N. Hastings, and Richard Hill. “The Evolution of the DEC System-10.” In Computer Engineering: A DEC View of Hardware Systems Design. Edited by C. Gordon Bell, J. Craig Mudge, and John E. McNamara. Bedford, Mass.: Digital Equipment Corporation, 1978.

Bell, C. Gordon, Gerald Butler, Robert Gray, John E. McNamara, Donald Vonada, and Ronald Wilson. “The PDP-1 and Other 18-Bit Computers.” In Computer Engineering: A DEC View of Hardware Systems Design. Edited by C. Gordon Bell, J. Craig Mudge, and John E. McNamara. Bedford, Mass.: Digital Equipment Corporation, 1978.

Bergaust, Erik. Wernher von Braun. Washington, D.C.: National Space Institute, 1976.

Blanc, Robert P., and Ira W. Cotton, eds. Computer Networking. New York: IEEE Press, 1976.

Brendon, Piers. Ike: His Life and Times. New York: Harper & Row, 1986.

Brooks, John. Telephone: The First HundredYears. New York: Harper & Row, 1976.

Brucker, Roger W., and Richard A. Watson. The Longest Cave. New York: Alfred A. Knopf, 1976.

Clarke, Arthur C., et al. The Telephone’s First Century—And Beyond: Essays on the Occasion of the 100th Anniversary of Telephone Communication. New York: Thomas Y. Crowell Company, 1977

Computer Science, Numerical Analysis and Computing. National Physical Laboratory, Engineering Sciences Group, Research 1971. London: Her Majesty’s Stationery Office, 1972.

Froehlich, Fritz E., Allen Kent, and Carolyn M. Hall, eds. “ARPANET, the Defense Data Network, and Internet.” In The Froehlich/Kent Encyclopedia of Telecommunications. New York: Marcel Dekker, Inc., 1991.

Goldstein, Jack S. A Different Sort of Time: The Life of Jerrold R. Zacharias. Cambridge MIT Press, 1992.

Halberstam, David. The Fifties. New York:Villard Books, 1993.

Hall, Mark, and John Barry. Sunburst: The Ascent of Sun Microsystems. Chicago: Contemporary Books, 1990.

Hammond, William M. Public Affairs: The Military and the Media, 1962–1968. Washington, D.C.: Center of Military History, U.S. Army, Superintendent of Documents, U.S. Government Printing Office, 1968.

Hamner, W. Clay. “The United States Postal Service: Will It Be Ready for the Year 2000?” In The Future of the Postal Service. Edited by Joel L. Fleishman. New York: Praeger, 1983.

Holzmann, Gerard J., and Björn Pehrson. The Early History of Data Network. Los Alamitos, Calif.: IEEE Computer Society Press, 1995.

Kidder, Tracy. The Soul of a New Machine. Boston: Little, Brown, 1981.

Killian, James R., Jr. Sputnik, Scientists, and Eisenhower: A Memoir of the First Special Assistant to the President for Science and Technology. Cambridge: MIT Press, 1977.

———. The Education of a College President: A Memoir. Cambridge: MIT Press, 1985.

Kleinrock, Leonard. Communication Nets: Stochastic Message Flow and Delay. New York: McGraw-Hill, 1964.

———. Queueing Systems. 2 vols. New York: John Wiley & Sons, 1974–1976.

Langdon-Davies, John. NPL: Jubilee Book of the National Physical Laboratory. London: His Majesty’s Stationery Office, 1951.

Lebow, Irwin. Information Highways & Byways: From the Telegraph to the 21st Century. New York: IEEE Press, 1995.

Licklider, J. C. R. “Computers and Government.” In The Computer Age: A Twenty-Year View, edited by Michael L. Dertouzos and Joel Moses. MIT Bicentennial Series. Cambridge: MIT Press, 1979.

———. Libraries of the Future. Cambridge: MIT Press, 1965.

Padlipsky, M. A. The Elements of Networking Style and Other Essays & Animadversions of the Art of Intercomputer Networking. Englewood Cliffs, N.J.: Prentice-Hall, Inc., 1985.

Proceedings of the Fifth Data Communications Symposium. IEEE Computer Society, Snowbird, Utah, September 27–29, 1977.

Pyatt, Edward. The National Physical Laboratory: A History. Bristol, England: Adam Hilger Ltd., 1983.

Redmond, Kent C., and Thomas M. Smith. The Whirlwind Project: The History of a Pioneer Computer. Bedford, Mass.: Digital Press, 1980.

Rheingold, Howard. The Virtual Community. New York: Harper Perennial, 1994.

———. Tools for Thought: The People and Ideas Behind the Next Computer Revolution. New York: Simon & Schuster, 1988.

Roberts, Lawrence G. “The ARPANET and Computer Networks.” In A History of Personal Workstations, edited by Adele Goldberg. Reading, Mass.: ACM Press (Addison-Wesley), 1988.

Rose, Marshall T. The Internet Message: Closing the Book with Electronic Mail. Englewood Cliffs, N.J.: PTR Prentice Hall, 1993.

Sherman, Kenneth. Data Communications: A User’s Guide. Reston,Virginia: Reston Publishing Company, 1981.

Smith, Douglas K., and Robert C. Alexander. Fumbling the Future: How Xerox Invented, then Ignored, the First Personal Computer. New York: William Morrow, 1988.

Udall, Stewart L. The Myths of August: A Personal Exploration of Our Tragic Cold War Affair with the Atom. New York: Pantheon, 1994.

Wildes, Karl L., and Nilo A. Lindgren. A Century of Electrical Engineering and Computer Science at MIT, 1882–1982. Cambridge, Mass.: MIT Press, 1985.

Winner, Langdon. The Whale and the Reactor: A Search for Limits in an Age of High Technology. Chicago: University of Chicago Press, 1986.Edit

Journal, Magazine, and Newspaper Articles

Abramson, Norman. “Development of the Alohanet.” IEEE Transactions on Information Theory, January 1985.

Anderson, Christopher. “The Accidental Superhighway.” The Economist, 1 July 1995.

Baran, Paul. “On Distributed Communications Networks.” IEEE Transactions on Communications Systems, 1 March 1964.

———.“Reliable Digital Communications Systems Using Unreliable Network Repeater Nodes.” RAND Corporation Mathematics Division Report No. P-1995, 27 May 1960.

Boggs, David R., John F. Shoch, Edward A. Taft, and Robert M. Metcalfe. “PUP: An Internetwork Architecture.” IEEE Transactions on Communications, April 1980.

“Bolt Beranek Accused by Government of Contract Overcharges.” Dow Jones News Service–Wall Street Journal combined stories, 27 October 1980.

“Bolt Beranek and Newman: Two Aides Plead Guilty to U.S. Charge.” Dow Jones News Service–Wall Street Journal combined stories, 12 November 1980.

“Bolt Beranek, Aides Accused of Cheating U.S. on Several Jobs.” The Wall Street Journal, 28 October 1980.

Bulkeley, William M. “Can He Turn Big Ideas into Big Sales?” The Wall Street Journal, 12 September 1994.

Bush,Vannevar. “As We May Think.” Atlantic Monthly, July 1945.

Campbell-Kelly, Martin. “Data Communications at the National Physical Laboratory: 1965–1975.” Annals of the History of Computing 9, no. 3/4, 1988.

Cerf,Vinton G., and Peter T. Kirstein. “Issues in Packet-Network Interconnection.” Proceedings of the IEEE, November 1979.

Cerf, Vinton G., and Robert E. Kahn. “A Protocol for Packet-Network Intercommunication.” IEEE Transactions on Communications, May 1974.

Cerf, Vinton. “PARRY Encounters the Doctor: Conversation Between a Simulated Paranoid and a Simulated Psychiatrist.” Datamation, July 1973.

Clark, David D. “The Design Philosophy of the DARPA Internet Protocols.” Proceedings of the Association for Computing Machinery Sigcomm Symposium on Data Communications, August 1988.

Clark, David D., Kenneth T. Pogran, and David P. Reed. “An Introduction to Local Area Networks.” Proceedings of the IEEE, November 1979.

Comer, Douglas. “The Computer Science Research Network CSNET: A History and Status Report.” Communications of the ACM, October 1983.

Crowther, W. R., F. E. Heart, A. A. McKenzie, J. M. McQuillan, and D. C. Walden.“Issues in Packet Switching Networking Design.” Proceedings of the 1975 National Computer Conference, 1975.

Denning, Peter J. “The Science of Computing: The ARPANET After Twenty Years.” American Scientist, November-December 1989.

Denning, Peter J., Anthony Hearn, and C. William Kern. “History and Overview of CSNET. “Proceedings of the Association for Computing Machinery Sigcomm Symposium on Data Communications, March 1983.

“Dr. J. C. R. Licklider Receives Biennial Award at State College Meeting.” The Journal of the Acoustical Society of America, November 1950.

Engelbart, Douglas C. “Coordinated Information Services for a Discipline-or Mission-Oriented Community.” Proceedings of the Second Annual Computer Communications Conference, January 1972.

———. “Intellectual Implications of Multi-Access Computer Networks.” Proceedings of the Interdisciplinary Conference on Multi-Access Computer Networks, Austin, Texas, April 1970.

Ericson, Raymond. “Philharmonic Hall Acoustics Start Rumors Flying.” The NewYork Times, 4 December 1962.

Finucane, Martin. “Creators of the Internet Forerunner Gather in Boston.” Reading (Mass.) Daily Times Herald, 12 September 1994.

Fisher, Sharon. “The Largest Computer Network: Internet Links UNIX Computers Worldwide.” InfoWorld, 25 April 1988.

Hines, William. “Mail.” Chicago Sun-Times, 29 March 1978.

Haughney, Joseph F. “Anatomy of a Packet-Switching Overhaul.” Data Communications, June 1982.

Holusha, John. “Computer Tied Carter, Mondale Campaigns: The Bethesda Connection.” Washington Star, 21 November 1976.

Jacobs, Irwin M., Richard Binder, and EstilV. Hoversten. “General Purpose Packet Satellite Networks.” Proceedings of the IEEE, November 1978.

Jennings, Dennis M., Lawrence H. Landweber, Ira H. Fuchs, David J. Farber, and W. Richards Adrion. “Computer Networking for Scientists.” Science, 22 February 1986.

Kahn, Robert E. “The Role of Government in the Evolution of the Internet.” Communications of the ACM, August 1994.

Kahn, Robert E., Steven A. Gronemeyer, Jerry Burchfiel, and Ronald C. Kunzelman. “Advances in Packet Radio Technology.” Proceedings of the IEEE, November 1978.

Kantrowitz, Barbara, and Adam Rogers. “The Birth of the Internet.” Newsweek, 8 August 1994.

Kleinrock, Leonard. “Principles and Lessons in Packet Communications.” Proceedings of the IEEE, November 1978.

Landweber, Lawrence H., Dennis M. Jennings, and Ira Fuchs. “Research Computer Networks and Their Interconnection.” IEEE Communications Magazine, June 1986.

Lee, J. A. N., and Robert F. Rosin.“The CTSS Interviews.” IEEE Annals of the History of Computing 14, no. 1, 1992.

———.“The Project MAC Interviews.” IEEE Annals of the History of Computing 14, no. 2, 1992.

Licklider, J. C. R. “A Gridless, Wireless Rat-Shocker.” Journal of Comparative and Physiological Psychology 44, 1951.

———. “Man-Computer Symbiosis.” Reprint. In Memoriam: J. C. R. Licklider. Digital Equipment Corporation Systems Research Center, 7 August 1990.

Licklider, J. C. R., and Albert Vezza. “Applications of Information Networks.” Proceedings of the IEEE, November 1978.

Licklider, J. C. R., and Robert W. Taylor. “The Computer as a Communication Device.” Reprint. In Memoriam: J. C. R. Licklider. Digital Equipment Corporation Systems Research Center, 7 August 1990.

Markoff, John. “Up from the Computer Underground.” The NewYork Times, 27 August 1993.

McKenzie, Alexander A., and B. P. Cosell, J. M. McQuillan, M. J. Thrope. “The Network Control Center for the ARPA Network.” Proceedings of the IEEE, 1972.

Mier, Edwin E. “Defense Department Readying Network Ramparts.” Data Communications, October 1983.

Mills, Jeffrey. “Electronic Mail.” Associated Press, 4 January 1976.

———.“Electronic Mail.” Associated Press, 19 June 1976.

———. “Postal Service Tests Electronic Message Service.” Associated Press, 28 March 1978.

Mills, Kay.“The Public Concern: Mail.” Newhouse News Service, 27 July 1976.

Mohl, Bruce A. “2 Bolt, Beranek Officials Collapse in Federal Court.” The Boston Globe, 31 October 1980.

Pallesen, Gayle. “Consultant Firm on PBIA Faces Criminal Charges.” Palm Beach (Florida) Post, 8 November 1980.

Pearse, Ben. “Defense Chief in the Sputnik Age.” The NewYork Times Magazine, 10 November 1957.

Pool, Bob. “Inventing the Future: UCLA Scientist Who Helped Create Internet Isn’t Done Yet.” Los Angeles Times, 11 August 1994.

Quarterman, John S., and Josiah C. Hoskins. “Notable Computer Networks.” Communications of the ACM, October 1986.

Roberts, Lawrence G. “ARPA Network Implications.” Educom, Bulletin of the Interuniversity Communications Council, fall 1971.

Salus, Peter. “Pioneers of the Internet.” Internet World, September 1994.

“Scanning the Issues,” IEEE Spectrum, August 1964.

Schonberg, Harold C. “4 Acoustics Experts to Urge Revisions in Auditorium.” The NewYork Times, 4 April 1963.

———.“Acoustics Again: Philharmonic Hall Has Some Defects, But Also Has a Poetry of Its Own.” The NewYork Times, 9 December 1962.

Selling It. Consumer Reports, June 1977.

Space Agencies. “ARPA Shapes Military Space Research.” Aviation Week, 16 June 1958.

Sterling, Bruce. “Internet.” Fantasy and Science Fiction, February 1993.

Swartzlander, Earl. “Time-Sharing at MIT.” IEEE Annals of the History of Computing 14, no. 1, 1992.

“Transforming BB&N: ARPANET’s Architect Targets Non-Military Networks.” Data Communications, April 1984.

Wilson, David McKay. “BBN Executives Collapse in Court.” Cambridge (Mass.) Chronicle, 6 November 1980.

———. “Consulting Co. Admits Overcharge.” Cambridge (Mass.) Chronicle, 30 October 1980.

Zitner, Aaron. “A Quiet Leap Forward in Cyberspace.” The Boston Globe, 11 September 1994.

Zuckerman, Laurence.“BBN Steps Out of the Shadows and into the Limelight.” The NewYork Times, 17 July 1995.Edit

Unpublished Papers, Interviews from Secondary Sources, and Other Documents

”Act One.” Symposium on the history of the ARPANET held at the University of California at Los Angeles, 17 August 1989. Transcript.

ARPA Network Information Center, Stanford Research Institute, Menlo Park, Calif. “Scenarios for Using the ARPANET.” Booklet. Prepared for the International Conference on Computer Communication, Washington, D.C., October 1972.

Baran, Paul. Interview by Judy O’Neill. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 5 March 1990.

Barlow, John Perry. “Crime and Puzzlement.” Pinedale, Wyo., June 1990.

BBN Systems and Technologies Corporation. “Annual Report of the Science Development Program.” Cambridge, Mass., 1988.

Bhushan, A. K. “Comments on the File Transfer Protocol.” Request for Comments 385. Stanford Research Institute, Menlo Park, Calif., August 1972.

———.“The File Transfer Protocol.” Request for Comments 354. Stanford Research Institute, Menlo Park, Calif., July 1972.

Bhushan, Abhay, Ken Pogran, Ray Tomlinson, and Jim White. “Standardizing Network Mail Headers.” Request for Comments 561. MIT, Cambridge, Mass., 5 September 1973.

Blue, Allan. Interview by William Aspray. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 12 June 1989.

Bolt Beranek and Newman Inc. “ARPANET Completion Report: Draft.” Cambridge, Mass., September 1977.

———.“BBN Proposal No. IMP P69-IST-5: Interface Message Processors for the ARPA Computer Network.” Design proposal. Submitted to the Department of the Army, Defense Supply Service, in response to RFQ No. DAHC15 69 Q 0002. Washington, D.C., 6 September 1968.

———. “BBN Report No. 1763: Initial Design for Interface Message Processors for the ARPA Computer Network.” Design proposal. Submitted to the Advanced Research Projects Agency under contract no. DAHC 15-69-C-0179. Washington, D.C., 6 January 1969.

———. “BBN Report No. 1822: Interface Message Processor.” Technical report. Cambridge, Mass., 1969.

———.“Interface Message Processors for the ARPA Computer Network.” Quarterly technical reports. Submitted to the Advanced Research Projects Agency under contract no. DAHC 15-69-C-0179 and contract no. F08606-73-C-0027. Washington, D.C., 1969–1973.

———. “Operating Manual for Interface Message Processors: 516 IMP, 316 IMP, TEP.” Revised. Submitted to the Advanced Research Projects Agency under ARPA order no. 1260, contract no. DAHC15-69-C-0179. Arlington,Va., April 1973.

———. “Report No. 4799: A History of the ARPANET: The First Decade.” Submitted to the Defense Advanced Research Projects Agency. Arlington,Va., April 1981.

———.“The Four Cities Plan.” Draft proposal and cost analysis for maintenance of IMPs and TIPs in Boston, Washington, Los Angeles, and San Francisco. Papers of BBN Division 6. Cambridge, Mass., April 1974.

———. Internal memoranda and papers relating to the work of Division 6. Cambridge, Mass., 1971–1972.

Carr, C. Stephen, Stephen D. Crocker, and Vinton G. Cerf. “HOST-HOST Communication Protocol in the ARPA Network.” Paper presented at the Spring Joint Computer Conference of the American Federation of Information Processing Societies, 1970.

Catton, Major General, USAF, Jack. Letter to F. R. Collbohm of RAND Corporation, 11 October 1965. Referring the preliminary technical development plan for message-block network to the Defense Communications Agency.

Cerf,Vinton G.“Confessions of a Hearing-Impaired Engineer.” Unpublished.

———.“PARRY Encounters the Doctor.” Request for Comments 439 (NIC 13771). Network Working Group, 21 January 1973.

Cerf, Vinton G., and Jonathan B. Postel. “Specification of Internetwork Transmission Control Protocol: TCP Version 3.” Information Sciences Institute, University of Southern California, January 1978.

Cerf, Vinton G. Interview by Judy O’Neill. Charles Babbage Institute, DARPA/ IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 24 April 1990.

Cerf, Vinton G., and Robert Kahn. “HOST and PROCESS Level Protocols for Internetwork Communication.” Notes of the International Network Working Group 39, 13 September 1973.

Clark, Wesley. Interview by Judy O’Neill. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 3 May 1990.

Crocker, David H. “Standard for the Format of ARPA Internet Text Messages.” Request for Comments 822. Department of Electrical Engineering, University of Delaware, 13 August 1982.

Crocker, David H., John J. Vittal, Kenneth T. Pogran, and D. Austin Henderson Jr. “Standard for the Format of ARPA Network Text Messages.” Request for Comments 733. The RAND Corporation, Santa Monica, Calif., 21 November 1977.

Crowther, William. Interview by Judy O’Neill. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 12 March 1990.

Crowther, William, and David Walden. “CurrentViews of Timing.” Memorandum to Frank E. Heart, Cambridge, Mass., 8 July 1969.

Davies, Donald W. “Further Speculations on Data Transmission.” Private papers. London, 16 November 1965.

———.“Proposal for a Digital Communication Network.” Private papers, photocopied and widely circulated. London, June 1966.

———. “Proposal for the Development of a National Communications Service for On-Line Data Processing.” Private papers. London, 15 December 1965.

———. “Remote On-line Data Processing and Its Communication Needs.” Private papers. London, 10 November 1965.

Davies, Donald W. Interview by Martin Campbell-Kelly. National Physical Laboratory, U.K., 17 March 1986.

Davies, Donald W., Keith Bartlett, Roger Scantlebury, and Peter Wilkinson. “A Digital Communications Network for Computers Giving Rapid Response at Remote Terminals.” Paper presented at the Association for Computing Machinery Symposium on Operating System Principles, Gatlinburg, Tenn., October 1967.

Davis, Ruth M. “Comments and Recommendations Concerning the ARPA Network.” Center for Computer Sciences and Technology, U.S. National Bureau of Standards, 6 October 1971.

Digital Equipment Corporation. “Interface Message Processors for the ARPA Computer Network.” Design proposal. Submitted to the Department of the Army, Defense Supply Service, in RFQ no. DAHC15 69 Q 002, 5 September 1968.

Frank, Howard. Interview by Judy O’Neill. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 30 March 1990.

Goldstein, Paul. “The Proposed ARPANET Divestiture: Legal Questions and Economic Issues.” Working Paper, Cabledata Associates, Inc., CAWP no. 101, 27 July 1973.

Hauben, Michael, and Ronda Hauben. The Netizens Netbook page can be found at http://www.columbia.edu/∼hauben/netbook/. The Haubens’ work has also appeared in the Amateur Computerist Newsletter, available from ftp://wuarchive.wustl.edu/doc/misc/acn/.

Heart, F. E., R. E. Kahn, S. M. Ornstein, W. R. Crowther, and D. C. Walden. “The Interface Message Processor for the ARPA Computer Network.” Paper presented at the Spring Joint Computer Conference of the American Federation of Information Processing Societies, 1970.

Heart, Frank E. Interview by Judy O’Neill. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 13 March 1990.

Herzfeld, Charles. Interview by Arthur Norberg. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 6 August 1990.

Honeywell, Inc. “Honeywell at Bolt Beranek and Newman, Inc.” Brochure. Published for the ARPA Network demonstration at the International Conference on Computer Communication, Washington, D.C., October 1972.

Information Sciences Institute, University of Southern California. “DOD Standard Transmission Control Protocol.” Request for Comments 761. Prepared for the Defense Advanced Research Projects Agency, Information Processing Techniques Office, Arlington,Va., January 1980.

International Data Corporation. “ARPA Computer Network Provides Communications Technology for Computer/Computer Interaction Within Special Research Community.” Industry report and market review. Newtonville, Mass., 3 March 1972.

Kahn, Robert. Interview by Judy O’Neill. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 24 April 1990.

Kahn, Robert. Interview by William Aspray. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 22 March 1989.

Kleinrock, Leonard. Interview by Judy O’Neill. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 3 April 1990.

Kryter, Karl D. “Lick as a Psychoacoustician and Physioacoustician.” Presentation honoring J. C. R. Licklider at the Meeting of the Acoustical Society of America, Baltimore, Md., 30 April 1991.

———. Obituary of J. C. R. Licklider, Journal of the Acoustical Society of America, December 1990.

Licklider, J. C. R., and Welden E. Clark. “On-Line Man-Computer Communication.” Paper presented at the Spring Joint Computer Conference of the American Federation of Information Processing Societies, 1962.

Licklider, J. C. R. Interview by William Aspray. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 28 October 1988.

Lukasik, Stephen. Interview by Judy O’Neill. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 17 October 1991.

Marill, Thomas, and Lawrence G. Roberts. “Toward a Cooperative Network of Time-Shared Computers.” Paper presented at the Fall Joint Computer Conference of the American Federation of Information Processing Societies, 1966.

McCarthy, J., S. Boilen, E. Fredkin, and J. C. R. Licklider. “A Time-Sharing Debugging System for a Small Computer.” Paper presented at the Spring Joint Computer Conference of the American Federation of Information Processing Societies, 1963.

McKenzie, Alexander A. “The ARPA Network Control Center.” Paper presented at the Fourth Data Communications Symposium of the Institute for Electrical and Electronics Engineers, October 1975.

McKenzie, Alexander A. Interview by Judy O’Neill. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 13 March 1990.

Message Group. The full text of more than 2,600 e-mail messages sent by members of the Message Group (or MsgGroup), one of the first electronic mailing lists, relating to the development of e-mail. The Computer Museum, Boston, Mass., June 1975–June 1986. Electronic document. (http://www.tcm.org/msgroup)

Metcalfe, Robert. “Some Historic Moments in Networking.” Request for Comments 89. Network Working Group, 19 January 1971.

Myer, T. H., and D. A. Henderson. “Message Transmission Protocol.” Request for Comments 680. Stanford Research Institute, Menlo Park, Calif., 1975.

National Research Council, Commission on Engineering and Technical Systems. “Transport Protocols for Department of Defense Data Networks.” Report to the Department of Defense and the National Bureau of Standards, Board on Telecommunication and Computer Applications, 1985.

Neigus, N.J. “File Transfer Protocol.” Request for Comments 542. Bolt Beranek and Newman Inc., Cambridge, Mass., 12 July 1973.

Norberg, Arthur L., and Judy E. O’Neill. “A History of the Information Processing Techniques Office of the Defense Advanced Research Projects Agency.” Charles Babbage Institute, University of Minnesota, Minneapolis, Minn., 1992.

Ornstein, Severo M., F. E. Heart, W. R. Crowther, H. K. Rising, S. B. Russell, and A. Michel. “The Terminal IMP for the ARPA Network.” Paper presented at the Spring Joint Computer Conference of the American Federation of Information Processing Societies, Atlantic City, N.J., May 1972.

Ornstein, Severo. Interview by Judy O’Neill. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 6 March 1990.

Pogran, Ken, John Vittal, Dave Crowther, and Austin Henderson. “Proposed Official Standard for the Format of ARPA Network Messages.” Request for Comments 724. MIT, Cambridge, Mass., 12 May 1977.

Postel, Jonathan B. “Simple Mail Transfer Protocol.” Request for Comments 821. Information Sciences Institute, University of Southern California, August 1982.

———. “Specification of Internetwork Transmission Control Protocol: TCP Version 4.” Information Sciences Institute, University of Southern California, September 1978.

———. “TCP and IP Bake Off.” Request for Comments 1025. Network Working Group, September 1987.

Pouzin, Louis. “Network Protocols.” Notes of the International Network Working Group 50, September 1973.

———.“Presentation and Major Design Aspects of the Cyclades Computer Network.” Paper presented at the IEEE Third Data Communications Symposium (Data Networks: Analysis and Design), November 1973.

———. “Experimental Communication Protocol: Basic Message Frame.” Notes of the International Network Working Group 48, January 1974.

———.“Interconnection of Packet Switching Networks.” Notes of the International Network Working Group 42, October 1973.

———. “Network Architecture and Components.” Notes of the International Network Working Group 49, August 1973.

RAND Corporation. “Development of the Distributed Adaptive Message-Block Network.” Recommendation to the Air Staff, 30 August 1965.

RCA Service Company, Government Services Division. “ARPANET Study Final Report.” Submitted under contract no. F08606-73-C-0018. 24 November 1972.

Richard J. Barber Associates, Inc. “The Advanced Research Projects Agency: 1958–1974.” A study for the Advanced Research Projects Agency under contract no. MDA-903-74-C-0096. Washington, D.C., December 1975. Photocopy.

Roberts, Lawrence G. “Extensions of Packet Communications Technology to a Hand-Held Personal Terminal.” Paper presented at the Spring Joint Computer Conference of the American Federation of Information Processing Societies, May 1972.

———. “Multiple Computer Networks and Intercomputer Communication.” Paper presented at the Association for Computing Machinery Symposium on Operating System Principles, October 1967.

Roberts, Lawrence G., and Barry D. Wessler. “Computer Network Development to Achieve Resource Sharing.” Paper presented at the Spring Joint Computer Conference of the American Federation of Information Processing Societies, 1970.

Roberts, Lawrence G. Interview by Arthur Norberg. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 4 April 1989.

Ruina, Jack. Interview by William Aspray. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 20 April 1989.

Sutherland, Ivan. Interview by William Aspray. Charles Babbage Institute DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 1 May 1989.

Taylor, Robert. Interview by William Aspray. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 28 February 1989.

U.S. Postal Service. “Electronic Message Systems for the U.S. Postal Service.” Report of the U.S.P.S. Support Panel, Committee on Telecommunications, Washington, D.C., January 1977.

Walden, David C. “Experiences in Building, Operating, and Using the ARPA Network.” Paper presented at the Second USA-Japan Computer Conference, Tokyo, Japan, August 1975.

Walden, David. Interview by Judy O’Neill. Charles Babbage Institute, DARPA/IPTO Oral History Collection, University of Minnesota Center for the History of Information Processing, Minneapolis, Minn., 6 February 1990.

Walker, Stephen T. “Completion Report: ARPA Network Development.” Defense Advanced Research Projects Agency, Information Processing Techniques Office, Washington, D.C., 4 January 1978.

Weik, Martin H. “A Third Survey of Domestic Electronic Digital Computing Systems.” Ballistic Research Laboratories, report no. 1115, March 1961.

White, Jim. “Proposed Mail Protocol.” Request for Comments 524. Stanford Research Institute, Menlo Park, Calif., 13 June 1973.

Zimmermann, H., and M. Elie. “Proposed Standard Host-Host Protocol for Heterogeneous Computer Networks: Transport Protocol.” Notes of the International Network Working Group 43, December 1973.Edit

Electronic Archives

Charles Babbage Institute, Center for the History of Information Processing, University of Minnesota. Large archival collection relating to the history of computing. More information can be obtained via the CBI Web site at http://cbi.itdean.umn.edu/cbi/welcome.html or via e-mail addressed to [email protected].

Computer Museum, Boston, Massachusetts. Large collection relating to the history of computing, including the archives of the Message Group concerning the early development of e-mail. The archive is available via the homepage at http://www.tcm.org/msgroup.

Information Sciences Institute, University of Southern California. Collection includes up-to-date indexes and tests of Internet standards, protocols, Requests for Comments (RFCs), and various other technical notes available via the ISI Web site: http://www.isi.edu. Some of the earlier RFCs are not available electronically, but are archived off-line in meticulous fashion by RFC editor Jon Postel. A searchable archive is maintained at http://info.internet.isi.edu:80/in-notes/rfc.

Ohio State University, Department of Computer and Information Science. The CIS Web Server offers access to RFCs and various other technical and historical documents related to the Internet via http://www.cis. ohio-state.edu:80/hypertext/information/rfc.html.

Primary Fair Use Source: B000FC0WP6

Secondary Fair Use Sources:

Categories
Artificial Intelligence Bibliography Cloud Data Science - Big Data Hardware and Electronics History Linux Networking Operating Systems Software Engineering

Where Wizards Stay Up Late – The Origins Of The Internet

Return to Timeline of the History of Computers or History

Fair Use Source: B000FC0WP6

Where Wizards Stay Up Late – The Origins Of The Internet by Matthew Lyon and Katie Hafner

by Matthew Lyon and Katie Hafner

“Twenty five years ago, it didn’t exist. Today, twenty million people worldwide are surfing the Net. Where Wizards Stay Up Late is the exciting story of the pioneers responsible for creating the most talked about, most influential, and most far-reaching communications breakthrough since the invention of the telephone.”

“In the 1960’s, when computers where regarded as mere giant calculators, J.C.R. Licklider at MIT saw them as the ultimate communications devices. With Defense Department funds, he and a band of visionary computer whizzes began work on a nationwide, interlocking network of computers. Taking readers behind the scenes, Where Wizards Stay Up Late captures the hard work, genius, and happy accidents of their daring, stunningly successful venture.”Edit

Book Details

  • Print length: 304 pages
  • Publication date: August 19, 1999
  • ASIN: B000FC0WP6
  • Publisher: Simon & Schuster
  • ISBN: 0684832674

Table of Contents

  • Prologue
  • 1. The Fastest Million Dollars
  • 2. A Block Here, Some Stones There
  • 3. The Third University
  • 4. Head Down in the Bits
  • 5. Do It to It Truett
  • 6. Hacking Away and Hollering
  • 7. E-Mail
  • 8. A Rocket on Our Hands
  • Epilogue
  • Chapter Notes
  • Bibliography
  • Acknowledgments
  • Index

Dedication

To the memory of J. C. R. Licklider and to the memory of Cary Lu

Los Alamos’ lights where wizards stay up late, (Stay in the car, forget the gate), To save the world or end it, time will tell” — James Merrill, “Under Libra: Weights and Measures

Fair Use Sources:

Categories
Artificial Intelligence GCP History Software Engineering

Google Releases TensorFlow – 2015 AD

Return to Timeline of the History of Computers

2015

Google Releases TensorFlow

Makoto Koike (dates unavailable)

“Cucumbers are a big culinary deal in Japan. The amount of work that goes into growing them can be repetitive and laborious, such as the task of hand-sorting them for quality based on size, shape, color, and prickles. An embedded-systems designer who happens to be the son of a cucumber farmer (and future inheritor of the cucumber farm) had the novel idea of automating his mother’s nine-category sorting process with a sorting robot (that he designed) and some fancy machine learning (ML) algorithms. With Google’s release of its open source machine learning library, TensorFlow®, Makoto Koike was able to do just that.

TensorFlow, a deep learning neural network, evolved from Google’s DistBelief, a proprietary machine learning system that the company used for a variety of its applications. (Machine learning allows computers to find relationships and perform classifications without being explicitly programmed regarding the details.) While TensorFlow was not the first open source library for machine learning, its release was important for a few reasons. First, the code was easier to read and implement than most of the other platforms out there. Second, it used Python, an easy-to-use computer language widely taught in schools, yet powerful enough for many scientific computing and machine learning tasks. TensorFlow also had great support, documentation, and a dynamic visualization tool, and it was as practical to use for research as it was for production. It ran on a variety of hardware, from high-powered supercomputers to mobile phones. And it certainly didn’t hurt that it was a product of one of the world’s behemoth tech companies whose most valuable asset is the gasoline that fuels ML and AI—data.

These factors helped to drive TensorFlow’s popularity. The greater the number of people using it, the faster it improved, and the more areas in which it was applied. This was a good thing for the entire AI industry. Allowing code to be open source and sharing knowledge and data from disparate domains and industries is what the field needed (and still needs) to move forward. TensorFlow’s reach and usability helped democratize experimentation and deployment of AI and ML applications. Rather than being exclusive to companies and research institutions, AI and ML capabilities were now in reach of individual consumers — such as cucumber farmers.”

SEE ALSO: GNU Manifesto (1985), Computer Beats Master at Go (2016), Artificial General Intelligence (AGI) (~2050)

TensorFlow’s hallucinogenic images show the kinds of mathematical structures that neural networks construct in order to recognize and classify images.

Fair Use Sources: B07C2NQSPV

Knight, Will. “Here’s What Developers Are Doing with Google’s AI Brain.” MIT Technology Review, December 8, 2015. https://www.technologyreview.com/s/544356/heres-what-developers-are-doing-with-googles-ai-brain.

Metz, Cade. “Google Just Open Sources TensorFlow, Its Artificial Intelligence Engine.” Wired online, November 9, 2015. https://www.wired.com/2015/11/google-open-sources-its-artificial-intelligence-engine.

Categories
Artificial Intelligence Data Science - Big Data History

Algorithm Influences Prison Sentence – 2013 AD

Return to Timeline of the History of Computers

2013

Algorithm Influences Prison Sentence

“Eric Loomis was sentenced to six years in prison and five years’ extended supervision for charges associated with a drive-by shooting in La Crosse, Wisconsin. The judge rejected Loomis’s plea deal, citing (among other factors), the high score that Loomis had received from the computerized COMPAS (Correctional Offender Management Profiling for Alternative Sanctions) risk-assessment system.

Loomis’ lawyers appealed his sentence on the grounds that his due process was violated, as he did not have any information into how the algorithm derived his score. As it turns out, neither did the judge. And the creators of COMPAS — Northpointe Inc. — refused to provide that information, claiming that it was proprietary. The Wisconsin Supreme court upheld the lower court’s ruling against Loomis, reasoning that the COMPAS score was just one of many factors the judge used to determine the sentence. In June 2017, the US Supreme Court decided not to give an opinion on the case, after previously inviting the acting solicitor general of the United States to file an amicus brief.

Data-driven decision-making focused on predicting the likelihood of some future behavior is not new — just ask parents who pay for their teenager’s auto insurance or a person with poor credit who applies for a loan. What is relatively new, however, is the increasingly opaque reasoning that these models perform as a consequence of the increasing use of sophisticated statistical machine learning. Research has shown that hidden bias can be inadvertently (or intentionally) coded into an algorithm. Illegal bias can also result from the selection of data fed to the data model. An additional question in the Loomis case is whether gender was considered in the algorithm’s score, a factor that is unconstitutional at sentencing. A final complicating fact is that profit-driven companies are neither required nor motivated to reveal any of this information.

State v. Loomis helped raise public awareness about the use of “black box” algorithms in the criminal justice system. This, in turn, has helped to stimulate new research into development of “white box” algorithms that increase the transparency and understandability of criminal prediction models by a nontechnical person.”

SEE ALSO: DENDRAL (1965), The Shockwave Rider (1975)

Computer algorithms such as the COMPAS risk-assessment system can influence the sentencing of convicted defendants in criminal cases.

Fair Use Sources: B07C2NQSPV

Angwin, Julia, Jeff Larson, Surya Mattu, and Lauren Kirchner. “Machine Bias” ProPublica, May 23, 2016. https://www.propublica.org/article/machine-bias-risk-assessments-in-criminal-sentencing.

Eric L. Loomis v. State of Wisconsin, 2015AP157-CR (Supreme Court of Wisconsin, October 12, 2016).

Harvard Law Review. “State v. Loomis: Wisconsin Supreme Court Requires Warning Before Use of Algorithmic Risk Assessments in Sentencing.” Vol. 130 (March 10, 2017): 1530–37.

Liptak, Adam. “Sent to Prison by a Software Program’s Secret Algorithms.” New York Times online, May 1, 2017. https://www.nytimes.com/2017/05/01/us/politics/sent-to-prison-by-a-software-programs-secret-algorithms.html.

Pasquale, Frank. “Secret Algorithms Threaten the Rule of Law.” MIT Technology Review, June 1, 2017. https://www.technologyreview.com/s/608011/secret-algorithms-threaten-the-rule-of-law/.

State of Wisconsin v. Eric L. Loomis 2015AP157-CR (Wisconsin Court of Appeals District IV, September 17, 2015). https://www.wicourts.gov/ca/cert/DisplayDocument.pdf?content=pdf&seqNo=149036.

Categories
Artificial Intelligence Data Science - Big Data History

IBM’s Watson Wins Jeopardy! – 2011 AD

Return to Timeline of the History of Computers

2011

Watson Wins Jeopardy!

David Ferrucci (b. 1962)

“For all of the mathematical accomplishments that computers are capable of, a machine that engages people in conversation is still the work of fiction and computer scientists’ dreams. When IBM’s Watson® beat the two best-ever Jeopardy! players—Ken Jennings and Brad Rutter—the dream seemed a little more real. Indeed, when Jennings realized he had lost, he tweaked a line from an episode of The Simpsons to display on his screen: “I, for one, welcome our new computer overlords.”

Unlike chess, for which IBM’s Deep Blue demonstrated domination when it beat the world’s best chess player, Garry Kasparov, in 1996, Jeopardy! is not a game governed by clear and objective rules that translate into mathematical calculations and statistical models. It’s a game governed by finding answers in language—a messy, unstructured, ambiguous jumble of symbols that humans understand as a result of context, culture, inference, and a vast corpus of knowledge acquired by virtue of being a human and having a lifetime of sensory experiences. Designing a computer that could beat a person at this game was a really big deal.

Watson was designed over several years using a 25-person team of multidisciplinary experts in fields that included natural language processing, game theory, machine learning, informational retrieval, and computational linguistics. The team accomplished much of its work in a common war room where the exchange of diverse ideas and perspectives enabled faster and more incremental progress than may have occurred using a more traditional research approach. The goal was not to model the human brain but to “build a computer that can be more effective in understanding and interacting in natural language, but not necessarily the same way humans do it,” according to David Ferrucci, Watson’s lead designer.

Watson’s success was not due to any one breakthrough, but rather incremental improvements in cognitive computing along with other factors, including the massive supercomputing capabilities of speed and memory that IBM could direct to the project, more than 100 algorithms the team had working in parallel to analyze questions and answers, and the corpus of millions of electronic documents Watson ingested, including dictionaries, literature, news reports, and Wikipedia.”

SEE ALSO Computer Is World Chess Champion (1997), Wikipedia (2001), Computer Beats Master at Go (2016)

Contestants Ken Jennings and Brad Rutter compete against Watson at a press conference before the “Man v. Machine” Jeopardy! competition at the IBM Thomas J. Watson Research Center in Yorktown Heights, New York.

Fair Use Sources: B07C2NQSPV

Thompson, Clive. “What is I.B.M.’s Watson?” New York Times online, June 16, 2010. http://www.nytimes.com/2010/06/20/magazine/20Computer-t.html.

Categories
Artificial Intelligence History

First International Meeting on Synthetic Biology – 2004 AD

Return to Timeline of the History of Computers

2004

First International Meeting on Synthetic Biology

Adam Arkin (dates unavailable), Drew Endy (b. 1970), Tom Knight (b. 1948)

“Over the past half century, scientists have been using advanced computer technology to investigate and seek knowledge about the biological world at its most fundamental level. Many of the discoveries in biology have been made possible by information processing for analyzing the large amounts of data that can be generated by a biological study, computational science for modeling biological systems, and, increasingly, advanced laboratory robotics for carrying out the experiments themselves.

Perhaps because of their familiarity with computers, many biologists have come to think of cells not just as metabolic systems, but also as information-processing systems. This has led to a basic question at the foundation of the new field of synthetic biology: is it possible to apply what has been learned in the creation of computers to the design and programming of cells?

In the 1990s, MIT computer scientist Tom Knight set up a biology laboratory in the MIT Laboratory for Computer Science with the goal of doing just that. One of his first milestones: creating bioluminescent bacteria that could be programmed to blink. In 1999, synthetic biologists Drew Endy and Adam Arkin proposed in a white paper that there should be “a standard parts list for biological circuitry.” By 2003, these parts had become a reality, with the creation of Tom Knight’s “BioBrick” standard for combining synthetic biology parts.

MIT hosted the First International Meeting on Synthetic Biology in 2004. Over the next few years, the number of researchers in the field multiplied. A key milestone followed: oscillator circuits that could be built into cells, coupled with other circuits that could be used to count the number of oscillations and signal the results at distances up to several centimeters.”

SEE ALSO: DNA Data Storage (2012)

The vision for synthetic biology is to enable engineers to program cells the way they can program computers.

Fair Use Sources: B07C2NQSPV

Cameron, D. Ewen, Caleb J. Bashor, and James Collins. “A Brief History of Synthetic Biology.” Nature Reviews, Microbiology 12, no. 5 (May 2014): 381–90.

Knight, Helen. “Researchers Develop Basic Computing Elements for Bacteria.” MIT News release, July 9, 2015. http://news.mit.edu/2015/basic-computing-for-bacteria-0709.

Sleator, Roy D. “The Synthetic Biology Future.” Bioengineered 5, no. 2 (March 2014): 69–72.

Categories
Artificial Intelligence History

CAPTCHA – Completely Automated Public Turing test to tell Computers and Humans Apart – 2003 AD

Return to Timeline of the History of Computers

2003

CAPTCHA

“CAPTCHAs are tests administered by a computer to distinguish a human from a bot, or a piece of software that is pretending to be a person. They were created to prevent programs (more correctly, people using programs) from abusing online services that were created to be used by people. For example, companies that provide free email services to consumers sometimes use a CAPTCHA to prevent scammers from registering thousands of email addresses within a few minutes. CAPTCHAs have also been used to limit spam and restrict editing to internet social media pages.

CAPTCHA stands for Completely Automated Public Turing test to tell Computers and Humans Apart. The term was coined in 2003 by computer scientists at Carnegie Mellon; however, the technique itself dates to patents filed in 1997 and 1998 by two separate teams at Sanctum, an application security company later acquired by IBM, and AltaVista that describe the technique in detail.

One clever application of CAPTCHAs is to improve and speed up the digitization of old books and other paper-based text material. The ReCAPTCHA program takes words that are illegible to OCR (Optical Character Recognition) technology when scanned and uses them as the puzzles to be retyped. Licensed to Google, this approach helps improve the accuracy of Google’s book-digitizing project by having humans provide “correct” recognition of words too fuzzy for current OCR technology. Google can then use the images and human-provided recognition as training data for further improving its automated systems.

As AI has improved, the ability of a machine to solve CAPTCHA puzzles has improved as well, creating a sort of arms race, as each side tries to improve. Different approaches have evolved over the years to create puzzles that are hard for computers but easy for people. For example, one of Google’s CAPTCHAs simply asks users to click a box that says “I am not a robot”—meanwhile, Google’s servers analyze the user’s mouse movements, examine the cookies, and even review the user’s browsing history to make sure the user is legitimate. Techniques to break or get around CAPTCHA puzzles also drive the improvement and evolution of CAPTCHA. One manual example of this is the use of “digital sweatshop workers” who type CAPTCHA solutions for human spammers, reducing the effectiveness of CAPTCHAs to limit the abuse of computer resources.”

SEE ALSO The Turing Test (1951), First Internet Spam Message (1978)

CAPTCHAs require human users to enter a series of characters or take specific actions to prove they are not robots.

Fair Use Sources: B07C2NQSPV

Categories
Artificial Intelligence History

Computer Is World Chess Champion – 1997 AD

Return to Timeline of the History of Computers

1997

Computer Is World Chess Champion

Garry Kasparov (b. 1963)

“Ever since Alan Turing wrote the first computer chess program in 1950, computer scientists (and the general public) had viewed proficiency at chess as a litmus test for machines’ intelligence. Machines, the thinking went, would be truly intelligent if they could beat a human at chess. When that happened, the challenge then subtly changed: would computers ever be able to beat every human at chess, even a grand master?

That happened nearly 50 years later in 1996, when IBM’s Deep Blue computer beat world chess champion Garry Kasparov.

Kasparov and Deep Blue played two matches—the first took place in February 1996 in Philadelphia. Kasparov lost two games to Deep Blue but still won the match. The rematch occurred a year later in May 1997, when Kasparov lost to Deep Blue with a final score of 3.5 to 2.5 (one game was a draw). In an unusual twist, Deep Blue made an unexpected play during game two of the second match, rattling Kasparov and throwing him off his strategy. Kasparov did not know what to make of the move and considered it a sign of superior intelligence. While counterintuitive, Kasparov’s interpretation of Deep Blue’s capabilities highlights the power and weakness of relying on human intuition when playing games of skill.

In fact, Deep Blue’s advantage was brute force, pure and simple. Deep Blue was really a massively parallel program coded in C, running on a UNIX cluster, and capable of computing 200 million possible board positions each second. Deep Blue’s “evaluative function,” which decided which board positions were better, was based on assessing four human-programmed variables: material, the value of each piece; position, the number of squares that buffer a player’s piece from attack; king safety, a number that represents how safe the king is, given his location on the board and the position of the other pieces; and tempo, the success of a player advancing his or her position over time. Given these factors and the relatively constrained size of the board, chess became a “quantifiable” equation for Deep Blue. As such, the computer can win by simply seeking the best board positions—something it can do faster, and better, than any human.”

SEE ALSO Computer Beats Master at Go (2016)

Viewers watch world chess champion Garry Kasparov on a television monitor at the start of the sixth and final match against IBM’s Deep Blue computer in New York.

Fair Use Sources: B07C2NQSPV

Categories
Artificial Intelligence History Software Engineering

Scheme Programming Language Invented by Guy Steele and Gerry Sussman – 1975 AD

Return to Timeline of the History of Computers

A variation of LISP, the Scheme programming language was created in 1975 by Guy Steele and Gerry Sussman at MIT’s Artificial Intelligence lab.

Fair Use Sources:

Categories
History Software Engineering

AI Medical Diagnosis – Artificial Intelligence in Medicine – 1975 AD

Return to Timeline of the History of Computers

1975

AI Medical Diagnosis

Edward Shortliffe (b. 1947)

MYCIN was the first expert knowledge system to prove that a computer program could outperform physicians and medical students in diagnosing a specific medical problem. MYCIN specialized in recommendations for antimicrobial therapy aimed at individual patients with severe blood infections, such as meningitis.

Research for MYCIN began in 1972 as physician and computer scientist Edward Shortliffe’s doctoral thesis at Stanford. The program used early AI techniques based on rule-based knowledge representations of what a human expert knows. To create the rules, information engineers discussed patient case histories with antimicrobial medical experts. The engineers captured the data as a series of IF-THEN statements, which were then compiled into the MYCIN system. MYCIN provided judgments and recommendations to physicians by modeling the question-and-answer style typically seen in a doctor-patient exchange. The physician would sit at a computer terminal and answer questions about his or her patient in response to the questions generated by the system. Soon the machine would give a diagnosis, or at least a recommendation.

MYCIN had three interrelated parts. A consultation system provided therapeutic advice based on domain-specific knowledge. An explanation system provided the rationale, reasoning, and motivation behind the conclusion reached, the recommended therapeutic advice, and the line of questioning used for the diagnosis. And, finally, a knowledge acquisition system allowed an expert or physician to easily update the static knowledge base.

For the test that proved the system’s accuracy, MYCIN’s recommendations for antimicrobial treatment of 10 patients were compared with the choices made by nine microbial experts. Eight independent evaluators with expertise in the treatment of meningitis assessed the results. MYCIN received a score of 65 percent compared to the human experts, who received scores ranging from 42 percent to 62 percent.

Despite its success, MYCIN was never implemented in a working environment. The computational resources required for end users such as hospitals were infeasible at the time, and questions surrounding the ethics and legality of acting for or against therapeutic conclusions reached by MYCIN still had to be resolved.

SEE ALSO “As We May Think” (1945), DENDRAL (1965), Mother of All Demos (1968)

Magnetic resonance imaging (MRI) of the brain, performed to rule out eosinophilic meningitis in a 13-year-old boy. MYCIN specialized in recommendations for antimicrobial therapy for patients with infections such as meningitis.

Fair Use Source: B07C2NQSPV

Categories
History Software Engineering

Game of Life – Early Artificial Intelligence (AI) Research – 1972 AD

Return to Timeline of the History of Computers

1972

Game of Life

John H. Conway (b. 1937)

Mathematician John Conway’s Game of Life is a digital grid of square cells. Each cell has eight “neighbors,” or other cells touching it (horizontally, vertically, or diagonally). Cells can be alive, indicated by a stone in the square, or dead. On each turn, the computer examines every cell. A live cell with zero or one live neighbors dies on the next turn (or generation), presumably from loneliness (or underpopulation). A cell with four or more live neighbors also dies, this time from overpopulation. A cell with two or three live neighbors survives to the next generation. A dead cell with three live neighbors will become alive—a birth. As time progresses, the pattern of cells changes and evolves, usually (but not always) reaching stable patterns. Beyond setting up the initial pattern and starting the game, there is nothing for a human to do, which is why Life is sometimes referred to as a zero-player game.

Conway developed Life after hearing John von Neumann ask if it was possible for a machine to replicate itself. In the simplified world of Life, Conway showed that a machine could.

This game was significant to computer science because it was the first time a program had been created that could copy itself independently of any human coding activity (outside of starting the program, of course). Life launched a new field of modeling and simulation research, wherein the cycles and evolutions in nature—whether environmental, human, or even organizational—could be observed and studied as emergent and evolutionary behavior in a dramatically simplified environment. These research activities and the questions they purported to answer would become known as simulation programs.

Life’s popularity grew significantly after Martin Gardner (1914–2010) mentioned it in the October 1970 issue of Scientific American. The game’s rules were easy to implement, and the resulting complexity from relatively simple initial configurations was completely unexpected. Today there are many versions of Life available on the internet that can be played in a web browser.

SEE ALSO First International Meeting on Synthetic Biology (2004), Computer Beats Master at Go (2016)

John Conway’s Game of Life on an LED matrix showing an assortment of gliders, oscillators, and reflecting patterns.

Fair Use Source: B07C2NQSPV