DOCSLIB.ORG

SAM History: Overview

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
SAM History: Overview SAM History: Overview The precurser of the Seminar for Applied Mathematics (SAM) (in German: Seminar f¨urAngewandte Mathematik) at ETH Zurich, the Institute for Applied Mathematics (IAM) was founded on January 1, 1948, at the request of Professor Eduard Stiefel (21.4.1909{25.11.1978), who had been a full profes- sor of mathematics since 1943, well known for his earlier contributions to pure mathematics. His vision was to introduce applied mathematics at ETH based on the usage of electronic computers as they were being developed in the United States, England, and the Netherlands. Among his early goals was the construction of a Swiss programmable electronic computer. As his first collaborators he hired two perma- nent assistants Heinz Rutishauser (30.1.1918{10.11.1970), a mathematician, and Ambros P. Speiser 13.11.1922{10.5.2003), an electrical engineer. For gathering information on the current status of computer technology, Stiefel went in October 1948 for five months on a fact finding mission to Amsterdam and sev- eral places of the United States. He also sent his two assistants for a year to the two top U.S. computer research centers: Harvard and Princeton. When Stiefel returned from the U.S., he learned that the Z4 computer, the fourth computer the ingenious German Konrad Zuse (22.6.1910{18.12.1995) had constructed during WWII had survived the war and was available for rent. He decided to rent it for a period of five years. It was installed at ETH in August 1950. Thanks to the Z4, Stiefel and his collaborators could quickly start working on numerical methods and their applications. Today we would say that in 1950 they started to work in computational science, and they were very successful in that. Their fundamental contributions to numerical algorithms are legendary: in particular, Stiefel's conjugate gradient (CG) method (found independently also by Magnus Hestenes and Cornelius Lanczos at the Institute for Numerical Analysis attached to UCLA in Los Angeles, CA) and Rutishauser's quotient-difference (qd) algorithm and his LR algorithm, the predecessor of the ubiquitous QR algorithm of John G.F. Francis (England) and Vera N. Kublanovskaya (USSR). Simultaneously, under the leadership of Ambros Speiser and Heinz Rutishauser, the staff of the IAM designed and constructed in the time range 1950{1956 a much faster electronic computer, the ERMETH (Elektronische Rechenmaschine der ETH), which was operational from 1956 until 1963. Moreover, during this period Heinz Rutishauser developed the concept of a compiler and was one of the main contributors to the groundbraking computer language ALGOL 60, and Hans-Rudolf Schwarz (*20.11.1930) wrote the first compiler for it. Heinz Rutishauser became a Privatdozent in 1951, an associate professor in 1955, and a full professor in 1962. On November 10, 1970, he died at the age of 52. Ambros P. Speiser became a Privatdozent in 1951, but in 1955 he left ETH to become the founding director of the IBM Research Laboratory in R¨uschlikon near Zurich. When he left, Peter L¨auchli and Alfred Schai were responsible for completing the ERMETH. Peter L¨auchlibecame an assistant professor in 1964 and an associate professor in 1968. In the wake of an offer from TH Munich, Heinz Rutishauser officially left the IAM in 1968 and founded, together with the promoted associate professor Peter L¨auchli(*4.6.1928) and the newly hired full professor Niklaus Wirth (*15.2.1934) the Fachgruppe Computer Wissenschaften, which was upgraded into the Institut f¨urInformatik in 1974. Also in the 1960s, Eduard Stiefel gradually changed his research interest from numerical analysis to celestial mechanics, an area of wide interest at the great time of space flights. End of 1969, the Institut f¨urAngewandte Mathematik was renamed Seminar f¨urAngewandte Mathematik because Eduard Stiefel and Peter K. Henrici (13.9.1923{13.3.1987) decided to join forces. Peter Henrici had been a full professor of mathematics at ETH since 1962, and he was already a famous numerical analyst. But the rules for an institute did not allow that it was lead by two full professors who were on a par, while the rules for a seminar assumed that it had an acting director who is just primus inter pares. In spring 1970 the two groups joined and moved to the newly erected RZ building at Clausiusstrasse 55. Moreover, in December 1970, J¨urgT. Marti (*24.5.1935) came to the SAM as an associate professor; in c SAM { ETH Zurich November 18, 2014 SAM History: Overview{1 SAM History: Overview 1976 he was promoted to full professor. From 1974 to 1977 Rudolf E. K´alm´an (*19.5.1930), the pioneer of modern systems and control theory, was also a full professor at the SAM. (Later he held an independent professorship at the Department of Mathematics.) The research of the other professors focused on the application of group theory (Stiefel), on applied and computational complex analysis (Henrici), and on approximation theory as well as compu- tational fluid dynamics (Marti). On November 25, 1978, Eduard Stiefel died at age 69 still in office. He was later replaced by J¨urgenMoser (4.7.1928{17.12.1999), who did not join the SAM however. On March 13, 1987, Peter Henrici died at the age of 63. Unfortunately, in the 1980s, replacing first Stiefel and then also Henrici at the SAM was repeatedly delayed by the Department of Mathematics. Finally, Rolf Jeltsch (*31.10.1945) in 1989 and Randall J. LeVeque (*30.9.1955) in 1990 started their work as full professors, but LeVeque choose to return to the U.S. in 1991. Again, it took four years until he got replaced by Christoph Schwab (*14.10.1962) (assoc. prof. in 1995, full prof. in 1998). In the new century, the SAM has been strengthened further by the appointment of Ralf Hiptmaier (*10.5.1967) (assoc. prof. in 2002, full prof. in 2005) and Siddhartha Mishra (*5.5.1980) (assoc. prof. in 2012). Moreover, since 1991 the institute profitted from a number of assistant professors that were either officially or at least de facto in the SAM: Christian Lubich (08/1991{08/1992), Martin Buhmann (04/1994{ 03/1997), Marcus Grote (10/1997{03/2001), Andreas Prohl (04/2002{04/2006), Manuel Torrilhon (04/2007{08/2010), Daniel Kressner (09/2008{04/2011), Siddhartha Mishra (08/2009{07/2011), Philipp Grohs (10/2011{), and Arnulf Jentzen (09/2012{). Since the 1990s the research focus of the SAM has been clearly in the numerical solution of partial differential equations, both for initial value and boundary value problems. Some of the assistant professors and some of the permanent scientific staff have been engaged in other areas. SAM History: Overview{2 November 18, 2014 c SAM { ETH Zurich.
Load more

Recommended publications
  • Thomas Ströhlein's Endgame Tables: a 50Th Anniversary
    Thomas Ströhlein's Endgame Tables: a 50th Anniversary Article Supplemental Material The Festschrift on the 40th Anniversary of the Munich Faculty of Informatics Haworth, G. (2020) Thomas Ströhlein's Endgame Tables: a 50th Anniversary. ICGA Journal, 42 (2-3). pp. 165-170. ISSN 1389-6911 doi: https://doi.org/10.3233/ICG-200151 Available at http://centaur.reading.ac.uk/90000/ It is advisable to refer to the publisher’s version if you intend to cite from the work. See Guidance on citing . Published version at: https://content.iospress.com/articles/icga-journal/icg200151 To link to this article DOI: http://dx.doi.org/10.3233/ICG-200151 Publisher: The International Computer Games Association All outputs in CentAUR are protected by Intellectual Property Rights law, including copyright law. Copyright and IPR is retained by the creators or other copyright holders. Terms and conditions for use of this material are defined in the End User Agreement . www.reading.ac.uk/centaur CentAUR Central Archive at the University of Reading Reading’s research outputs online 40 Jahre Informatik in Munchen:¨ 1967 – 2007 Festschrift Herausgegeben von Friedrich L. Bauer unter Mitwirkung von Helmut Angstl, Uwe Baumgarten, Rudolf Bayer, Hedwig Berghofer, Arndt Bode, Wilfried Brauer, Stephan Braun, Manfred Broy, Roland Bulirsch, Hans-Joachim Bungartz, Herbert Ehler, Jurgen¨ Eickel, Ursula Eschbach, Anton Gerold, Rupert Gnatz, Ulrich Guntzer,¨ Hellmuth Haag, Winfried Hahn (†), Heinz-Gerd Hegering, Ursula Hill-Samelson, Peter Hubwieser, Eike Jessen, Fred Kroger,¨ Hans Kuß, Klaus Lagally, Hans Langmaack, Heinrich Mayer, Ernst Mayr, Gerhard Muller,¨ Heinrich Noth,¨ Manfred Paul, Ulrich Peters, Hartmut Petzold, Walter Proebster, Bernd Radig, Angelika Reiser, Werner Rub,¨ Gerd Sapper, Gunther Schmidt, Fred B.
    [Show full text]
  • The Advent of Recursion & Logic in Computer Science
    The Advent of Recursion & Logic in Computer Science MSc Thesis (Afstudeerscriptie) written by Karel Van Oudheusden –alias Edgar G. Daylight (born October 21st, 1977 in Antwerpen, Belgium) under the supervision of Dr Gerard Alberts, and submitted to the Board of Examiners in partial fulfillment of the requirements for the degree of MSc in Logic at the Universiteit van Amsterdam. Date of the public defense: Members of the Thesis Committee: November 17, 2009 Dr Gerard Alberts Prof Dr Krzysztof Apt Prof Dr Dick de Jongh Prof Dr Benedikt Löwe Dr Elizabeth de Mol Dr Leen Torenvliet 1 “We are reaching the stage of development where each new gener- ation of participants is unaware both of their overall technological ancestry and the history of the development of their speciality, and have no past to build upon.” J.A.N. Lee in 1996 [73, p.54] “To many of our colleagues, history is only the study of an irrele- vant past, with no redeeming modern value –a subject without useful scholarship.” J.A.N. Lee [73, p.55] “[E]ven when we can't know the answers, it is important to see the questions. They too form part of our understanding. If you cannot answer them now, you can alert future historians to them.” M.S. Mahoney [76, p.832] “Only do what only you can do.” E.W. Dijkstra [103, p.9] 2 Abstract The history of computer science can be viewed from a number of disciplinary perspectives, ranging from electrical engineering to linguistics. As stressed by the historian Michael Mahoney, different `communities of computing' had their own views towards what could be accomplished with a programmable comput- ing machine.
    [Show full text]
  • Early Life: 1924–1945
    An interview with FRITZ BAUER Conducted by Ulf Hashagen on 21 and 26 July, 2004, at the Technische Universität München. Interview conducted by the Society for Industrial and Applied Mathematics, as part of grant # DE-FG02-01ER25547 awarded by the US Department of Energy. Transcript and original tapes donated to the Computer History Museum by the Society for Industrial and Applied Mathematics © Computer History Museum Mountain View, California ABSTRACT: Professor Friedrich L. Bauer describes his career in physics, computing, and numerical analysis. Professor Bauer was born in Thaldorf, Germany near Kelheim. After his schooling in Thaldorf and Pfarrkirchen, he received his baccalaureate at the Albertinium, a boarding school in Munich. He then faced the draft into the German Army, serving first in the German labor service. After training in France and a deployment to the Eastern Front in Kursk, he was sent to officer's school. His reserve unit was captured in the Ruhr Valley in 1945 during the American advance. He returned to Pfarrkirchen in September 1945 and in spring of 1946 enrolled in mathematics and physics at the Ludwig-Maximilians-Universitäat, München. He studied mathematics with Oscar Perron and Heinrich Tietze and physics with Arnold Sommerfeld and Paul August Mann. He was offered a full assistantship with Fritz Bopp and finished his Ph.D. in 1951 writing on group representations in particle physics. He then joined a group in Munich led by a professor of mathematics Robert Sauer and the electrical engineer Hans Piloty, working with a colleague Klaus Samelson on the design of the PERM, a computer based in part on the Whirlwind concept.
    [Show full text]
  • Methods of Conjugate Gradients for Solving Linear Systems
    Methods of Conjugate Gradients for Solving Linear Systems The advent of electronic computers in the middle of systematic way in order to compute the solution. These the 20th century stimulated a flurry of activity in devel- methods were finite, but required a rather large amount oping numerical algorithms that could be applied to of computational effort with work growing as the cube computational problems much more difficult than those of the number of unknowns. The second type of al- solved in the past. The work described in this paper [1] gorithm used “relaxation techniques” to develop a se- was done at the Institute for Numerical Analysis, a quence of iterates converging to the solution. Although part of NBS on the campus of UCLA [2]. This institute convergence was often slow, these algorithms could be was an incredibly fertile environment for the develop- terminated, often with a reasonably accurate solution ment of algorithms that might exploit the potential estimate, whenever the human “computers” ran out of of these new automatic computing engines, especially time. algorithms for the solution of linear systems and matrix The ideal algorithm would be one that had finite eigenvalue problems. Some of these algorithms are termination but, if stopped early, would give a useful classified today under the term Krylov Subspace approximate solution. Hestenes and Stiefel succeeded in Iteration, and this paper describes the first of these developing an algorithm with exactly these characteris- methods to solve linear systems. tics, the method of conjugate gradients. Magnus Hestenes was a faculty member at UCLA The algorithm itself is beautiful, with deep connec- who became associated with this Institute, and Eduard tions to optimization theory, the Pad table, and quadratic Stiefel was a visitor from the Eidgeno¨ssischen Technis- forms.
    [Show full text]
  • A Static Analysis Framework for Security Properties in Mobile and Cryptographic Systems
    A Static Analysis Framework for Security Properties in Mobile and Cryptographic Systems Benyamin Y. Y. Aziz, M.Sc. School of Computing, Dublin City University A thesis presented in fulfillment of the requirements for the degree of Doctor of Philosophy Supervisor: Dr Geoff Hamilton September 2003 “Start by doing what’s necessary; then do what’s possible; and suddenly you are doing the impossible” St. Francis of Assisi To Yowell, Olivia and Clotilde Declaration I hereby certify that this material, which I now submit for assessment on the programme of study leading to the award of the degree of Doctor of Philosophy (Ph.D.) is entirely my own work and has not been taken from the work of others save and to the extent that such work has been cited and acknowledged within the text of my work. Signed: I.D. No.: Date: Acknowledgements I would like to thank all those people who were true sources of inspiration, knowledge, guidance and help to myself throughout the period of my doctoral research. In particular, I would like to thank my supervisor, Dr. Geoff Hamilton, without whom this work would not have seen the light. I would also like to thank Dr. David Gray, with whom I had many informative conversations, and my colleagues, Thomas Hack and Fr´ed´ericOehl, for their advice and guidance. Finally, I would like to mention that the work of this thesis was partially funded by project IMPROVE (Enterprise Ireland Strategic Grant ST/2000/94). Benyamin Aziz Abstract We introduce a static analysis framework for detecting instances of security breaches in infinite mobile and cryptographic systems specified using the languages of the π-calculus and its cryptographic extension, the spi calculus.
    [Show full text]
  • Die Gruncllehren Cler Mathematischen Wissenschaften
    Die Gruncllehren cler mathematischen Wissenschaften in Einzeldarstellungen mit besonderer Beriicksichtigung der Anwendungsgebiete Band 135 Herausgegeben von J. L. Doob . E. Heinz· F. Hirzebruch . E. Hopf . H. Hopf W. Maak . S. Mac Lane • W. Magnus. D. Mumford M. M. Postnikov . F. K. Schmidt· D. S. Scott· K. Stein Geschiiftsfiihrende Herausgeber B. Eckmann und B. L. van der Waerden Handbook for Automatic Computation Edited by F. L. Bauer· A. S. Householder· F. W. J. Olver H. Rutishauser . K. Samelson· E. Stiefel Volume I . Part a Heinz Rutishauser Description of ALGOL 60 Springer-Verlag New York Inc. 1967 Prof. Dr. H. Rutishauser Eidgenossische Technische Hochschule Zurich Geschaftsfuhrende Herausgeber: Prof. Dr. B. Eckmann Eidgenossische Tecbnische Hocbscbule Zurich Prof. Dr. B. L. van der Waerden Matbematisches Institut der Universitat ZUrich Aile Rechte, insbesondere das der Obersetzung in fremde Spracben, vorbebalten Ohne ausdriickliche Genehmigung des Verlages ist es auch nicht gestattet, dieses Buch oder Teile daraus auf photomechaniscbem Wege (Photokopie, Mikrokopie) oder auf andere Art zu vervielfaltigen ISBN-13: 978-3-642-86936-5 e-ISBN-13: 978-3-642-86934-1 DOl: 10.1007/978-3-642-86934-1 © by Springer-Verlag Berlin· Heidelberg 1967 Softcover reprint of the hardcover 1st edition 1%7 Library of Congress Catalog Card Number 67-13537 Titel-Nr. 5l1B Preface Automatic computing has undergone drastic changes since the pioneering days of the early Fifties, one of the most obvious being that today the majority of computer programs are no longer written in machine code but in some programming language like FORTRAN or ALGOL. However, as desirable as the time-saving achieved in this way may be, still a high proportion of the preparatory work must be attributed to activities such as error estimates, stability investigations and the like, and for these no programming aid whatsoever can be of help.
    [Show full text]
  • The Education Column
    The Education Column by Juraj Hromkovicˇ Department of Computer Science ETH Zürich Universitätstrasse 6, 8092 Zürich, Switzerland [email protected] Informatics –New Basic Subject Walter Gander Department of Computer Science ETH Zürich [email protected] Abstract Informatics, as Computer Science is called in Europe, has become a leading science. It is high time that it be adopted as a basic subject in schools like mathematics or physics. We discuss in this article some recent develop- ments in Europe concerning informatics in schools. 1 Computers have been invented for computing! The first computers were calculating machines designed to solve engineering problems faster and with fewer errors. Consider for instance two typical repre- sentatives of computer pioneers: 1. Howard Aiken (1900-1973), a physicist, who encountered a system of dif- ferential equations during his PhD studies in 1939 which could not be solved analytically. He therefore needed to compute a numerical approximation, a tedious work by hand calculations. He envisioned an electro-mechanical computing device that could do much of the tedious work for him. This computer was originally called the ASCC (Automatic Sequence Controlled Calculator) and later renamed Harvard Mark I. With engineering, construction, and funding from IBM, the machine was completed and installed at Harvard in February, 1944.1 2. Konrad Zuse (1910-1995), civil engineer, had to solve linear equations for static calculations. This tedious calculations motivated him to think about constructing a machine to do this work. Unlike Aiken he did not look for a sponsor but installed 1936 a workshop for constructing a computer in the living room of his parents! [8] 1http://en.wikipedia.org/wiki/Howard_H._Aiken His greatest achievement was the world’s first programmable computer; the functional program-controlled Turing-complete Z3 became operational in May 1941.
    [Show full text]
  • Literaturverzeichnis
    Literaturverzeichnis ABD+99. Dirk Ansorge, Klaus Bergner, Bernhard Deifel, Nicholas Hawlitzky, Christoph Maier, Barbara Paech, Andreas Rausch, Marc Sihling, Veronika Thurner, and Sascha Vogel: Managing componentware development – software reuse and the V-Modell process. In M. Jarke and A. Oberweis (editors): Advanced Information Systems Engineering, 11th International Conference CAiSE’99, Heidelberg, volume 1626 of Lecture Notes in Computer Science, pages 134–148. Springer, 1999, ISBN 3-540-66157-3. Abr05. Jean-Raymond Abrial: The B-Book. Cambridge University Press, 2005. AJ94. Samson Abramsky and Achim Jung: Domain theory. In Samson Abramsky, Dov M. Gabbay, and Thomas Stephen Edward Maibaum (editors): Handbook of Logic in Computer Science, volume 3, pages 1–168. Clarendon Press, 1994. And02. Peter Bruce Andrews: An introduction to mathematical logic and type theory: To Truth Through Proof, volume 27 of Applied Logic Series. Springer, 2nd edition, July 2002, ISBN 978-94-015-9934-4. AVWW95. Joe Armstrong, Robert Virding, Claes Wikström, and Mike Williams: Concurrent programming in Erlang. Prentice Hall, 2nd edition, 1995. Bac78. Ralph-Johan Back: On the correctness of refinement steps in program develop- ment. PhD thesis, Åbo Akademi, Department of Computer Science, Helsinki, Finland, 1978. Report A–1978–4. Bas83. Günter Baszenski: Algol 68 Preludes for Arithmetic in Z and Q. Bochum, 2nd edition, September 1983. Bau75. Friedrich Ludwig Bauer: Software engineering. In Friedrich Ludwig Bauer (editor): Advanced Course: Software Engineering, Reprint of the First Edition (February 21 – March 3, 1972), volume 30 of Lecture Notes in Computer Science, pages 522–545. Springer, 1975. Bau82. Rüdeger Baumann: Programmieren mit PASCAL. Chip-Wissen. Vogel-Verlag, Würzburg, 1982.
    [Show full text]
  • Mathematical Sciences Meetings and Conferences Section
    page 1349 Calendar of AMS Meetings and Conferences Thla calandar lists all meetings which have been approved prior to Mathematical Society in the issue corresponding to that of the Notices the date this issue of Notices was sent to the press. The summer which contains the program of the meeting, insofar as is possible. and annual meetings are joint meetings of the Mathematical Associ­ Abstracts should be submitted on special forms which are available in ation of America and the American Mathematical Society. The meet­ many departments of mathematics and from the headquarters office ing dates which fall rather far in the future are subject to change; this of the Society. Abstracts of papers to be presented at the meeting is particularly true of meetings to which no numbers have been as­ must be received at the headquarters of the Society in Providence, signed. Programs of the meetings will appear in the issues indicated Rhode Island, on or before the deadline given below for the meet­ below. First and supplementary announcements of the meetings will ing. Note that the deadline for abstracts for consideration for pre­ have appeared in earlier issues. sentation at special sessions is usually three weeks earlier than that Abatracta of papara presented at a meeting of the Society are pub­ specified below. For additional information, consult the meeting an­ lished in the journal Abstracts of papers presented to the American nouncements and the list of organizers of special sessions. Meetings Abstract Program Meeting# Date Place Deadline Issue
    [Show full text]
  • NBS-INA-The Institute for Numerical Analysis
    t PUBUCATiONS fl^ United States Department of Commerce I I^^^V" I ^1 I National Institute of Standards and Tectinology NAT L INST. OF STAND 4 TECH R.I.C. A111D3 733115 NIST Special Publication 730 NBS-INA — The Institute for Numerical Analysis - UCLA 1947-1954 Magnus R, Hestenes and John Todd -QC- 100 .U57 #730 1991 C.2 i I NIST Special Publication 730 NBS-INA — The Institute for Numerical Analysis - UCLA 1947-1954 Magnus R. Hestenes John Todd Department of Mathematics Department of Mathematics University of California California Institute of Technology at Los Angeles Pasadena, CA 91109 Los Angeles, CA 90078 Sponsored in part by: The Mathematical Association of America 1529 Eighteenth Street, N.W. Washington, DC 20036 August 1991 U.S. Department of Commerce Robert A. Mosbacher, Secretary National Institute of Standards and Technology John W. Lyons, Director National Institute of Standards U.S. Government Printing Office For sale by the Superintendent and Technology Washington: 1991 of Documents Special Publication 730 U.S. Government Printing Office Natl. Inst. Stand. Technol. Washington, DC 20402 Spec. Publ. 730 182 pages (Aug. 1991) CODEN: NSPUE2 ABSTRACT This is a history of the Institute for Numerical Analysis (INA) with special emphasis on its research program during the period 1947 to 1956. The Institute for Numerical Analysis was located on the campus of the University of California, Los Angeles. It was a section of the National Applied Mathematics Laboratories, which formed the Applied Mathematics Division of the National Bureau of Standards (now the National Institute of Standards and Technology), under the U.S.
    [Show full text]
  • The Political Ascendance of the English Language in Computer Programming
    Talking to Machines: The Political Ascendance of the English Language in Computer Programming by Ejilayomi Mimiko B.A. (History), Simon Fraser University, 2018 Extended Essay Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Arts in the School of Communication (Dual Degree Program in Global Communication) Faculty of Communication, Art and Technology © Ejilayomi Mimiko 2019 SIMON FRASER UNIVERSITY Summer 2019 Copyright in this Work rests With the author. Please ensure that any reproduction or re-use is done in accordance With the relevant national copyright legislation. Approval Name: Ejilayomi Mimiko Degree: Master of Arts Title: Talking to Machines: The Political Ascendance of the English Language in Computer Programming Supervisory Committee: Program Director Katherine Reilly, Professor Yuezhi Zhao Senior Supervisor Professor Katherine Reilly Program Director Associate Professor Date Approved: 29th August, 2019. ii Abstract This essay explores possible reasons Why English has become the "default" natural language from Which programming commands are borroWed. Programming languages like C, C++, Java and Python use English keywords exclusively. The essay explores the social factors that underlie this phenomenon and how traditional poWer hierarchies are perpetuated. The essay is a critical response to the emancipatory rhetoric that ushered in the creation and popularization of the digital computer. It uses the story of ALGOL project to illustrate how technical goals are shaped by social factors Which inevitably reify inequality into technological artefacts. ALGOL, an attempt to create a standardized machine independent universal programming language, While answering a significant amount of technical questions, did not bridge the natural language gap. By Way of historical exploration, I argue this result is an expression of American globalization of the computing industry.
    [Show full text]
  • A Bibliography of Publications of Friedrich Ludwig Bauer
    A Bibliography of Publications of Friedrich Ludwig Bauer Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 30 January 2021 Version 1.02 Abstract This bibliography records publications of Friedrich Ludwig Bauer (10 June 1924–26 March 2015). Title word cross-reference 2p−1 ≡ 3 π $24.50 [G.70]. 3; ( p−1 ) 1 (mod p ) [Bau88]. e [Bau07c, Bau07c]. g [Bau60b]. π [Bau05a]. π(x) [Bau03d]. πe [Bau07c]. QR [RB68]. -algorithm [Bau60b]. 1 [Bau05c, Bau06d]. 105 [BS62c]. 10th [BS81]. 11 [BGHS79]. 11/27/1978 [BGHS79]. 135 [Sch69]. 153 [Bau63a]. 17-Eck [BH08]. 17-gon [BH08]. 1905 [Bau05c, Bau06d]. 1945 [Bau08b]. 1960 [AGG60]. 1964 [Ghi10]. 1971 [Dij71]. 1972 [BW72a]. 1973 [Bau75a]. 1978 [BGHS79]. 1980 [GB81]. 1988 [Bau89b]. 1989 [Bau91a]. 1990 [Bau90c]. 1991 [BBS93]. 1999 [BS00]. 1 2 2001 [Bau01a]. 2007 [Bau07e]. 20th [BS00]. 22.8.1970 [GB71]. 25.5.1980 [GB81]. 28/29 [BD01]. 292 [Chu51]. 3 [Bau95a, Leh87]. 3-211-82527-4 [Bau95a]. 3-540-13814-5 [Leh87]. 300th [Bau07c, Bau07g]. 310447Theoretische [Bau95a]. 314 [Cul72b].ˇ 367 [Cul72a].ˇ 4 [Bau95a]. 4/21/1909 [BGHS79]. 5 [Leh87]. 50 [Gep66]. 60 [BBG+60, BBG+63c, BBG+63a, BBG+76, Bau61a, BHO+67, Cul72b,ˇ Cul72a,ˇ Gep66, GHL67, NBB+60, NBB+62, NBB+63, NBB+65, NBB+97]. 68 [vWMPK69b, vWMPK69a]. 80 [Ano04, Bod04, Hei68, Kad76].
    [Show full text]