Related papers: P not= NP for infinite time Turing machines
While prior work established a verifier-based polynomial-time framework for NP, explicit deterministic machines for concrete NP-complete problems have remained elusive. In this paper, we construct fully specified deterministic Turing…
In the present work we propose a generalization of tunneling time in parity and time ($\mathcal{P}\mathcal{T}$)-symmetric systems. The properties of tunneling time in $\mathcal{P}\mathcal{T}$-symmetric systems are studied with a simple…
It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether a given quantum…
We study a polynomial-time decision problem in which each input encodes a depth-$N$ causal execution in which a single non-duplicable token must traverse an ordered sequence of steps, revealing at most $O(1)$ bits of routing information at…
Despite remarkable achievements in its practical tractability, the notorious class of NP-complete problems has been escaping all attempts to find a worst-case polynomial time-bound solution algorithms for any of them. The vast majority of…
We study clockability for Ordinal Turing Machines (OTMs). In particular, we show that, in contrast to the situation for ITTMs, admissible ordinals can be OTM-clockable, that $\Sigma_{2}$-admissible ordinals are never OTM-clockable and that…
This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is specified, but the exact values of the probabilities are not.…
Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…
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…
*by a standard (one-tape) Turing machine. It is well-known that the word problem for hyperbolic groups, whence in particular for free groups, can be solved in linear time. However, these algorithms run on machines more complicated than a…
Recent technological breakthroughs have precipitated the availability of specialized devices that promise to solve NP-Hard problems faster than standard computers. These `Ising Machines' are however analog in nature and as such inevitably…
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm…
We discuss the problem of large gauge invariance at finite temperature.
We survey results of a quarter century of work on computation by reversible general-purpose computers (in this setting Turing machines), and general reversible simulation of irreversible computations, with respect to energy-, time- and…
When facing time-variant problems in analog computing, the desirable RNN design requires finite-time convergence and robustness with respect to various types of uncertainties, due to the time-variant nature and difficulties in…
Since many real-world problems arising in the fields of compiler optimisation, automated software engineering, formal proof systems, and so forth are equivalent to the Halting Problem--the most notorious undecidable problem--there is a…
Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview…
In CSL'99 Roversi pointed out that the Turing machine encoding of Girard's seminal paper "Light Linear Logic" has a flaw. Moreover he presented a working version of the encoding in Light Affine Logic, but not in Light Linear Logic. In this…
A controversy surrounding the "tunnelling time problem" stems from the seeming inability of quantum mechanics to provide, in the usual way, a definition of the duration a particle is supposed to spend in a given region of space. For this…
The (Non-Preemptive) Throughput Maximization problem is a natural and fundamental scheduling problem. We are given $n$ jobs, where each job $j$ is characterized by a processing time and a time window, contained in a global interval $[0,T)$,…