Related papers: On Kolmogorov Structure Functions
Arranging the bits of a random string or real into k columns of a two-dimensional array or higher dimensional structure is typically accompanied with loss in the Kolmogorov complexity of the columns, which depends on k. We quantify and…
This paper discusses a general and useful stability principle which, roughly speaking, says that given a uniformly continuous function defined on an arbitrary metric space, if the function is bounded on the constraint set and we slightly…
We study the computably enumerable sets in terms of the: (a) Kolmogorov complexity of their initial segments; (b) Kolmogorov complexity of finite programs when they are used as oracles. We present an extended discussion of the existing…
In the algorithmic (Kolmogorov) view, agents are programs that track and compress sensory streams using generative programs. We propose a framework where the relevant structural prior is simplicity (Solomonoff) understood as…
We present a well-structured detailed exposition of a well-known proof of the following celebrated result solving Hilbert's 13th problem on superpositions. For functions of 2 variables the statement is as follows. Kolmogorov Theorem. There…
We examine the behavior of the Kolmogorov constants C_2, C_k, and C_{k1}, which are, respectively, the prefactors of the second order longitudinal structure function, the three dimensional and one-dimensional longitudinal energy spectrum in…
Kolmogorov-Chaitin complexity has long been believed to be impossible to approximate when it comes to short sequences (e.g. of length 5-50). However, with the newly developed \emph{coding theorem method} the complexity of strings of length…
We construct a string field Hamiltonian for a noncritical string theory with the continuum limit of the Ising model or its generalization as the matter theory on the worldsheet. It consists of only three string vertices as in the case for…
Vacuum structure and global cosmic strings are analyzed in the effective theory of self-interacting O(2) scalar fields on (3+1)-manifolds with conical singularities. In the context of one-loop effective action computed by heat-kernel…
Lattice-based string formation algorithms can, at least in principle, be reduced to the study of the statistics of the corresponding aperiodic random walk. Since in three or more dimensions such walks are transient this approach necessarily…
String field theories exhibit exponential suppression of interactions among the component fields at high energies due to infinite-derivative factors such as $e^{\ell^2 \Box / 2}$ in the vertices. This nonlocality has hindered the…
Much of statistics relies upon four key elements: a law of large numbers, a calculus to operationalize stochastic convergence, a central limit theorem, and a framework for constructing local approximations. These elements are…
Structured distributions, i.e. distributions over combinatorial spaces, are commonly used to learn latent probabilistic representations from observed data. However, scaling these models is bottlenecked by the high computational and memory…
The tensionless limit of classical string theory may be formulated as a topological theory on the world-sheet. A vector density carries geometrical information in place of an internal metric. It is found that path-integral quantization…
Motivated by mass-spectrometry protein sequencing, we consider a simply-stated problem of reconstructing a string from the multiset of its substring compositions. We show that all strings of length 7, one less than a prime, or one less than…
We revisit classic string problems considered in the area of parameterized complexity, and study them through the lens of dynamic data structures. That is, instead of asking for a static algorithm that solves the given instance efficiently,…
We describe a scheme of quantum mechanics in which the Hilbert space and linear operators are only secondary structures of the theory. As primary structures we consider observables, elements of noncommutative algebra, and the physical…
In this paper, we examine the fundamental performance limitations in the control of stochastic dynamical systems; more specifically, we derive generic $\mathcal{L}_p$ bounds that hold for any causal (stabilizing) controllers and any…
We study the classification problems over string data for hypotheses specified by formulas of monadic second-order logic MSO. The goal is to design learning algorithms that run in time polynomial in the size of the training set,…
The matrix model formulation of two dimensional string theory has been shown to admit time dependent classical solutions whose closed string duals are geodesically incomplete space-times with space-like boundaries. We investigate some…