Universal families of reversible p systems

Authors:
Alberto Leporati;Claudio Zandron;Giancarlo Mauri
Affiliations:
Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano – Bicocca, Milano, Italy;Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano – Bicocca, Milano, Italy;Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano – Bicocca, Milano, Italy
Venue:
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Year:
2004

Citing 8
Cited 4

Introduction to Circuit Complexity: A Uniform Approach

Introduction to Circuit Complexity: A Uniform Approach
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Energy-Controlled P Systems

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Computing with Membranes

Computing with Membranes
Simulating Boolean Circuits on a DNA Computer

Simulating Boolean Circuits on a DNA Computer
The conformon-P system: a molecular and cell biology-inspired computability model

Theoretical Computer Science
Irreversibility and heat generation in the computing process

IBM Journal of Research and Development
Logical reversibility of computation

IBM Journal of Research and Development

Three "quantum" algorithms to solve 3-SAT

Theoretical Computer Science
(UREM) P systems with a quantum-like behavior: background, definition, and computational power

WMC'07 Proceedings of the 8th international conference on Membrane computing
Quantum sequential p systems with unit rules and energy assigned to membranes

WMC'05 Proceedings of the 6th international conference on Membrane Computing
Conservative computations in energy–based p systems

WMC'04 Proceedings of the 5th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conservative logic is a mathematical model of computation that reflects some properties of microdynamical laws of physics, such as reversibility and the conservation of the internal energy of the physical system used to perform the computations. The model is based upon the Fredkin gate, a reversible and conservative three–input/three–output boolean gate which is functionally complete for boolean logic. Computations are performed by reversible circuits composed by Fredkin gates. In this paper we introduce energy–based P systems as a parallel and distributed model of computation in which the amount of energy manipulated and/or consumed during computations is taken into account. Moreover, we show how energy–based P systems can be used to simulate reversible Fredkin circuits. The simulating systems turn out to be themselves reversible and conservative.