Related papers: Polynomial Depth, Highness and Lowness for E
We prove nilpotency results for Lie algebras over an arbitrary field admitting a derivation, which satisfies a given polynomial identity $r(t)=0$. For the polynomial $r=t^n-1$ we obtain results on the nilpotency of Lie algebras admitting a…
This contribution investigates the computational complexity of simulating linear ordinary differential equations (ODEs) on digital computers. We provide an exact characterization of the complexity blowup for a class of ODEs of arbitrary…
The purpose of this article is to examine and limit the conditions in which the P complexity class could be equivalent to the NP complexity class. Proof is provided by demonstrating that as the number of clauses in a NP-complete problem…
In this article, we study the relationship between notions of depth for sequences, namely, Bennett's notions of strong and weak depth, and deep $\Pi^0_1$ classes, introduced by the authors and motivated by previous work of Levin. For the…
Stochastic differential equations (SDEs) and the Kolmogorov partial differential equations (PDEs) associated to them have been widely used in models from engineering, finance, and the natural sciences. In particular, SDEs and Kolmogorov…
Logical depth and sophistication are two quantitative measures of the non-trivial organization of an object. Although apparently different, these measures have been proven equivalent, when the logical depth is renormalized by the busy…
It is not obvious what fraction of all the potential information residing in the molecules and structures of living systems is significant or meaningful to the system. Sets of random sequences or identically repeated sequences, for example,…
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…
This paper presents a new semantic method for proving lower bounds in computational complexity. We use it to prove that maxflow, a PTIME complete problem, is not computable in polylogarithmic time on parallel random access machines (PRAMs)…
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…
The computational complexity of polynomial ideals and Gr\"obner bases has been studied since the 1980s. In recent years, the related notions of polynomial subalgebras and SAGBI bases have gained more and more attention in computational…
This paper is about the logarithmic limit sets of real semi-algebraic sets, and, more generally, about the logarithmic limit sets of sets definable in an o-minimal, polynomially bounded structure. We prove that most of the properties of the…
Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…
We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings,…
In this paper we introduce a new formulation of Bennett's logical depth based on pebble transducers. This notion is defined based on the difference between the minimal length descriptional complexity of prefixes of infinite sequences from…
Typing of lambda-terms in Elementary and Light Affine Logic (EAL, LAL, resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL, resp.) proof-nets admits a guaranteed polynomial…
Kolmogorov argued that the concept of information exists also in problems with no underlying stochastic model (as Shannon's information representation) for instance, the information contained in an algorithm or in the genome. He introduced…
It has long been conjectured that hypotheses spaces suitable for data that is compositional in nature, such as text or images, may be more efficiently represented with deep hierarchical networks than with shallow ones. Despite the vast…
We show that the mutual information, in the sense of Kolmogorov complexity, of any pair of strings $x$ and $y$ is equal, up to logarithmic precision, to the length of the longest shared secret key that two parties, one having $x$ and the…
Let $N$ be a large prime and $P, Q \in \mathbb{Z}[x]$ two linearly independent polynomials with $P(0) = Q(0) = 0$. We show that if a subset $A$ of $\mathbb{Z}/N\mathbb{Z}$ lacks a progression of the form $(x, x + P(y), x + Q(y), x + P(y) +…