Edward Grigorievich Belaga (also Eduard Belaga) (born 22 December 1939) is a Russian mathematician. December 22 is the 356th day of the year (357th in leap years) in the Gregorian Calendar. ... 1939 (MCMXXXIX) was a common year starting on Sunday (link will take you to calendar). ... Euclid, Greek mathematician, 3rd century BC, known today as the father of geometry; shown here in a detail of The School of Athens by Raphael. ...

Born in Kiev, Belaga received his Ph.D. in mathematics, in the field of ordinary differential equations, from Moscow University in 1965. He is one of the pioneers of algebraic complexity theory and is interested in mathematical logic, philosophy of mathematics, number theory, topological methods of image treatement, quantum computations, and mathematical methods of molecular biology. He was active in the study of the Four-colour problem, and is currently working on the Collatz problem. At present (2006) he is a researcher at the Institute of Advanced Mathematical Research, of the Louis Pasteur University of Strasbourg. Location Map of Ukraine with Kyiv highlighted. ... Moscow State University campus M.V. Lomonosov Moscow State University (Московский Государственный Университет име&#1085... Digital topology deals with properties and features of two-dimensional (2D) or three-dimensional (3D) digital images that correspond to topological properties (e. ... Molecular biology is the study of biology at a molecular level. ... Example of a four color map Example of a map with non-contiguous regions The four color theorem (also known as the four color map theorem) states that given any plane separated into regions, such as a political map of the counties of a state, the regions may be colored... The Collatz conjecture is an unsolved conjecture in mathematics. ...

Selected publications

• Belaga, Edward and Mignotte, Maurice (2006) : "Walking Cautiously into the Collatz Wilderness : Algorithmically, Number-Theoretically, Randomly", to appear in the Proceedings of Mathinfo06, Nancy, Strasbourg 18–22,2006.
• Belaga, Edward and Mignotte, Maurice (2006) "The Collatz Problem and Its Generalizations: Experimental Data. Table 1. Primitive Cycles of (3n+d)-mappings" Institut de Recherche Mathématique Avancée de Strasbourg, Strasbourg.
• Belaga, Edward G.(2003) "Effective polynomial upper bounds to perigees and numbers of (3x+d)-cycles of a given oddlength" Acta Arithmetica 106(2): pp. 197–206;
• Belaga, Edward G.(2003) "Mod 3 arithmetic on triangulated Riemann surfaces", Theoretical Computer Science, Volume 263, Issue 1–2 (July 2001).
• Belaga, Edward G.(2000) "Mathematical Infinity, Its Inventors, Discoverers, Detractors, Defenders, Masters, Victims, Users, and Spectators",Institut de Recherche Mathématique Avancée de Strasbourg, Strasbourg.
• Belaga, Edward (2000) "Post-Hilbertian Programme and Its Post-Gödelian Stumbling Block. II Logical, Phenomenological, and Philosophical Limits of the Set-Theoretical Quest for Mathematical Infinity" in ELSS 2000 European Congress of the Association for Symbolic Logic, Paris;
• Belaga, Edward (1999) "Cobordism as a Basic Topological Paradigm of Virtual Computer Animation", Proceedings of the Las Vegas Conference on the Treatment of images, July 1999.
• Belaga, Edward G. (1989) "Through the mincing machine with a Boolean layer cake. Nonstandard computations over Boolean circuits in the lower-bounds-to-circuit-size complexity proving" Acta Informatica 26(4): pp. 381–407;
• Belaga, Edward (1977) "On analysis of protoschemes" in Fundamentals of Computation Theory pp. 361–366. (Series:Lecture Notes in Computer Science, Vol. 56) Springer, Berlin.
• Belaga, Edward (1977) Mashiny Tyuringa i rekursivnye funktsii [Turing machines and recursive functions] Mir, Moscow.

External links

• "Eduard Grigorievich Belaga" Mathematics Genealogy Project;