DOCSLIB.ORG

The Lovelace Lectures Will Be Held Through December and January

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Lovelace Lectures Will Be Held Through December and January The Ada Lovelace Bicentenary Lectures on Computability Augusta Ada Lovelace, acclaimed as the world’s first computer programmer, was born on 10th of December 1815. Daughter of the poet Byron, Ada collaborated with Victorian inventor Charles Babbage, who envisioned steam-age computers built out of cogwheels. She died at the tragically young age of 36. Two centuries later, her contributions are being celebrated in the Ada Lovelace Bicentenary Lectures on Computability, kicked off by Ada’s 200th birthday party on December 10. In the series of 15 lectures, to be held during December and January, an array of international stars of modern computer science will pay homage to Lovelace. The line-up includes two winners of the coveted Turing Award — computer science’s Nobel Prize — as well as winners of the US Presidential Award, the US National Science Foundation’s Waterman Award, the Herbrand Award, IBM’s Outstanding Innovation Award, the Krill Prize for Excellence in Scientific Research, the Gödel Prize, and a swathe of other distinguished tributes. The lecture series is being hosted by the Israel Institute for Advanced Studies. “Lovelace triumphed intellectually despite the rampant sexism of her era”, say the organizers of the lecture series Jack Copeland, Diane Proudfoot, and Eli Dresner. “Babbage studied at Cambridge University but Lovelace, as a woman, could not.” The Lovelace Lectures will be held through December and January. Attendance is free of charge and the lectures are open to everyone. PROGRAM FOR DECEMBER 20 December Opening lecture. TITLE by Dorit Aharonov (Hebrew University, Jerusalem, Israel). www.cs.huji.ac.il/~doria 21 December Computability in the Footsteps of Turing ¬— A Personal Trip, by David Harel (Weizmann Institute of Science, Rehovot, Israel). www.wisdom.weizmann.ac.il/~harel 22 December What is an Algorithm?, by Yuri Gurevich (Microsoft Research, Redmond, Washington). research.microsoft.com/en- us/um/people/gurevich 23 December Humans, Machines, and the Future of Work, by Moshe Vardi (Rice University, Houston, Texas, USA). www.cs.rice.edu/~vardi 31 December Explorations in Universality by Scott Aaronson (Massachusetts Institute of Technology, Cambridge, Massachusetts, USA). www.scottaaronson.com All lectures will be held at the Israel Institute for Advanced Studies, Givat Ram, Jerusalem. Times are as follows: 11:00 - 11:15 Coffee and biscuits 11:15 - 12:15 The lecture 12:30 - 13:15 Break for lunch 13:15 - 14:15 Q & A with the lecturer 14:15 - 15:00 Afternoon tea The dates of the January lectures will be announced soon. The January lectures will be given by: Hajnal Andréka, Hungarian Academy of Sciences, Budapest, Hungary. www.renyi.hu/~andreka Nachum Dershowitz, Tel Aviv University, Tel Aviv, Israel. www.cs.tau.ac.il/~nachumd/Homepage.html Jo Francis, Flare Productions, Bethesda, Maryland, USA. www.mith.umd.edu/flare/about John Fuegi, University of Maryland, College Park, Maryland, USA. www.english.umd.edu/users/jfuegi Shafi Goldwasser, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA. people.csail.mit.edu/shafi Istvan and Peter Nemeti, Hungarian Academy of Sciences, Budapest, Hungary. www.renyi.hu/~nemeti Michael Rabin, Harvard University, Cambridge, Massachusetts, USA. www.seas.harvard.edu/directory/rabin Aaron Sloman, University of Birmingham, Birmingham, UK. www.cs.bham.ac.uk/~axs Mark Sprevak, University of Edinburgh, Edinburgh, UK. www.ppls.ed.ac.uk/people/mark-sprevak Susan Stepney, University of York, York, UK. www- users.cs.york.ac.uk/susan Doron Swade, Computer History Museum, Mountain View, California, USA. www.computerhistory.org/events/bio/Doron,Swade Avi Wigderson, Institute for Advanced Study, Princeton, New Jersey, USA. www.math.ias.edu/avi/home .
Load more

Recommended publications
  • Who Invented the Computer?
    Who Invented the Computer? AP This story comes from VOA Special English, Voice of America's daily news and information service for English learners. Read the story and then do the activities in the worksheet at the end. Millions of us use them every day. Some are so large they have to sit on the floor. Others are so small that they fit in our hand. They help us with mathematical problems, store our music and pictures, and are needed to search the Internet. They are, of course, computers. So try this experiment. Ask a friend or just someone you see on the street this question: “Who invented the computer?” Some people cannot live without computers, but we know very little about who invented them. So who did it? Are you ready? The answer is … we do not know for sure. Many people who know a lot about information technology might say computers were invented by Alan Turing. He was a British mathematician who helped solve coded messages from Germany during World War Two. Many people consider him the “father of computer science.” But to find the first person who thought he could make a computing device, we have to go back one hundred eighty years to a man named Charles Babbadge. He also was British. Special English is part of VOA Learning English: voanews.com/learningenglish | December 2011 | 1 Recently, researchers in his home country announced plans to use millions of dollars to build one of Babbadge’s “Analytical Engines.” John Graham- Cumming and Doron Swade are supervising the project at the Science Museum in London.
    [Show full text]
  • A Decade of Lattice Cryptography
    Full text available at: http://dx.doi.org/10.1561/0400000074 A Decade of Lattice Cryptography Chris Peikert Computer Science and Engineering University of Michigan, United States Boston — Delft Full text available at: http://dx.doi.org/10.1561/0400000074 Foundations and Trends R in Theoretical Computer Science Published, sold and distributed by: now Publishers Inc. PO Box 1024 Hanover, MA 02339 United States Tel. +1-781-985-4510 www.nowpublishers.com [email protected] Outside North America: now Publishers Inc. PO Box 179 2600 AD Delft The Netherlands Tel. +31-6-51115274 The preferred citation for this publication is C. Peikert. A Decade of Lattice Cryptography. Foundations and Trends R in Theoretical Computer Science, vol. 10, no. 4, pp. 283–424, 2014. R This Foundations and Trends issue was typeset in LATEX using a class file designed by Neal Parikh. Printed on acid-free paper. ISBN: 978-1-68083-113-9 c 2016 C. Peikert All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. Photocopying. In the USA: This journal is registered at the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923. Authorization to photocopy items for in- ternal or personal use, or the internal or personal use of specific clients, is granted by now Publishers Inc for users registered with the Copyright Clearance Center (CCC). The ‘services’ for users can be found on the internet at: www.copyright.com For those organizations that have been granted a photocopy license, a separate system of payment has been arranged.
    [Show full text]
  • The Best Nurturers in Computer Science Research
    The Best Nurturers in Computer Science Research Bharath Kumar M. Y. N. Srikant IISc-CSA-TR-2004-10 http://archive.csa.iisc.ernet.in/TR/2004/10/ Computer Science and Automation Indian Institute of Science, India October 2004 The Best Nurturers in Computer Science Research Bharath Kumar M.∗ Y. N. Srikant† Abstract The paper presents a heuristic for mining nurturers in temporally organized collaboration networks: people who facilitate the growth and success of the young ones. Specifically, this heuristic is applied to the computer science bibliographic data to find the best nurturers in computer science research. The measure of success is parameterized, and the paper demonstrates experiments and results with publication count and citations as success metrics. Rather than just the nurturer’s success, the heuristic captures the influence he has had in the indepen- dent success of the relatively young in the network. These results can hence be a useful resource to graduate students and post-doctoral can- didates. The heuristic is extended to accurately yield ranked nurturers inside a particular time period. Interestingly, there is a recognizable deviation between the rankings of the most successful researchers and the best nurturers, which although is obvious from a social perspective has not been statistically demonstrated. Keywords: Social Network Analysis, Bibliometrics, Temporal Data Mining. 1 Introduction Consider a student Arjun, who has finished his under-graduate degree in Computer Science, and is seeking a PhD degree followed by a successful career in Computer Science research. How does he choose his research advisor? He has the following options with him: 1. Look up the rankings of various universities [1], and apply to any “rea- sonably good” professor in any of the top universities.
    [Show full text]
  • Constraint Based Dimension Correlation and Distance
    Preface The papers in this volume were presented at the Fourteenth Annual IEEE Conference on Computational Complexity held from May 4-6, 1999 in Atlanta, Georgia, in conjunction with the Federated Computing Research Conference. This conference was sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, in cooperation with the ACM SIGACT (The special interest group on Algorithms and Complexity Theory) and EATCS (The European Association for Theoretical Computer Science). The call for papers sought original research papers in all areas of computational complexity. A total of 70 papers were submitted for consideration of which 28 papers were accepted for the conference and for inclusion in these proceedings. Six of these papers were accepted to a joint STOC/Complexity session. For these papers the full conference paper appears in the STOC proceedings and a one-page summary appears in these proceedings. The program committee invited two distinguished researchers in computational complexity - Avi Wigderson and Jin-Yi Cai - to present invited talks. These proceedings contain survey articles based on their talks. The program committee thanks Pradyut Shah and Marcus Schaefer for their organizational and computer help, Steve Tate and the SIGACT Electronic Publishing Board for the use and help of the electronic submissions server, Peter Shor and Mike Saks for the electronic conference meeting software and Danielle Martin of the IEEE for editing this volume. The committee would also like to thank the following people for their help in reviewing the papers: E. Allender, V. Arvind, M. Ajtai, A. Ambainis, G. Barequet, S. Baumer, A. Berthiaume, S.
    [Show full text]
  • Interactions of Computational Complexity Theory and Mathematics
    Interactions of Computational Complexity Theory and Mathematics Avi Wigderson October 22, 2017 Abstract [This paper is a (self contained) chapter in a new book on computational complexity theory, called Mathematics and Computation, whose draft is available at https://www.math.ias.edu/avi/book]. We survey some concrete interaction areas between computational complexity theory and different fields of mathematics. We hope to demonstrate here that hardly any area of modern mathematics is untouched by the computational connection (which in some cases is completely natural and in others may seem quite surprising). In my view, the breadth, depth, beauty and novelty of these connections is inspiring, and speaks to a great potential of future interactions (which indeed, are quickly expanding). We aim for variety. We give short, simple descriptions (without proofs or much technical detail) of ideas, motivations, results and connections; this will hopefully entice the reader to dig deeper. Each vignette focuses only on a single topic within a large mathematical filed. We cover the following: • Number Theory: Primality testing • Combinatorial Geometry: Point-line incidences • Operator Theory: The Kadison-Singer problem • Metric Geometry: Distortion of embeddings • Group Theory: Generation and random generation • Statistical Physics: Monte-Carlo Markov chains • Analysis and Probability: Noise stability • Lattice Theory: Short vectors • Invariant Theory: Actions on matrix tuples 1 1 introduction The Theory of Computation (ToC) lays out the mathematical foundations of computer science. I am often asked if ToC is a branch of Mathematics, or of Computer Science. The answer is easy: it is clearly both (and in fact, much more). Ever since Turing's 1936 definition of the Turing machine, we have had a formal mathematical model of computation that enables the rigorous mathematical study of computational tasks, algorithms to solve them, and the resources these require.
    [Show full text]
  • Lovelace & Babbage and the Creation of the 1843 'Notes'
    Lovelace & Babbage and the Creation of the 1843 ‘Notes’ John Fuegi and Jo Francis Flare/MITH Augusta Ada Lovelace worked with Charles Babbage to create a description of Babbage’s unbuilt invention, the Analytical Engine, a highly advanced mechanical calculator often considered a forerunner of the electronic calculating computers of the 20th century. Ada Lovelace’s “Notes,” describing the Analytical Engine, published in Taylor’s Scientific Memoirs in 1843, contained a ground-breaking description of the possibilities of programming the machine to go beyond number-crunching to “computing” in the wider sense in which we understand the term today. This article expands on research first presented by the authors in their documentary film, To Dream Tomorrow. What shall we do to get rid of Mr. Babbage and known to have crossed the intellectual thresh- his calculating Machine? Surely if completed it old between conceptualizing computing as would be worthless as far as science is con- only for calculation on the one hand, and on cerned? the other hand, computing as we know it —British Prime Minister Sir Robert Peel, 18421 today: with wider applications made possible by symbolic substitution. The Analytical Engine does not occupy common In an early background interview at the ground with mere ‘calculating machines.’ … In Science Museum (London) for the historical enabling mechanism to combine together gen- documentary film about collaboration between eral symbols, in successions of unlimited variety Lovelace and Babbage, To Dream Tomorrow,3 and extent, a uniting link is established between Babbage authority Doron Swade mentioned the operations of matter and the abstract mental that he thought Babbage and Lovelace had processes of the most abstract branch of mathe- “very different qualities of mind.” Swade’s matical science.
    [Show full text]
  • Who Was Charles Babbage?
    Click here for Full Issue of EIR Volume 27, Number 20, May 19, 2000 EIRBooks Who Was Charles Babbage? by Lyndon H. LaRouche, Jr. of the Analytical Engine that was under construction at the time of Babbage’s death, all he ever built of that The Cogwheel Brain revolutionary machine. Its modest size gives little clue by Doron Swade to the monumental intellectual accomplishment of its London: Little, Brown, 2000 conception and its much publicized role as the symbolic 342 pages, hardbound, £14.99 antecedent of the modern computer.” That part of Swade’s account, covering the period from May 11, 2000 the launching of the Science Museum’s Babbage project, from May 20, 1985 through the public demonstration of No- The specific merit in Doron Swade’s new assessment of vember 29, 1991, occupies the concluding, third section of his Charles Babbage’s role in the development of modern mathe- book, which is subtitled: “A Modern Sequel.” For qualified matical computing machines, lies in Swade’s notable part in specialists familiar with earlier standard sources on Bab- the actual construction of a machine according to Babbage’s bage’s life and work, the useful contribution of Swade’s book, own designs. Swade describes the circumstances leading into lies almost entirely in the content of that third section. the first public demonstration, which was made in London, The misleading elements in the earlier part of Swade’s on Friday, November 29, 1991, three days after inventor Bab- book as a whole, lie in his fallacy of composition. Instead of bage’s 200th birthday.
    [Show full text]
  • Optimal Hitting Sets for Combinatorial Shapes
    Optimal Hitting Sets for Combinatorial Shapes Aditya Bhaskara∗ Devendra Desai† Srikanth Srinivasan‡ November 5, 2018 Abstract We consider the problem of constructing explicit Hitting sets for Combinatorial Shapes, a class of statistical tests first studied by Gopalan, Meka, Reingold, and Zuckerman (STOC 2011). These generalize many well-studied classes of tests, including symmetric functions and combi- natorial rectangles. Generalizing results of Linial, Luby, Saks, and Zuckerman (Combinatorica 1997) and Rabani and Shpilka (SICOMP 2010), we construct hitting sets for Combinatorial Shapes of size polynomial in the alphabet, dimension, and the inverse of the error parame- ter. This is optimal up to polynomial factors. The best previous hitting sets came from the Pseudorandom Generator construction of Gopalan et al., and in particular had size that was quasipolynomial in the inverse of the error parameter. Our construction builds on natural variants of the constructions of Linial et al. and Rabani and Shpilka. In the process, we construct fractional perfect hash families and hitting sets for combinatorial rectangles with stronger guarantees. These might be of independent interest. 1 Introduction Randomness is a tool of great importance in Computer Science and combinatorics. The probabilistic method is highly effective both in the design of simple and efficient algorithms and in demonstrating the existence of combinatorial objects with interesting properties. But the use of randomness also comes with some disadvantages. In the setting of algorithms, introducing randomness adds to the number of resource requirements of the algorithm, since truly random bits are hard to come by. For combinatorial constructions, ‘explicit’ versions of these objects often turn out to have more structure, which yields advantages beyond the mere fact of their existence (e.g., we know of explicit arXiv:1211.3439v1 [cs.CC] 14 Nov 2012 error-correcting codes that can be efficiently encoded and decoded, but we don’t know if random codes can [5]).
    [Show full text]
  • Publications Core Magazine, 2007 Read
    CA PUBLICATIONo OF THE COMPUTERre HISTORY MUSEUM ⁄⁄ SPRINg–SUMMER 2007 REMARKABLE PEOPLE R E scuE d TREAsuREs A collection saved by SAP Focus on E x TRAORdinARy i MAGEs Computers through the Robert Noyce lens of Mark Richards PUBLISHER & Ed I t o R - I n - c hie f THE BEST WAY Karen M. Tucker E X E c U t I V E E d I t o R TO SEE THE FUTURE Leonard J. Shustek M A n A GI n G E d I t o R OF COMPUTING IS Robert S. Stetson A S S o c IA t E E d I t o R TO BROWSE ITS PAST. Kirsten Tashev t E c H n I c A L E d I t o R Dag Spicer E d I t o R Laurie Putnam c o n t RIBU t o RS Leslie Berlin Chris garcia Paula Jabloner Luanne Johnson Len Shustek Dag Spicer Kirsten Tashev d E S IG n Kerry Conboy P R o d U c t I o n ma n ager Robert S. Stetson W E BSI t E M A n AGER Bob Sanguedolce W E BSI t E d ESIG n The computer. In all of human history, rarely has one invention done Dana Chrisler so much to change the world in such a short time. Ton Luong The Computer History Museum is home to the world’s largest collection computerhistory.org/core of computing artifacts and offers a variety of exhibits, programs, and © 2007 Computer History Museum.
    [Show full text]
  • A Short History of Computing
    A Short History of Computing 01/15/15 1 Jacques de Vaucanson 1709-1782 • Gifted French artist and inventor • Son of a glove-maker, aspired to be a clock- maker • 1727-1743 – Created a series of mechanical automations that simulated life. • Best remembered is the “Digesting Duck”, which had over 400 parts. • Also worked to automate looms, creating the first automated loom in 1745. 01/15/15 2 1805 - Jacquard Loom • First fully automated and programmable loom • Used punch cards to “program” the pattern to be woven into cloth 01/15/15 3 Charles Babbage 1791-1871 • English mathematician, engineer, philosopher and inventor. • Originated the concept of the programmable computer, and designed one. • Could also be a Jerk. 01/15/15 4 1822 – Difference Engine Numerical tables were constructed by hand using large numbers of human “computers” (one who computes). Annoyed by the many human errors this produced, Charles Babbage designed a “difference engine” that could calculate values of polynomial functions. It was never completed, although much work was done and money spent. Book Recommendation: The Difference Engine: Charles Babbage and the Quest to Build the First Computer by Doron Swade 01/15/15 5 1837 – Analytical Engine Charles Babbage first described a general purpose analytical engine in 1837, but worked on the design until his death in 1871. It was never built due to lack of manufacturing precision. As designed, it would have been programmed using punch-cards and would have included features such as sequential control, loops, conditionals and branching. If constructed, it would have been the first “computer” as we think of them today.
    [Show full text]
  • Science Lives: Video Portraits of Great Mathematicians
    Science Lives: Video Portraits of Great Mathematicians accompanied by narrative profiles written by noted In mathematics, beauty is a very impor- mathematics biographers. tant ingredient… The aim of a math- Hugo Rossi, director of the Science Lives project, ematician is to encapsulate as much as said that the first criterion for choosing a person you possibly can in small packages—a to profile is the significance of his or her contribu- high density of truth per unit word. tions in “creating new pathways in mathematics, And beauty is a criterion. If you’ve got a theoretical physics, and computer science.” A beautiful result, it means you’ve got an secondary criterion is an engaging personality. awful lot identified in a small compass. With two exceptions (Atiyah and Isadore Singer), the Science Lives videos are not interviews; rather, —Michael Atiyah they are conversations between the subject of the video and a “listener”, typically a close friend or colleague who is knowledgeable about the sub- Hearing Michael Atiyah discuss the role of beauty ject’s impact in mathematics. The listener works in mathematics is akin to reading Euclid in the together with Rossi and the person being profiled original: You are going straight to the source. The to develop a list of topics and a suggested order in quotation above is taken from a video of Atiyah which they might be discussed. “But, as is the case made available on the Web through the Science with all conversations, there usually is a significant Lives project of the Simons Foundation. Science amount of wandering in and out of interconnected Lives aims to build an archive of information topics, which is desirable,” said Rossi.
    [Show full text]
  • Operator Scaling Via Geodesically Convex Optimization, Invariant Theory and Polynomial Identity Testing∗
    Operator Scaling via Geodesically Convex Optimization, Invariant Theory and Polynomial Identity Testing∗ Zeyuan Allen-Zhu Ankit Garg Yuanzhi Li Microsoft Research AI Microsoft Research New England Princeton University [email protected] [email protected] [email protected] Rafael Oliveira Avi Wigderson University of Toronto Institute for Advanced Study [email protected] [email protected] ABSTRACT 1 INTRODUCTION We propose a new second-order method for geodesically convex Group orbits and their closures capture natural notions of equiv- optimization on the natural hyperbolic metric over positive definite alence and are studied in several fields of mathematics like group matrices. We apply it to solve the operator scaling problem in time theory, invariant theory and algebraic geometry. They also come polynomial in the input size and logarithmic in the error. This up naturally in theoretical computer science. For example, graph is an exponential improvement over previous algorithms which isomorphism, the VP vs VNP question and lower bounds on were analyzed in the usual Euclidean, “commutative” metric (for tensor rank are all questions about such notions of equivalence. which the above problem is not convex). Our method is general In this paper, we focus on the orbit-closure intersection problem, and applicable to other settings. which is the most natural way to define equivalence for continuous As a consequence, we solve the equivalence problem for the left- group actions. We explore a general approach to the problem via right group action underlying the operator scaling problem. This geodesically convex optimization. As a testbed for our techniques, yields a deterministic polynomial-time algorithm for a new class of we design a deterministic polynomial-time algorithm for the orbit- Polynomial Identity Testing (PIT) problems, which was the original closure intersection problem for the left-right group action.
    [Show full text]