Abstract
We know how to measure distance from Turku to Toronto. However, do you know how to measure the distance between two information carrying entities? For example: two genomes, two music scores, two programs, two articles, two emails, two concepts, or from a question to an answer? Furthermore, such a distance measure must be application-independent, must be universal in the sense it is provably better than all other distances, and must be applicable.
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
References
Li, M., Vitanyi, P.: An introduction to Kolmogorov complexity and its applications, 3rd edn. Springer, Heidelberg (to appear in 2007/2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, M. (2007). Information Distance and Applications. In: Harju, T., Karhumäki, J., Lepistö, A. (eds) Developments in Language Theory. DLT 2007. Lecture Notes in Computer Science, vol 4588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73208-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-73208-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73207-5
Online ISBN: 978-3-540-73208-2
eBook Packages: Computer ScienceComputer Science (R0)