Phrasal semantics is concerned with how the meaning of a sentence is composed both from the meaning of the constituent words, and from extra meaning contained within the structural organization of the sentence itself. In this context, grammatical constructions correspond to form-meaning mappings that essentially capture this “extra” meaning and allow its representation. The current research exa...

We show that the Arzelà–Ascoli theorem and Kolmogorov compactness theorem both are consequences of a simple lemma on compactness in metric spaces. Their relation to Helly’s theorem is discussed. The paper contains a detailed discussion on the historical background of the Kolmogorov compactness theorem.

This paper gives a self contained proof of the perturbation theorem for invariant tori in Hamiltonian systems by Kolmogorov, Arnold, and Moser with sharp differentiability hypotheses. The proof follows an idea outlined by Moser in [16] and, as byproducts, gives rise to uniqueness and regularity theorems for invariant tori. 1

We consider the general problem of constructing nonparametric Bayesian models on infinite-dimensional random objects, such as functions, infinite graphs or infinite permutations. The problem has generated much interest in machine learning, where it is treated heuristically, but has not been studied in full generality in nonparametric Bayesian statistics, which tends to focus on models over prob...

The Chapman-Kolmogorov equation with fractional integrals is derived. An integral of fractional order is considered as an approximation of the integral on fractal. Fractional integrals can be used to describe the fractal media. Using fractional integrals, the fractional generalization of the Chapman-Kolmogorov equation is obtained. From the fractional Chapman-Kolmogorov equation, the Fokker-Pla...

The Chapman–Kolmogorov equation with fractional integrals is derived. An integral of fractional order is considered as an approximation of the integral on fractal. Fractional integrals can be used to describe the fractal media. Using fractional integrals, the fractional generalization of the Chapman–Kolmogorov equation is obtained. From the fractional Chapman–Kolmogorov equation, the Fokker–Pla...

The theory of Kolmogorov complexity is based on the discovery, by Alan Turing in 1936, of the universal Turing machine. After proposing the Turing machine as an explanation of the notion of a computing machine, Turing found that there exists one Turing machine which can simulate any other Turing machine. Complexity, according to Kolmogorov, can be measured by the length of the shortest program ...

A link between Kolmogorov Complexity and geometry is uncovered. A similar concept of projection and vector decomposition is described for Kolmogorov Complexity. By using a simple approximation to the Kolmogorov Complexity, coded in Mathematica, the derived formulas are tested and used to study the geometry of Light Cone.

We develop a theory of the algorithmic information in bits contained in an individual pure quantum state. This extends classical Kolmogorov complexity to the quantum domain retaining classical descriptions. Quantum Kolmogorov complexity coincides with the classical Kolmogorov complexity on the classical domain. Quantum Kolmogorov complexity is upper bounded and can be effectively approximated f...