相关论文: Is Space a Stronger Resource than Time? Positive A…

Any class of languages $\mathbf{L}$ accepted in time $\mathbf{T}$ has a counterpart $\mathbf{NL}$ accepted in nondeterministic time $\mathbf{NT}$. It follows from the definition of nondeterministic languages that $\mathbf{L} \subseteq…

We prove in this paper that there is a language $L_s$ accepted by some nondeterministic Turing machine that runs within time $O(n^k)$ for any positive integer $k\in\mathbb{N}_1$ but not by any ${\rm co}\mathcal{NP}$ machines. Then we…

We present new results on the landscape of problems that can be solved by quantum Turing machines (QTM's) employing severely limited amounts of memory. In this context, we demonstrate two infinite time hierarchies of complexity classes…

Savitch showed in $1970$ that nondeterministic logspace (NL) is contained in deterministic $\mathcal{O}(\log^2 n)$ space but his algorithm requires quasipolynomial time. The question whether we can have a deterministic algorithm for every…

The power of real-time Turing machines using sublinear space is investigated. In contrast to a claim appearing in the literature, such machines can accept non-regular languages, even if working in deterministic mode. While maintaining a…

We show that for all functions $t(n) \geq n$, every multitape Turing machine running in time $t$ can be simulated in space only $O(\sqrt{t \log t})$. This is a substantial improvement over Hopcroft, Paul, and Valiant's simulation of time…

With the theory of special relativity, time has been linked with space into a four-dimensional space-time from which a basic question must be asked: can space be really transformed into time and vice-versa? The response is affirmative if…

We give an O(n^3+n^2 t) time algorithm to determine whether an NFA with n states and t transitions accepts a language of polynomial or exponential growth. We also show that given a DFA accepting a language of polynomial growth, we can…

A classic result of Paul, Pippenger, Szemer\'edi and Trotter states that DTIME(n) is strictly contained in NTIME(n). The natural question then arises: could DTIME(t(n)) be contained in NTIME(n) for some superlinear time-constructible…

IIn the paper the Space-Time problem is considered as it seen in the informational conception ("the Information as Absolute" conception) comparing with a number of existent physical and philosophical approaches. Since the conception is…

We live in a 3+1 space-time that is intended as a description of the universe with three space dimensions and one time dimension. Space-time dimensionality seems so natural that it is rarely criticized. Experiments and the highly successful…

From the Physics point of view, time is now best described through General Relativity, as part of space-time which is a dynamical object encoding gravity. Time possesses also some intrinsic irreversibility due to thermodynamics, quantum…

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…

Modern physics, via the standard model with Higgs mechanism and string theory for example, has supplied ether-like models and emergent general relativity scenarios that substantially weaken the usual defense of orthodox relativity and…

Understanding the emergence of a tangible 4-dimensional space-time from a quantum theory of gravity promises to be a tremendously difficult task. This article makes the case that this task may not have to be carried. Space-time as we know…

We examine the minimum amount of memory for real-time, as opposed to one-way, computation accepting nonregular languages. We consider deterministic, nondeterministic and alternating machines working within strong, middle and weak space, and…

There is an important and interesting open question in computational complexity on the relation between the complexity classes $\mathcal{NP}$ and $\mathcal{PSPACE}$. It is a widespread belief that $\mathcal{NP}\ne\mathcal{PSPACE}$. In this…

We consider Minkowski spacetime, the set of all point-events of spacetime under the relation of causal accessibility. That is, ${\sf x}$ can access ${\sf y}$ if an electromagnetic or (slower than light) mechanical signal could be sent from…

We consider the Partition problem and propose a deterministic FPTAS (Fully Polynomial-Time Approximation Scheme) that runs in $\widetilde{O}(n + 1/\varepsilon)$-time. This is the best possible (up to a polylogarithmic factor) assuming the…

The formulation of gravity theory is considered where space-time is a 4-dimensional surface in flat ten-dimensional space. The possibility of using the "external" time (the time of ambient space) in this approach is investigated. The…