Results 31 to 40 of about 29,432 (243)
Complexity and the Emergence of Physical Properties
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
On Measuring the Complexity of Networks: Kolmogorov Complexity versus Entropy
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
Kolmogorov Complexity as a Language [PDF]
The notion of Kolmogorov complexity (=the minimal length of a program that generates some object) is often useful as a kind of language that allows us to reformulate some notions and therefore provide new intuition. In this survey we provide (with minimal comments) many different examples where notions and statements that involve Kolmogorov complexity ...
openaire +2 more sources
A Safe Approximation for Kolmogorov Complexity [PDF]
Kolmogorov complexity (K) is an incomputable function. It can be approximated from above but not to arbitrary given precision and it cannot be approximated from below. By restricting the source of the data to a specific model class, we can construct a computable function κ¯ to approximate K in a probabilistic sense: the probability that the error is ...
Peter Bloem +4 more
openaire +2 more sources
Kolmogorov Complexity of Categories [PDF]
Kolmogorov complexity theory is used to tell what the algorithmic informational content of a string is. It is defined as the length of the shortest program that describes the string. We present a programming language that can be used to describe categories, functors, and natural transformations. With this in hand, we define the informational content of
openaire +2 more sources
Kolmogorov compression complexity may differentiate different schools of Orthodox iconography
The complexity in the styles of 1200 Byzantine icons painted between 13th and 16th from Greece, Russia and Romania was investigated through the Kolmogorov algorithmic information theory. The aim was to identify specific quantitative patterns which define
Daniel Peptenatu +16 more
doaj +1 more source
Ladderpath Approach: How Tinkering and Reuse Increase Complexity and Information
The notion of information and complexity are important concepts in many scientific fields such as molecular biology, evolutionary theory and exobiology. Many measures of these quantities are either difficult to compute, rely on the statistical notion of ...
Yu Liu, Zengru Di, Philip Gerlee
doaj +1 more source
Transcripts enriched in codons that trigger P‐site tRNA‐mediated mRNA decay possess stable mRNA
PTMD codons were first described by Mendel et al. as mediators of an mRNA decay pathway dependent on the human protein CNOT3, homologous to yeast Not5. Our findings confirm that PTMD codons destabilize transcripts; however, unlike in yeast, the human pathway specifically targets and slightly destabilizes primarily stable mRNAs.
Rodolfo Lopes Carneiro +1 more
wiley +1 more source
The complexity or randomness of the laminar-turbulent transition process of an inlet boundary layer in a circular pipe was analyzed by use of Kolmogorov complexity which is a very important measure of the randomness of various events. In the inlet region
Masashi ICHIMIYA +2 more
doaj +1 more source
Predicting extreme defects in additive manufacturing remains a key challenge limiting its structural reliability. This study proposes a statistical framework that integrates Extreme Value Theory with advanced process indicators to explore defect–process relationships and improve the estimation of critical defect sizes. The approach provides a basis for
Muhammad Muteeb Butt +8 more
wiley +1 more source

