Seminars of Alexander A. Stepanov
- From RSS
We open registration for two seminars at once, which will take place on April 19 and 20, 2010 , in the Moscow office of Yandex .
Alexander Alexandrovich Stepanov , a well-known programming specialist, founder of the Generic programming approach (general programming) and creator of the Standard Template Library (STL) in C ++, comes to visit us .
Stepanov A.A. - author of the monograph on generalized programming Elements of Programming ( “The book contains some of the most beautiful code I have ever seen.” - Bjarne Stroustrup, Designer of C ++ ).
Alexander Alexandrovich has vast administrative and technical experience in world-class companies: General Electric Research Center, HP Labs, CTO of Server and Supercomputer Business Unit in SGI, VP and Chief Architect at AT&T, Compaq, Adobe. Currently works at A9.com (Amazon).
On April 19, a speech will be held on the topic: The greatest general measure: the last 2500 years (Originally prepared as the 1999 Arthur Schoffstall Lecture in Computer Science and Computer Engineering at the Rensselaer Polytechnic Institute).
The purpose of the lecture is to convince the listener that mathematics and algorithmics are one, and that their unity is the central theme of our civilization. The idea of generalized algorithms was not invented by us, but has an ancient history.
The study of mathematics develops an architectural talent - the talent to organize knowledge - which is necessary for programmers. The Beginnings of Euclid is a great tutorial for developers of complex systems.
A scientist needs to know the history of his discipline in order to distinguish between the important and the secondary.
April 20 will be held presentation on the topic: Transformations and their orbits (Transformations and their orbits).
A conversion is a unary regular function that returns an object of the same type. Repeated applications of the transformation to the initial object determine the orbit of this object. Using only the regularity of the transformation and the finiteness of the orbit, an algorithm is given for determining the structure of the orbit, applicable for various applications - for example, to detect a cycle in a list or to analyze a pseudo-random number generator. The interface to the algorithm, the procedures associated with it, their parameters and return values are defined. Using the analysis of the algorithm for determining the structure of the orbit, we introduced our approach to programming using the simplest example.
You can register for the event by calling (495) 739-7000 - do not forget to tell which seminar you plan to attend. Participation in the seminars is free, the number of places is limited.
The event starts at 17:30, but in order to manage to take a seat and not be late for the beginning of the lecture, it is better to approach 17:00.
Yulia Simutenko, we train and develop