From 2001 to August 31, 2025, I taught at the Department of Mathematics of the Faculty of Mechanics and Mathematics of the Al-Farabi Kazakh National University.
Since September 1, 2025, I have been working at the Department of Biochemical Engineering at the International University of Engineering and Technology.
1995 - 1999 Al-Farabi Kazakh National University. Bachelor`s degree in Mathematics.
1999 - 2001 Al-Farabi Kazakh National University. Master`s degree of Mathematics.
2001 - 2004 Al-Farabi Kazakh National University. Postgraduate study in Mathematics, In 2006, I defended my PhD dissertation.
I am currently studying new articles in computability theory.
1. On positive numberings in Ershov' hierarchy// The Bullletin on Siybolic Logic.2002., Vollume 8, Issue 1, P. 178.
2. Positive numberings of families of sets in the Ershov hierarchy // Algebra and Logic. 2003, Volume 42, №6, P.413-418.
Математиканың өзінде де, оны жүзеге асыруда да пайда болатын дискретті құрылымдардың қасиеттерін зерттейтін математика саласы. Бұл жағдайда дискретті құрылымдар қажетті сипаттамалары мәндердің шекті санын қабылдайтын объектілер деп аталады. Мұндай құрылымдарға, мысалы, ақырлы топтар, ақырлы графиктер, ақпаратты түрлендіргіштердің кейбір математикалық модельдері, ақырлы автоматтар, Тьюринг машиналары жатады.
The goal and objectives of the discipline are to familiarize themselves with the basic algorithms of discrete mathematics and mastering the main results of this discipline for creating software products and modeling real processes, the development of logical thinking and mathematical culture in students, necessary for studying mathematics (and indeed for carrying out research work) , development of mathematical (qualitative, analytical and geometric) intuition. Learning outcomes: after completing the course, the student should know: basic fundamental concepts of discrete mathematics: algorithms of number theory and combinatorial schemes, basic concepts and results of graph theory, basic concepts of logic algebra, as well as ways of representing algorithms of discrete mathematics; be able to: apply the knowledge gained while studying the course "Discrete Mathematics" for solving applied problems; find solutions for comparing the first and second order, solve comparison systems, skillfully apply basic combinatorial principles, build the Perfect Disjunctive Normal Form and the Perfect Conjunctive Normal Form, construct Zhegalkin polynomials for specific Boolean functions, be competent in matters of professional activity related to algorithms of discrete mathematics.
The purpose of the discipline is to form students' theoretical knowledge and practical skills in the field of mathematics. The course studies the mathematical apparatus that helps to model, analyze and solve practical problems with applications and forms the skills of applying the basic laws of mathematics, the basics of mathematical logic, the ability to expand the scope of the laws of mathematical logic in the social scientific sphere.
The purpose of the discipline is to form the student's basic concepts of laws and theories of higher mathematics sections, as well as practical skills to use the studied techniques and methods to solve specific practical problems of real processes.