Recursion theory for programmers
The book is a textbook on the theory of recursion in the aspect of its application in the field of programming. It discusses the basics of recursion theory and its use in the development and analysis of recursive algorithms. The basic information about recursive sequences and functions is given, examples of recursive algorithms developed on the basis of recurrent relations, the decomposition method and the dynamic programming method are given, methods of developing recursive algorithms and their theoretical analysis are described, including elements of the theory of resource efficiency of computational algorithms. Methods of analysis of recursive algorithms are described in detail, illustrated by a number of examples. The application contains the texts of programs implementing recursive algorithms discussed in the main text of the book, and the results of experimental studies. The textbook is aimed at specialists in the field of computer science and algorithm analysis, developers of algorithmic software and is intended for students, postgraduates and university teachers specializing in mathematical computer science, recursion theory, development, analysis and research of recursive algorithms.
No reviews found
