014w: Algorithmic Presentations in Mathematics

Nikolay Bazhenov, Sobolev Institute of Mathematics of SB RAS

Iskander Kalimullin, Kazan Federal University

Omega Sirius Hotel, 'Turin' conference-hall

In computable (or effective) mathematics one studies algorithmic properties of mathematical objects. The problems of effectivity were raised in Hilbert's problems (in particular, in the 2nd and the 10th problems), as well as in the works of M. Dehn (at the beginning of the XXth century) who initiated the study of the word problems in group theory. In the 1930s A. Turing, K. Hödel, and others have developed the formal definition of an algorithm.

Nowadays the computable mathematics is an active research field, its leading specialists work at the most prestigious universities in the world. In Russia, such investigations are conducted by large scientific schools in Kazan, Moscow, and Novosibirsk.

In the last decade, there were obtained significant advances in various branches of the effective mathematics: effective algebra, computable analysis, and computation theory with limited resources. These directions are interrelated, there is no clear border between them. During the conference, we plan to discuss recent advances in contemporary computable mathematics.

Sirius University of Science and Technology provides travel support and accommodation including breakfasts and lunches for all participants. For further inquiries please write to  smc@sochisirius.ru.

External web-site