Abstract
The most natural approach to defining the quantity of information is clearly to define it in relation to the individual object (be it Homer’s Odyssey or 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.
History and References
R.J. Solomonoff, 1960/1964, A.N. Kolmogorov, 1965, and G.J. Chaitin, 1969.
A.A. Markov [Soviet Math. Dokl, 5(1964), 922–924]
G.J. Chaitin [J. ACM, 13(1966), 547–569].
M. Koppel and H. Atlan [Unpublished Manuscript] and M. Koppel [Complex Systems, 1 (1987), 1087-1091.
The Universal Turing Machine: A Half-Century Survey, R. Herken, ed., Oxford Univ. Press, 1988, 435-452].
A.N. Kolmogorov, Lecture Notes in Mathematics, vol. 1021, Springer-Verlag, 1983, 1-5.
A.N. Kolmogorov, V.A. Uspensky, Theory Probab. Appl., 32(1987), 389–412.
a.Kh. Shen’, Soviet Math. Dokl., 28(1983), 295–299.
V.V. V’yugin, Theory Probab. Appl., 32(1987), 508–512.
T.M. Cover and J.A. Thomas, Elements of Information Theory, Wiley, 1991, 169-182.
L. Löfgren [Automata Theory, E. Caianiello, Ed., Academic Press, 1966, 251-268.
Computer and Information Sciences II, J. Tou (Ed.), Academic Press, 1967, 165-175].
D.W. Loveland introduced n-strings in [Inform. Contr., 15(1969), 510–526; Proc. ACM 1st Symp. Theory Comput., 1969, 61-65]
L.A. Levin and A.K. Zvonkin [Russ. Math. Surv., 25:6(1970), 83–124]
P. Gács’s [Komplexität und Zufälligkeit, Ph.D. Thesis, J.W. Goethe Univ., Frankfurt am Main, 1978.
unpublished; Lecture Notes on Descriptional Complexity and Randomness, Manuscript, Boston University, 1987].
V.V. V’yugin, Selecta Mathematica formerly Sovietica, 13:4(1994), 357–389.
(Translated from the Russian Semiotika and Informatika, 16(1981), 14–43).
[A.K. Zvonkin and L.A. Levin, Russ. Math. Surv., 25:6(1970), 83–124].
[M. Sipser, Lecture Notes on Complexity Theory, MIT Lab Computer Science, 1985, unpublished].
[R.J. Solomonoff, Inform. Contr., 7(1964), 1–22, 224-254].
M. Sipser [Theoret. Comput. Sci., 15(1981), 291–309].
P. Martin-Löf [Inform. Contr., 9(1966), 602–619; Z. Wahrsch. Verw. Geb., 19(1971), 225-230].
G.J. Chaitin [J. ACM, 16(1969), 145–159].
[A.K. Zvonkin and L.A. Levin, Russ. Math. Surv., 25:6(1970), 83–124; P. Gács, Lecture Notes on Descriptional Complexity and Randomness, Manuscript, Boston University, 1987].
[A.K. Zvonkin and L.A. Levin, Russ. Math. Surv., 25:6(1970), 83–124]
C.P. Schnorr [Lecture Notes in Mathematics, vol. 218, Springer-Verlag, 1971].
D.E. Knuth, Seminumerical Algorithms, Addison-Wesley, 1981, pp. 142-169.
[A.N. Kolmogorov and V.A. Uspensky, Theory Probab. Appl., 32(1987), 389–412.
V.A. Uspensky, A.L. Semenov and A. Kh. Shen’, Russ. Math. Surv., 45:1(1990), 121–189].
[M. Li and P.M.B. Vitányi, Math. Systems Theory, 27(1994), 365–376].
[A.K. Zvonkin and L.A. Levin, Russ. Math. Surv., 25:6(1970), 83–124].
[J. ACM, 21(1974), 403-423; Scientific American, 232:5(1975), 47-52].
G.J. Chaitin and C.H. Bennett [C.H. Bennett and M. Gardner, Scientific American, 241:5(1979), 20–34].
[P. Gács, Lecture Notes on De-scriptional Complexity and Randomness, Manuscript, Boston University, 1987].
M. van Lambalgen [J. Symb. Logic, 54(1989), 1389–1400].
[J.M. Barzdins, Soviet Math. Dokl., 9(1968), 1251–1254, and D.W. Loveland, Proc. ACM 1st Symp. Theory Comput., 1969, 61-65].
[Russ. Math. Surv., 38:4(1983), 27-36]
[L.A. Levin, Problems Inform. Transmission, 10:3(1974), 206–210].
A.N. Kolmogorov [Problems Inform. Transmission, 1:1(1965), 1–7; IEEE Trans. Inform. Theory, IT-14(1968), 662-665.
Russ. Math. Surv., 38:4(1983), 27-36; Lecture Notes in Mathematics, vol. 1021, Springer-Verlag, 1983, 1-5]
[A.K. Zvonkin and L.A. Levin, Russ. Math. Surv., 25:6(1970), 83–124].
[A.K. Zvonkin and L.A. Levin, Russ. Math. Surv., 25:6(1970), 83–124.
A.N. Kolmogorov, Russ. Math. Surv., 38:4(1983), 27–36].
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Li, M., Vitányi, P. (1997). Algorithmic Complexity. In: An Introduction to Kolmogorov Complexity and Its Applications. Graduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2606-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2606-0_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-2608-4
Online ISBN: 978-1-4757-2606-0
eBook Packages: Springer Book Archive