相关论文: On Invariance and Convergence in Time Complexity t…

Eilenberg-type correspondences, relating varieties of languages (e.g. of finite words, infinite words, or trees) to pseudovarieties of finite algebras, form the backbone of algebraic language theory. Numerous such correspondences are known…

This paper proposes an alternative language for expressing results of the algorithmic theory of randomness. The language is more precise in that it does not involve unspecified additive or multiplicative constants, making mathematical…

This paper considers the question of P = NP in context of the polynomial time SAT algorithm. It posits proposition dependent on existence of conjectured problem that even where the algorithm is shown to solve SAT in polynomial time it…

Having in mind that physical systems have different levels of structure we develop the concept of external, internal and total improper Lorentz transformation (space inversion and time reversal). A particle obtained from the ordinary one by…

Contrary to our immediate and vivid sensation of past, present, and future as continually shifting non-relational modalities, time remains as tenseless and relational as space in all of the established theories of fundamental physics. Here…

Given a sound first-order p-time theory $T$ capable of formalizing syntax of first-order logic we define a p-time function $g_T$ that stretches all inputs by one bit and we use its properties to show that $T$ must be incomplete. We leave it…

For the principal eigenvalue of discrete weighted $p$-Laplacian on the set of nonnegative integers, the convergence of an approximation procedure and the inverse iteration is proved. Meanwhile, in the proof of the convergence, the…

The theory of regularity is a philosophical perspective in which laws of nature are just descriptions, that is to say, laws of nature do not govern the world. Moreover, according to the theory of regularity, the number of laws of nature…

Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $\Sigma$ of $\mathcal{L}_{\omega_1, \omega}(L)$ for which there exists an $S_\infty$-invariant probability measure on the collection…

Quantum theory makes the most accurate empirical predictions and yet it lacks simple, comprehensible physical principles from which the theory can be uniquely derived. A broad class of probabilistic theories exist which all share some…

Constraint Satisfaction Problem on finite sets is known to be NP-complete in general but certain restrictions on the constraint language can ensure tractability. It was proved that if a constraint language has a weak near unanimity…

Formal languages are sets of strings of symbols described by a set of rules specific to them. In this note, we discuss a certain class of formal languages, called regular languages, and put forward some elementary results. The properties of…

A finite constraint language $\mathscr{R}$ is a finite set of relations over some finite domain $A$. We show that intractability of the constraint satisfaction problem $\operatorname{CSP}(\mathscr{R})$ can, in all known cases, be replaced…

Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…

Consider a stochastic process $\mathfrak{X}$, regenerative at a state $x$ which is instantaneous and regular. Let $L$ be a regenerative local time for $\mathfrak{X}$ at $x$. Suppose furthermore that $\mathfrak{X}$ can be approximated by…

Separation is a classical problem asking whether, given two sets belonging to some class, it is possible to separate them by a set from a smaller class. We discuss the separation problem for regular languages. We give a Ptime algorithm to…

In Zanardo, 1998, the Peircean semantics for branching-time logics is enriched with a notion of indistinguishability at a moment t between histories passing through t. Trees with indistinguishability relations provide a semantics for a…

This paper develops a new divergence that generalizes relative entropy and can be used to compare probability measures without a requirement of absolute continuity. We establish properties of the divergence, and in particular derive and…

In the first part, in the local non archimedean case, we consider distributions on GL(n+1) which are invariant under the adjoint action of GL(n). We conjecture that such distributions are invariant by transposition. This would imply…

We consider variations on the following problem: given an NFA M and a pattern p, does there exist an x in L(M) such that p matches x? We consider the restricted problem where M only accepts a finite language. We also consider the variation…