A Conversation with Piet Groeneboom Geurt Jongbloed
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
AB42.4.8 REMARKS on ABSTRACTO Leo Geurts Lambert
AB42 p. 56 AB42.4.8 REMARKS ON ABSTRACTO Leo Geurts Lambert Meertens Mathematlsch Centrum, Amsterdam I. ABSTRACTO LIVES If an author wants to describe an algorithm, he has to choose a vehicle to express himself. The "traditional" way is to give a description in some natural language, such as English. This vehicle has some obvious drawbacks. The most striking one is that of the sloppyness of natural languages. Hill [|] gives a convincing (and hilarious) exposition of ambiguities in ordinary English, quoting many examples from actual texts for instructional or similar purposes. The problem is often not so much that of syntactical ambiguities ("You would not recognise little Johnny now. He has grown another foot.") as that of unintended possible interpretations ("How many times can you take 6 away from a million? [...] I can do this as many times as you like."). A precise and unambiguous description may require lengthy and repetitious phrases. The more precise the description, the more difficult it is to understand for many, if not most, people. Another drawback of natural languages is the inadequacy of referencing or grouping methods (the latter for lack of non-parenthetical parentheses). This tends to give rise to GOTO-like instructions. With the advent of modern computing automata, programming languages have been invented to communicate algorithms to these computers. Programming languages are almost by definition precise and unambiguous. Nevertheless, they do not provide an ideal vehicle for presenting algorithms to human beings. The reason for this is that programming languages require the specification of many details which are relevant for the computing equipment but not for the algorithm proper. -
301669474.Pdf
Centrum voor Wiskunde en Informatica Centre for Mathematics and Computer Science L.G.L.T. Meertens Paramorphisms Computer Science/ Department of Algorithmics & Architecture Report CS-R9005 February Dib'I( I, 1fle.'1 Cootrumvoor ~', ;""'" ,,., tn!o.-1 Y.,'~• Am.,t,..-(,';if'! The Centre for Mathematics and Computer Science is a research institute of the Stichting Mathematisch Centrum, which was founded on February 11, 1946, as a nonprofit institution aiming at the promotion of mathematics, com puter science, and their applications. It is sponsored by the Dutch Govern ment through the Netherlands Organization for the Advancement of Research (N.W.O.). Copyright © Stichting Mathematisch Centrum, Amsterdam Paramorphisms Lambert Meertens CWI, Amsterdam, & University of Utrecht 0 Context This paper is a small contribution in the context of an ongoing effort directed towards the design of a calculus for constructing programs. Typically, the development of a program contains many parts that are quite standard, re quiring no invention and posing no intellectual challenge of any kind. If, as is indeed the aim, this calculus is to be usable for constructing programs by completely formal manipulation, a major concern is the amount of labour currently required for such non-challenging parts. On one level this concern can be addressed by building more or less spe cialised higher-level theories that can be drawn upon in a derivation, as is usual in almost all branches of mathematics, and good progress is being made here. This leaves us still with much low-level laboriousness, like admin istrative steps with little or no algorithmic content. Until now, the efforts in reducing the overhead in low-level formal labour have concentrated on using equational reasoning together with specialised notations to avoid the introduction of dummy variables, in particular for "canned induction" in the form of promotion properties for homomorphisms- which have turned out to be ubiquitous. -
CWI Scanprofile/PDF/300
Centrum voor Wiskunde en lnformatica Centre for Mathematics and Computer Science L.G.L.T. Meertens, S. Pemberton An implementation of the B programming language Department of Computer Science Note CS-N8406 June Biblioiiie.:;I( ~'~'l'i't'Hm.n<' Wi~f.i;r;de- c11 !nform;:,;i:i.C<a - Ams1errJar11 AN IMPLEMENTATION OF THE B PROGRAMMING LANGUAGE L.G.L.T. MEERTENS, S. PEMBERTON CentPe foP Mathematics and ComputeP Science~ AmstePdam Bis a new programming language designed for personal computing. We describe some of the decisions taken in implementing the language, and the problems involved. Note: B is a working title until the language is finally frozen. Then it will acquire its definitive name. The language is entirely unrelated to the predecessor of C. A version of this paper will appear in the proceedings of the Washington USENIX Conference (January 1984). 1982 CR CATEGORIES: 69D44. KEY WORDS & PHRASES: programming language implementation, progrannning envi ronments, B. Note CS-N8406 Centre f~r Mathematics and Computer Science P.O. Box 4079, 1009 AB Amsterdam, The Netherlands I The programming language B B is a programming language being designed and implemented at the CWI. It was originally started in 1975 in an attempt to design a language for beginners as a suitable replacement for BASIC. While the emphasis of the project has in the intervening years shifted from "beginners" to "personal computing", the main design objectives have remained the same: · • simplicity; • suitability for conversational use; • availability of tools for structured programming. The design of the language has proceeded iteratively, and the language as it now stands is the third iteration of this process. -
NOTICES Was Sent to Press, the Meeting Dates Which Fall Rather Far in the Future Are Subject Tr Change
AMERICAN MATHEMATICAL SOCIETY Nottces Edited by GORDON L. WALKER Contents MEETINGS Calendar of Meetings • • • . • • • • • • • • . • • • • • . • • • • • • 4 Program of the February Meeting in Tucson • • • . • . • . • . 5 Abstracts for the Meeting, pp. 80-84 Program of the February Meeting in New York ••••••••• 10 Abstracts for the Meeting, pp. 85-94 PRELIMINARY ANNOUNCEMENTS OF MEETINGS ••••••.••• 15 ACTIVITIES OF OTHER ASSOCIATIONS ••••••••••••••••• 19 NEWS ITEMS AND ANNOUNCEMENTS •••••••••••••••••• 27 FOREIGN SCIENCE INFORMATION •••••••••.•••••••••• 38 PERSONAL ITEMS •••••••.•••••••••.••••••••••••• 47 NEW PUBLICATIONS ••••••••••••••••••••••••••••. 50 CATALOGUE OF LECTURE NOTES - Supplement No.1 . • • • • • 57 ABSTRACTS OF CONTRIBUTED PAPERS • • • • • • . • • • • • • • • 59 RESERVATION FORM . • . • • • • • • • • • • . • • • • • . • . • • • • • • 99 3 MEETINGS CALENDAR OF MEETINGS NOTE: This Calendar lists all of the meetings which have been approved by the Council up to the date at which this issue of the NOTICES was sent to press, The meeting dates which fall rather far in the future are subject tr change. This is particularly true of the meetings to which no numbers have yet been assigned, Meet Deadline ing Date Place for No, Abstracts* 567 April 14-16, 1960 New York, New York Mar. 1 568 April 22-23, 1960 Chicago, Illinois Mar, 1 569 April 22-23, 1960 Berkeley, California Mar, 570 June 18, 1960 Missoula, Montana May 5 571 August 29-September 3, 1960 East Lansing, Michigan July 15 (65th Summer Meeting) 572 October 22, 1960 Worcester, Massachusetts Sept. 8 January 24-27, 1961 Washington, D. C. (67th Annual Meeting) August, 1961 Stillwater, Oklahoma (66th Summer Meeting) January, 1962 Kansas City, Missouri (68th Annual Meeting) August, 1962 Vancouver, British Columbia (67th Summer Meeting) August, 1963 Boulder, Colorado (68th Summer Meeting) *The abstracts of papers to be presented at the meetings must be received i. -
Publiek Domein Laat Bedrijven Te Veel Invullen
Steven Pemberton, software-uitvinder en bouwer aan het World wide web Publiek domein laat bedrijven te veel invullen De Brit Steven Pemberton is al sinds 1982 verbonden aan het Centrum voor Wiskunde Informatica (CWI) in Amsterdam. Ook hij is een aartsvader van het internet. Specifiek van het World wide web, waarvan hij destijds dicht bij de uitvinding zat. Steven blijft naar de toekomst kijken, nog met dezelfde fraaie idealen. C.V. 19 februari 1953 geboren te Ash, Surrey, Engeland 1972-1975 Programmeur Research Support Unit Sussex University 1975-1977 Research Programmer Manchester University 1977-1982 Docent Computerwetenschap Brighton University 1982-heden Onderzoeker aan het Centrum voor Wiskunde & Informatica (CWI) Verder: 1993–1999 Hoofdredacteur SIGCHI Bulletin en ACM Interactions 1999–2009 Voorzitter HTML en XHTML2 werkgroepen van W3C 2008-heden Voorzitter XForms werkgroep W3C The Internet Guide to Amsterdam Homepage bij het CWI Op Wikipedia 1 Foto’s: Frank Groeliken Tekst: Peter Olsthoorn Steven Pemberton laat zich thuis interviewen, op een typisch Amsterdamse plek aan de Bloemgracht, op de 6e etage van een pakhuis uit 1625 met uitzicht op de Westertoren. Hij schrijft aan een boek, een voortzetting van zijn jaarlijkse lezing in Pakhuis de Zwijger, met in 2011 The Computer as Extended Phenotype (Computers, Genes and You) als titel. Wat is je thema? “De invloed van hard- en software op de maatschappij, vanuit de nieuwe technologie bezien. ‘Fenotype’ gaat over computers als product van onze genen, als een onderdeel van de evolutie. Je kunt de aanwas van succesvolle genen zien als een vorm van leren, of een vorm van geheugen. -
Ezért Érdemes Pythonban Fejleszteni Dr.Guta Gábor
Ezért érdemes Pythonban fejleszteni Dr.Guta Gábor http://axonmatics.com Mennyire népszerű? index/ (7) - Forrás: https://www.tiobe.com/tiobe Forrás: 2019 (C) Axonmatics Ltd. - Air Quality Monitoring and Control for a Confidential Healthier City http://axonmatics.com 2019.11.27. – Dr. Guta Gábor Miért népszerű? Az ABC nyelv elveinek a továbbgondolása: • Egyszerű, python • Kompakt, - • Strukturált, • Kifejező, • Egységes, • Magas-szintű, https://freesvg.org/happy : • Egyértelmű, Forrás • Interaktív (Adaptálva: Leo Geurts, Lambert Meertens, and Steven Pemberton: The ABC Programmer's Handbook) http://axonmatics.com 2019.11.27. – Dr. Guta Gábor Miért népszerű? (folyt.) Hatékonyság: • Megvalósítandó feladat/ráfordított idő python - • Átlagos commit méret (KLOC-ban) Elérhetőség: https://freesvg.org/happy • Eszköz támogatás : • Oktató anyag/dokumentáció Forrás • Képzett emberek http://axonmatics.com 2019.11.27. – Dr. Guta Gábor Miért lehet utálni? mouth • Formázás (tabulálás) - • Nincs típusosság (de, van) • Nem olyan mint a megszokott/kedvenc programozási nyelv http://www.peakpx.com/5335/python • Lassú (általában ez nem gond, Forrás: de orvosolható) (Környezetemben hangzottak el) http://axonmatics.com 2019.11.27. – Dr. Guta Gábor Kik használják a nagyvilágban? • Web oldalak: Instagram, YouTube, Printest, Prezi… “Python where we • Cégek: Dropbox, Google, can, C++ where Bloomberg, Spotify… we must.” • Alkalmazások: Gedit, yum, Home Assistant, Cura… http://axonmatics.com 2019.11.27. – Dr. Guta Gábor Mire használják a nagyvilágban? 2019/python/ Fejlesztők -
Group Actions on Dendrites and Curves 3
GROUP ACTIONS ON DENDRITES AND CURVES BRUNO DUCHESNE AND NICOLAS MONOD ABSTRACT. We establish obstructions for groups to act by homeomorphisms on dendrites. For instance, lattices in higher rank simple Lie groups will always fix a point or a pair. The same holds for irreducible lattices in products of connected groups. Further results include a Tits alternative and a description of the topological dynamics. We briefly discuss to what extent our results hold for more general topological curves. 1. INTRODUCTION 1.A — Dendrites. Recall that a dendrite is a locally connected continuum without simple closed curves. Other equivalent definitions and some basic facts are recalled in Section 2 below. A simple example of a dendrite is obtained by compactifying a countable simplicial tree (Section 12), but the typical dendrite is much more complicated: certain Julia sets are den- drites [BT07] and Wazewski’s˙ universal dendrite [Waz23a]˙ can be identified with the Berkovich projective line over Cp [HLP14]. The homeomorphisms group of some dendrites is enor- mous (Section 12), whilst for others it is trivial [dGW58, p. 443]. In fact, it was recognized early on [Why28, Why30] that any continuum has a canoni- cal dendrite quotient reflecting its cut-point structure, see [Bow98], [PS06] for the general statement. Bowditch made remarkable use of this quotient [Bow99b], leading to the solu- tion of the cut-point conjecture for hyperbolic groups [Bow99a, Swa96]. In this application, Bowditch’s dendrites retained a decidedly geometric aspect inherited from the hyperbolic group, namely the dynamical convergence property, allowing him to reconstruct a metric tree with an isometric action. -
Bibliography 161
160 Biblio graphy [1] C. J. Aarts, R. C. Backhouse, P. Ho ogendijk, T. S. Vo ermans, and J. van der Woude, ARelational Theory of Datatypes. Available via anonymous ftp from ftp.win.tue.nl in directory pub/math.prog.construction, Eindhoven University of Technology 1992. [2] H. Abrahamson and V. Dahl, Logic Grammars. Springer-Verlag 1989. [3] Peter Aczel, An introduction to Inductive De nitions. In: Handb o ok of Mathematical Logic (ed. Jon Barwise), North Holland 1977, pp. 739{782. [4] Peter Aczel, Non-wel l-founded Sets. CSLI Lecture Notes no. 14, Stanford 1988. [5] Roland Backhouse, Paul Chisholm, Grant Malcolm, and Erik Saaman, Do-it-yourself type theory. Formal Asp ects of Computing 1 (1989), pp. 19{84. [6] R.C. Backhouse, On a Relation on Functions. In: Beauty Is Our Business|A Birthday Salute to Edsger W. Dijkstra (ed. W.H.J. Feijen e.a.), Springer Verlag 1990, pp. 7{18. [7] R.C. Backhouse, P.J. de Bruin, G.R. Malcolm, T.S. Vo ermans, and J.C.S.P. van der Woude, Relational catamorphisms. In: Constructing Programs From Sp eci cations, North Holland 1991, pp. 287{318. [8] Roland Backhouse and Henk Do ornb os, Mathematical Induction Made Calculational. CS- rep ort 94-16, Eindhoven University of Technology 1994. [9] E.S. Bainbridge, P.J. Freyd, A. Scedrov, and P.J. Scott, Functorial Polymorphism. Theo- retical Computer Science 70 (1990), pp. 35{64. [10] Erik Barendsen and Marc Bezem, Bar Recursion versus Polymorphism.Technical Rep ort 81, Utrecht Research Institute for Philosophy, Utrecht University 1991. -
Connected Sum at Infinity and Cantrell-Stallings Hyperplane Unknotting
CONNECTED SUM AT INFINITY AND CANTRELL-STALLINGS HYPERPLANE UNKNOTTING JACK S. CALCUT, HENRY C. KING, AND LAURENT C. SIEBENMANN Dedicated to Ljudmila V. Keldysh and the members of her topology seminar on the occasion of the centenary of her birth.1 1. Introduction We give a general treatment of the somewhat unfamiliar operation on manifolds called connected sum at infinity or CSI for short. A driving ambition has been to make the geometry behind the well defi- nition and basic properties of CSI as clear and elementary as possible. CSI then yields a very natural and elementary proof of a remark- able theorem of J.C. Cantrell and J.R. Stallings [Can63, Sta65]. It as- serts unknotting of cat embeddings of Rm−1 in Rm with m 6= 3, for all three classical manifold categories: topological (= top), piecewise linear (= pl), and differentiable (= diff) — as defined for example in [KS77]. It is one of the few major theorems whose statement and proof can be the same for all three categories. We give it the acronym HLT, which is short for “Hyperplane Linearization Theorem” (see The- orem 6.1 plus 7.3). We pause to set out some common conventions that are explained in [KS77] and in many textbooks. By default, spaces will be assumed metrizable, and separable (i.e. having a countable basis of open sets). arXiv:1010.2707v1 [math.GT] 13 Oct 2010 Simplicial complexes will be unordered. A pl space (often called a polyhedron) has a maximal family of pl compatible triangulations by Date: September 17, 2008 (revised October 12, 2010). -
A Counterexample in the Theories of Compactness and of Metrization 1)
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector MATHEMATICS A COUNTEREXAMPLE IN THE THEORIES OF COMPACTNESS AND OF METRIZATION 1) BY FRANKLIN D. TALL (Communicated by Prof. H. FEEUDENTHAL at the meeting of May 26, 1973) The fact that the Baire category theorem held for both compact Haus- doti spaces and complete metric spaces led to a search for a natural class of spaces encompassing both of these classes and satisfying the theorem. The first successful attempt was due to TECH [5]-the so-called de& complete spaces. There have been numerous additional attempts since then. In addition to Tech completeness, we shall only deal with two concepts closely related to each other, basis-compactness [lo] and co- compactness [l]. A comprehensive survey [2] of these and many more completeness properties by J. M. AARTS and D. J. LUTZER is in preparation. I am indebted to them for many stimulating thoughts on the subject. We shall present an example to show that neither basis-compactness nor cocompactness is implied by Tech completeness. The example has a number of other interesting properties- it is a metacompact locally metrizable Moore space which is not metrizable, but may, consistently with the axioms of set theory, be assumed normal. The example’s sig- nificance in metrization theory is dealt with in [9]. Here we will confine ourselves to completeness questions. DEFINITION. A space (we assume all spaces completely regular) is tech complete if it is a Ga in its Stone-Tech compactification. -
(Pdf) of the School of Squiggol: a History of the Bird−Meertens
The School of Squiggol A History of the Bird{Meertens Formalism Jeremy Gibbons University of Oxford Abstract. The Bird{Meertens Formalism, colloquially known as \Squig- gol", is a calculus for program transformation by equational reasoning in a function style, developed by Richard Bird and Lambert Meertens and other members of IFIP Working Group 2.1 for about two decades from the mid 1970s. One particular characteristic of the development of the Formalism is fluctuating emphasis on novel `squiggly' notation: sometimes favouring notational exploration in the quest for conciseness and precision, and sometimes reverting to simpler and more rigid nota- tional conventions in the interests of accessibility. This paper explores that historical ebb and flow. 1 Introduction In 1962, IFIP formed Working Group 2.1 to design a successor to the seminal algorithmic language Algol 60 [4]. WG2.1 eventually produced the specification for Algol 68 [63, 64]|a sophisticated language, presented using an elaborate two- level description notation, which received a mixed reception. WG2.1 continues to this day; technically, it retains responsibility for the Algol languages, but practi- cally it takes on a broader remit under the current name Algorithmic Languages and Calculi. Over the years, the Group has been through periods of focus and periods of diversity. But after the Algol 68 project, the period of sharpest focus covered the two decades from the mid 1970s to the early 1990s, when what later became known as the Bird{Meertens Formalism (BMF) drew the whole group together again. It is the story of those years that is the subject of this paper. -
Bitonic Sort on Ultracomputers by Lambert Meertens† Ultracomputer
Bitonic Sort on Ultracomputers by Lambert Meertens† Ultracomputer Research Laboratory Courant Institute of Mathematical Sciences 715 Broadway, 10th Floor New York, NY 10003 Ultracomputer Note #1 March, 1979 † Matematisch Centrum, Amsterdam ABSTRACT Batcher’s bitonic sort (cf. Knuth, v. III, pp. 232 ff) is a sorting network, capable of sort- ing n inputs in !((log n)2) stages. When adapted to conventional computers, it gives rise to an algorithm that runs in time !(n(log n)2). The method can also be adapted to ultracomputers (Schwartz [1979]) to exploit their high degree of parallelism. The resulting algorithm will take time !((log N)2) for ultracomputers of ‘‘size’’ N. The im- plicit constant factor is low, so that even for moderate values of N the ultracomputer ar- chitecture performs faster than the !(N log N) time conventional architecture can achieve. The purpose of this note is to describe the adapted algorithm. After some preliminaries a first version of the algorithm is given whose correctness is easily shown. Next, this algorithm is transformed to make it suitable for an ultracomputer. 1. Introduction Batcher’s bitonic sort (cf. Knuth, v. III, pp. 232 ff) is a sorting network, capable of sorting n inputs in !((log n)2) stages. When adapted to conventional computers, it gives rise to an algorithm that runs in time !(n(log n)2). The method can also be adapted to ultracomputers (Schwartz [1979]) to exploit their high degree of parallelism. The resulting algorithm will take time !((log N)2) for ultracomputers of ‘‘size’’ N. The implicit constant factor is low, so that even for moderate values of N the ultracomputer architecture performs faster than the !(N log N) time conventional architecture can achieve.