Related papers: Towards an axiomatic system for Kolmogorov complex…
In classical physics, the Kolmogorov extension theorem lays the foundation for the theory of stochastic processes. It has been known for a long time that, in its original form, this theorem does not hold in quantum mechanics. More…
By Kolmogorov Complexity,two number-theoretic problems are solved in different way than before,one problem is Maxim Kontsevich and Don Bernard Zagier's Problem 3 \emph{Exhibit at least one number which does not belong to} $ \mathcal{P}$…
A system's apparent simplicity depends on whether it is represented classically or quantally. This is not so surprising, as classical and quantum physics are descriptive frameworks built on different assumptions that capture, emphasize, and…
Is it possible to find a shortest description for a binary string? The well-known answer is "no, Kolmogorov complexity is not computable." Faced with this barrier, one might instead seek a short list of candidates which includes a laconic…
Abstract argumentation frameworks (AFs) provide a formal setting to analyze many forms of reasoning with conflicting information. While the expressiveness of general infinite AFs make them a tempting tool for modeling many kinds of…
We study the possible growth rates of the Kolmogorov complexity of initial segments of sequences that are random with respect to some computable measure on $2^\omega$, the so-called proper sequences. Our main results are as follows: (1) We…
Using the ideas of abstract algebra, we introduce the basic concepts of abstract probability theory that generalize the Kolmogorov's probability theory, possibility theory and other theories that deal with uncertainty. Based on abstract…
We consider $N$-species nonautonomous competitive systems of partial differential equations of Kolmogorov type. Under the Neumann boundary conditions we give a sufficient condition for the system to be uniformly stable and globally…
Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing…
Uniqueness and independence are two fundamental properties of data. Their enforcement in database systems can lead to higher quality data, faster data service response time, better data-driven decision making and knowledge discovery from…
The simplicial volume is a homotopy invariant of manifolds introduced by Gromov in 1982. In order to study its main properties, Gromov himself initiated the dual theory of bounded cohomology, that developed into an active and independent…
Given a first-order theory $T$ formulated in the usual language of first-order arithmetic, we say that $T$ is of *restricted complexity* if there is some natural number $n$ and some set $\mathcal A$ of $\Sigma_n$-sentences such that $T$ can…
Loveland complexity is a variant of Kolmogorov complexity, where it is asked to output separately the bits of the desired string, instead of the string itself. Similarly to the resource-bounded Kolmogorov sets we define Loveland sets. We…
We give a necessary and sufficient condition for a simplicial complex to be approximately Cohen-Macaulay. Namely it is approximately Cohen-Macaulay if and only if the ideal associated to its Alexander dual is componentwise linear and…
Let X be a smooth, geometrically connected variety over a p-adic local field. We show that the pro-unipotent fundamental group of X (in both the etale and crystalline settings) satisfies the weight-monodromy conjecture, following…
We study the computational complexity theory of smooth, finite-dimensional dynamical systems. Building off of previous work, we give definitions for what it means for a smooth dynamical system to simulate a Turing machine. We then show that…
Recently, we obtained in [7] a new characterization for an orthogonal system to be a simple-minded system in the stable module category of any representation-finite self-injective algebra. In this paper, we apply this result to give an…
In this paper we analyze the notion of "stopping time complexity", informally defined as the amount of information needed to specify when to stop while reading an infinite sequence. This notion was introduced by Vovk and Pavlovic (2016). It…
We prove, for an arbitrary finite root system, the periodicity conjecture of Al.B.Zamolodchikov concerning Y-systems, a particular class of functional relations arising in the theory of thermodynamic Bethe ansatz. Algebraically, Y-systems…
We extend the classical Ostrowski numeration systems, closely related to Sturmian words, by allowing a wider range of coefficients, so that possible representations of a number $n$ better reflect the structure of the associated Sturmian…