The Elusive Quest for Intelligence in Artificial Intelligence
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Artificial Intelligence? 1 V2.0 © J
TU Darmstadt, WS 2012/13 Einführung in die Künstliche Intelligenz Einführung in die Künstliche Intelligenz Dozenten Prof. Johannes Fürnkranz (Knowledge Engineering) Prof. Ulf Brefeld (Knowledge Mining and Assessment) Homepage http://www.ke.informatik.tu-darmstadt.de/lehre/ki/ Termine: Dienstag 11:40-13:20 S202/C205 Donnerstag 11:40-13:20 S202/C205 3 VO + 1 UE Vorlesungen und Übungen werden in Doppelstunden abgehalten Übungen Terminplan wird auf der Web-Seite aktualisiert Ü voraussichtlich: 30.10., 13.11., 27.11., 11.12., 15.1., 29.1. Tafelübungen What is Artificial Intelligence? 1 V2.0 © J. Fürnkranz TU Darmstadt, WS 2012/13 Einführung in die Künstliche Intelligenz Text Book The course will mostly follow Stuart Russell und Peter Norvig: Artificial Intelligence: A Modern Approach. Prentice Hall, 2nd edition, 2003. Deutsche Ausgabe: Stuart Russell und Peter Norvig: Künstliche Intelligenz: Ein Moderner Ansatz. Pearson- Studium, 2004. ISBN: 978-3-8273-7089-1. 3. Auflage 2012 Home-page for the book: http://aima.cs.berkeley.edu/ Course slides in English (lecture is in German) will be availabe from Home-page What is Artificial Intelligence? 2 V2.0 © J. Fürnkranz TU Darmstadt, WS 2012/13 Einführung in die Künstliche Intelligenz What is Artificial Intelligence Different definitions due to different criteria Two dimensions: Thought processes/reasoning vs. behavior/action Success according to human standards vs. success according to an ideal concept of intelligence: rationality. Systems that think like humans Systems that think rationally Systems that act like humans Systems that act rationally What is Artificial Intelligence? 3 V2.0 © J. Fürnkranz TU Darmstadt, WS 2012/13 Einführung in die Künstliche Intelligenz Definitions of Artificial Intelligence What is Artificial Intelligence? 4 V2.0 © J. -
The Machine That Builds Itself: How the Strengths of Lisp Family
Khomtchouk et al. OPINION NOTE The Machine that Builds Itself: How the Strengths of Lisp Family Languages Facilitate Building Complex and Flexible Bioinformatic Models Bohdan B. Khomtchouk1*, Edmund Weitz2 and Claes Wahlestedt1 *Correspondence: [email protected] Abstract 1Center for Therapeutic Innovation and Department of We address the need for expanding the presence of the Lisp family of Psychiatry and Behavioral programming languages in bioinformatics and computational biology research. Sciences, University of Miami Languages of this family, like Common Lisp, Scheme, or Clojure, facilitate the Miller School of Medicine, 1120 NW 14th ST, Miami, FL, USA creation of powerful and flexible software models that are required for complex 33136 and rapidly evolving domains like biology. We will point out several important key Full list of author information is features that distinguish languages of the Lisp family from other programming available at the end of the article languages and we will explain how these features can aid researchers in becoming more productive and creating better code. We will also show how these features make these languages ideal tools for artificial intelligence and machine learning applications. We will specifically stress the advantages of domain-specific languages (DSL): languages which are specialized to a particular area and thus not only facilitate easier research problem formulation, but also aid in the establishment of standards and best programming practices as applied to the specific research field at hand. DSLs are particularly easy to build in Common Lisp, the most comprehensive Lisp dialect, which is commonly referred to as the “programmable programming language.” We are convinced that Lisp grants programmers unprecedented power to build increasingly sophisticated artificial intelligence systems that may ultimately transform machine learning and AI research in bioinformatics and computational biology. -
Backpropagation with Callbacks
Backpropagation with Continuation Callbacks: Foundations for Efficient and Expressive Differentiable Programming Fei Wang James Decker Purdue University Purdue University West Lafayette, IN 47906 West Lafayette, IN 47906 [email protected] [email protected] Xilun Wu Grégory Essertel Tiark Rompf Purdue University Purdue University Purdue University West Lafayette, IN 47906 West Lafayette, IN, 47906 West Lafayette, IN, 47906 [email protected] [email protected] [email protected] Abstract Training of deep learning models depends on gradient descent and end-to-end differentiation. Under the slogan of differentiable programming, there is an increas- ing demand for efficient automatic gradient computation for emerging network architectures that incorporate dynamic control flow, especially in NLP. In this paper we propose an implementation of backpropagation using functions with callbacks, where the forward pass is executed as a sequence of function calls, and the backward pass as a corresponding sequence of function returns. A key realization is that this technique of chaining callbacks is well known in the programming languages community as continuation-passing style (CPS). Any program can be converted to this form using standard techniques, and hence, any program can be mechanically converted to compute gradients. Our approach achieves the same flexibility as other reverse-mode automatic differ- entiation (AD) techniques, but it can be implemented without any auxiliary data structures besides the function call stack, and it can easily be combined with graph construction and native code generation techniques through forms of multi-stage programming, leading to a highly efficient implementation that combines the per- formance benefits of define-then-run software frameworks such as TensorFlow with the expressiveness of define-by-run frameworks such as PyTorch. -
Oral History Interview with Severo Ornstein and Laura Gould
An Interview with SEVERO ORNSTEIN AND LAURA GOULD OH 258 Conducted by Bruce H. Bruemmer on 17 November 1994 Woodside, CA Charles Babbage Institute Center for the History of Information Processing University of Minnesota, Minneapolis Severo Ornstein and Laura Gould Interview 17 November 1994 Abstract Ornstein and Gould discuss the creation and expansion of Computer Professionals for Social Responsibility (CPSR). Ornstein recalls beginning a listserve at Xerox PARC for those concerned with the threat of nuclear war. Ornstein and Gould describe the movement of listserve participants from e-mail discussions to meetings and forming a group concerned with computer use in military systems. The bulk of the interview traces CPSR's organizational growth, fundraising, and activities educating the public about computer-dependent weapons systems such as proposed in the Strategic Defense Initiative (SDI). SEVERO ORNSTEIN AND LAURA GOULD INTERVIEW DATE: November 17, 1994 INTERVIEWER: Bruce H. Bruemmer LOCATION: Woodside, CA BRUEMMER: As I was going through your oral history interview I began to wonder about your political background and political background of the people who had started the organization. Can you characterize that? You had mentioned in your interview that you had done some antiwar demonstrations and that type of thing which is all very interesting given also your connection with DARPA. ORNSTEIN: Yes, most of the people at DARPA knew this. DARPA was not actually making bombs, you understand, and I think in the interview I talked about my feelings about DARPA at the time. I was strongly against the Vietnam War and never hid it from anyone. I wore my "Resist" button right into the Pentagon and if they didn't like it they could throw me out. -
Backmatter In
Appendices Bibliography This book is a little like the previews of coming attractions at the movies; it's meant to whet your appetite in several directions, without giving you the complete story about anything. To ®nd out more, you'll have to consult more specialized books on each topic. There are a lot of books on computer programming and computer science, and whichever I chose to list here would be out of date by the time you read this. Instead of trying to give current references in every area, in this edition I'm listing only the few most important and timeless books, plus an indication of the sources I used for each chapter. Computer science is a fast-changing ®eld; if you want to know what the current hot issues are, you have to read the journals. The way to start is to join the Association for Computing Machinery, 1515 Broadway, New York, NY 10036. If you are a full-time student you are eligible for a special rate for dues, which as I write this is $25 per year. (But you should write for a membership application with the current rates.) The Association publishes about 20 monthly or quarterly periodicals, plus the newsletters of about 40 Special Interest Groups in particular ®elds. 341 Read These! If you read no other books about computer science, you must read these two. One is an introductory text for college computer science students; the other is intended for a nonspecialist audience. Abelson, Harold, and Gerald Jay Sussman with Julie Sussman, Structure and Interpretation of Computer Programs, MIT Press, Second Edition, 1996. -
Stuart Russell and Peter Norvig, Artijcial Intelligence: a Modem Approach *
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Artificial Intelligence ELSEVIER Artificial Intelligence 82 ( 1996) 369-380 Book Review Stuart Russell and Peter Norvig, Artijcial Intelligence: A Modem Approach * Nils J. Nilsson Robotics Laboratory, Department of Computer Science, Stanford University, Stanford, CA 94305, USA 1. Introductory remarks I am obliged to begin this review by confessing a conflict of interest: I am a founding director and a stockholder of a publishing company that competes with the publisher of this book, and I am in the process of writing another textbook on AI. What if Russell and Norvig’s book turns out to be outstanding? Well, it did! Its descriptions are extremely clear and readable; its organization is excellent; its examples are motivating; and its coverage is scholarly and thorough! End of review? No; we will go on for some pages-although not for as many as did Russell and Norvig. In their Preface (p. vii), the authors mention five distinguishing features of their book: Unified presentation of the field, Intelligent agent design, Comprehensive and up-to-date coverage, Equal emphasis on theory and practice, and Understanding through implementation. These features do indeed distinguish the book. I begin by making a few brief, summary comments using the authors’ own criteria as a guide. l Unified presentation of the field and Intelligent agent design. I have previously observed that just as Los Angeles has been called “twelve suburbs in search of a city”, AI might be called “twelve topics in search of a subject”. -
The Evolution of Lisp
1 The Evolution of Lisp Guy L. Steele Jr. Richard P. Gabriel Thinking Machines Corporation Lucid, Inc. 245 First Street 707 Laurel Street Cambridge, Massachusetts 02142 Menlo Park, California 94025 Phone: (617) 234-2860 Phone: (415) 329-8400 FAX: (617) 243-4444 FAX: (415) 329-8480 E-mail: [email protected] E-mail: [email protected] Abstract Lisp is the world’s greatest programming language—or so its proponents think. The structure of Lisp makes it easy to extend the language or even to implement entirely new dialects without starting from scratch. Overall, the evolution of Lisp has been guided more by institutional rivalry, one-upsmanship, and the glee born of technical cleverness that is characteristic of the “hacker culture” than by sober assessments of technical requirements. Nevertheless this process has eventually produced both an industrial- strength programming language, messy but powerful, and a technically pure dialect, small but powerful, that is suitable for use by programming-language theoreticians. We pick up where McCarthy’s paper in the first HOPL conference left off. We trace the development chronologically from the era of the PDP-6, through the heyday of Interlisp and MacLisp, past the ascension and decline of special purpose Lisp machines, to the present era of standardization activities. We then examine the technical evolution of a few representative language features, including both some notable successes and some notable failures, that illuminate design issues that distinguish Lisp from other programming languages. We also discuss the use of Lisp as a laboratory for designing other programming languages. We conclude with some reflections on the forces that have driven the evolution of Lisp. -
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. -
A Framework for Representing Knowledge Marvin Minsky MIT-AI Laboratory Memo 306, June, 1974. Reprinted in the Psychology of Comp
A Framework for Representing Knowledge Marvin Minsky MIT-AI Laboratory Memo 306, June, 1974. Reprinted in The Psychology of Computer Vision, P. Winston (Ed.), McGraw-Hill, 1975. Shorter versions in J. Haugeland, Ed., Mind Design, MIT Press, 1981, and in Cognitive Science, Collins, Allan and Edward E. Smith (eds.) Morgan-Kaufmann, 1992 ISBN 55860-013-2] FRAMES It seems to me that the ingredients of most theories both in Artificial Intelligence and in Psychology have been on the whole too minute, local, and unstructured to account–either practically or phenomenologically–for the effectiveness of common-sense thought. The "chunks" of reasoning, language, memory, and "perception" ought to be larger and more structured; their factual and procedural contents must be more intimately connected in order to explain the apparent power and speed of mental activities. Similar feelings seem to be emerging in several centers working on theories of intelligence. They take one form in the proposal of Papert and myself (1972) to sub-structure knowledge into "micro-worlds"; another form in the "Problem-spaces" of Newell and Simon (1972); and yet another in new, large structures that theorists like Schank (1974), Abelson (1974), and Norman (1972) assign to linguistic objects. I see all these as moving away from the traditional attempts both by behavioristic psychologists and by logic-oriented students of Artificial Intelligence in trying to represent knowledge as collections of separate, simple fragments. I try here to bring together several of these issues by pretending to have a unified, coherent theory. The paper raises more questions than it answers, and I have tried to note the theory's deficiencies. -
Artificial Intelligence: a Modern Approach (3Rd Edition)
[PDF] Artificial Intelligence: A Modern Approach (3rd Edition) Stuart Russell, Peter Norvig - pdf download free book Free Download Artificial Intelligence: A Modern Approach (3rd Edition) Ebooks Stuart Russell, Peter Norvig, PDF Artificial Intelligence: A Modern Approach (3rd Edition) Popular Download, Artificial Intelligence: A Modern Approach (3rd Edition) Full Collection, Read Best Book Online Artificial Intelligence: A Modern Approach (3rd Edition), Free Download Artificial Intelligence: A Modern Approach (3rd Edition) Full Popular Stuart Russell, Peter Norvig, I Was So Mad Artificial Intelligence: A Modern Approach (3rd Edition) Stuart Russell, Peter Norvig Ebook Download, PDF Artificial Intelligence: A Modern Approach (3rd Edition) Full Collection, full book Artificial Intelligence: A Modern Approach (3rd Edition), online pdf Artificial Intelligence: A Modern Approach (3rd Edition), Download Free Artificial Intelligence: A Modern Approach (3rd Edition) Book, pdf Stuart Russell, Peter Norvig Artificial Intelligence: A Modern Approach (3rd Edition), the book Artificial Intelligence: A Modern Approach (3rd Edition), Download Artificial Intelligence: A Modern Approach (3rd Edition) E-Books, Read Artificial Intelligence: A Modern Approach (3rd Edition) Book Free, Artificial Intelligence: A Modern Approach (3rd Edition) PDF read online, Artificial Intelligence: A Modern Approach (3rd Edition) Ebooks, Artificial Intelligence: A Modern Approach (3rd Edition) Popular Download, Artificial Intelligence: A Modern Approach (3rd Edition) Free Download, Artificial Intelligence: A Modern Approach (3rd Edition) Books Online, Free Download Artificial Intelligence: A Modern Approach (3rd Edition) Books [E-BOOK] Artificial Intelligence: A Modern Approach (3rd Edition) Full eBook, CLICK HERE FOR DOWNLOAD The dorian pencil novels at the end of each chapter featured charts. makes us the meaning of how our trip and unk goes into trouble with others like land. -
Artificial Intelligence
Outline: Introduction to AI Artificial Intelligence N-ways Introduction Introduction to AI - Personal Information and - What is Intelligence? Introduction Background - An Intelligent Entity - The Age of Intelligent Machines Course Outline: - Definitions of AI - Requirements and Expectation - Behaviourist’s View on Intelligent - Module Assessment Machines - Recommended Books - Turing’s Test - Part 1 & 2 - Layout of Course (14 lessons) - History of AI Lecture 1 - Examples of AI systems - Office Hours Course Delivery Methods General Reference for the Course Goals and Objectives of module 2 Course Outline: General Reference for the Course Recommended Books Artificial Intelligence by Patrick Henry Winston AI related information. Whatis.com (Computer Science Dictionary) Logical Foundations of Artificial Intelligence by Michael R. http://whatis.com/search/whatisquery.html Genesereth, Nils J. Nislsson, Nils J. Nilsson General computer-related news sources. Technology Encyclopedia Artificial Intelligence, Luger, Stubblefield http://www.techweb.com/encyclopedia/ General Information Artificial Intelligence : A Modern Approach by Stuart J. Russell, Technology issues. Peter Norvig Computing Dictionary http://wombat.doc.ic.ac.uk/ Artificial Intelligence by Elaine Rich, Kevin Knight (good for All web links in my AI logic, knowledge representation, and search only) website. Webster Dictionary http://work.ucsd.edu:5141/cgi- bin/http_webster 3 4 Goals and Objectives of module Introduction to AI: What is Intelligence? Understand motivation, mechanisms, and potential Intelligence, taken as a whole, consists of of Artificial Intelligence techniques. the following skills:- Balance of breadth of techniques with depth of 1. the ability to reason understanding. 2. the ability to acquire and apply knowledge Conversant with the applicational scope and 3. the ability to manipulate and solution methodologies of AI. -
Mccarthy As Scientist and Engineer, with Personal Recollections
Articles McCarthy as Scientist and Engineer, with Personal Recollections Edward Feigenbaum n John McCarthy, professor emeritus of com - n the late 1950s and early 1960s, there were very few people puter science at Stanford University, died on actually doing AI research — mostly the handful of founders October 24, 2011. McCarthy, a past president (John McCarthy, Marvin Minsky, and Oliver Selfridge in of AAAI and an AAAI Fellow, helped design the I Boston, Allen Newell and Herbert Simon in Pittsburgh) plus foundation of today’s internet-based computing their students, and that included me. Everyone knew everyone and is widely credited with coining the term, artificial intelligence. This remembrance by else, and saw them at the few conference panels that were held. Edward Feigenbaum, also a past president of At one of those conferences, I met John. We renewed contact AAAI and a professor emeritus of computer sci - upon his rearrival at Stanford, and that was to have major con - ence at Stanford University, was delivered at the sequences for my professional life. I was a faculty member at the celebration of John McCarthy’s accomplish - University of California, Berkeley, teaching the first AI courses ments, held at Stanford on 25 March 2012. at that university, and John was doing the same at Stanford. As – AI Magazine Stanford moved toward a computer science department under the leadership of George Forsythe, John suggested to George, and then supported, the idea of hiring me into the founding fac - ulty of the department. Since we were both Advanced Research Project Agency (ARPA) contract awardees, we quickly formed a close bond concerning ARPA-sponsored AI research and gradu - ate student teaching.