Algorithms: Main Ideas and Applications

the long version

The theory of algorithms not only answers philosophical questions but also is eminently applicable to practical computing, as well as to software and hardware design. This book presents exact mathematical formulations of major concepts and facts of the theory of algorithms in a unified and elegant way. Precise mathematical statements are given, together with their underlying motivations, philosophical interpretations and historical developments, starting with Frege, Hilbert and Borel through Gödel and Turing up to Kolmogorov's results of 1950-1980. The book is divided into two parts. The first part outlines the fundamental discoveries of the general theory of algorithms. Numerous applications are discussed in the second part. The concept of probabilistic algorithms is presented in the Appendix. This work will be of interest to mathematicians, computer scientists, engineers and to everyone who uses algorithms.