Skip header Section
Skip Bibliometrics Section
An introduction to Kolmogorov complexity and its applicationsSeptember 1993
- Authors:
- Ming Li,
- Paul Vitányi
Abstract
No abstract available.
Cited By
Scheffler S, Tromer E and Varia M Formalizing Human Ingenuity: A Quantitative Framework for Copyright Law's Substantial Similarity Proceedings of the 2022 Symposium on Computer Science and Law, (37-49)- Lorena A, Garcia L, Lehmann J, Souto M and Ho T (2019). How Complex Is Your Classification Problem?, ACM Computing Surveys, 52:5, (1-34), Online publication date: 30-Sep-2020.
- Fürnkranz J, Kliegr T and Paulheim H (2019). On cognitive preferences and the plausibility of rule-based models, Machine Language, 109:4, (853-898), Online publication date: 1-Apr-2020.
- Downey R and Hirschfeldt D (2019). Algorithmic randomness, Communications of the ACM, 62:5, (70-80), Online publication date: 24-Apr-2019.
- Marx A and Vreeken J Identifiability of Cause and Effect using Regularized Regression Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (852-861)
- Xu K, Wan Y, Xue G and Wang F Multidimensional behavioral profiling of internet-of-things in edge networks Proceedings of the International Symposium on Quality of Service, (1-10)
- Marx A and Vreeken J (2019). Telling cause from effect by local and global regression, Knowledge and Information Systems, 60:3, (1277-1305), Online publication date: 1-Sep-2019.
- Fischer J and Vreeken J Sets of Robust Rules, and How to Find Them Machine Learning and Knowledge Discovery in Databases, (38-54)
- Budhathoki K and Vreeken J (2018). Origo, Knowledge and Information Systems, 56:2, (285-307), Online publication date: 1-Aug-2018.
- Staiger L (2017). Exact Constructive and Computable Dimensions, Theory of Computing Systems, 61:4, (1288-1314), Online publication date: 1-Nov-2017.
- Hoyrup M and Gomaa W On the extension of computable real functions Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)
- Dokuchaev N (2016). Near-ideal causal smoothing filters for the real sequences, Signal Processing, 118:C, (285-293), Online publication date: 1-Jan-2016.
- Bläser M and Manthey B (2015). Smoothed Complexity Theory, ACM Transactions on Computation Theory, 7:2, (1-21), Online publication date: 11-May-2015.
- Wang Y, Lin X, Wu L and Zhang W Effective Multi-Query Expansions Proceedings of the 23rd ACM international conference on Multimedia, (79-88)
- Kutrib M, Provillard J, Vaszil G and Wendlandt M (2015). Deterministic One-Way Turing Machines with Sublinear Space, Fundamenta Informaticae, 136:1-2, (139-155), Online publication date: 1-Jan-2015.
- Koutra D, Kang U, Vreeken J and Faloutsos C (2015). Summarizing and understanding large graphs, Statistical Analysis and Data Mining, 8:3, (183-202), Online publication date: 1-Jun-2015.
- Bloem P, Rooij S and Adriaans P Two Problems for Sophistication Proceedings of the 26th International Conference on Algorithmic Learning Theory - Volume 9355, (379-394)
- Miettinen P and Vreeken J (2014). MDL4BMF, ACM Transactions on Knowledge Discovery from Data, 8:4, (1-31), Online publication date: 7-Oct-2014.
- Tarau P Bijective Collection Encodings and Boolean Operations with Hereditarily Binary Natural Numbers Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, (31-42)
- Milioris D and Jacquet P (2014). Joint Sequence Complexity Analysis, Bell Labs Technical Journal, 18:4, (75-88), Online publication date: 1-Mar-2014.
- Sunehag P and Hutter M Learning agents with evolving hypothesis classes Proceedings of the 6th international conference on Artificial General Intelligence, (150-159)
- Moser P (2013). On the polynomial depth of various sets of random strings, Theoretical Computer Science, 477, (96-108), Online publication date: 1-Mar-2013.
- Tarau P A declarative specification of tree-based symbolic arithmetic computations Proceedings of the 14th international conference on Practical Aspects of Declarative Languages, (273-288)
- Tatti N and Vreeken J The long and the short of it Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, (462-470)
- Mampaey M, Vreeken J and Tatti N (2012). Summarizing data succinctly with the most informative itemsets, ACM Transactions on Knowledge Discovery from Data, 6:4, (1-42), Online publication date: 1-Dec-2012.
- Akoglu L, Tong H, Vreeken J and Faloutsos C Fast and reliable anomaly detection in categorical data Proceedings of the 21st ACM international conference on Information and knowledge management, (415-424)
- Bergen S and Ross B Aesthetic 3d model evolution Proceedings of the First international conference on Evolutionary and Biologically Inspired Music, Sound, Art and Design, (11-22)
- Bensch S, Holzer M, Kutrib M and Malcher A Input-Driven stack automata Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science, (28-42)
- Siebes A Queries for data analysis Proceedings of the 11th international conference on Advances in Intelligent Data Analysis, (7-22)
- Sunehag P and Hutter M Optimistic AIXI Proceedings of the 5th international conference on Artificial General Intelligence, (312-321)
- Manin Y (2012). Renormalisation and computation ii, Mathematical Structures in Computer Science, 22:5, (729-751), Online publication date: 1-Sep-2012.
- Miettinen P and Vreeken J Model order selection for boolean matrix factorization Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, (51-59)
- Ivanovska S, Karaivanova A and Manev N Numerical integration using sequences generating permutations Proceedings of the 8th international conference on Large-Scale Scientific Computing, (455-463)
- Moser P On the polynomial depth of various sets of random strings Proceedings of the 8th annual conference on Theory and applications of models of computation, (517-527)
- Gulwani S Dimensions in program synthesis Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming, (13-24)
- Tarau P Hereditarily finite representations of natural numbers and self-delimiting codes Proceedings of the third ACM SIGPLAN workshop on Mathematically structured functional programming, (11-18)
- Jiang T, Li M and Ravikumar B Basic notions in computational complexity Algorithms and theory of computation handbook, (19-19)
- Galatolo S, Hoyrup M and Rojas C (2010). Effective symbolic dynamics, random points, statistical behavior, complexity and entropy, Information and Computation, 208:1, (23-41), Online publication date: 1-Jan-2010.
- Tarau P On arithmetic computations with hereditarily finite sets, functions and types Proceedings of the 7th International colloquium conference on Theoretical aspects of computing, (367-381)
- Mailing A, Crivelli T and Cernuschi-Frías B Model distribution dependant complexity estimation on textures Proceedings of the 6th international conference on Advances in visual computing - Volume Part III, (271-279)
- Kutrib M and Malcher A Two-party Watson-Crick computations Proceedings of the 15th international conference on Implementation and application of automata, (191-200)
- Chandola V, Banerjee A and Kumar V (2009). Anomaly detection, ACM Computing Surveys, 41:3, (1-58), Online publication date: 1-Jul-2009.
- Koopman A and Siebes A Characteristic relational patterns Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, (437-446)
- Tarau P An embedded declarative data transformation language Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, (171-182)
- Jurdziński T (2008). The Boolean Closure of Growing Context-Sensitive Languages, Fundamenta Informaticae, 89:2-3, (289-305), Online publication date: 15-Jan-2009.
- Bosnić Z and Kononenko I (2009). An overview of advances in reliability estimation of individual predictions in machine learning, Intelligent Data Analysis, 13:2, (385-401), Online publication date: 1-Apr-2009.
- Kaplan M and Laplante S Kolmogorov Complexity and Combinatorial Methods in Communication Complexity Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation, (261-270)
- Leeuwen M, Vreeken J and Siebes A (2009). Identifying the components, Data Mining and Knowledge Discovery, 19:2, (176-193), Online publication date: 1-Oct-2009.
- Kowaliw T Measures of complexity for artificial embryogeny Proceedings of the 10th annual conference on Genetic and evolutionary computation, (843-850)
- Jurdziński T (2008). The Boolean Closure of Growing Context-Sensitive Languages, Fundamenta Informaticae, 89:2-3, (289-305), Online publication date: 1-Apr-2008.
- Downey R and Greenberg N (2008). Turing degrees of reals of positive effective packing dimension, Information Processing Letters, 108:5, (298-303), Online publication date: 1-Nov-2008.
- Hartmanis J Turing award lecture ACM Turing award lectures
- Wolff J (2007). Towards an intelligent database system founded on the SP theory of computing and cognition, Data & Knowledge Engineering, 60:3, (596-624), Online publication date: 1-Mar-2007.
- Jurdziński T and Loryś K (2007). Lower bound technique for length-reducing automata, Information and Computation, 205:9, (1387-1412), Online publication date: 1-Sep-2007.
- Wang D, Liau C and Hsu T Granulation as a privacy protection mechanism Transactions on rough sets VII, (256-273)
- Benci V and Galatolo S Optimal information measures for weakly chaotic dynamical systems General Theory of Information Transfer and Combinatorics, (614-627)
- Semwal S, Ohya J, Semwal I and Bikker B Visual blending using 2D morphing Proceedings of the 24th IASTED international conference on Signal processing, pattern recognition, and applications, (316-321)
- Fadel R Modeling strategic beliefs with outsmarting belief systems Proceedings of the First international conference on Knowledge Science, Engineering and Management, (102-113)
- Fortnow L and Ogihara M Very sparse leaf languages Proceedings of the 31st international conference on Mathematical Foundations of Computer Science, (375-386)
- Stephan F and Yu L Lowness for weakly 1-generic and kurtz-random Proceedings of the Third international conference on Theory and Applications of Models of Computation, (756-764)
- Woodward J Invariance of function complexity under primitive recursive functions Proceedings of the 9th European conference on Genetic Programming, (310-319)
- Jurdziński T The boolean closure of growing context-sensitive languages Proceedings of the 10th international conference on Developments in Language Theory, (248-259)
- Jurdziński T Probabilistic length-reducing automata Proceedings of the 31st international conference on Mathematical Foundations of Computer Science, (561-572)
- Figueira S, Stephan F and Wu G (2006). Randomness and universal machines, Journal of Complexity, 22:6, (738-751), Online publication date: 1-Dec-2006.
- Iwata K, Ikeda K and Sakai H (2006). The asymptotic equipartition property in reinforcement learning and its relation to return maximization, Neural Networks, 19:1, (62-75), Online publication date: 1-Jan-2006.
- Schmiedekamp M, Subbu A and Phoha S (2006). The Clustered Causal State Algorithm, Computing in Science and Engineering, 8:5, (59-67), Online publication date: 1-Sep-2006.
- Alfonseca M, Cebrián M and Ortega A Testing genetic algorithm recombination strategies and the normalized compression distance for computer-generated music Proceedings of the 5th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases, (53-58)
- Hornby G Measuring, enabling and comparing modularity, regularity and hierarchy in evolutionary design Proceedings of the 7th annual conference on Genetic and evolutionary computation, (1729-1736)
- Malcher A (2005). On two-way communication in cellular automata with a fixed number of cells, Theoretical Computer Science, 330:2, (325-338), Online publication date: 2-Feb-2005.
- Alfonseca M, Cebrián M and Ortega A Evolving computer-generated music by means of the normalized compression distance Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization, (343-348)
- Kenny R (2005). Orbit Complexity and Entropy for Group Endomorphisms, Electronic Notes in Theoretical Computer Science (ENTCS), 120:C, (97-110), Online publication date: 3-Feb-2005.
- Clauss P, Kenmei B and Beyler J The periodic-linear model of program behavior capture Proceedings of the 11th international Euro-Par conference on Parallel Processing, (325-335)
- Furuya T, Matsuzaki T and Matsuura K Detection of unknown dos attacks by kolmogorov-complexity fluctuation Proceedings of the First SKLOIS conference on Information Security and Cryptology, (395-406)
- de la Higuera C (2005). A bibliographical study of grammatical inference, Pattern Recognition, 38:9, (1332-1348), Online publication date: 1-Sep-2005.
- Cruz-Ramirez N, Acosta Mesa H, Martinez E, Rojas-Marcial J and Nava-Fernandez L A Parsimonious Constraint-based Algorithm to Induce Bayesian Network Structures from Data Proceedings of the Sixth Mexican International Conference on Computer Science, (306-313)
- Franceschini G and Geffert V (2005). An in-place sorting with O(nlog n) comparisons and O(n) moves, Journal of the ACM, 52:4, (515-537), Online publication date: 1-Jul-2005.
- Smola A and Schölkopf B (2004). A tutorial on support vector regression, Statistics and Computing, 14:3, (199-222), Online publication date: 1-Aug-2004.
- Valentini G and Dietterich T (2004). Bias-Variance Analysis of Support Vector Machines for the Development of SVM-Based Ensemble Methods, The Journal of Machine Learning Research, 5, (725-775), Online publication date: 1-Dec-2004.
- Downey R, Griffiths E and Reid S (2004). On Kurtz randomness, Theoretical Computer Science, 321:2-3, (249-270), Online publication date: 16-Aug-2004.
- Janson S, Lonardi S and Szpankowski W (2004). On average sequence complexity, Theoretical Computer Science, 326:1-3, (213-227), Online publication date: 20-Oct-2004.
- Streeter M Two broad classes of functions for which a no free lunch result does not hold Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII, (1418-1430)
- Torr P (2002). Bayesian Model Estimation and Selection for Epipolar Geometry and Generic Manifold Fitting, International Journal of Computer Vision, 50:1, (35-61), Online publication date: 1-Oct-2002.
- Ho T and Basu M (2002). Complexity Measures of Supervised Classification Problems, IEEE Transactions on Pattern Analysis and Machine Intelligence, 24:3, (289-300), Online publication date: 1-Mar-2002.
- Droste S, Jansen T and Wegener I (2002). Optimization with randomized search heuristics, Theoretical Computer Science, 287:1, (131-144), Online publication date: 25-Sep-2002.
- Staiger L (2002). The Kolmogorov complexity of real numbers, Theoretical Computer Science, 284:2, (455-466), Online publication date: 28-Jul-2002.
- Diks K, Kranakis E, Krizanc D and Pelc A (2002). The impact of information on broadcasting time in linear radio networks, Theoretical Computer Science, 287:2, (449-471), Online publication date: 28-Sep-2002.
- Cheng Q and Fang F (2002). Kolmogorov random graphs only have trivial stable colorings, Information Processing Letters, 81:3, (133-136), Online publication date: 14-Feb-2002.
- Adjeroh D, Zhang Y, Mukherjee A, Powell M and Bell T DNA Sequence Compression Using the Burrows-Wheeler Transform Proceedings of the IEEE Computer Society Conference on Bioinformatics
- Itkis G Intrusion-resilient signatures Proceedings of the 3rd international conference on Security in communication networks, (102-118)
- Apolloni B, Malchiodi D, Orovas C and Palmas G (2002). From synapses to rules, Cognitive Systems Research, 3:2, (167-201), Online publication date: 1-Jun-2002.
- de Luca A A survey of some quantitative approaches to the notion of information Formal and natural computing, (77-95)
- Denis F (2001). Learning Regular Languages from Simple Positive Examples, Machine Language, 44:1-2, (37-66), Online publication date: 1-Jul-2001.
- Oliveira A and Silva J (2001). Efficient Algorithms for the Inference of Minimum Size DFAs, Machine Language, 44:1-2, (93-119), Online publication date: 1-Jul-2001.
- Lotker Z, Patt-Shamir B and Peleg D Distributed MST for constant diameter graphs Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, (63-71)
- (2001). The Communication Complexity of Enumeration, Elimination, and Selection, Journal of Computer and System Sciences, 63:2, (148-185), Online publication date: 1-Sep-2001.
- Bennett A, Paris J and Vencovská A (2000). A New Criterion for Comparing Fuzzy Logics for Uncertain Reasoning, Journal of Logic, Language and Information, 9:1, (31-63), Online publication date: 1-Jan-2000.
- Brent M (1999). An Efficient, Probabilistically Sound Algorithm for Segmentation andWord Discovery, Machine Language, 34:1-3, (71-105), Online publication date: 1-Feb-1999.
- Li M, Ma B and Wang L Finding similar regions in many strings Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (473-482)
- Ben-Amram A and Petersen H Backing up in singly linked lists Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (780-786)
- Jurdzinski T, Kutyłowski M and Lorys K Multi-party finite computations Proceedings of the 5th annual international conference on Computing and combinatorics, (318-329)
- Sałustowicz R, Wiering M and Schmidhuber J (1998). Learning Team Strategies, Machine Language, 33:2-3, (263-282), Online publication date: 1-Dec-1998.
- Geurts F (1998). Abstract compositional analysis of iterated relations, 10.5555/1743606, Online publication date: 1-Jan-1998.
- Nikolaev N and Slavov V (1998). Inductive Genetic Programming with Decision Trees, Intelligent Data Analysis, 2:1, (31-44), Online publication date: 1-Jan-1998.
- Culberson J (1998). On the futility of blind search, Evolutionary Computation, 6:2, (109-127), Online publication date: 1-Jun-1998.
- Karalič A and Bratko I (1997). First Order Regression, Machine Language, 26:2-3, (147-176), Online publication date: 1-Mar-1997.
- Schmidhuber J, Zhao J and Wiering M (1997). Shifting Inductive Bias with Success-Story Algorithm, AdaptiveLevin Search, and Incremental Self-Improvement, Machine Language, 28:1, (105-130), Online publication date: 1-Jul-1997.
- Johansen P (1997). Adaptive Pattern Recognition, Journal of Mathematical Imaging and Vision, 7:4, (325-339), Online publication date: 1-Oct-1997.
- Hammer D, Romashchenko A, Shen A and Vereshchagin N Inequalities for Shannon entropies and Kolmogorov Complexities Proceedings of the 12th Annual IEEE Conference on Computational Complexity
- Rao R and Ballard D (1997). Dynamic model of visual recognition predicts neural response properties in the visual cortex, Neural Computation, 9:4, (721-763), Online publication date: 15-May-1997.
- Han Y and Hemaspaandra L (1996). Pseudorandom generators and the frequency of simplicity, Journal of Cryptology, 9:4, (251-261), Online publication date: 1-Sep-1996.
- Levin L (1996). Fundamentals of computing (a cheatlist), ACM SIGACT News, 27:3, (89), Online publication date: 1-Sep-1996.
- Freund Y Predicting a binary sequence almost as well as the optimal biased coin Proceedings of the ninth annual conference on Computational learning theory, (89-98)
- Yamanishi K A randomized approximation of the MDL for stochastic models with hidden variables Proceedings of the ninth annual conference on Computational learning theory, (99-109)
- Buhrman H, Hoepman J and Vitányi P Optimal routing tables Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, (134-142)
- Knobbe A and Adriaans P Analysing binary associations Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, (311-314)
- Jürgensen H and Staiger L (1995). Local Hausdorff dimension, Acta Informatica, 32:5, (491-507), Online publication date: 1-May-1995.
- Vovk V A game of prediction with expert advice Proceedings of the eighth annual conference on Computational learning theory, (51-60)
- Chen S Bayesian grammar induction for language modeling Proceedings of the 33rd annual meeting on Association for Computational Linguistics, (228-235)
- Muggleton S (1995). Inverse entailment and progol, New Generation Computing, 13:3-4, (245-286), Online publication date: 1-Dec-1995.
- Regan K and Wang J (1994). The quasilinear isomorphism challenge, ACM SIGACT News, 25:3, (106-113), Online publication date: 1-Sep-1994.
- Hartmanis J (1994). Turing Award lecture on computational complexity and the nature of computer science, Communications of the ACM, 37:10, (37-43), Online publication date: 1-Oct-1994.
- Jiang T, Seiferas J and Vitányi P Two heads are better than two tapes Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (668-675)
- Juedes D, Lathrop J and Lutz J (1994). Computational depth and reducibility, Theoretical Computer Science, 132:1, (37-70), Online publication date: 26-Sep-1994.
- Bennett C, Gács P, Li M, Vitányi P and Zurek W Thermodynamics of computation and information distance Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing, (21-30)
Index Terms
- An introduction to Kolmogorov complexity and its applications
Recommendations
Kolmogorov Complexity for Possibly Infinite Computations
In this paper we study the Kolmogorov complexity for non-effective computations, that is, either halting or non-halting computations on Turing machines. This complexity function is defined as the length of the shortest input that produce a desired ...
An Additivity Theorem for Plain Kolmogorov Complexity
We prove the formula C(a,b)=K(a|C(a,b))+C(b|a,C(a,b))+O(1) that expresses the plain complexity of a pair in terms of prefix-free and plain conditional complexities of its components.