A Member of the Russian Academy of Sciences (RAS) and
of the Russian Academy of Education (RAE),
Doctor of Science (Phys&Math),
Rector, Moscow State University of Education
Prof. A. Semenov is an expert in mathematical logic, algorithm theory, theoretical and applied programming.
Prof. A. Semenov was born on October 13, 1950 in Moscow. In 1972 he graduated from the School of Mechanics and Mathematics, Moscow State University. He was a professor in the Dept. of Mathematical Logic; head, Algorithms Theory and Linguistic Tools Lab, Cybernetics Board, USSR Academy of Sciences, vice project leader, School-1 Project, USSR Academy of Sciences; he served as Vice Head, Dept. of Education, Moscow City Hall.
Since 1993 he has been Rector, Moscow Open Education Institute (Moscow Teachers Retraining Institute prior to 2002). Since August, 2013 he is Rector, Moscow State University of Education.
Prof. A. Semenov’s contribution to theoretical computer science includes his achievements in formal grammar, software flowcharts and dynamic logic, relational algebra, automata-based relations, resolving algorithms for a number of mathematical theories; he has developed the algorithmic randomness theory of finite sequences, the parallel Kolmogorov combinatorial incidence theory based on the Kolmogorov complexity concept; he has solved the Kolmogorov problem of accurate randomness test evaluation.
Prof. A. Semenov has organized and has been directly involved in the development of the first domestic high school computer science textbook, federal computer science textbooks and digital tutorials on various subjects for primary and middle school, the Russian General Education Portal covering on-hands experience with IT and telecommunication technology at high schools; he is chief designer for the Education area, Digital Moscow Program.
Major Publications: IT for Education. Course Curriculum (2000); Open and Distance Learning. Trends, Policy, Strategies (2004); IT Competence of Students and Teachers (2004); IT for Training Teachers. A Planning Guide (2005); IT for Education: Middle School Curriculums and Teacher Retraining Programs (2005); Digital Tutorials for General and Primary Vocational Education(2005); IT for General Education. Theory and Applications (2006).
Prof. A. Semenov has been awarded the RF President Education Award (1998); the Kolmogorov Award, Russian Academy of Sciences (2006) for his outstanding contribution to mathematics, a Russian Government Award (2009), a UNESCO Award (2009).
1. Semenov A. L., Atanasyan S. L., Karakozov S. D. Key Ideas of the Russian Mathematical Education Development Concept // Computer Science for High School: Past, Present and Future: IT for Education National Conference Proceedings. Perm : Perm National Research University, 2014. P. 264-266.
2. Semenov A. L. Two Cultures in Modern School (Part 1) // Mathematics in High School. 2014. No. 5. P. 21-26.
3. Semenov A. L. Two Cultures in Modern School (Part 2) // Mathematics in High School. 2014. No. 6. P. 21-26.
4. Semenov A. L., Atanasyan S. L. Teaching Math Competence in General School // Science and School. 2014. No. 5. P. 7-12.
5. 3,000 Math Problems with Answers: All B Category Final Exam Problems / Edited by Prof. A. Semenov, I. V. Yashchenko. Moscow : Examen Publishing, 2013. 542 p, illustrated.
6. Semenov A. L. The Mathematics of Texts. Moscow : Moscow Continuous Education Center Publishing, 2008. 16 p.
7. Semenov A. L. IT for General Education. Theory and Applications. Moscow : INT RF, 2006. 327 p [ordered by UNESCO].
8. Semenov A. L., Averkin Yu. A., Matveeva N. V., Rudchenko T. A. Tutorials for Topic-Based Computer Science Testing in Primary School. Moscow : Binom Publishing, Laboratory of Knowledge, 2004. 98 p.
9. Semenov A. L., Zvonkin A. K., Lando S. K., Shen A. Kh. Algorithmics. Tutorials. Moscow : Drofa Publishing, 1994; 1996; 1997, 1998; Moscow : INT, 1991. 72 p.
10.Semenov A. L., Shen A. Kh. Simple and Complicated Programming Problems. Moscow : Nauka Publishing, 1987. 78 p.
11.Uspensky V. A., Semenov A. L. The Theory of Algorithms. Basic Discoveries and Applications. Moscow : Nauka Publishing, 1987. 288 p.
12.Semenov A. L. On the Definability of Arithmetic and Its Fragments // Academy of Sciences Proceedings. 1982. Vol. 263. No. 1. P. 44-47.
13.Semenov A. L., Soprunov S., Uspensky V. A. The Lattice of Definability. Origins, Recent Developments, and Further Directions. Computer Science: Theory and Applications, Lecture Notes in Comput. Sci., 8476, Springer, Cham, 2014. P. 23-38.
14.Semenov A. L., Uspensky V. A. Algorithms: Main Ideas and Applications // Kluwer Academic Publishers, Mathematics and Its Applications, 1993. V. 251. 310 p.