CS 4700: Foundations of Artificial Intelligence

Total Page:16

File Type:pdf, Size:1020Kb

CS 4700: Foundations of Artificial Intelligence CS 4700: CS 4701: Foundations of Practicum in Artificial Intelligence Artificial Intelligence Fall 2017 Instructor: Prof. Haym Hirsh Lecture 1 Irving Ives, 1896-1962 CS 4700: CS 4701: Foundations of Practicum in Artificial Intelligence Artificial Intelligence Fall 2017 Instructor: Prof. Haym Hirsh Doubled in 4 years ? New CS Professors and Lecturers Hired in the Last 3 Years Class is Full All 287 seats are taken Class is Full Please drop as soon as you know you’re not taking the class Today • Overview of AI • Overview of 4700 Next Time • Introduction • Last 15 minutes: 4701 What is Artificial Intelligence? What is Intelligence? Intelligence Intelligence Manipulate Play Plan and Use Language See Learn and Move Games Reason Artificial Intelligence Manipulate Play Plan and Use Language See Learn and Move Games Reason Artificial Intelligence Natural Computer Machine Planning/ Language Robotics Games Automated Understanding Vision Learning Reasoning Artificial Intelligence Natural Computer Machine Planning/ Language Robotics Games Automated Understanding Vision Learning Reasoning (1950s) John McCarthy (1927-2011) The study is to proceed on the basis of the conjecture that every aspect of learning or any other feature of intelligence can in principle be so precisely described that a machine can be made to simulate it. 1. Ray Solomonoff 11. Abraham Robinson 2. Marvin Minsky 12. Tom Etter 3. John McCarthy 13. John Nash 4. Claude Shannon 14. David Sayre 5. Trenchard More 15. Arthur Samuel 6. Nathaniel Rochester 16. Shoulders 7. Oliver Selfridge 17. Shoulder's friend 8. Julian Bigelow 18. Alex Bernstein 9. W. Ross Ashby 19. Herbert Simon 10. W.S. McCulloch 20. Allen Newell 1. Ray Solomonoff 11. Abraham Robinson 2. Marvin Minsky 12. Tom Etter 3. John McCarthy 13. John Nash 4. Claude Shannon 14. David Sayre 5. Trenchard More 15. Arthur Samuel 6. Nathaniel Rochester 16. Shoulders 7. Oliver Selfridge 17. Shoulder's friend 8. Julian Bigelow 18. Alex Bernstein 9. W. Ross Ashby 19. Herbert Simon 10. W.S. McCulloch 20. Allen Newell 1. Ray Solomonoff 11. Abraham Robinson 2. Marvin Minsky 12. Tom Etter 3. John McCarthy 13. John Nash 4. Claude Shannon 14. David Sayre 5. Trenchard More 15. Arthur Samuel 6. Nathaniel Rochester 16. Shoulders 7. Oliver Selfridge 17. Shoulder's friend 8. Julian Bigelow 18. Alex Bernstein 9. W. Ross Ashby 19. Herbert Simon 10. W.S. McCulloch 20. Allen Newell Artificial Intelligence Natural Computer Machine Planning/ Language Robotics Games Automated Understanding Vision Learning Reasoning Artificial Intelligence Natural Computer Machine Planning/ Language Robotics Games Automated Understanding Vision Learning Reasoning Hard to tell what would be easy and what would be hard Artificial Intelligence Natural Computer Machine Planning/ Language Robotics Games Automated Understanding Vision Learning Reasoning Hard to predict how long to achieve a goal Artificial Intelligence Natural Computer Machine Planning/ Language Robotics Games Automated Understanding Vision Learning Reasoning 1990s: Common ideas arising in separate areas: Probabilistic modeling Machine learning, mathematical optimization of error on training data Artificial Intelligence Natural Computer Machine Planning/ Language Robotics Games Automated Understanding Vision Learning Reasoning 2000-present: Successes based on - “Standing on the shoulders of giants” - Moore’s Law - Machine learning/data Artificial Intelligence Natural Computer Machine Planning/ Language Robotics Games Automated Understanding Vision Learning Reasoning Artificial Intelligence Natural Computer Machine Planning/ Language Robotics Games Automated Understanding Vision Learning Reasoning Artificial Intelligence Artificial Intelligence Natural Computer Machine Planning/ Language Robotics Games Automated Understanding Vision Learning Reasoning Artificial Social Intelligence Intelligence? This course Artificial Intelligence Natural Computer Machine Planning/ Language Robotics Games Automated Understanding Vision Learning Reasoning 1. Ray Solomonoff 11. Abraham Robinson 2. Marvin Minsky 12. Tom Etter 3. John McCarthy 13. John Nash 4. Claude Shannon 14. David Sayre 5. Trenchard More 15. Arthur Samuel 6. Nathaniel Rochester 16. Shoulders 7. Oliver Selfridge 17. Shoulder's friend 8. Julian Bigelow 18. Alex Bernstein 9. W. Ross Ashby 19. Herbert Simon 10. W.S. McCulloch 20. Allen Newell Human-like “Smart” (“Rational”) Thinks like people Thinks “rationally” How Acts like people Acts “rationally” What Human-like “Smart” (“Rational”) Thinks like people Thinks “rationally” How ~ Cognitive Science, Cognitive Neuroscience Acts like people Acts “rationally” What Human-like “Smart” (“Rational”) Thinks like people Thinks “rationally” How ~ Cognitive Science, Cognitive Neuroscience Acts like people Acts “rationally” What “Turing Test” Alan Turing (1912-1954) Course Details • Instructor: Prof. Haym Hirsh, [email protected], Gates 352 • TAs: TBA • Course website: http://www.cs.cornell.edu/courses/cs4700/ • Textbook: Artificial Intelligence: A Modern Approach by Stuart Russell and Peter Norvig, 3rd Edition • Editions: 1995, 2003, 2010 Course Details • Prerequisites: • CS 2110/ENGRD 2110 • CS 2800 - especially probability, first-order logic • Grade: • 14%: Homeworks • 35%: Prelim (tentatively March 21) • 50%: Final • 1%: Course evaluation • Class participation: Extra credit (used if you are borderline between two grades).
Recommended publications
  • John Mccarthy
    JOHN MCCARTHY: the uncommon logician of common sense Excerpt from Out of their Minds: the lives and discoveries of 15 great computer scientists by Dennis Shasha and Cathy Lazere, Copernicus Press August 23, 2004 If you want the computer to have general intelligence, the outer structure has to be common sense knowledge and reasoning. — John McCarthy When a five-year old receives a plastic toy car, she soon pushes it and beeps the horn. She realizes that she shouldn’t roll it on the dining room table or bounce it on the floor or land it on her little brother’s head. When she returns from school, she expects to find her car in more or less the same place she last put it, because she put it outside her baby brother’s reach. The reasoning is so simple that any five-year old child can understand it, yet most computers can’t. Part of the computer’s problem has to do with its lack of knowledge about day-to-day social conventions that the five-year old has learned from her parents, such as don’t scratch the furniture and don’t injure little brothers. Another part of the problem has to do with a computer’s inability to reason as we do daily, a type of reasoning that’s foreign to conventional logic and therefore to the thinking of the average computer programmer. Conventional logic uses a form of reasoning known as deduction. Deduction permits us to conclude from statements such as “All unemployed actors are waiters, ” and “ Sebastian is an unemployed actor,” the new statement that “Sebastian is a waiter.” The main virtue of deduction is that it is “sound” — if the premises hold, then so will the conclusions.
    [Show full text]
  • Ray Solomonoff, Founding Father of Algorithmic Information Theory [Obituary]
    UvA-DARE (Digital Academic Repository) Ray Solomonoff, founding father of algorithmic information theory [Obituary] Vitanyi, P.M.B. DOI 10.3390/a3030260 Publication date 2010 Document Version Final published version Published in Algorithms Link to publication Citation for published version (APA): Vitanyi, P. M. B. (2010). Ray Solomonoff, founding father of algorithmic information theory [Obituary]. Algorithms, 3(3), 260-264. https://doi.org/10.3390/a3030260 General rights It is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), other than for strictly personal, individual use, unless the work is under an open content license (like Creative Commons). Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: https://uba.uva.nl/en/contact, or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible. UvA-DARE is a service provided by the library of the University of Amsterdam (https://dare.uva.nl) Download date:29 Sep 2021 Algorithms 2010, 3, 260-264; doi:10.3390/a3030260 OPEN ACCESS algorithms ISSN 1999-4893 www.mdpi.com/journal/algorithms Obituary Ray Solomonoff, Founding Father of Algorithmic Information Theory Paul M.B. Vitanyi CWI, Science Park 123, Amsterdam 1098 XG, The Netherlands; E-Mail: [email protected] Received: 12 March 2010 / Accepted: 14 March 2010 / Published: 20 July 2010 Ray J.
    [Show full text]
  • The Computer Scientist As Toolsmith—Studies in Interactive Computer Graphics
    Frederick P. Brooks, Jr. Fred Brooks is the first recipient of the ACM Allen Newell Award—an honor to be presented annually to an individual whose career contributions have bridged computer science and other disciplines. Brooks was honored for a breadth of career contributions within computer science and engineering and his interdisciplinary contributions to visualization methods for biochemistry. Here, we present his acceptance lecture delivered at SIGGRAPH 94. The Computer Scientist Toolsmithas II t is a special honor to receive an award computer science. Another view of computer science named for Allen Newell. Allen was one of sees it as a discipline focused on problem-solving sys- the fathers of computer science. He was tems, and in this view computer graphics is very near especially important as a visionary and a the center of the discipline. leader in developing artificial intelligence (AI) as a subdiscipline, and in enunciating A Discipline Misnamed a vision for it. When our discipline was newborn, there was the What a man is is more important than what he usual perplexity as to its proper name. We at Chapel Idoes professionally, however, and it is Allen’s hum- Hill, following, I believe, Allen Newell and Herb ble, honorable, and self-giving character that makes it Simon, settled on “computer science” as our depart- a double honor to be a Newell awardee. I am pro- ment’s name. Now, with the benefit of three decades’ foundly grateful to the awards committee. hindsight, I believe that to have been a mistake. If we Rather than talking about one particular research understand why, we will better understand our craft.
    [Show full text]
  • The Dartmouth College Artificial Intelligence Conference: the Next
    AI Magazine Volume 27 Number 4 (2006) (© AAAI) Reports continued this earlier work because he became convinced that advances The Dartmouth College could be made with other approaches using computers. Minsky expressed the concern that too many in AI today Artificial Intelligence try to do what is popular and publish only successes. He argued that AI can never be a science until it publishes what fails as well as what succeeds. Conference: Oliver Selfridge highlighted the im- portance of many related areas of re- search before and after the 1956 sum- The Next mer project that helped to propel AI as a field. The development of improved languages and machines was essential. Fifty Years He offered tribute to many early pio- neering activities such as J. C. R. Lick- leiter developing time-sharing, Nat Rochester designing IBM computers, and Frank Rosenblatt working with James Moor perceptrons. Trenchard More was sent to the summer project for two separate weeks by the University of Rochester. Some of the best notes describing the AI project were taken by More, al- though ironically he admitted that he ■ The Dartmouth College Artificial Intelli- Marvin Minsky, Claude Shannon, and never liked the use of “artificial” or gence Conference: The Next 50 Years Nathaniel Rochester for the 1956 “intelligence” as terms for the field. (AI@50) took place July 13–15, 2006. The event, McCarthy wanted, as he ex- Ray Solomonoff said he went to the conference had three objectives: to cele- plained at AI@50, “to nail the flag to brate the Dartmouth Summer Research summer project hoping to convince the mast.” McCarthy is credited for Project, which occurred in 1956; to as- everyone of the importance of ma- coining the phrase “artificial intelli- sess how far AI has progressed; and to chine learning.
    [Show full text]
  • A Philosophical Treatise of Universal Induction
    Entropy 2011, 13, 1076-1136; doi:10.3390/e13061076 OPEN ACCESS entropy ISSN 1099-4300 www.mdpi.com/journal/entropy Article A Philosophical Treatise of Universal Induction Samuel Rathmanner and Marcus Hutter ? Research School of Computer Science, Australian National University, Corner of North and Daley Road, Canberra ACT 0200, Australia ? Author to whom correspondence should be addressed; E-Mail: [email protected]. Received: 20 April 2011; in revised form: 24 May 2011 / Accepted: 27 May 2011 / Published: 3 June 2011 Abstract: Understanding inductive reasoning is a problem that has engaged mankind for thousands of years. This problem is relevant to a wide range of fields and is integral to the philosophy of science. It has been tackled by many great minds ranging from philosophers to scientists to mathematicians, and more recently computer scientists. In this article we argue the case for Solomonoff Induction, a formal inductive framework which combines algorithmic information theory with the Bayesian framework. Although it achieves excellent theoretical results and is based on solid philosophical foundations, the requisite technical knowledge necessary for understanding this framework has caused it to remain largely unknown and unappreciated in the wider scientific community. The main contribution of this article is to convey Solomonoff induction and its related concepts in a generally accessible form with the aim of bridging this current technical gap. In the process we examine the major historical contributions that have led to the formulation of Solomonoff Induction as well as criticisms of Solomonoff and induction in general. In particular we examine how Solomonoff induction addresses many issues that have plagued other inductive systems, such as the black ravens paradox and the confirmation problem, and compare this approach with other recent approaches.
    [Show full text]
  • Pioneers of Computing
    Pioneers of Computing В 1980 IEEE Computer Society учредило Золотую медаль (бронзовую) «Вычислительный Пионер» Пионерами учредителями стали 32 члена IEEE Computer Society, связанных с работами по информатике и вычислительным наукам. 1 Pioneers of Computing 1.Howard H. Aiken (Havard Mark I) 2.John V. Atanasoff 3.Charles Babbage (Analytical Engine) 4.John Backus 5.Gordon Bell (Digital) 6.Vannevar Bush 7.Edsger W. Dijkstra 8.John Presper Eckert 9.Douglas C. Engelbart 10.Andrei P. Ershov (theroretical programming) 11.Tommy Flowers (Colossus engineer) 12.Robert W. Floyd 13.Kurt Gödel 14.William R. Hewlett 15.Herman Hollerith 16.Grace M. Hopper 17.Tom Kilburn (Manchester) 2 Pioneers of Computing 1. Donald E. Knuth (TeX) 2. Sergei A. Lebedev 3. Augusta Ada Lovelace 4. Aleksey A.Lyapunov 5. Benoit Mandelbrot 6. John W. Mauchly 7. David Packard 8. Blaise Pascal 9. P. Georg and Edvard Scheutz (Difference Engine, Sweden) 10. C. E. Shannon (information theory) 11. George R. Stibitz 12. Alan M. Turing (Colossus and code-breaking) 13. John von Neumann 14. Maurice V. Wilkes (EDSAC) 15. J.H. Wilkinson (numerical analysis) 16. Freddie C. Williams 17. Niklaus Wirth 18. Stephen Wolfram (Mathematica) 19. Konrad Zuse 3 Pioneers of Computing - 2 Howard H. Aiken (Havard Mark I) – США Создатель первой ЭВМ – 1943 г. Gene M. Amdahl (IBM360 computer architecture, including pipelining, instruction look-ahead, and cache memory) – США (1964 г.) Идеология майнфреймов – система массовой обработки данных John W. Backus (Fortran) – первый язык высокого уровня – 1956 г. 4 Pioneers of Computing - 3 Robert S. Barton For his outstanding contributions in basing the design of computing systems on the hierarchical nature of programs and their data.
    [Show full text]
  • W. Brodersen Prof. Michael Dertouzos Lab. Prof. Jerome A. Feldman Dr. Michael Frankel
    * DARPA PRINCIPAL INVESTIGATORS MEETING DOUBLETREE INN MONTEREY, CALIFORNIA APRIL 10 - 13, 1983 ATTENDEES ( Dr. Robert Balzer USC-lnformation Sciences Inst. Prof. Robert W. Brodersen DR. BRUCE BUCHANAN Univ. of Calif.-Berkeley STANFORD UNIVERSITY Dr. John H. Cafarella MIT-Lincoln Lab. Prof. Thomas Cheatham Harvard University Aiken Computation Lab. Dr. Danny Cohen USC-lnformation Sciences Inst. Prof. Michael Dertouzos MIT-Computer Science Lab. Prof. Edward A. Feigenbaum Stanford University Prof. Jerome A. Feldman University of Rochester Dr. Michael Frankel SRI International Prof. Robert Gallager MIT-EE and Computer Science Dr. Corded Green Kestrel Institute Dr. Anthony Hearn Rand Corporation Prof. John L Hennessy Stanford University Dr. Estil V. Hoversten Linkabit Corporation "* 2 Prof. Leonard Kleinrock Univ. of Calif.-Los Angeles Prof. Victor R. Lesser University of Massachusetts Dr. Donald Nielson SRI International Prof. Jon McCarthy Stanford University Mr. Alan McLaughlin MIT-Lincoln Lab. Prof. James Meindl Stanford University Prof. Allen Newell Carnegie Mellon University Dr. Nils J. Nilsson SRI International Prof. Allan Oppenheim MIT-EE and Computer Science Prof. Paul Penfield, Jr. Massachusetts Inst, of Technology Dr. Gerald Popek Univ. of Calif. -Los Angeles Dr. Raj D. Reddy Carnegie Mellon University Dr. Daniel R. Ries Computer Corp. of America Prof. Edward R. Riseman Univ. of Massachusetts Prof. Roger C. Shank Yale University \ 3 Prof. Chuck Seitz Calif. Inst, of Technology Prof. Carlo H. Sequin Univ. of Calif.-Berkeley Prof. Joseph F. Traub Columbia University Mr. Keith W. Uncapher USC-lnformation Sciences Inst. Mr. Albert Vezza MIT-Laboratory for Computer Science Mr. David C. Walden Bolt, Beranek and Newman Prof. Patrick Winston MIT-Artificial Intelligence Lab.
    [Show full text]
  • Introduction
    INTRODUCTION In which we try to explain why we consider artificial intelligence to be a subject most worthy of study, and in which we try to decide what exactly it is, this being a good thing to decide before embarking. INTELLIGENCE We call ourselves _Homo sapiens—man the wise—because our intelligence is so important to us. For thousands of years, we have tried to understand how we think; that is, how a mere handful of matter can perceive, understand, predict, and manipulate a world far larger and ARTIFICIAL NTIIII GERHIE more complicated than itself. The field of artificial intelligence, or Al, goes further still: it attempts not just to understand but also to build intelligent entities. AI is one of the newest fields in science and engineering. Work started in earnest soon after World War II, and the name itself was coined in 1956. Along with molecular biology, AI is regularly cited as the "field I would most like to be in" by scientists in other disciplines. A student in physics might reasonably feel that all the good ideas have already been taken by Galileo, Newton, Einstein, and the rest. AI, on the other hand, still has openings for several full-time Einsteins and Edisons. Al currently encompasses a huge variety of subfields, ranging from the general (learning and perception) to the specific, such as playing chess, proving mathematical theorems, writing poetry, driving a car on a crowded street, and diagnosing diseases. AI is relevant to any intellectual task; it is truly a universal field. 1.1 WHAT IS AI? We have claimed that AI is exciting, but we have not said what it is.
    [Show full text]
  • Arxiv:2106.11534V1 [Cs.DL] 22 Jun 2021 2 Nanjing University of Science and Technology, Nanjing, China 3 University of Southampton, Southampton, U.K
    Noname manuscript No. (will be inserted by the editor) Turing Award elites revisited: patterns of productivity, collaboration, authorship and impact Yinyu Jin1 · Sha Yuan1∗ · Zhou Shao2, 4 · Wendy Hall3 · Jie Tang4 Received: date / Accepted: date Abstract The Turing Award is recognized as the most influential and presti- gious award in the field of computer science(CS). With the rise of the science of science (SciSci), a large amount of bibliographic data has been analyzed in an attempt to understand the hidden mechanism of scientific evolution. These include the analysis of the Nobel Prize, including physics, chemistry, medicine, etc. In this article, we extract and analyze the data of 72 Turing Award lau- reates from the complete bibliographic data, fill the gap in the lack of Turing Award analysis, and discover the development characteristics of computer sci- ence as an independent discipline. First, we show most Turing Award laureates have long-term and high-quality educational backgrounds, and more than 61% of them have a degree in mathematics, which indicates that mathematics has played a significant role in the development of computer science. Secondly, the data shows that not all scholars have high productivity and high h-index; that is, the number of publications and h-index is not the leading indicator for evaluating the Turing Award. Third, the average age of awardees has increased from 40 to around 70 in recent years. This may be because new breakthroughs take longer, and some new technologies need time to prove their influence. Besides, we have also found that in the past ten years, international collabo- ration has experienced explosive growth, showing a new paradigm in the form of collaboration.
    [Show full text]
  • An Interview with Oliver Selfridge1
    An Interview with Oliver Selfridge1 Oliver Selfridge was born in 1926 in London. He studied Mathematics at MIT under Norbert Wiener and went on to write important early papers on pattern recognition and machine learning. His 1958 paper on the Pandemonium system is regarded as one of the classics of machine intelligence. He has worked at MIT Lincoln Laboratory, BBN and GTE Laboratories where he was a Chief Scientist. He has served on various advisory panels to the White House and numerous national committees. As well as his scientific writings, he has authored several books for children2. This is an edited transcript of an interview conducted on the 8th May 2006. Phil Husbands: Could you start by saying a little about your early years? Were there any particular influences from home or school that put you on the road to a career in science and engineering? Oliver Selfridge: Well, an important part of my education was my father. Without knowing any mathematics himself, he was wildly enthusiastic about my interest in it, which started at quite an early age: seven or eight. As was usual in England back then, I went away to school when I was ten. At the age of thirteen, I entered Malvern College, one of the (so-called) public schools. I remember we spent the year of 1940 in Blenheim Palace because the Royal Radar Establishment (RRE) had taken over the school. While at Malvern I covered calculus to the standard you’d reach after the first two years of a degree at MIT. One of the great things about education back then, and I am not sure that it’s true any more, is that if you were good in one subject they’d move you ahead in that subject.
    [Show full text]
  • Dartmouth College Artificial Intelligence Conference the Next Fifty Years
    To proceed on the basis of the conjecture that every aspect of learning or any other feature of intelligence can be so precisely described that a machine can be made to simulate it. – Goal proposed for AI by the 1956 Dartmouth Summer Research Project on Artificial Intelligence Dartmouth College Artificial Intelligence Conference The Next Fifty Years AI@50 Co-Sponsored by: Office of the Dean of the Faculty, Welcome! Dartmouth College Office of the Provost, Fifty years ago, pioneer AI researchers Dartmouth College gathered on this campus for their first-ever meeting in 1956, convening the Dartmouth Summer Research Project on Artificial The project is also sponsored in part Intelligence. The term itself had to be through a grant from the coined by John McCarthy, then a Dartmouth Defense Advanced Research Projects Agency math professor, to apply for a grant to fund The content of the information does not necessarily the original project. By end of summer, one reflect the position or the policy of the Government. of the first AI operating programs, Simon and No official endorsement should be inferred. Newell’s Logic Theorist, had presented demonstrable proof of a future for AI We wish to express our gratitude to through digital computer development. these cooperating organizations: This summer, the College commemorates that Summer Research Project by again hosting the 2006 Dartmouth Artificial Intelligence Conference: The Next Fifty Years, over July 13-15. We wish to thank the Office of the Dean of the Faculty and the Office of the Provost for their originating support toward forwarding progress on AI into the 21st century.
    [Show full text]
  • Building the Second Mind, 1961-1980: from the Ascendancy of ARPA to the Advent of Commercial Expert Systems Copyright 2013 Rebecca E
    Building the Second Mind, 1961-1980: From the Ascendancy of ARPA to the Advent of Commercial Expert Systems copyright 2013 Rebecca E. Skinner ISBN 978 09894543-4-6 Forward Part I. Introduction Preface Chapter 1. Introduction: The Status Quo of AI in 1961 Part II. Twin Bolts of Lightning Chapter 2. The Integrated Circuit Chapter 3. The Advanced Research Projects Agency and the Foundation of the IPTO Chapter 4. Hardware, Systems and Applications in the 1960s Part II. The Belle Epoque of the 1960s Chapter 5. MIT: Work in AI in the Early and Mid-1960s Chapter 6. CMU: From the General Problem Solver to the Physical Symbol System and Production Systems Chapter 7. Stanford University and SRI Part III. The Challenges of 1970 Chapter 8. The Mansfield Amendment, “The Heilmeier Era”, and the Crisis in Research Funding Chapter 9. The AI Culture Wars: the War Inside AI and Academia Chapter 10. The AI Culture Wars: Popular Culture Part IV. Big Ideas and Hardware Improvements in the 1970s invert these and put the hardware chapter first Chapter 11. AI at MIT in the 1970s: The Semantic Fallout of NLR and Vision Chapter 12. Hardware, Software, and Applications in the 1970s Chapter 13. Big Ideas in the 1970s Chapter 14. Conclusion: the Status Quo in 1980 Chapter 15. Acknowledgements Bibliography Endnotes Forward to the Beta Edition This book continues the story initiated in Building the Second Mind: 1956 and the Origins of Artificial Intelligence Computing. Building the Second Mind, 1961-1980: From the Establishment of ARPA to the Advent of Commercial Expert Systems continues this story, through to the fortunate phase of the second decade of AI computing.
    [Show full text]