Results 11 to 20 of about 29,432 (243)
Open Physics, 2015 We propose novel metrics based on the Kolmogorov complexity for use in complex system behavior studies and time series analysis. We consider the origins of the Kolmogorov complexity and discuss its physical meaning. To get better insights into the nature
Mihailović Dragutin T. +3 more
doaj +2 more sources
Semantic Algorithmic Information Theory: From Kolmogorov Complexity to Semantic Equivalence [PDF]
EntropyClassical Algorithmic Information Theory (AIT) provides a rigorous foundation for information-based similarity measurement, but classical formulations and their compression-based approximations largely operate at the syntactic level, making them ...
Jiatong Wu +4 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
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 +2 more sources
The Boltzmann Entropy and Randomness Tests [PDF]
EntropyIn the context of the dynamical systems of classical mechanics, we introduce two new notions called “algorithmic fine-grain and coarse-grain entropy”.
Peter Gács
doaj +2 more sources
Quantum Kolmogorov complexity [PDF]
Proceedings 15th Annual IEEE Conference on Computational Complexity, 2001 14 pages, LaTeX2e, no figures, \usepackage{amssymb,a4wide}.
Berthiaume, A. +2 more
openaire +4 more sources
List Approximation for Increasing Kolmogorov Complexity
Axioms, 2021 It is impossible to effectively modify a string in order to increase its Kolmogorov complexity. However, is it possible to construct a few strings, no longer than the input string, so that most of them have larger complexity?
Marius Zimand
doaj +1 more source
Kolmogorov Basic Graphs and Their Application in Network Complexity Analysis
Entropy, 2021 Throughout the years, measuring the complexity of networks and graphs has been of great interest to scientists. The Kolmogorov complexity is known as one of the most important tools to measure the complexity of an object.
Amirmohammad Farzaneh +2 more
doaj +1 more source
Combinatorics and Kolmogorov complexity [PDF]
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 2002 The authors investigate combinatorial properties of finite sequences with high Kolmogorov complexity. They also demonstrate the utility of a Kolmogorov complexity method in combinatorial theory by several examples (such as the coin-weighing problem). >
Ming Li 0001, Paul M. B. Vitányi
openaire +1 more source
Second quantised information distance
IET Quantum Communication, 2023 The Kolmogorov complexity of a string is the minimum length of a programme that can produce that string. Information distance between two strings based on Kolmogorov complexity is defined as the minimum length of a programme that can transform either ...
Songsong Dai
doaj +1 more source