Results 21 to 30 of about 27,445 (253)
Resource-Bounded Kolmogorov Complexity Revisited [PDF]
SIAM Journal on Computing, 2001 Summary: We take a fresh look at CD complexity, where CD\(^{t}(x)\) is the size of the smallest program that distinguishes \(x\) from all other strings in time \(t(|x|)\). We also look at CND complexity, a new nondeterministic variant of CD complexity, and time-bounded Kolmogorov complexity, denoted by C complexity.
Buhrman, Harry +2 more
openaire +1 more source
, 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
+5 more sources
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 +1 more source
Reductions to the set of random strings: The resource-bounded case [PDF]
Logical Methods in Computer Science, 2014 This paper is motivated by a conjecture that BPP can be characterized in terms of polynomial-time nonadaptive reductions to the set of Kolmogorov-random strings.
Eric Allender +3 more
doaj +1 more source
Inductive reasoning and kolmogorov complexity [PDF]
Journal of Computer and System Sciences, 1992 In this comprehensive note, the authors discuss several basic senses of inductive inference and their generalization to inductive reasoning. Neither Zadeh-type fuzzy reasoning nor Peirce-type abductive reasoning is addressed there. In the process, the authors refine Ockham's Rozor and combine principles of Epicurus, Ockham and Bayes in various useful ...
Li, Ming, M.B. Vitányi, Paul
openaire +1 more source
Complexity and the Emergence of Physical Properties
Entropy, 2014 Using the effective complexity measure, proposed by M. Gell-Mann and S. Lloyd, we give a quantitative definition of an emergent property. We use several previous results and properties of this particular information measure closely related to the random ...
Miguel Angel Fuentes
doaj +1 more source
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.
Harry Buhrman +3 more
openaire +1 more source
On Measuring the Complexity of Networks: Kolmogorov Complexity versus Entropy
Complexity, 2017 One of the most popular methods of estimating the complexity of networks is to measure the entropy of network invariants, such as adjacency matrices or degree sequences.
Mikołaj Morzy +2 more
doaj +1 more source
Complexity Measures for Maxwell–Boltzmann Distribution
Complexity, 2021 This work presents a discussion about the application of the Kolmogorov; López-Ruiz, Mancini, and Calbet (LMC); and Shiner, Davison, and Landsberg (SDL) complexity measures to a common situation in physics described by the Maxwell–Boltzmann distribution.
Nicholas Smaal +1 more
doaj +1 more source
Compressibility and Kolmogorov Complexity
Notre Dame Journal of Formal Logic, 2013 In the paper under review, the authors investigated a metric space over \(2^{\omega}\) defined by \(d(x,y)=\overline{\lim}_n \frac{C(x\upharpoonright n|y\upharpoonright n)}{n}\). They prove that, among the others, for any \(\alpha\in [0,1]\), \(d(\alpha\cdot x, \alpha \cdot y)=\alpha\cdot d(x,y)\); and \(2^{\omega}\) is path connected.
Binns, Stephen, Nicholson, Marie
openaire +3 more sources