How Incomputable Is Kolmogorov Complexity? [PDF]
Entropy, 2020 Kolmogorov complexity is the length of the ultimately compressed version of a file (i.e., anything which can be put in a computer). Formally, it is the length of a shortest program from which the file can be reconstructed.
Paul M.B. Vitányi
doaj +6 more sources
Kolmogorov complexity metrics in assessing L2 proficiency: An information-theoretic approach [PDF]
Frontiers in Psychology, 2022 Based on 774 argumentative writings produced by Chinese English as a foreign language (EFL) learners, this study examined the extent to which Kolmogorov complexity metrics can distinguish the proficiency levels of beginner, lower-intermediate, and upper ...
Gui Wang, Hui Wang, Li Wang
doaj +2 more sources
Fuzzy Kolmogorov Complexity Based on a Classical Description [PDF]
Entropy, 2020 In this paper, we give a definition for fuzzy Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a single finite string is the length of the shortest program that produces this string.
Songsong Dai
doaj +2 more sources
An Ensemble and Multi-View Clustering Method Based on Kolmogorov Complexity [PDF]
Entropy, 2023 The ability to build more robust clustering from many clustering models with different solutions is relevant in scenarios with privacy-preserving constraints, where data features have a different nature or where these features are not available in a ...
Juan Zamora, Jérémie Sublime
doaj +2 more sources
Statistic complexity: combining kolmogorov complexity with an ensemble approach. [PDF]
PLoS ONE, 2010 BACKGROUND: The evaluation of the complexity of an observed object is an old but outstanding problem. In this paper we are tying on this problem introducing a measure called statistic complexity. METHODOLOGY/PRINCIPAL FINDINGS: This complexity measure is
Frank Emmert-Streib
doaj +2 more sources
Topological arguments for Kolmogorov complexity [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We present several application of simple topological arguments in problems of Kolmogorov complexity. Basically we use the standard fact from topology that the disk is simply connected.
Alexander Shen, Andrei Romashchenko
doaj +6 more sources
Utility of Kolmogorov complexity measures: Analysis of L2 groups and L1 backgrounds. [PDF]
PLoS ONEThe proliferation of automated syntactic complexity tools allowed the analysis of larger amounts of learner writing. However, existing tools tend to be language-specific or depend on segmenting learner production into native-based units of analysis. This
Alaa Alzahrani
doaj +2 more sources
Adjusted Kolmogorov Complexity of Binary Words with Empirical Entropy Normalization [PDF]
EntropyKolmogorov complexity of a finite binary word reflects both algorithmic structure and the empirical distribution of symbols appearing in the word. Words with symbol frequencies far from one half belong to smaller combinatorial classes and therefore ...
Brani Vidakovic
doaj +2 more sources
Kolmogorov Complexity of Coronary Sinus Atrial Electrograms Before Ablation Predicts Termination of Atrial Fibrillation After Pulmonary Vein Isolation [PDF]
Entropy, 2019 Atrial fibrillation (AF) is related to a very complex local electrical activity reflected in the rich morphology of intracardiac electrograms. The link between electrogram complexity and efficacy of the catheter ablation is unclear.
Katarzyna Stępień +5 more
doaj +2 more sources
Entropy Measures vs. Kolmogorov Complexity
Entropy, 2011 Kolmogorov complexity and Shannon entropy are conceptually different measures. However, for any recursive probability distribution, the expected value of Kolmogorov complexity equals its Shannon entropy, up to a constant.
Luís Antunes +3 more
doaj +3 more sources