Edward Grigorievich Belaga (also Eduard Belaga)) Russian mathematician.
Belaga received his Ph.D. in mathematics from Moscow University in 1965. His major field was in the philosophy of mathematics, and he was particularly interested in the four-colour problem. Until his retirement in 2006, he was a professor at the Institute of Advanced Mathematical Research, Louis Pasteur University of the University of Strasbourg.
Selected publications
- 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 (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 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.