Abstract
It is surprising to realize how much we can learn from the theory of algorithms. It helps to clarify fundamental concepts such as provability, complexity, and randomness. The discoveries in the theory of algorithms (as, probably, in many other cases) consist not so much of obtaining new results as of introducing new concepts and refining old ones. A.Maltsev wrote in this connection: “A system of concepts and a language are not something external for a mathematical theory but constitute an essential part of it” [Mal 66, p.72].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Uspensky, V., Semenov, A. (1993). Introduction. In: Algorithms: Main Ideas and Applications. Mathematics and Its Applications, vol 251. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8232-2_1
Download citation
DOI: https://doi.org/10.1007/978-94-015-8232-2_1
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4256-9
Online ISBN: 978-94-015-8232-2
eBook Packages: Springer Book Archive