Abstract
The general idea to define complexity of a constructive object as the minimal volume of a program describing this object is due to Kolmogorov (see [Kol 65]). Independently (though in a less explicit form) similar ideas were expressed by Solomonoff in [Sol 64]. In the course of the development of this approach it was found out that different intuitive ideas of complexity correspond to different exact definitions (see, e.g., [Lov 69]). Several attempts to classify different versions of complexity notions can be found in [Lev 76], [Us 92]; the classification given below is based on ideas from [Šen’ 84].
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). The theory of complexity and entropy of constructive objects. In: Algorithms: Main Ideas and Applications. Mathematics and Its Applications, vol 251. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8232-2_20
Download citation
DOI: https://doi.org/10.1007/978-94-015-8232-2_20
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4256-9
Online ISBN: 978-94-015-8232-2
eBook Packages: Springer Book Archive