Abstract
A.N.Kolmogorov writes in his preface [Kol 54]: “The distinction between “constructive” and “nonconstructive” plays a big role in the modern mathematical thinking”. And later: “Theoretically speaking any natural number can be given constructively as 1+1+1+...+1.”
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
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). Preliminary notions of the theory of algorithms: constructive objects and aggregates; local properties and local actions. In: Algorithms: Main Ideas and Applications. Mathematics and Its Applications, vol 251. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8232-2_3
Download citation
DOI: https://doi.org/10.1007/978-94-015-8232-2_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4256-9
Online ISBN: 978-94-015-8232-2
eBook Packages: Springer Book Archive