Related papers: On Kolmogorov Structure Functions
This article provides an introductory tutorial on structural results in partially observed Markov decision processes (POMDPs). Typically, computing the optimal policy of a POMDP is computationally intractable. We use lattice program- ming…
There are (at least) three approaches to quantifying information. The first, algorithmic information or Kolmogorov complexity, takes events as strings and, given a universal Turing machine, quantifies the information content of a string as…
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…
Hamiltonian systems with functionally dependent constraints (irregular systems), for which the standard Dirac procedure is not directly applicable, are discussed. They are classified according to their behavior in the vicinity of the…
The central theme of this thesis is noncommutativity in string theory. We explore in detail how noncommutative structures can emerge in case of the interacting bosonic string and even in the fermionic sector of superstring theory. We have…
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypotheses testing in a framework of classical mathematical statistics. The methods for identity testing and…
We find exact solutions of the string equations of motion and constraints describing the {\em classical}\ splitting of a string into two. We show that for the same Cauchy data, the strings that split have {\bf smaller} action than the…
So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky's work). However, some linguistic phenomena do not cope properly…
Logical models have been successfully used to describe regulatory and signaling networks without requiring quantitative data. However, existing data is insufficient to adequately define a unique model, rendering the parametrization of a…
We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, {\em if-then-else} and…
These proceedings are based on the author's invited talk reviewing the original published work [1,2] of the author with collaborators. The subject matter is a new, covariant and efficient technology of constructing entire trajectories of…
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…
We study some low-lying physical states in a superstring theory based on the quadratically non-linear $SO(N)$--extended superconformal algebra. In the realisation of the algebra that we use, all the physical states are discrete, analogous…
We find a Polyakov-type action for strings moving in a torsional Newton-Cartan geometry. This is obtained by starting with the relativistic Polyakov action and fixing the momentum of the string along a non-compact null isometry. For a flat…
We show that in closed string topology and in open-closed string topology with one $D$-brane, higher genus stable string operations are trivial. This is a consequence of Harer's stability theorem and related stability results on the…
We present results from a detailed numerical study of the small-scale and loop production properties of cosmic string networks, based on the largest and highest resolution string simulations to date. We investigate the non-trivial fractal…
Algorithmic statistics considers the following problem: given a binary string $x$ (e.g., some experimental data), find a "good" explanation of this data. It uses algorithmic information theory to define formally what is a good explanation.…
We give a non-perturbative completion of a class of closed topological string theories in terms of building blocks of dual open strings. In the specific case where the open string is given by a matrix model these blocks correspond to a…
Not only in physical string theories, but also in some highly simplified situations, background independence has been difficult to understand. It is argued that the ``holomorphic anomaly'' of Bershadsky, Cecotti, Ooguri, and Vafa gives a…
We show that the proper interpretation of the cocycle operators appearing in the physical vertex operators of compactified strings is that the closed string target is non-commutative. We track down the appearance of this non-commutativity…