Related papers: Space and Time Complexity for Infinite Time Turing…
Proving lower bounds remains the most difficult of tasks in computational complexity theory. In this paper, we show that whereas most natural NP-complete problems belong to NLIN (linear time on nondeterministic RAMs), some of them,…
New notions of the complexity function C(epsilon;t,s) and entropy function S(epsilon;t,s) are introduced to describe systems with nonzero or zero Lyapunov exponents or systems that exhibit strong intermittent behavior with ``flights'',…
We propose to consider non confluence with respect to implicit complexity. We come back to some well known classes of first-order functional program, for which we have a characterization of their intentional properties, namely the class of…
Standpoint linear temporal logic SLTL is a recent formalism able to model possibly conflicting commitments made by distinct agents, taking into account aspects of temporal reasoning. In this paper, we analyse the computational properties of…
We study the complexity of deciding the equality of infinite objects specified by systems of equations, and of infinite objects specified by lambda-terms. For equational specifications there are several natural notions of equality: equality…
This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named…
In this paper we consider the classification of minimal cellular structures of spaces of topological complexity two under some hypotheses on there graded cohomological algebra. This continues the method used by M.Grant et al. in [1].
In this paper we study a class of inhomogeneous cosmological models which is a modified version of what is usually called the Lema\^itre-Tolman model. We assume that we have a space with 2-dimensional locally homogeneous spacelike surfaces.…
We investigate bicomplex Hamiltonian systems in the framework of an analogous version of the Schrodinger equation. Since in such a setting three different types of conjugates of bicomplex numbers appear, each is found to define in a natural…
We investigate the relationship between several enumeration complexity classes and focus in particular on problems having enumeration algorithms with incremental and polynomial delay (IncP and DelayP respectively). We show that, for some…
Inspired by the universality of computation, we advocate for a principle of spacetime complexity, where gravity arises as a consequence of spacetime optimizing the computational cost of its own quantum dynamics. This principle is explicitly…
We give arguments for the existence of a thermodynamics of quantum complexity that includes a "Second Law of Complexity". To guide us, we derive a correspondence between the computational (circuit) complexity of a quantum system of $K$…
Our purpose here is to introduce the idea of viewing the spacetime as a macroscopic complex system which, consequently, cannot be directly quantized. It should be thought of as a collection of more fundamental "microscopical" entities…
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…
Time, space, and matter are categories of our reasoning, whose properties appear to be fundamental. However, these require a scrutiny as in the extreme regime of the primordial universe these present quantum properties. What does it mean…
This essay examines our fundamental conceptions of time, spacetime, the asymmetry of time, and the motion of a quantum mechanical particle. The concept of time has multiple meanings and these are often confused in the literature and must be…
The machinery is suggested to describe the varying spacetime topology on the level of its substitutes by finite topological spaces.
Recent proposals suggest that a notion of generalized complexity, analogous to generalized entropy, may be necessary for understanding the dynamics of holographic complexity in settings where quantum effects are non-negligible, such as…
We classify the complexity of the satisfiability problem for extensions of CTL and UB. The extensions we consider are Boolean combinations of path formulas, fairness properties, past modalities, and forgettable past. Our main result shows…
The fact that in Minkowski space, space and time are both quantized does not have to be introduced as a new postulate in physics, but can actually be derived by combining certain features of General Relativity and Quantum Mechanics. This is…