Algorithms Theory. Educational manual
Please sign in so that we can notify you about a reply
The textbook presents 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, clarification of the algorithm concept through Turing machines and other machines, recursive and recursively enumerable sets, algorithmic problems, some complexity estimates of algorithms. In addition to theoretical and practical materials, the textbook contains assignments for independent work. The content of the textbook corresponds to the Federal State Educational Standard of Higher Education of the third generation and methodological requirements for educational publications. The textbook is intended for students of higher educational institutions studying in the field of "Pedagogical Education" with profiles in "Physics and Informatics," "Technology and Informatics," "Mathematics and Informatics," "Informatics and Mathematics," and "Applied Informatics." It may be useful to a wide range of readers interested in the fundamentals of computability theory.
Author:
Author:Matrosov Viktor Leonidovich, Mirzoev Makhmasharif Sayfovich
Cover:
Cover:hardcover
Category:
- Category:Computer & Technology
- Category:Education & Teaching
Publication language:
Publication Language:Russian
Paper:
Paper:offset
Dimensions:
Dimensions:20.5x14.5x1.5 cm
ISBN:
ISBN:978-5-907100-65-7
No reviews found