Stanford Computer Forum Ea

Total Page:16

File Type:pdf, Size:1020Kb

Stanford Computer Forum Ea STANFORD COMPUTER FORUM ERL 234 STANFORD UNIVERSITY STANFORD, CALIFORNIA 94305 16 January 1980 To Computer Systems/Computer Science Faculty and Invited Guests EECEiiWIB) From: Bill Miller, Director and Conference Chairman 18 Sally Burns, Assistant Director E.A. FEIGENBAUM Subj: COMPUTER FORUM ANNUAL MEETING It is our pleasure to invite you to the 12th Annual Meeting of the Stanford Computer Forum being held Thursday and Friday, 7 and 8 February 1980. We encourage your participation at the Technical Sessions, the luncheons, the banquet and the Friday afternoon reception. All meals are without charge and for invitees only (sorry, no spouses). A copy of the Program is attached. Please consult it for location of social events as well as for citation of topics which might be of interest to you in our Technical Sessions. During the two days of our Meeting, we are provided with an excel- lent opportunity to get to know some of our colleagues in industry. To a large degree, they are coming to this Meeting to get acquainted with you. We would appreciate your attendance at as many functions (both social and scientific) as possible. A list of attendees from our affiliate companies is enclosed. A meal reply form is also enclosed. PLEASE COME TO THE MEALS and PLEASE COME TO THE MEALS YOU SAID YOU WOULD COME TO. Sally will accept either hard-copy replies or on-line responses (CSL. SALLY via SCORE) to your meal plans. Please return your meal reply forms by 1 February 1980. We need your enthusiastic involvement. We look forward to a most successful and interesting Twelfth Annual Meeting. xc (with ends.): R. W. Dutton, J. F. Gibbons, W. M. Kays, D. Kennedy, G. J. Lieberman, J. G. Linvill, R. W. Lyman, R. M. Rosenzweig, J. N. Rosse, H. L. Royden, R. L. Street ( STANFORD COMPUTER FORUM ERL234 STANFORD UNIVERSITY STANFORD, CALIFORNIA 94305 TWELFTH ANNUAL MEETING 7, g February 1980 Tresidder Union Room 270-271 Opening Session: 9:00 - 9:15 a.m., Thursday, 7 February 1980 Conference Chairman: Professor William F. Miller Opening Remarks: Dr. Robert M. Rosenzweig Vice-President of Public Affai rs Stanford University Technical Session I: 9 : A - 10:35 a - m - Chairman: Professor Douglas B. Lenat The Use of Planning in Language Generation Douglas E. Appelt* Professor Terry Winograd Representing Large Knowledge Bases Russell Greiner Professor Douglas Lenat Planning Molecular Genetics Experiments: Constraint Posting Mark J. Stefik* Professor Bruce Buchanan Ventilator Manager: A Program to Provide On-Line Consultative Advice in the ICU Lawrence M. Pagan* Professor Edward Feigenbaum 10:35 a.m. Coffee Break x-denotes speaker Technical Session II: 10: a.m. - 12:15 p.m. Chairman: Professor Zohar Manna Can Verification Be Practical? A Case Study of the Verification of a Compiler Wolfgang Polak* Professor David Luckham Expression Procedures and Program Derivation William L. Scherlis Professor Zohar Manna Testing, Tracing, and Debugging Recursive Programs Martin F. Brooks Professor John McCarthy Verifying Network Protocols Using Temporal Logic Brent T. Hailpern* Professor Susan Cwicki 12:25 Luncheon Room 28l (Large Lounge) Tresidder Union Technical Session III: 1:30 - 3:10 P- m - Chairman: Professor John G. Herriot Numerical Fluid Dynamics Professor Robert S. Schreiber*- Fast Numerical Solution of the Biharmonic Equation Petter E. Bjorstad* Professor Joseph Oliger Some Numerical Problems in Control Theory Daniel L. Bo ley* Professor Gene Golub Feature Extraction from Protein Electron M. Density Maps Eric H. Gross e Professor John Herriot The Khachiyan Algorithm Richard E. Stone* Professor George Dantzig 3:15 p.m. Coffee Break "^denotes speaker Technical Session IV: 3:35 - 5:15 p.m. Chairman: Professor Gio Wiederhold The study of databases is a relatively new area, increasing in importance. By offering a close linkage between computer scientists and computer users, databases allow scientific and engineering competence to be scrutinized directly by laymen. To manage data properly requires reliable hardware, algorithms, programming languages, and operating systems, offering many exciting research areas to explore. Overview: Database Problems and Academic Research Professor Gio Wiederhold* Lossless Joins Professor Jeffrey D. Ullman.* Cooperative Responses to Queries Dr. S. Jerrold Kaplan* Use of Domain Knowledge for Efficient Retrieval Jonathan J. King Professor Gio Wiederhold A Relational Database Machine Architecture David Shaw* Professor Terry Winograd Evening Activities 6:00 p.m. Cocktail Party Gold Lounge Stanford Faculty Club 7:00 p.m. Dinner Main Dining Room Stanford Faculty Club Toastmaster: Professor William Miller Director Stanford Computer Forum Speaker: Professor James F. Gibbons* Electrical Engineering Dept Stanford University "Tutored Videotape Instruction for Off-Campus Education in Science and Engineering" ■^denotes speaker denotes highlight session Technical Session V: 9:00 - 10:20 a.m., Friday, 8 February Chairman: Professor Robert Tarjan A Language for Typesetting Graphics Christopher J. Van Wyk* Professor Donald Knuth Optimum Coalesced Hashing Jeffrey S. Vitter* Professor Donald Knuth Some Aspects of Complexity Theory Professor Andrew C. Yao Fill-in Bounds for Generalized Nested Dissection John R. Gilbert* Professor Robert Tarjan 10:20 a.m. Coffee Break Technical Session VI: 10:^0 a.m. - noon Chairman: Professor John L. Hennessy A Statistical Study of Reliability and System Load at SLAC Steven E. Butner Professor Edward McCluskey Message-Based Priority Functions in -x Multi-access Broadcast Systems Noel Gonzalez-Cawley Professor Fouad Tobagi A Language-Oriented Approach to Computer Architecture Clark R. Wilcox* Professor Michael Flynn Multi-Channel Digital Spectrum Analyzer Hardware Design Kok Chen, Kottappuram Mohiuddin* and Shankar Narayan Professor Allen Peterson 12:10 p.m. Luncheon Room 28l (Large Lounge) Tresidder Union -^denotes speaker \j Technical Session VII: 1:10 - 2:50 p.m. Chairman: Professor James H. Clark Presentations of this session represent three types of Design Aid activity at Stanford. System Simulation is the theme of the first three speakers: each effort described is complemented and driven by actual Systems Design research, an important part of any Design Aid endeavor. The fourth speaker presents a specific VLSI Graphics Subsystem of potential use in all design systems. The third type of DA activity is represented by the last speaker who discusses circuit modelling and measurement work that is critical for accurate VLSI timing simulations. Verification of Timing Constraints in ■x- Large Digital Systems Thomas M. McWilliams Professor Forest Baskett Language and for Environment Multi- -x- level Simulation Dwight D. Hill Professor Willem vanCleemput -X- A Microcode Simulator/PLA Compiler Professor John Hennessy A VLSI Subsystem for Computer Graphics Professor James Clark' VLSI Circuit Parameters Computed from Process Variables Professor Robert Dutton* Tours: 3:00 - U:3O p.m. Computer Forum guests are invited to participate in either or both of the tours planned for this time period. One will be a visit to the new Computer Science Department quarters in Margaret Jacks Hall (Bldg. U6O) on the quadrangle. One walk-through will be conducted from 3:15 to 3A5 and the second, identical tour will take place from A OO to k'.^O. The tour will range from viewing the computing equipment located in the basement (the DEC-System 20 SCORE computer, the DEC XL/10—formerly housed at the A.I. Lab, and some new graphics printers) to the Xerox Altos and VAX computers housed on the fourth floor with brief stops in-between to see the improved offices on the second and third floors. Marvin Theimer, the CS student representative to the Computer Forum Committee, will discuss logistics for participating in the Jacks tour at the luncheon on Friday. denotes speaker \*4. denotes highlight session Tours (continued) Our second tour will be to the Integrated Circuits Laboratory. Guests are asked to assemble in front of the main door to the Electrical Engineering Department (McCullough Building) . There will be two starting times for these tours: 3:00 and 3A5. The tour will cover the IC fabrication facility (lithography, implantation, CVD, ...IC appli- cation projects) plus demonstration of computer aids for IC technology. Cary Kornfield, the CSL representative to the Computer Forum Committee, will elaborate upon arrangements to participate in this tour at the luncheon on Friday. Individual Conferences Forum attendees may choose to see individual faculty members or students in lieu of taking either tour mentioned above. These personal discussions are certainly encouraged and can be arranged directly with the person involved (see the Directory on the following page). Reception: k: 30 - 6:00 p.m. To become better acquainted with the faculty, staff and all students of the Computer Science Department and the Computer Systems Laboratory, an informal wine and hors d'oeuvres reception will be held in the Gold and Red Lounges of the Faculty Club as the "closing session" of our Annual Meeting. Stanford Computer Forum Committee Dennis P. Brown, Associate Chairman, Computer Science Department Sally Burns, Assistant Director, Stanford Computer Forum Michael J. Flynn, Professor of Electrical Engineering Cary Kornfield, Ph.D. candidate, Department of Electrical Engineering Douglas B. Lenat, Assistant Professor of Computer Science William F. Miller, Director, Stanford Computer Forum; Professor of Computer Science Marvin Theimer, Ph.D. candidate, Computer Science Department.
Recommended publications
  • Prominence of Expert System and Case Study- DENDRAL Namita Mirjankar, Shruti Ghatnatti Karnataka, India [email protected],[email protected]
    International Journal of Advanced Networking & Applications (IJANA) ISSN: 0975-0282 Prominence of Expert System and Case Study- DENDRAL Namita Mirjankar, Shruti Ghatnatti Karnataka, India [email protected],[email protected] Abstract—Among many applications of Artificial Intelligence, Expert System is the one that exploits human knowledge to solve problems which ordinarily would require human insight. Expert systems are designed to carry the insight and knowledge found in the experts in a particular field and take decisions based on the accumulated knowledge of the knowledge base along with an arrangement of standards and principles of inference engine, and at the same time, justify those decisions with the help of explanation facility. Inference engine is continuously updated as new conclusions are drawn from each new certainty in the knowledge base which triggers extra guidelines, heuristics and rules in the inference engine. This paper explains the basic architecture of Expert System , its first ever success DENDRAL which became a stepping stone in the Artificial Intelligence field, as well as the difficulties faced by the Expert Systems Keywords—Artificial Intelligence; Expert System architecture; knowledge base; inference engine; DENDRAL I INTRODUCTION the main components that remain same are: User Interface, Knowledge Base and Inference Engine. For more than two thousand years, rationalists all over the world have been striving to comprehend and resolve two unavoidable issues of the universe: how does a human mind work, and can non-people have minds? In any case, these inquiries are still unanswered. As humans, we all are blessed with the ability to learn and comprehend, to think about different issues and to decide; but can we design machines to do all these things? Some philosophers are open to the idea that machines will perform all the tasks a human can do.
    [Show full text]
  • Awards and Distinguished Papers
    Awards and Distinguished Papers IJCAI-15 Award for Research Excellence search agenda in their area and will have a first-rate profile of influential re- search results. e Research Excellence award is given to a scientist who has carried out a e award is named for John McCarthy (1927-2011), who is widely rec- program of research of consistently high quality throughout an entire career ognized as one of the founders of the field of artificial intelligence. As well as yielding several substantial results. Past recipients of this honor are the most giving the discipline its name, McCarthy made fundamental contributions illustrious group of scientists from the field of artificial intelligence: John of lasting importance to computer science in general and artificial intelli- McCarthy (1985), Allen Newell (1989), Marvin Minsky (1991), Raymond gence in particular, including time-sharing operating systems, the LISP pro- Reiter (1993), Herbert Simon (1995), Aravind Joshi (1997), Judea Pearl (1999), Donald Michie (2001), Nils Nilsson (2003), Geoffrey E. Hinton gramming languages, knowledge representation, commonsense reasoning, (2005), Alan Bundy (2007), Victor Lesser (2009), Robert Anthony Kowalski and the logicist paradigm in artificial intelligence. e award was estab- (2011), and Hector Levesque (2013). lished with the full support and encouragement of the McCarthy family. e winner of the 2015 Award for Research Excellence is Barbara Grosz, e winner of the 2015 inaugural John McCarthy Award is Bart Selman, Higgins Professor of Natural Sciences at the School of Engineering and Nat- professor at the Department of Computer Science, Cornell University. Pro- ural Sciences, Harvard University. Professor Grosz is recognized for her pio- fessor Selman is recognized for expanding our understanding of problem neering research in natural language processing and in theories and applica- complexity and developing new algorithms for efficient inference.
    [Show full text]
  • “History of Artificial Intelligence (AI)”
    The Privacy Foundation “History Of Artificial Intelligence (AI)” 1308 Catalan poet and theologian Ramon Llull publishes Ars generalis ultima (The Ultimate General Art), further perfecting his method of using paper-based mechanical means to create new knowledge from combinations of concepts. 1666 Mathematician and philosopher Gottfried Leibniz publishes Dissertatio de arte combinatoria (On the Combinatorial Art), following Ramon Llull in proposing an alphabet of human thought and arguing that all ideas are nothing but combinations of a relatively small number of simple concepts. 1763 Thomas Bayes develops a framework for reasoning about the probability of events. Bayesian inference will become a leading approach in machine learning. 1898 At an electrical exhibition in the recently completed Madison Square Garden, Nikola Tesla makes a demonstration of the world’s first radio-controlled vessel. The boat was equipped with, as Tesla described, “a borrowed mind.” 1914 The Spanish engineer Leonardo Torres y Quevedo demonstrates the first chess-playing machine, capable of king and rook against king endgames without any human intervention. 1921 Czech writer Karel Čapek introduces the word "robot" in his play R.U.R. (Rossum's Universal Robots). The word "robot" comes from the word "robota" (work). 1925 Houdina Radio Control releases a radio-controlled driverless car, travelling the streets of New York City. 1927 The science-fiction film Metropolis is released. It features a robot double of a peasant girl, Maria, which unleashes chaos in Berlin of 2026—it was the first robot depicted on film, inspiring the Art Deco look of C-3PO in Star Wars. 1929 Makoto Nishimura designs Gakutensoku, Japanese for "learning from the laws of nature," the first robot built in Japan.
    [Show full text]
  • Seinfeld's Recent Comments on Zoom…. Energy
    Stanford Data Science Departmental 2/4/2021 Seminar Biomedical AI: Its Roots, Evolution, and Early Days at Stanford Edward H. Shortliffe, MD, PhD Chair Emeritus and Adjunct Professor Department of Biomedical Informatics Columbia University Department of Biomedical Data Science Seminar Stanford Medicine Stanford, California 2:30pm – 4:50pm – February 4, 2021 Seinfeld’s recent comments on Zoom…. Energy, attitude and personality cannot be “remoted” through even the best fiber optic lines Jerry Seinfeld: So You Think New York Is ‘Dead’ (It’s not.) Aug. 24, 2020 © E.H. Shortliffe 1 Stanford Data Science Departmental 2/4/2021 Seminar Disclosures • No conflicts of interest with content of presentation • Offering a historical perspective on medical AI, with an emphasis on US activities in the early days and specific work I know personally • My research career was intense until I became a medical school dean in 2007 • Current research involvement is largely as a textbook author and two decades as editor-in-chief of a peer- reviewed journal (Journal of Biomedical Informatics [Elsevier]) Goals for Today’s Presentation • Show that today’s state of the art in medical AI is part of a 50-year scientific trajectory that is still evolving • Provide some advice to today’s biomedical AI researchers, drawing on that experience • Summarize where we are today in the evolution, with suggestions for future emphasis More details on slides than I can include in talk itself – Full deck available after the talk © E.H. Shortliffe 2 Stanford Data Science Departmental
    [Show full text]
  • UC Berkeley Previously Published Works
    UC Berkeley UC Berkeley Previously Published Works Title Building the Second Mind, 1961-1980: From the Ascendancy of ARPA-IPTO to the Advent of Commercial Expert Systems Permalink https://escholarship.org/uc/item/7ck3q4f0 ISBN 978-0-989453-4-6 Author Skinner, Rebecca Elizabeth Publication Date 2013-12-31 eScholarship.org Powered by the California Digital Library University of California 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.
    [Show full text]
  • The Profile of Edward Feigenbaum Begins of Leadership That He Has
    v#' ■/ '■J1 A PROFILE OF EDWARD A. FEIGENBAUM, OFFERED IN CONNECTION WITH THE MCI COMMUNICATIONS INFORMATION TECHNOLOGY LEADERSHIP AWARD FOR INNOVATION The profile of Edward Feigenbaum begins with his Curriculum Vitae, which is attached. Those facts indicate the dimensions of leadership that he has offered to innovation in information technology and the applications of computers. Briefly summarized, the dimensions of his leadership are: a. scientific and technological: pioneering in applied artificial intelligence, an information technology that has created important new applications of computers and that offers promise of major future gains in productivity and quality of work in the new economy of "knowledge workers/ the so-called post-industrial knowledge-based society. b. literary: i.e. "entrepreneuring" with the word, writing books to disseminate an understanding of the new developments to both lay and professional audiences. This also includes appearances on television and radio broadcasts, public lectures, and the making of an award-winning film. c. corporate: i.e. entrepreneuring in the usual sense of establishing companies to transfer the fruits of university basic research to industry and business. This also includes service on boards of large corporations. d. professional: serving his university, the national government, and his science in a variety of leadership positions. This also includes his role in helping to found the American Association for Artificial Intelligence and serving as its second president. HONORS For his scientific innovation and leadership, Feigenbaum has been accorded many honors. Among the most prominent are his election to the National Academy of Engineering and to the American Academy of Arts and Sciences; his honorary degree from Aston University in England; his election to fellow status in the American Association for the Advancement of Science and the Society of Medical Informatics; and his Lee Kuan Yew Professorship, as well as his election to the Productivity Hall of Fame, in the Republic of Singapore.
    [Show full text]
  • 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.
    [Show full text]
  • Oral History of Edward Feigenbaum
    Oral History of Edward Feigenbaum Interviewed by: Don Knuth Recorded: April 4, and May 2, 2007 Mountain View, California CHM Reference number: X3897.2007 © 2007 Computer History Museum Oral History of Edward Feigenbaum (Knuth) Don Knuth: Hello, everyone. My name is Don Knuth. Today [April 4, 2007] I have the great privilege of interviewing Ed Feigenbaum for oral history where we hope to reach people generations from now and also people of today. I’m going to try to ask a zillion questions about things that I wish I could have asked people who unfortunately are dead now so that students and general scientific people, people with general interest in the world, historians and so on in the future will have some idea as to what Ed was really like even though none of us are going to be around forever. Now this is the second part of a two- phase study. Ed grilled me a couple weeks ago and now it’s my turn to do him. I hope I can do half as well as he did for me. I’d like to get right into it But first of all sort of for organization, my plan -- who knows if it’ll carry it out -- is to do a little bit first that’s chronological, in order to set the scenes for his whole life. Then most of my questions are probably going to be cross-cutting that go through the years. But first of all, Ed, do you have some remarks you would like to start with? Or shall I get right into the— Edward Feigenbaum: No, Don.
    [Show full text]
  • The History of Expert Systems
    Articles Learning from Artificial Intelligence’s Previous Awakenings: The History of Expert Systems David C. Brock n Much of the contemporary moment’s f it is indeed true that we cannot fully understand our enthusiasms for and commercial inter- present without knowledge of our past, there is perhaps ests in artificial intelligence, specificial- Ino better time than the present to attend to the history of ly machine learning, are prefigured in artificial intelligence. Late 2017 saw Sundar Pichai, the CEO the experience of the artificial intelli- of Google, Inc., opine that “AI is one of the most important gence community concerned with expert systems in the 1970s and 1980s. This things that humanity is working on. It’s more profound than, essay is based on an invited panel on I don’t know, electricity or fire” (Schleifer 2018). Pichai’s the history of expert systems at the notable enthusiasm for, and optimism about, the power of AAAI-17 conference, featuring Ed multilayer neural networks coupled to large data stores is Feigenbaum, Bruce Buchanan, Randall widely shared in technical communities and well beyond. Davis, and Eric Horvitz. It argues that Indeed, the general zeal for such artificial intelligence sys- artifical intelligence communities today tems of the past decade across the academy, business, gov- have much to learn from the way that ernment, and the popular imagination was reflected in a earlier communities grappled with the New York Times Magazine , issues of intelligibility and instrumen- recent article “The Great AI Awak- tality in the study of intelligence. ening” (Lewis-Kraus 2016). Imaginings of our near-future promoted by the World Economic Forum under the banner of a Fourth Industrial Revolution place this “machine learn- ing” at the center of profound changes in economic activity and social life, indeed in the very meaning of what it means to be human (Schwab 2016).
    [Show full text]
  • Interview with Edward Feigenbaum
    An Interview with EDWARD FEIGENBAUM OH 157 Conducted by William Aspray on 3 March 1989 Palo Alto, CA Charles Babbage Institute Center for the History of Information Processing University of Minnesota, Minneapolis Copyright, Charles Babbage Institute 1 Edward Feigenbaum Interview 3 March 1989 Abstract Feigenbaum begins the interview with a description of his initial recruitment by ARPA in 1964 to work on a time- sharing system at Berkeley and his subsequent move to Stanford in 1965 to continue to do ARPA-sponsored research in artificial intelligence. The bulk of the interview is concerned with his work on AI at Stanford from 1965 to the early 1970s and his impression of the general working relationship between the IPT Office at ARPA and the researchers at Stanford. He discusses how this relationship changed over time under the various IPT directorships and the resulting impact it had on their AI research. The interview also includes a general comparison of ARPA with other funding sources available to AI researchers, particularly in terms of their respective funding amounts, criteria for allocation, and management style. This interview was recorded as part of a research project on the influence of the Defense Advanced Research Projects Agency (DARPA) on the development of computer science in the United States. 2 EDWARD FEIGENBAUM INTERVIEW DATE: 3 March 1989 INTERVIEWER: William Aspray LOCATION: Palo Alto, CA ASPRAY: I'd like your comments about how you first became involved in getting DARPA support (ARPA at that time), and what your interactions were with the program officers at the time. FEIGENBAUM: The first thing to say is that for me the period of coverage that you're interested in starts at 1965, so you're talking about 1965 through the early 1970s.
    [Show full text]
  • Alan Mathison Turing and the Turing Award Winners
    Alan Turing and the Turing Award Winners A Short Journey Through the History of Computer TítuloScience do capítulo Luis Lamb, 22 June 2012 Slides by Luis C. Lamb Alan Mathison Turing A.M. Turing, 1951 Turing by Stephen Kettle, 2007 by Slides by Luis C. Lamb Assumptions • I assume knowlege of Computing as a Science. • I shall not talk about computing before Turing: Leibniz, Babbage, Boole, Gödel... • I shall not detail theorems or algorithms. • I shall apologize for omissions at the end of this presentation. • Comprehensive information about Turing can be found at http://www.mathcomp.leeds.ac.uk/turing2012/ • The full version of this talk is available upon request. Slides by Luis C. Lamb Alan Mathison Turing § Born 23 June 1912: 2 Warrington Crescent, Maida Vale, London W9 Google maps Slides by Luis C. Lamb Alan Mathison Turing: short biography • 1922: Attends Hazlehurst Preparatory School • ’26: Sherborne School Dorset • ’31: King’s College Cambridge, Maths (graduates in ‘34). • ’35: Elected to Fellowship of King’s College Cambridge • ’36: Publishes “On Computable Numbers, with an Application to the Entscheindungsproblem”, Journal of the London Math. Soc. • ’38: PhD Princeton (viva on 21 June) : “Systems of Logic Based on Ordinals”, supervised by Alonzo Church. • Letter to Philipp Hall: “I hope Hitler will not have invaded England before I come back.” • ’39 Joins Bletchley Park: designs the “Bombe”. • ’40: First Bombes are fully operational • ’41: Breaks the German Naval Enigma. • ’42-44: Several contibutions to war effort on codebreaking; secure speech devices; computing. • ’45: Automatic Computing Engine (ACE) Computer. Slides by Luis C.
    [Show full text]
  • Computer Science Department Research Report
    STANFORD COMPUTER SCIENCE DEPARTMENT RESEARCH REPORT by R. Davis and M. Wright (revised January 1976 by CSD staff) STAN-CS-76-405 JANUARY 1976 COMPUTER SCIENCE DEPARTMENT School of Humanities and Sciences STANFORD UNIVERSITY . '"ITT « "/ STANgORD .SCIENCE DEPARTMENT RESEARCH REPORT January 1976 TABLE OF CONTENTS Preface 1 Section 1 Forest Baskett, 111 1 Thomas Binford ? Bruce Buchanan - Vinton Cerf , Vaclav Chvatal _ George Dantzig - Lester Earnest Feigenbaum - Edward 8 Robert Floyd John Gill, 111 _ Gene Golub ? Cordell Green 13 John _ Herriot 1 Donald Knuth ZZ Joshua Lederberg _ _ David Luckham 18 John McCarthy 2n Edward McCluskey 21 Joseph Oliger _„ Robert Tarjan _? Terry Winograd „^ Section 2 Combinatorics and Analysis of Algorithms Digital Systems 26 Laboratory 30 Heuristic Programming Project 32 Numerical Analysis Group 35 Artificial Intelligence Laboratory 37 PREFACE This collection of reports is divided into two sections. The first contains the research summaries for individual faculty members and research associates in the Computer Science Department. Two professors from Electrical Engineering are included as "Affiliated Faculty" because their interests are closely related to those of the Department. The second section gives an overview of the activities of research groups in the Department. "Group" here is taken to imply many different things, including people related by various degrees of intellectual interests, physical proximity, or funding considerations. We have tried to describe any group whose scope of interest is greater than that of one person. The list of recent pub- lications for each is not intended to be comprehensive, but rather to give a feeling for the range of topics considered.
    [Show full text]