Touring the Calculus Gallery
نویسنده
چکیده
1. INTRODUCTION. The premise of this article—what our friends in theatre would call its " conceit " —is that we are about to visit a gallery devoted to the history of calculus. Admittedly no such institution exists, but it is easily imagined. One need only think of an art museum, albeit one whose masterpieces are not canvases but theorems and whose masters are not Courbet and Cezanne but Leibniz and Lebesgue. Our stroll through the Calculus Gallery must be brief, and we can stop only occasionally to examine particular works in detail. Even so, the visit should provide a glimpse of the development of calculus/analysis from its appearance in the late seventeenth century, through its expansion in the eighteenth, to its " Classical Period " in the first two-thirds of the nineteenth, and on to the mature subject of today. Like any museum, we enter through a grand hall whose walls are inscribed with noble sentiments. One, from John von Neumann, catches our eye [16, p. 3]:
منابع مشابه
An Immersive and Interactive Map Touring System Based on Traveler Conceptual Models
Digital map systems can be categorized, based on the support they provide, into map navigation systems and map touring systems. Map navigation systems put more focus on helping travelers finding routes or directions instantly. By contrast, map touring systems such as Google Maps running on desktop computers are built to support users in developing their routes and survey knowledge before they g...
متن کاملAssessment concerning the Domain of Applicability of Protodiakonov Method in Calculus of Underground Structures
The sectional stresses (M, N) in a gallery lining are computed comparatively numerical by FEM taking into account the interaction underground structure – surrounding ground and analytical by Protodiakonov method. The last method is based on coincidence arch born in ground over gallery. Comprehensive analyses allow to settle the domain in which Protodiakonov method can be applied as well as the ...
متن کاملApproximate Algorithms for Touring a Sequence of Polygons
Given two points p and q and a finite number of simple polygons in a plane. The basic version of a touring-a-sequence-of-polygons problem (in brief: a touring polygons problem, TPP) is how to find a shortest path such that it starts at p, then it visits these polygons in the given order, and finally it ends at q. This paper describes approximate algorithms for different versions of touring poly...
متن کاملThe Touring Machine System (ver. 3): an Open Distributed Platform for Information Networking Applications
The Touring Machine 1 system is an open and extensible software platform to enable the construction of distributed, third-party, multi-supplier, applications that operate across heterogeneous network transport fabrics to potentially mobile users. The design and implementation of the Touring Machine system are part of an ongoing information networking technology experiment. The goals are 1) to i...
متن کاملTouring Machine: A Software Platform for Distributed Multimedia Applications
The goal of the Touring Machine project is to provide a reliable and extensible software platform that supports independently-developed distributed multimedia applications. The project includes an experimental testbed composed of a network of desktop video and audio devices controlled via user workstations. Touring Machine is more than a research testbed; it is the basis of the communications t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The American Mathematical Monthly
دوره 112 شماره
صفحات -
تاریخ انتشار 2005