DOCSLIB.ORG

Recent Advances in Real Complexity and Computation

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Recent Advances in Real Complexity and Computation 604 Recent Advances in Real Complexity and Computation UIMP-RSME Lluís A. Santaló Summer School Recent Advances in Real Complexity and Computation July 16–20, 2012 Universidad Internacional Menéndez Pelayo, Santander, Spain José Luis Montaña Luis M. Pardo Editors American Mathematical Society Real Sociedad Matemática Española American Mathematical Society Licensed to University Paul Sabatier. Prepared on Mon Dec 14 09:01:17 EST 2015for download from IP 130.120.37.54. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms Recent Advances in Real Complexity and Computation UIMP-RSME Lluís A. Santaló Summer School Recent Advances in Real Complexity and Computation July 16–20, 2012 Universidad Internacional Menéndez Pelayo, Santander, Spain José Luis Montaña Luis M. Pardo Editors Licensed to University Paul Sabatier. Prepared on Mon Dec 14 09:01:17 EST 2015for download from IP 130.120.37.54. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms Licensed to University Paul Sabatier. Prepared on Mon Dec 14 09:01:17 EST 2015for download from IP 130.120.37.54. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms 604 Recent Advances in Real Complexity and Computation UIMP-RSME Lluís A. Santaló Summer School Recent Advances in Real Complexity and Computation July 16–20, 2012 Universidad Internacional Menéndez Pelayo, Santander, Spain José Luis Montaña Luis M. Pardo Editors American Mathematical Society Real Sociedad Matemática Española American Mathematical Society Providence, Rhode Island Licensed to University Paul Sabatier. Prepared on Mon Dec 14 09:01:17 EST 2015for download from IP 130.120.37.54. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms EDITORIAL COMMITTEE Dennis DeTurck, managing editor Michael Loss Kailash Misra Martin J. Strauss 2010 Mathematics Subject Classification. Primary 03D15, 14Qxx, 14Q20, 65-xx, 65H20. Library of Congress Cataloging-in-Publication Data UIMP-RSME Lluis Santal´o Summer School (2012 : Santander, Spain) Recent advances in real complexity and computation : UIMP-RSME Lluis Santal´o Summer School 2012, recent advances in real complexity and computation, July 16–20, 2012, UIMP Palacio de la Magdalena, Santander (Cantabria), Spain / Jose Luis Montana, Luis M. Pardo, editors. pages cm – (Contemporary Mathematics ; volume 604) Includes bibliographical references. ISBN 978-0-8218-9150-6 (alk. paper) 1. Computational complexity–Congresses. I. Pardo, L. M. (Luis M.), editor of compilation. II. Montana, Jose Luis, 1961–editor of compilation. III. Title. QA267.7.U36 2012 511.352–dc23 2013022512 Contemporary Mathematics ISSN: 0271-4132 (print); ISSN: 1098-3627 (online) DOI: http://dx.doi.org/10.1090/conm/604 Copying and reprinting. Material in this book may be reproduced by any means for edu- cational and scientific purposes without fee or permission with the exception of reproduction by services that collect fees for delivery of documents and provided that the customary acknowledg- ment of the source is given. This consent does not extend to other kinds of copying for general distribution, for advertising or promotional purposes, or for resale. Requests for permission for commercial use of material should be addressed to the Acquisitions Department, American Math- ematical Society, 201 Charles Street, Providence, Rhode Island 02904-2294, USA. Requests can also be made by e-mail to [email protected]. Excluded from these provisions is material in articles for which the author holds copyright. In such cases, requests for permission to use or reprint should be addressed directly to the author(s). (Copyright ownership is indicated in the notice in the lower right-hand corner of the first page of each article.) c 2013 by the American Mathematical Society. All rights reserved. The American Mathematical Society retains all rights except those granted to the United States Government. Copyright of individual articles may revert to the public domain 28 years after publication. Contact the AMS for copyright status of individual articles. Printed in the United States of America. ∞ The paper used in this book is acid-free and falls within the guidelines established to ensure permanence and durability. Visit the AMS home page at http://www.ams.org/ 10987654321 181716151413 Licensed to University Paul Sabatier. Prepared on Mon Dec 14 09:01:17 EST 2015for download from IP 130.120.37.54. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms Dedicated to our beloved friend Jean-Pierre Dedieu. Licensed to University Paul Sabatier. Prepared on Mon Dec 14 09:01:17 EST 2015for download from IP 130.120.37.54. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms Licensed to University Paul Sabatier. Prepared on Mon Dec 14 09:01:17 EST 2015for download from IP 130.120.37.54. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms Contents Editors’ preface ix Topics in real and complex number complexity theory Martijn Baartse and Klaus Meer 1 Polar, bipolar and copolar varieties: Real solving of algebraic varieties with intrinsic complexity Bernd Bank, Marc Giusti, and Joos Heintz 55 The complexity and geometry of numerically solving polynomial systems Carlos Beltran´ and Michael Shub 71 Multiplicity hunting and approximating multiple roots of polynomial systems M. Giusti and J.-C. Yakoubsohn 105 On the intrinsic complexity of elimination problems in effective algebraic geometry Joos Heintz, Bart Kuijpers, and Andres´ Rojas Paredes 129 Newton iteration, conditioning and zero counting Gregorio Malajovich 151 vii Licensed to University Paul Sabatier. Prepared on Mon Dec 14 09:01:17 EST 2015for download from IP 130.120.37.54. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms Licensed to University Paul Sabatier. Prepared on Mon Dec 14 09:01:17 EST 2015for download from IP 130.120.37.54. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms Editors’ preface This volume is composed of six contributions derived from the lectures given during the UIMP–RSME Llu´ıs Santal´o Summer School on “Recent Advances in Real Complexity and Computation”. The goal of this Summer School was to present some of the recent advances on Smale’s 17th Problem. This Problem was stated by Steve Smale as follows: Problem 1 (Smale’s 17th Problem). Can a zero of n complex polynomial equa- tions in n unknowns be found approximately, on the average, in polynomial time with a uniform algorithm? These contributions cover several aspects around this problem: from numerical to symbolic methods in polynomial equation solving, computational complexity as- pects (both worse and average cases, both upper and lower complexity bounds) and even aspects of the underlying geometry of the problem. Some of the contributions also deal with either real or multiple solutions solving. The School was oriented to graduate mathematicians, as to Master or Ph. D. students in Mathematics and to senior researchers interested on this topic. The School was promoted and supported by the Spanish Royal Mathematical Society (RSME) and hosted by the Universidad Internacional Men´endez Pelayo (UIMP), from July 16th to July 20th of 2012, in El Palacio de la Magdalena, San- tander. Partial financial support was also granted by the University of Cantabria and the Spanish Ministry of Science Grant MTM2010-16051. We thank these in- stitutions and grants for their financial support. The speakers (in alphabetical order) and their courses in this Summer School were the following ones: • Carlos Beltr´an,“Stability, precision and complexity in some numerical problems”. • Marc Giusti, “Polar, co–polar and bipolar varieties: real solving of alge- braic varieties with intrinsic complexity”. • Joos Heintz, “On the intrinsic complexity of elimination problems in ef- fective algebraic geometry”. • Gregorio Malajovich, “From the quadratic convergence of Newton’s method to problems of counting of the number of solutions”. • Klaus Meer,“Real Number Complexity Theory and Probabilistically Check- able Proofs (PCPs)”. • Michael Shub,“The geometry of condition and the analysis of algorithms”. • Jean-Claude Yakoubsohn, “ Tracking multiplicities”. ix Licensed to University Paul Sabatier. Prepared on Mon Dec 14 09:01:17 EST 2015for download from IP 130.120.37.54. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms x EDITORS’ PREFACE The present volume extends the Summer School by expository articles pre- senting the state of art of each of the topics. The reader will find the following contributions in forthcoming pages: (1) Martijn Baartse and Klaus Meer,“Topics in real and complex num- ber complexity theory” The contribution intends to introduce into topics relevant in real and com- plex number complexity theory. This is done in a survey style. Taking as starting point the computational model introduced by Blum, Shub, and Smale the following issues are addressed: Basic results concerning decid- ability and NP-completeness, transfer results of open questions between different models of computation, structural complexity inside NPR,com- putational
Load more

Recommended publications
  • 1 Lenore Blum, Matemática Computacional, Algoritmos, Lógica, Geometría Algebraica
    MATEMATICOS ACTUALES Lenore Blum, Matemática computacional, Algoritmos, Lógica, Geometría algebraica. Debemos dejar claro desde el comienzo de esta biografía de Lenore Blum que Blum es su apellido de casada, que solo tomó después de casarse con Manuel Blum, que también era matemático. Sin embargo, para evitar confusiones, nos referiremos a ella como Blum a lo largo de este artículo. Los padres de Lenore eran Irving y Rose y, además de una hermana, Harriet, que era dos años menor que Lenore, ella era parte de una extensa familia judía con varias tías y tíos. Su madre Rose era maestra de ciencias de secundaria en Nueva York. Lenore asistió a una escuela pública en la ciudad de Nueva York hasta que tuvo nueve años cuando su familia se mudó a América del Sur. Su padre Irving trabajaba en el negocio de importación/exportación y él y su esposa se instalaron en Venezuela con Lenore y Harriet. Durante su primer año en Caracas, Lenore no asistió a la escuela, sin embargo su madre le enseñó. Básicamente, la familia era demasiado pobre para poder pagar las tasas escolares. Al cabo de un año, Rose ocupó un puesto docente en la Escuela Americana E. Campo Alegre, en Caracas, y esto proporcionó suficiente dinero para permitir que Lenore asistiera a la escuela secundaria y luego a la escuela secundaria en Caracas. Mientras estaba en Caracas, conoció a Manuel Blum, quien también era de una familia judía. Manuel salió de Caracas mientras Lenore todavía estaba allí en la escuela y se fue a los Estados Unidos donde ingresó como estudiante en el Instituto de Tecnología de Massachusetts.
    [Show full text]
  • The Association for Women in Mathematics: How and Why It Was
    Mathematical Communities t’s 2011 and the Association for Women in Mathematics The Association (AWM) is celebrating 40 years of supporting and II promoting female students, teachers, and researchers. It’s a joyous occasion filled with good food, warm for Women conversation, and great mathematics—four plenary lectures and eighteen special sessions. There’s even a song for the conference, titled ‘‘((3 + 1) 9 3 + 1) 9 3 + 1 Anniversary in Mathematics: How of the AWM’’ and sung (robustly!) to the tune of ‘‘This Land is Your Land’’ [ICERM 2011]. The spirit of community and and Why It Was the beautiful mathematics on display during ‘‘40 Years and Counting: AWM’s Celebration of Women in Mathematics’’ are truly a triumph for the organization and for women in Founded, and Why mathematics. It’s Still Needed in the 21st Century SARAH J. GREENWALD,ANNE M. LEGGETT, AND JILL E. THOMLEY This column is a forum for discussion of mathematical communities throughout the world, and through all time. Our definition of ‘‘mathematical community’’ is Participants from the Special Session in Number Theory at the broadest: ‘‘schools’’ of mathematics, circles of AWM’s 40th Anniversary Celebration. Back row: Cristina Ballantine, Melanie Matchett Wood, Jackie Anderson, Alina correspondence, mathematical societies, student Bucur, Ekin Ozman, Adriana Salerno, Laura Hall-Seelig, Li-Mei organizations, extra-curricular educational activities Lim, Michelle Manes, Kristin Lauter; Middle row: Brooke Feigon, Jessica Libertini-Mikhaylov, Jen Balakrishnan, Renate (math camps, math museums, math clubs), and more. Scheidler; Front row: Lola Thompson, Hatice Sahinoglu, Bianca Viray, Alice Silverberg, Nadia Heninger. (Photo Cour- What we say about the communities is just as tesy of Kiran Kedlaya.) unrestricted.
    [Show full text]
  • HHMC 2017 (2017 Workshop on Hybrid Human-Machine Computing)
    CRonEM CRonEM HHMC 2017 (2017 Workshop on Hybrid Human-Machine Computing) 20 & 21 September 2017 Treetops, Wates House, University of Surrey Guildford, Surrey, UK Programme INTRODUCTION KEYNOTE 1 The 2017 Workshop on Hybrid Human-Machine Computing (HHMC 2017) is 2-day workshop, to be held Title: Password Generation, an Example of Human Computation at the University of Surrey, Guildford, UK, on 20 and 21 September, 2017. It is a workshop co-funded by Abstract: University of Surrey’s Institute for Advanced Studies (IAS), a number of other organizations and related research projects. A password schema is an algorithm for humans - working in their heads - without paper and pencil - to transform challenges (typically website names) into responses (passwords). When we talk about “computing” we often mean computers do something (for humans), but due to the more and more blurred boundary between humans and computers, this old paradigm of “computing” has To start this talk, the speaker will ask for 2 or 3 volunteers, whisper instructions in their ears, then have them changed drastically, e.g., in human computation humans do all or part of the computing (for machines), transform audience-proposed challenges (like AMAZON and FACEBOOK) into passwords. in computer-supported cooperative work (CSCW) humans are working together with assistance from The passwords will look random. The audience will be challenged to guess properties of the passwords but computers to conduct cooperative work, in social computing and computer-mediated communication even the simple schema the speaker whispered to the volunteers will produce passwords that look random. people’s social behaviors are intermingled with computer systems so computing happens with humans and These passwords can be easily made so strong that they pass virtually all password tests, like passwordmeter.
    [Show full text]
  • Page 657 Monterey Program (November 19-20)- Page 666
    EAST Lansing Program (November 12-13)- Page 657 Monterey Program (November 19-20)- Page 666 VI 0 0 Notices of the American Mathematical Society z c:: 3 o­ ..,~ z 0 < ~ November 1982, Issue 221 ·5- Volume 29, Number 7, Pages 617- 720 ..,~ Providence, Rhode Island USA ISSN 0002-9920 Calendar of AMS Meetings THIS CALENDAR lists all meetings which have been approved by the Council prior to the date this issue of the Notices was sent to press. The summer and annual meetings are joint meetings of the Mathematical Association of America and the Ameri· can Mathematical Society. The meeting dates which fall rather far in the future are subject to change; this is particularly true of meetings to which no numbers have yet been assigned. Programs of the meetings will appear in the issues indicated below. First and second announcements of the meetings will have appeared in earlier issues. ABSTRACTS OF PAPERS presented at a meeting of the Society are published in the journal Abstracts of papers presented to the American Mathematical Society in the issue corresponding to that of the Notices which contains the program of the meet· ing. Abstracts should be submitted on special forms which are available in many departments of mathematics and from the office of the Society in Providence. Abstracts of papers to be presented at the meeting must be received at the headquarters of the Society in Providence, Rhode Island, on or before the deadline given below for the meeting. Note that the deadline for ab· stracts submitted for consideration for presentation at special sessions is usually three weeks earlier than that specified below.
    [Show full text]
  • What Is a Horseshoe?, Volume 52, Number 5
    ?WHAT IS... a Horseshoe? Michael Shub The Smale horseshoe is the hallmark of chaos. With n →∞; while if y lies on the vertical through p, then striking geometric and analytic clarity it robustly the inverse iterates of f squeeze it to p. With respect describes the homoclinic dynamics encountered to linear coordinates centered at p, f (x, y)=(kx, my) by Poincaré and studied by Birkhoff, Cartwright- where (x, y) ∈ B and 0 <k<1 <m. Similarly, Littlewood, and Levinson. We give the example first − − and the definitions later. f (x, y)=( kx, my) with respect to linear coordi- Consider the embedding f of the disc ∆ into nates on D at s. itself exhibited in the figure. It contracts the The sets semidiscs A, E to the semidiscs f (A), f (E) in A and s ={ n → →∞} it sends the rectangles B, D linearly to the rectan- W z : f (z) p as n , glesf (B), f (D), stretching them vertically and shrink- W u ={z : f n(z) → p as n →−∞} ing them horizontally. In the case of D, it also rotates by 180 degrees. We don’t really care what are the stable and unstable manifolds of p. They the image f (C) of C is as long as it does not intersect intersect at r , which is what Poincaré called a the rectangle B ∪ C ∪ D. In the figure it is placed so homoclinic point. The figure shows these invariant that the total image resembles a horseshoe, hence the manifolds only locally. Iteration extends them name. globally.
    [Show full text]
  • 2003 Newsletter
    1.6180339887498948482045868343656381177203091798057628621354486227052604628189024497072072041893911374847540880753868917521266338622235369317931800607667263544333890865959395829056 M e t r o M a t h 2.7182818284590452353602874713526624977572470936999595749669676277240766303535475945713821785251664274274663919320030599218174135966290435729003342952605956307381323286279434907632 N e w s l e t t e r Metropolitan New York Section of The Mathematical Association of America February 2003 3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055 Bronx Brooklyn Columbia Dutchess Greene Manhattan Nassau Orange Putnam Queens Richmond Rockland Suffolk Sullivan Ulster Westchester 1.7724538509055160272981674833411451827975494561223871282138077898529112845910321813749506567385446654162268236242825706662361528657244226025250937096027870684620376986531051228499 A N N U A L M E E T I N G Saturday, 3 May 2003 9:00 AM − 5:00 PM LaGuardia Community College (CUNY) Long Island City, New York (Inquire Within for More Information) E L E C T I O N B A L L O T E N C L O S E D SECTION OFFICERS Section Governor Raymond N. Greenwell (516) 463-5573 (2002 – 2005) Hofstra University [email protected] Chair John (Jack) Winn (631) 420-2182 (2001 – 2003) Farmingdale (SUNY) [email protected] Chair-Elect Abraham S. Mantell (516) 572-8092 (2001 – 2003) Nassau Community College (SUNY) [email protected] Secretary Dan King (914) 395-2424 (2000 – 2003)
    [Show full text]
  • NP-Complete Problems and Physical Reality
    NP-complete Problems and Physical Reality Scott Aaronson∗ Abstract Can NP-complete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, protein folding, quantum computing, quantum advice, quantum adia- batic algorithms, quantum-mechanical nonlinearities, hidden variables, relativistic time dilation, analog computing, Malament-Hogarth spacetimes, quantum gravity, closed timelike curves, and “anthropic computing.” The section on soap bubbles even includes some “experimental” re- sults. While I do not believe that any of the proposals will let us solve NP-complete problems efficiently, I argue that by studying them, we can learn something not only about computation but also about physics. 1 Introduction “Let a computer smear—with the right kind of quantum randomness—and you create, in effect, a ‘parallel’ machine with an astronomical number of processors . All you have to do is be sure that when you collapse the system, you choose the version that happened to find the needle in the mathematical haystack.” —From Quarantine [31], a 1992 science-fiction novel by Greg Egan If I had to debate the science writer John Horgan’s claim that basic science is coming to an end [48], my argument would lean heavily on one fact: it has been only a decade since we learned that quantum computers could factor integers in polynomial time. In my (unbiased) opinion, the showdown that quantum computing has forced—between our deepest intuitions about computers on the one hand, and our best-confirmed theory of the physical world on the other—constitutes one of the most exciting scientific dramas of our time.
    [Show full text]
  • Computing Over the Reals: Where Turing Meets Newton, Volume 51
    Computing over the Reals: Where Turing Meets Newton Lenore Blum he classical (Turing) theory of computation been a powerful tool in classical complexity theory. has been extraordinarily successful in pro- But now, in addition, the transfer of complexity re- Tviding the foundations and framework for sults from one domain to another becomes a real theoretical computer science. Yet its dependence possibility. For example, we can ask: Suppose we on 0s and 1s is fundamentally inadequate for pro- can show P = NP over C (using all the mathemat- viding such a foundation for modern scientific ics that is natural here). Then, can we conclude that computation, in which most algorithms—with ori- P = NP over another field, such as the algebraic gins in Newton, Euler, Gauss, et al.—are real num- numbers, or even over Z2? (Answer: Yes and es- ber algorithms. sentially yes.) In 1989, Mike Shub, Steve Smale, and I introduced In this article, I discuss these results and indi- a theory of computation and complexity over an cate how basic notions from numerical analysis arbitrary ring or field R [BSS89]. If R is such as condition, round-off, and approximation are Z2 = ({0, 1}, +, ·), the classical computer science being introduced into complexity theory, bringing theory is recovered. If R is the field of real num- together ideas germinating from the real calculus bers R, Newton’s algorithm, the paradigm algo- of Newton and the discrete computation of com- rithm of numerical analysis, fits naturally into our puter science. The canonical reference for this ma- model of computation. terial is the book Complexity and Real Computation Complexity classes P, NP and the fundamental [BCSS98].
    [Show full text]
  • March 1992 Council Minutes
    AMERICAN MATHEMATICAL SOCIETY MINUTES OF THE COUNCIL Springfield, Missouri 19 March 1992 Abstract The Council of the American Mathematical Society met at 7:00 pm on Thursday, 19 March 1992, in the Texas Room of the Springfield Holiday Inn–University Plaza Hotel. Members present were Michael Artin, Salah Baouendi, Lenore Blum, Carl Cowen, Chandler Davis, Robert Fossum, Frank Gilfeather, Ronald Graham, Judy Green, Rebecca Herb, Linda Keen, Elliott Lieb, Andy Magid (Associate Secretary in charge of Springfield Meeting), Frank Peterson, Carl Pomerance, Frank Quinn, Marc Rieffel, John Selfridge (in place of BA Taylor), and Ruth Williams. Also attending were: William H. Jaco (ED), Jane Kister (MR-Ann Arbor), James Maxwell (AED), Ann Renauer (AMS Staff), Sylvia Wiegand (Committee on Committees), and Kelly Young (AMS Staff). President Artin presided. 1 2 CONTENTS Contents 0 Call to Order and Introductions. 4 0.1 Call to Order. ........................................ 4 0.2 Introduction of New Council Members. .......................... 4 1MINUTES 4 1.1 January 92 Council. .................................... 4 1.2 Minute of Business By Mail. ................................ 5 2 CONSENT AGENDA. 5 2.1 Discharge Committees. ................................... 5 2.1.1 Committee on Cooperative Symposia. ...................... 5 2.1.2 Liaison Committee with Sigma Xi ........................ 5 2.2 Society for Industrial and Applied Mathematics (SIAM). ................ 5 3 REPORTS OF BOARDS AND STANDING COMMITTEES. 6 3.1 EBC ............................................. 6 3.2 Nominating Committee .................................. 6 3.2.1 Vice-President. ................................... 6 3.2.2 Member-at-large of Council. ............................ 6 3.2.3 Trustee. ....................................... 7 3.3 Other action. ........................................ 7 3.4 Executive Committee and Board of Trustees (ECBT). ................. 7 3.5 Report from the Executive Director.
    [Show full text]
  • Board Committee Academic Policy Documents Cfsaagenda100918
    BOARD OF TRUSTEES THE CITY UNIVERSITY OF NEW YORK BOARD COMMITTEE ON FACULTY, STAFF Agenda AND ADMINISTRATION October 9, 2018 I. ACTION ITEMS A. Approval of the Minutes of June 4, 2018 B. POLICYCALENDAR 1. Appointment of Vivian Louie, Professor of Urban Policy and Planning at Hunter College, with tenure pursuant to §6.2(b) of the Bylaws (I-B-1) 2. Appointment of Luisa Borrell as Distinguished Professor at the CUNY Graduate School of Public Health and Health Policy (I-B-2) 3. Appointment of Michael Shub as Distinguished Professor at City College (I-B- 3) 4. Appointment of Eric Lott as Distinguished Professor at the Graduate Center (I-B-4) 5. Appointment of Nari Ward as Distinguished Professor at Hunter College (I-B- 5) 6. Appointment of Steven Greenbaum as Distinguished Professor at Hunter College (I-B-6) 7. Appointment of Naresh Devineni at City College with Early Tenure pursuant to §6.2(d) of the Bylaws (I-B-7) II. INFORMATION ITEMS A. Chancellors University Report Review and Proposed Bylaws Amendments -- 1st reading B. Revised Naming Policy Guidelines C. Quarterly Diversity Report BOARD OF TRUSTEES THE CITY UNIVERSITY OF NEW YORK COMMITTEE ON MINUTES OF THE MEETING FACULTY, STAFF AND ADMINISTRATION JUNE 4, 2018 The meeting was called to order by Committee Chair Lorraine Cortés-Vázquez at 5:01 p.m. The following people were present: Committee Members: University Staff: Hon. Lorraine A. Cortés-Vázquez, Chair Interim Chancellor Vita C. Rabinowitz Hon. Ken Sunshine, Vice Chair Interim Vice Chancellor Margaret Egan Hon. Kevin Kim Vice Chancellor Brigette Bryant Hon.
    [Show full text]
  • Technical Report No. 2005-492 the MYTH of UNIVERSAL COMPUTATION∗
    Technical Report No. 2005-492 THE MYTH OF UNIVERSAL COMPUTATION∗ Selim G. Akl School of Computing Queen’s University Kingston, Ontario, Canada K7L 3N6 January 31, 2005 Abstract It is shown that the concept of a Universal Computer cannot be realized. Specif- ically, instances of a computable function are exhibited that cannot be computed on any machine that is capable of only aF finite and fixed number of operations per step. This remainsU true even if the machine is endowed with an infinite memory and the ability to communicate with the outsideU world while it is attempting to compute . It also remains true if, in addition, is given an indefinite amount of time to computeF . This result applies not onlyU to idealized models of computation, such as the TuringF Machine and the like, but also to all known general-purpose computers, including existing conventional computers (both sequential and parallel), as well as contemplated unconventional ones such as biological and quantum computers. Even accelerating machines (that is, machines that increase their speed at every step) are not universal. Keywords: Universal computer, Turing machine, simulation, parallel computation, superlinear speedup, real-time computation, uncertainty, geometric transformation. 1 Introduction Universal computation, which rests on the principle of simulation, is one of the foundational concepts in computer science. Thus, it is one of the main tenets of the field that any computation that can be carried out by one general-purpose computer can also be carried out on any other general-purpose computer. At times, the imitated computation, running on the second computer, may be faster or slower depending on the computers involved.
    [Show full text]
  • On a Theory of Computation and Complexity Over the Real Numbers: Np-Completeness, Recursive Functions and Universal Machines1
    BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 21, Number 1, July 1989 ON A THEORY OF COMPUTATION AND COMPLEXITY OVER THE REAL NUMBERS: NP-COMPLETENESS, RECURSIVE FUNCTIONS AND UNIVERSAL MACHINES1 LENORE BLUM2, MIKE SHUB AND STEVE SMALE ABSTRACT. We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain universal machines, partial recursive functions, as well as JVP-complete problems. While our theory reflects the classical over Z (e.g., the computable func­ tions are the recursive functions) it also reflects the special mathematical character of the underlying ring R (e.g., complements of Julia sets provide natural examples of R. E. undecidable sets over the reals) and provides a natural setting for studying foundational issues concerning algorithms in numerical analysis. Introduction. We develop here some ideas for machines and computa­ tion over the real numbers R. One motivation for this comes from scientific computation. In this use of the computer, a reasonable idealization has the cost of multiplication independent of the size of the number. This contrasts with the usual theoretical computer science picture which takes into account the number of bits of the numbers. Another motivation is to bring the theory of computation into the do­ main of analysis, geometry and topology. The mathematics of these sub­ jects can then be put to use in the systematic analysis of algorithms. On the other hand, there is an extensively developed subject of the theory of discrete computation, which we don't wish to lose in our theory.
    [Show full text]