Theory of algorithms. Study guide
The textbook describes various approaches to formalizing the concept of an algorithm. It discusses: the intuitive concept of a computable arithmetic function, the theory of recursive functions, recursive predicates, the refinement of the concept of an algorithm through a mathematical Turing machine and other machines, recursive and recursively enumerable sets, algorithmic problems, some estimates of the complexity of algorithms. In addition to theoretical and practical materials, the textbook contains tasks for independent work. The content of the textbook corresponds to the Federal State Educational Standard of higher Education of the third generation and the methodological requirements for educational publications. The textbook is intended for students of higher educational institutions studying in the direction of "Pedagogical education" of the profiles "Physics and Computer Science", "Technology and Computer Science", "Mathematics and Computer Science", "Computer Science and Mathematics", "Applied Computer Science". It may be useful to a wide range of readers interested in the basics of computability theory
No reviews found
