Related papers: On Kolmogorov Structure Functions
In this paper we investigate the problem of building a static data structure that represents a string s using space close to its compressed size, and allows fast access to individual characters of s. This type of structures was investigated…
Classical versions of Kolmogorov complexity are incomputable. Nevertheless, in 1975 Solovay showed that there are computable functions $f > K+O(1)$ such that for infinitely many strings $\sigma$, $f(\sigma)=K(\sigma)+O(1)$, where $K$…
We first show that the currently accepted statistical mechanics for granular matter is flawed. The reason is that it is based on the volume function, which depends only on a minute fraction of all the structural degrees of freedom and is…
$\chat=1$ fermionic string theory, which is considered as a fermionic string theory in two dimension, is shown to decompose into two mutually independent parts, one of which can be viewed as a topological model and the other is irrelevant…
Any positive word comprised of random sequence of tokens form a finite alphabet can be reduced (without change of length) using an appropriate size Braid group relationships. Surprisingly the Braid relations dramatically reduce the…
Kolmogorov's exponential inequalities are basic tools for studying the strong limit theorems such as the classical laws of the iterated logarithm for both independent and dependent random variables. This paper establishes the Kolmogorov…
In an attempt to demonstrate that local hidden variables are mathematically possible, Pitowsky constructed "spin-$\frac12$ functions" and later "Kolmogorovian models", which employs a nonstandard notion of probability. We describe…
Although information content is invariant up to an additive constant, the range of possible additive constants applicable to programming languages is so large that in practice it plays a major role in the actual evaluation of K(s), the…
The possible tensor constructions of open string theories are analyzed from first principles. To this end the algebraic framework of open string field theory is clarified, including the role of the homotopy associative A_\infty algebra, the…
Alice and Bob are given two correlated n-bit strings x_1 and, respectively, x_2, which they want to losslessly compress and send to Zack. They can either collaborate by sharing their strings, or work separately. We show that there is no…
It is well known that normality can be described as incompressibility via finite automata. Still the statement and the proof of this result as given by Becher and Heiber (2013) in terms of "lossless finite-state compressors" do not follow…
Let s be a string whose symbols are solely available through access(i), a read-only operation that probes s and returns the symbol at position i in s. Many compressed data structures for strings, trees, and graphs, require two kinds of…
This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…
It is shown that the generating function of $\mathscr{N}=2$ topological strings, in the heterotic weak coupling limit, is identified with the partition function of a six-dimensional Melvin background. This background, which corresponds to…
R. Duncan Luce once mentioned in a conversation that he did not consider Kolmogorov's probability theory well-constructed because it treats stochastic independence as a "numerical accident," while it should be treated as a fundamental…
This paper is about certain string-to-string functions, called the polyregular functions. These are like the regular string-to-string functions, except that they can have polynomial (and not just linear) growth. The class has four…
We develop a general formalism for representing and understanding structure in complex systems. In our view, structure is the totality of relationships among a system's components, and these relationships can be quantified using information…
The mission of statistics is to provide adequate statistical hypotheses (models) for observed data. But what is an "adequate" model? To answer this question, one needs to use the notions of algorithmic information theory. It turns out that…
Little String Theory (LST) is a still somewhat mysterious theory that describes the dynamics near a certain class of time-like singularities in string theory. In this paper we discuss the topological version of LST, which describes…
In this paper, we present a theoretical effort to connect the theory of program size to psychology by implementing a concrete language of thought with Turing-computable Kolmogorov complexity (LT^2C^2) satisfying the following requirements:…