Related papers: Towards an axiomatic system for Kolmogorov complex…
We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…
We provide a novel semantics for belief using simplicial complexes. In our framework, belief satisfies the \textsf{KD45} axioms and rules as well as the ``knowledge implies belief'' axiom ($K\phi \lthen B\phi$); in addition, we adopt the…
The spatial character of territorial systems plays a crucial role in the emergence of their complexities. This contribution aims at illustrating to what extent different types of complexities can be exhibited in models of such systems. We…
We study the orthogonal quantum groups satisfying the ``easiness'' assumption axiomatized in our previous paper, with the construction of some new examples, and with some partial classification results. The conjectural conclusion is that…
We consider whether given a simple, finite description of a group in the form of an algorithm, it is possible to algorithmically determine if the corresponding group has some specified property or not. When there is such an algorithm, we…
For a broad class of input-output maps, arguments based on the coding theorem from algorithmic information theory (AIT) predict that simple (low Kolmogorov complexity) outputs are exponentially more likely to occur upon uniform random…
Cook and Reckhow 1979 pointed out that NP is not closed under complementation iff there is no propositional proof system that admits polynomial size proofs of all tautologies. Theory of proof complexity generators aims at constructing sets…
This is an expository paper about the Borel complexity of structure and classification theorems. It sorts several classical problems relative to known benchmarks of complexity. As a corollary various problems proposed by people such as von…
In this paper, we assess the complexity results of formalisms that describe the feature theories used in computational linguistics. We show that from these complexity results no immediate conclusions can be drawn about the complexity of the…
Within integrable systems, the class of so called "semitoric" integrable systems in dimension four has attracted a lot of attention in recent years, especially since fundamental examples from classical and quantum mechanics have been…
In 1988, Ivlev proposed four-valued non-deterministic semantics for modal logics in which the alethic T axiom holds good. Unfortunately, no completeness was proved. In previous work, we proved completeness for some Ivlev systems and…
Diverse applications of Kolmogorov complexity to learning [CIKK16], circuit complexity [OPS19], cryptography [LP20], average-case complexity [Hir21], and proof search [Kra22] have been discovered in recent years. Since the running time of…
We propose a simple complexity indicator of classical Liouvillian dynamics, namely the separability entropy, which determines the logarithm of an effective number of terms in a Schmidt decomposition of phase space density with respect to an…
We consider stationary stochastic processes $X_n$, $n\in \mathbb{Z}$ such that $X_0$ lies in the closed linear span of $X_n$, $n\neq 0$; following Ghosh and Peres, we call such processes linearly rigid. Using a criterion of Kolmogorov, we…
We introduce amorphic complexity as a new topological invariant that measures the complexity of dynamical systems in the regime of zero entropy. Its main purpose is to detect the very onset of disorder in the asymptotic behaviour. For…
Steepness is a geometric property which, together with complex-analyticity, is needed in order to insure stability of a near-integrable hamiltonian system over exponentially long times. Following a strategy developed by Nekhoro-shev, we…
The decay of a general time dependent structure factors is considered. The dynamics is that of stochastic field equations of the Langevin type, where the systematic generalized force is a functional derivative of some classical field…
The information in an individual finite object (like a binary string) is commonly measured by its Kolmogorov complexity. One can divide that information into two parts: the information accounting for the useful regularity present in the…
We address here the problem of extending the Pesin relation among positive Lyapunov exponents and the Kolmogorov-Sinai entropy to the case of dynamical systems exhibiting subexponential instabilities. By using a recent rigorous result due…
Recent work of Qi et al. arXiv:2004.11240v7 proposes a set of axioms for tensor rank functions. The current paper presents examples showing that their axioms allow rank functions to have some undesirable properties, and a stronger set of…