Diskrētā matemātika (nepilna laika) (F.Sadirbajevs)

The Discrete Mathematics course includes computational mathematics methods and models. Main tasks of graph theory (algorithm for finding the tree of shortest paths, algorithms for finding the maximum and minimum cost flow and many others), logic functions and their minimization, finite automata and the minimization of the number of states of finite automata, an introduction to the theory of algorithms, the Turing machine and its definitions, universal Turing machine, halting and self-application problems, introduction to logic, predicates and statements, principles of formal systems (theories) construction and propositional calculus are discussed.