We propose three quantum algorithms to solve the 3-SAT NP-complete decision problem. The first algorithm builds, for any instance φ of 3-SAT, a quantum Fredkin circuit that computes a superposition… (More)

Reversibility plays a fundamental role when the possibility to perform computations with minimal energy dissipation is considered. Many papers on reversible computation have appeared in literature:… (More)

We improve previously known universality results on enzymatic numerical P systems (EN P systems, for short) working in all-parallel and one-parallel modes. By using a flattening technique, we first… (More)

We consider the possibility of using spiking neural P systems for solving computationally hard problems, under the assumption that some (possibly exponentially large) pre-computed resources are given… (More)