Abstract
The most natural approach to define the quantity of information is clearly to define it in relation to the individual object (Homer’s ‘Odyssey’, a particular type of dodo) rather than in relation to a set of objects from which the individual object may be selected. To do so, one could define the quantity of information in an object in terms of the number of bits required to describe it. A description of an object is evidently only useful if we can reconstruct the object from this description.
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Li, M., Vitányi, P. (1993). Algorithmic Complexity. In: An Introduction to Kolmogorov Complexity and Its Applications. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3860-5_2
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3860-5_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-3862-9
Online ISBN: 978-1-4757-3860-5
eBook Packages: Springer Book Archive