Related papers: On Kolmogorov Structure Functions
We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…
T-duality of string theory suggests nonlocality manifested as the shortest possible distance. As an alternative, we suggest a nonlocal formulation of string theory that breaks T-duality at the fundamental level and does not require the…
Perturbative string amplitudes are correctly derived from the string geometry theory, which is one of the candidates of a non-perturbative formulation of string theory. In order to derive non-perturbative effects rather easily, we formulate…
Two objects are independent if they do not affect each other. Independence is well-understood in classical information theory, but less in algorithmic information theory. Working in the framework of algorithmic information theory, the paper…
Assuming string theorists will not soon provide a compelling case for the primary theory underlying particle physics, the field will proceed as it has historically: with data stimulating and testing ideas. Ideally the soft supersymmetry…
We summarize our recent findings, where we proposed a framework for learning a Kolmogorov model, for a collection of binary random variables. More specifically, we derive conditions that link outcomes of specific random variables, and…
We investigate the problem of learning the structure of a Markov network from data. It is shown that the structure of such networks can be described in terms of constraints which enables the use of existing solver technology with…
A $c$-short program for a string $x$ is a description of $x$ of length at most $C(x) + c$, where $C(x)$ is the Kolmogorov complexity of $x$. We show that there exists a randomized algorithm that constructs a list of $n$ elements that…
Submodular functions are discrete functions that model laws of diminishing returns and enjoy numerous algorithmic applications. They have been used in many areas, including combinatorial optimization, machine learning, and economics. In…
We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations), in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple…
String theory is canonically accompanied with a space-time interpretation which determines S-matrix-like observables, and connects to the standard physics at low energies in the guise of local effective field theory. Recently, we have…
It has been pointed out that cosmic string solutions can exist in gauge field theories with broken symmetry even when $\pi _1(G/H)$ is trivial. The stability of such semilocal defects is not guaranteed by topology and depends on dynamical…
Every topological space has a Kolmogorov quotient that is obtained by identifying topologically indistinguishable points, that is, points that are contained in exactly the same open sets. In this survey, we look at the relationship between…
It is shown that the length of the algorithmic minimal sufficient statistic of a binary string x, either in a representation of a finite set, computable semimeasure, or a computable function, has a length larger than the computational depth…
Recently the theory of widths of Kolmogorov-Gelfand has received a great deal of interest due to its close relationship with the newly born area of Compressive Sensing in Signal Processing. However fundamental problems of the theory of…
We reformulated the string formalism given by Aoyama, using an adjacent matrix of a network and introduced a series of generalized clustering coefficients based on it. Furthermore we numerically evaluated Milgram condition proposed by their…
Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…
Muchnik's theorem about simple conditional descriptions states that for all strings $a$ and $b$ there exists a short program $p$ transforming $a$ to $b$ that has the least possible length and is simple conditional on $b$. In this paper we…
One cannot yet point to any firm string prediction. While many approximate string ground states are known with interesting properties, we do not have any argument that one or another describes what we observe around us, and for reasons…
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: randomness and classification. The survey is divided in two parts…