相关论文: Kolmogorov Complexity, String Information, Pansper…

It is shown that it is possible for bound fermions on a cosmic string to form a superconducting state. Due to the attractive force between them, particles moving in opposite directions along the string form bound pairs. This involves a…

Joseph Miller [16] and independently Andre Nies, Frank Stephan and Sebastiaan Terwijn [18] gave a complexity characterization of 2-random sequences in terms of plain Kolmogorov complexity C: they are sequences that have infinitely many…

A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new ``normalized information distance'', based on the noncomputable notion of…

Kolmogorov argued that the concept of information exists also in problems with no underlying stochastic model (as Shannon's information representation) for instance, the information contained in an algorithm or in the genome. He introduced…

Assume that for some $\alpha<1$ and for all nutural $n$ a set $F_n$ of at most $2^{\alpha n}$ "forbidden" binary strings of length $n$ is fixed. Then there exists an infinite binary sequence $\omega$ that does not have (long) forbidden…

The incompressibility method is a counting argument in the framework of algorithmic complexity that permits discovering properties that are satisfied by most objects of a class. This paper gives a preliminary insight into Kolmogorov's…

The fast growing field of compressed sensing is founded on the fact that if a signal is 'simple' and has some 'structure', then it can be reconstructed accurately with far fewer samples than its ambient dimension. Many different plausible…

The paper studies randomness extraction from sources with bounded independence and the issue of independence amplification of sources, using the framework of Kolmogorov complexity. The dependency of strings $x$ and $y$ is ${\rm dep}(x,y) =…

Information distance is a parameter-free similarity measure based on compression, used in pattern recognition, data mining, phylogeny, clustering, and classification. The notion of information distance is extended from pairs to multiples…

Within the SETI community, a school of thought holds that ET might prefer to send information physically in so-called "probes," rather than by radio or optical beacon, in effect, a message in a bottle. In this paper, a related solution to…

Astrophysical and cosmological signals such as the cosmic microwave background radiation, as observed, typically contain contributions of different components, and their statistical properties can be used to distinguish one from the other.…

For every total recursive time bound $t$, a constant fraction of all compressible (low Kolmogorov complexity) strings is $t$-bounded incompressible (high time-bounded Kolmogorov complexity); there are uncountably many infinite sequences of…

Data complexity is an important concept in the natural sciences and related areas, but lacks a rigorous and computable definition. In this paper, we focus on a particular sense of complexity that is high if the data is structured in a way…

Peter Gacs showed (Gacs 1974) that for every n there exists a bit string x of length n whose plain complexity C(x) has almost maximal conditional complexity relative to x, i.e., C(C(x)|x) > log n - log^(2) n - O(1). (Here log^(2) i = log…

The ability to find short representations, i.e. to compress data, is crucial for many intelligent systems. We present a theory of incremental compression showing that arbitrary data strings, that can be described by a set of features, can…

In this study, the effect of bounded quantum memory in a primitive information protocol has been examined using the quantum Kolmogorov complexity as a measure of information. We employed a toy two-party protocol in which Bob by using a…

It has been suggested that reality works like a quantum computer, but such claims are just words if they are not backed up by sound mathematics. In pursuit of the fundamental equations I look to string theory where physicists led by Mike…

Is the universe computable? If so, it may be much cheaper in terms of information requirements to compute all computable universes instead of just ours. I apply basic concepts of Kolmogorov complexity theory to the set of possible…

Being able to objectively characterise the intrinsic complexity of behavioural patterns resulting from human or animal decisions is fundamental for deconvolving cognition and designing autonomous artificial intelligence systems. Yet…

The multitime probability distributions obtained by repeatedly probing a quantum system via the measurement of an observable generally violate Kolmogorov's consistency property. Therefore, one cannot interpret such distributions as the…