Related papers: Complexity Hierarchies Beyond Elementary
A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…
We define the notion of localizable property for a dynamical system. Then we survey three properties of complexity and relate how they are known to be typical among differentiable dynamical systems. These notions are the fast growth of the…
Abstraction is essential for reducing the complexity of systems across diverse fields, yet designing effective abstraction methodology for probabilistic models is inherently challenging due to stochastic behaviors and uncertainties. Current…
Higher category theory is an exceedingly active area of research, whose rapid growth has been driven by its penetration into a diverse range of scientific fields. Its influence extends through key mathematical disciplines, notably homotopy…
Analytical thinking is dominated by binary ideas. From pair-wise interactions, to algebraic operations, to compositions of processes, to network models, binary structures are deeply ingrained in the fabric of most current scientific…
The well-known difficulties arising in a classification which is not set-theoretically trivial---involving what is sometimes called a non-smooth quotient---have been overcome in a striking way in the theory of operator algebras by the use…
Many tasks in statistical and causal inference can be construed as problems of \emph{entailment} in a suitable formal language. We ask whether those problems are more difficult, from a computational perspective, for \emph{causal}…
We study the complexity of the model checking problem, for fixed model A, over certain fragments L of first-order logic. These are sometimes known as the expression complexities of L. We obtain various complexity classification theorems for…
The evolution of complexity has been a central theme for Biology and Artificial Life (Bonner, 1988; Bedau et al., 2000). Complexification has been interpreted in different ways: as a process of diversification between evolving units…
We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…
We study multimodal logics over universally first-order definable classes of frames. We show that even for bimodal logics, there are universal Horn formulas that define set of frames such that the satisfiability problem is undecidable, even…
We review some semantic and syntactic complexity classes that were introduced to better understand the relationship between complexity classes P and NP. We also define several new complexity classes, some of which are associated with…
The underlying structure of natural language is hierarchical; words combine into phrases, which in turn form clauses. An awareness of this hierarchical structure can aid machine learning models in performing many linguistic tasks. However,…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
It may happen that for a certain abductive problem there are several possible explanations, not all of them mutually compatible. What explanation is selected and which criteria are used to select it? This is the well-known problem of the…
Ladders of recollements of abelian categories are introduced, and used to address three general problems. Ladders of a certain height allow to construct recollements of triangulated categories, involving derived categories and singularity…
We show that mixtures comprised of multicomponent systems typically are much more structurally complex than the sum of their parts; sometimes, infinitely more complex. We contrast this with the more familiar notion of statistical mixtures,…
For substructural logics with contraction or weakening admitting cut-free sequent calculi, proof search was analyzed using well-quasi-orders on $\mathbb{N}^d$ (Dickson's lemma), yielding Ackermannian upper bounds via controlled bad-sequence…
This position paper reflects on the state-of-the-art in decision-making under uncertainty. A classical assumption is that probabilities can sufficiently capture all uncertainty in a system. In this paper, the focus is on the uncertainty…
We develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put forward an algebraic interpretation of the…