Results 11 to 20 of about 1,622,352 (271)
Exploring Overall and Component Complexities via Relative Complexity Change and Interacting Complexity Amplitudes in the Kolmogorov Plane: A Case Study of U.S. Rivers [PDF]
EntropyOne of the most challenging tasks in studying streamflow is quantifying how the complexities of environmental and dynamic parameters contribute to the overall system complexity.
Dragutin T. Mihailović +1 more
doaj +3 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
Approximating Kolmogorov complexity
Computability, 2023 It is well known that the Kolmogorov complexity function (the minimal length of a program producing a given string, when an optimal programming language is used) is not computable and, moreover, does not have computable lower bounds. In this paper we investigate a more general question: can this function be approximated?
Ruslan Ishkuvatov +2 more
openaire +3 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
Time Series Correlations and Kolmogorov Complexity: A Hausdorff Dimension Perspective [PDF]
EntropySpurious correlations between time series are a persistent problem: simple, low-complexity patterns are abundant, so unrelated series can easily exhibit high Pearson correlation.
Boumediene Hamzi +4 more
doaj +2 more sources
An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity
EntropyWe study practical approximations of Kolmogorov prefix complexity (K) using IMP2, a high-level programming language. Our focus is on investigating the optimality of the interpreter for this language as the reference machine for the Coding Theorem Method (
Zoe Leyva-Acosta +2 more
doaj +2 more sources
Increasing Kolmogorov Complexity [PDF]
, 2005 How much do we have to change a string to increase its Kolmogorov complexity? We show that we can increase the complexity of any non-random string of length n by flipping $O(\sqrt{n})$ bits and some strings require $\Omega(\sqrt{n})$ bit flips. For a given m, we also give bounds for increasing the complexity of a string by flipping m bits.
H.M. Buhrman (Harry) +3 more
openaire +5 more sources
SECOND QUANTIZED KOLMOGOROV COMPLEXITY [PDF]
International Journal of Quantum Information, 2008 The Kolmogorov complexity of a string is the length of its shortest description. We define a second quantized Kolmogorov complexity where the length of a description is defined to be the average length of its superposition. We discuss this complexity's basic properties.
Rogers, C, Vedral, V, Nagarajan, R
openaire +5 more sources
, 2007 The term "complexity" has different meanings in different contexts. Computational complexity measures how much time or space is needed to perform some computational task. On the other hand, the complexity of description (called also Kolmogorov complexity) is the minimal number of information bits needed to define (describe) a given object.
Bruno Durand, Alexander Zvonkin
core +5 more sources