Kolmogorov complexity (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Kolmogorov complexity" in English language version.

refsWebsite

Global rank English rank

14doi.org

2^nd place

7semanticscholar.org

11^th place

8^th place

4ghostarchive.org

32^nd place

21^st place

4archive.org

6^th place

3std.com

low place

3arxiv.org

69^th place

59^th place

2ams.org

451^st place

277^th place

2harvard.edu

18^th place

17^th place

2worldcat.org

5^th place

2web.archive.org

1^st place

2psu.edu

207^th place

136^th place

2springer.com

274^th place

309^th place

1handle.net

102^nd place

76^th place

1umd.edu

1,747^th place

1,277^th place

1mathnet.ru

8,783^rd place

low place

1au.dk

8,222^nd place

8,022^nd place

1free.fr

321^st place

724^th place

1mcmaster.ca

6,572^nd place

4,351^st place

1loria.fr

low place

1cwi.nl

low place

ams.org

mathscinet.ams.org

Kolmogorov, Andrey (1963). "On Tables of Random Numbers". Sankhyā Ser. A. 25: 369–375. MR 0178484.
Kolmogorov, Andrey (1998). "On Tables of Random Numbers". Theoretical Computer Science. 207 (2): 387–395. doi:10.1016/S0304-3975(98)00075-9. MR 1643414.

archive.org

Li, Ming; Vitányi, Paul (2008). "Preliminaries". An Introduction to Kolmogorov Complexity and its Applications. Texts in Computer Science. pp. 1–99. doi:10.1007/978-0-387-49820-1_1. ISBN 978-0-387-33998-6.
Jorma Rissanen (2007). Information and Complexity in Statistical Modeling. Springer S. p. 53. ISBN 978-0-387-68812-1.
Ming Li; Paul M.B. Vitányi (2009). An Introduction to Kolmogorov Complexity and Its Applications. Springer. pp. 105–106. ISBN 978-0-387-49820-1.
Ming Li; Paul M.B. Vitányi (2009). An Introduction to Kolmogorov Complexity and Its Applications. Springer. p. 119. ISBN 978-0-387-49820-1.

arxiv.org

Galatolo, Stefano; Hoyrup, Mathieu; Rojas, Cristóbal (2010). "Effective symbolic dynamics, random points, statistical behavior, complexity and entropy" (PDF). Information and Computation. 208: 23–41. arXiv:0801.0209. doi:10.1016/j.ic.2009.05.001. S2CID 5555443. Archived (PDF) from the original on 2022-10-09.
Alexei Kaltchenko (2004). "Algorithms for Estimating Information Distance with Application to Bioinformatics and Linguistics". arXiv:cs.CC/0404039.
Vitányi, Paul M.B. (2013). "Conditional Kolmogorov complexity and universal probability". Theoretical Computer Science. 501: 93–100. arXiv:1206.0983. doi:10.1016/j.tcs.2013.07.009. S2CID 12085503.

au.dk

daimi.au.dk

Stated without proof in: P. B. Miltersen (2005). "Course notes for Data Compression - Kolmogorov complexity" (PDF). p. 7. Archived from the original (PDF) on 2009-09-09.

cwi.nl

ir.cwi.nl

Vitányi, Paul M.B. (2013). "Conditional Kolmogorov complexity and universal probability". Theoretical Computer Science. 501: 93–100. arXiv:1206.0983. doi:10.1016/j.tcs.2013.07.009. S2CID 12085503.

doi.org

Kolmogorov, Andrey (1998). "On Tables of Random Numbers". Theoretical Computer Science. 207 (2): 387–395. doi:10.1016/S0304-3975(98)00075-9. MR 1643414.
Hutter, Marcus (2007-03-06). "Algorithmic information theory". Scholarpedia. 2 (3): 2519. Bibcode:2007SchpJ...2.2519H. doi:10.4249/scholarpedia.2519. hdl:1885/15015. ISSN 1941-6016.
Solomonoff, Ray (March 1964). "A Formal Theory of Inductive Inference Part I" (PDF). Information and Control. 7 (1): 1–22. doi:10.1016/S0019-9958(64)90223-2. Archived (PDF) from the original on 2022-10-09.
Solomonoff, Ray (June 1964). "A Formal Theory of Inductive Inference Part II" (PDF). Information and Control. 7 (2): 224–254. doi:10.1016/S0019-9958(64)90131-7. Archived (PDF) from the original on 2022-10-09.
Chaitin, Gregory J. (1969). "On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers". Journal of the ACM. 16 (3): 407–422. CiteSeerX 10.1.1.15.3821. doi:10.1145/321526.321530. S2CID 12584692.
Kolmogorov, A. (1968). "Logical basis for information theory and probability theory". IEEE Transactions on Information Theory. 14 (5): 662–664. doi:10.1109/TIT.1968.1054210. S2CID 11402549.
Li, Ming; Vitányi, Paul (2008). "Preliminaries". An Introduction to Kolmogorov Complexity and its Applications. Texts in Computer Science. pp. 1–99. doi:10.1007/978-0-387-49820-1_1. ISBN 978-0-387-33998-6.
Zvonkin, A.; L. Levin (1970). "The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms" (PDF). Russian Mathematical Surveys. 25 (6): 83–124. Bibcode:1970RuMaS..25...83Z. doi:10.1070/RM1970v025n06ABEH001269. S2CID 250850390.
Gregory J. Chaitin (Jul 1974). "Information-theoretic limitations of formal systems" (PDF). Journal of the ACM. 21 (3): 403–434. doi:10.1145/321832.321839. S2CID 2142553. Here: Thm.4.1b
Wallace, C. S.; Dowe, D. L. (1999). "Minimum Message Length and Kolmogorov Complexity". Computer Journal. 42 (4): 270–283. CiteSeerX 10.1.1.17.321. doi:10.1093/comjnl/42.4.270.
Martin-Löf, Per (1966). "The definition of random sequences". Information and Control. 9 (6): 602–619. doi:10.1016/s0019-9958(66)80018-9.
Galatolo, Stefano; Hoyrup, Mathieu; Rojas, Cristóbal (2010). "Effective symbolic dynamics, random points, statistical behavior, complexity and entropy" (PDF). Information and Computation. 208: 23–41. arXiv:0801.0209. doi:10.1016/j.ic.2009.05.001. S2CID 5555443. Archived (PDF) from the original on 2022-10-09.
Li, Ming; Vitányi, Paul (2008). "An Introduction to Kolmogorov Complexity and Its Applications". Texts in Computer Science. Exercise 2.7.7. doi:10.1007/978-0-387-49820-1. ISBN 978-0-387-33998-6. ISSN 1868-0941.
Vitányi, Paul M.B. (2013). "Conditional Kolmogorov complexity and universal probability". Theoretical Computer Science. 501: 93–100. arXiv:1206.0983. doi:10.1016/j.tcs.2013.07.009. S2CID 12085503.

free.fr

alexander.shen.free.fr

Zvonkin, A.; L. Levin (1970). "The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms" (PDF). Russian Mathematical Surveys. 25 (6): 83–124. Bibcode:1970RuMaS..25...83Z. doi:10.1070/RM1970v025n06ABEH001269. S2CID 250850390.

ghostarchive.org

Solomonoff, Ray (February 4, 1960). A Preliminary Report on a General Theory of Inductive Inference (PDF). Report V-131 (Report). Revision published November 1960. Archived (PDF) from the original on 2022-10-09.
Solomonoff, Ray (March 1964). "A Formal Theory of Inductive Inference Part I" (PDF). Information and Control. 7 (1): 1–22. doi:10.1016/S0019-9958(64)90223-2. Archived (PDF) from the original on 2022-10-09.
Solomonoff, Ray (June 1964). "A Formal Theory of Inductive Inference Part II" (PDF). Information and Control. 7 (2): 224–254. doi:10.1016/S0019-9958(64)90131-7. Archived (PDF) from the original on 2022-10-09.
Galatolo, Stefano; Hoyrup, Mathieu; Rojas, Cristóbal (2010). "Effective symbolic dynamics, random points, statistical behavior, complexity and entropy" (PDF). Information and Computation. 208: 23–41. arXiv:0801.0209. doi:10.1016/j.ic.2009.05.001. S2CID 5555443. Archived (PDF) from the original on 2022-10-09.

handle.net

hdl.handle.net

Hutter, Marcus (2007-03-06). "Algorithmic information theory". Scholarpedia. 2 (3): 2519. Bibcode:2007SchpJ...2.2519H. doi:10.4249/scholarpedia.2519. hdl:1885/15015. ISSN 1941-6016.

harvard.edu

ui.adsabs.harvard.edu

Hutter, Marcus (2007-03-06). "Algorithmic information theory". Scholarpedia. 2 (3): 2519. Bibcode:2007SchpJ...2.2519H. doi:10.4249/scholarpedia.2519. hdl:1885/15015. ISSN 1941-6016.
Zvonkin, A.; L. Levin (1970). "The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms" (PDF). Russian Mathematical Surveys. 25 (6): 83–124. Bibcode:1970RuMaS..25...83Z. doi:10.1070/RM1970v025n06ABEH001269. S2CID 250850390.

loria.fr

Galatolo, Stefano; Hoyrup, Mathieu; Rojas, Cristóbal (2010). "Effective symbolic dynamics, random points, statistical behavior, complexity and entropy" (PDF). Information and Computation. 208: 23–41. arXiv:0801.0209. doi:10.1016/j.ic.2009.05.001. S2CID 5555443. Archived (PDF) from the original on 2022-10-09.

mathnet.ru

Burgin, M. (1982). "Generalized Kolmogorov complexity and duality in theory of computations". Notices of the Russian Academy of Sciences. 25 (3): 19–23.

mcmaster.ca

cas.mcmaster.ca

Gregory J. Chaitin (Jul 1974). "Information-theoretic limitations of formal systems" (PDF). Journal of the ACM. 21 (3): 403–434. doi:10.1145/321832.321839. S2CID 2142553. Here: Thm.4.1b

psu.edu

citeseerx.ist.psu.edu

Chaitin, Gregory J. (1969). "On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers". Journal of the ACM. 16 (3): 407–422. CiteSeerX 10.1.1.15.3821. doi:10.1145/321526.321530. S2CID 12584692.
Wallace, C. S.; Dowe, D. L. (1999). "Minimum Message Length and Kolmogorov Complexity". Computer Journal. 42 (4): 270–283. CiteSeerX 10.1.1.17.321. doi:10.1093/comjnl/42.4.270.

semanticscholar.org

api.semanticscholar.org

Chaitin, Gregory J. (1969). "On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers". Journal of the ACM. 16 (3): 407–422. CiteSeerX 10.1.1.15.3821. doi:10.1145/321526.321530. S2CID 12584692.
Kolmogorov, A. (1968). "Logical basis for information theory and probability theory". IEEE Transactions on Information Theory. 14 (5): 662–664. doi:10.1109/TIT.1968.1054210. S2CID 11402549.
Zvonkin, A.; L. Levin (1970). "The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms" (PDF). Russian Mathematical Surveys. 25 (6): 83–124. Bibcode:1970RuMaS..25...83Z. doi:10.1070/RM1970v025n06ABEH001269. S2CID 250850390.
Gregory J. Chaitin (Jul 1974). "Information-theoretic limitations of formal systems" (PDF). Journal of the ACM. 21 (3): 403–434. doi:10.1145/321832.321839. S2CID 2142553. Here: Thm.4.1b
Galatolo, Stefano; Hoyrup, Mathieu; Rojas, Cristóbal (2010). "Effective symbolic dynamics, random points, statistical behavior, complexity and entropy" (PDF). Information and Computation. 208: 23–41. arXiv:0801.0209. doi:10.1016/j.ic.2009.05.001. S2CID 5555443. Archived (PDF) from the original on 2022-10-09.
Chaitin, G.; Arslanov, A.; Calude, Cristian S. (1995-09-01). "Program-size Complexity Computes the Halting Problem". Bull. EATCS. S2CID 39718973.
Vitányi, Paul M.B. (2013). "Conditional Kolmogorov complexity and universal probability". Theoretical Computer Science. 501: 93–100. arXiv:1206.0983. doi:10.1016/j.tcs.2013.07.009. S2CID 12085503.

springer.com

Calude, Cristian S. (12 September 2002). Information and Randomness: an algorithmic perspective. Springer. ISBN 9783540434665.

link.springer.com

Li, Ming; Vitányi, Paul (2008). "An Introduction to Kolmogorov Complexity and Its Applications". Texts in Computer Science. Exercise 2.7.7. doi:10.1007/978-0-387-49820-1. ISBN 978-0-387-33998-6. ISSN 1868-0941.

std.com

world.std.com

Solomonoff, Ray (February 4, 1960). A Preliminary Report on a General Theory of Inductive Inference (PDF). Report V-131 (Report). Revision published November 1960. Archived (PDF) from the original on 2022-10-09.
Solomonoff, Ray (March 1964). "A Formal Theory of Inductive Inference Part I" (PDF). Information and Control. 7 (1): 1–22. doi:10.1016/S0019-9958(64)90223-2. Archived (PDF) from the original on 2022-10-09.
Solomonoff, Ray (June 1964). "A Formal Theory of Inductive Inference Part II" (PDF). Information and Control. 7 (2): 224–254. doi:10.1016/S0019-9958(64)90131-7. Archived (PDF) from the original on 2022-10-09.

umd.edu

ece.umd.edu

Kolmogorov, A.N. (1965). "Three Approaches to the Quantitative Definition of Information". Problems Inform. Transmission. 1 (1): 1–7. Archived from the original on September 28, 2011.

web.archive.org

Kolmogorov, A.N. (1965). "Three Approaches to the Quantitative Definition of Information". Problems Inform. Transmission. 1 (1): 1–7. Archived from the original on September 28, 2011.
Stated without proof in: P. B. Miltersen (2005). "Course notes for Data Compression - Kolmogorov complexity" (PDF). p. 7. Archived from the original (PDF) on 2009-09-09.

worldcat.org

Hutter, Marcus (2007-03-06). "Algorithmic information theory". Scholarpedia. 2 (3): 2519. Bibcode:2007SchpJ...2.2519H. doi:10.4249/scholarpedia.2519. hdl:1885/15015. ISSN 1941-6016.
Li, Ming; Vitányi, Paul (2008). "An Introduction to Kolmogorov Complexity and Its Applications". Texts in Computer Science. Exercise 2.7.7. doi:10.1007/978-0-387-49820-1. ISBN 978-0-387-33998-6. ISSN 1868-0941.