Symport/Antiport P Systems with Three Objects Are Universal

Authors:
Gheorghe Păun;Mario J. Pérez-Jiménez;Juan Pazos;Alfonso Rodríguez-Patón
Affiliations:
(Correspd.) Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700 Bucureşti, Romania. george.paun@imar.ro;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Avda. Reina Mercedes s/n, 41012 Sevilla, Spain. gpaun/marper@us.es;Department of Artificial Intelligence, Faculty of Computer Science, Polytechnical University of Madrid, Campus de Montegancedo, Boadilla del Monte 28660, Madrid, Spain. jpazos/arpaton@fi.upm.es;Department of Artificial Intelligence, Faculty of Computer Science, Polytechnical University of Madrid, Campus de Montegancedo, Boadilla del Monte 28660, Madrid, Spain. jpazos/arpaton@fi.upm.es
Venue:
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Year:
2005

Citing 10
Cited 1

Small universal Turing machines

Theoretical Computer Science - Special issue on universal machines and computations
Membrane Computing: An Introduction

Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport

New Generation Computing
Membrane Computing: When Communication Is Enough

UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Membrane Systems with Symport/Antiport Rules: Universality Results

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Tissue P systems

Theoretical Computer Science
Tissue P systems with channel states

Theoretical Computer Science - Insightful theory
Computation: finite and infinite machines

Computation: finite and infinite machines
Communicative p systems with minimal cooperation

WMC'04 Proceedings of the 5th international conference on Membrane Computing
On the size of p systems with minimal symport/antiport

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

Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The operations of symport and antiport, directly inspired frombiology, are already known to be rather powerful when used in the framework of P systems. In this paper we confirm this observation with a quite surprising result: P systems with symport/antiport rules using only three objects can simulate any counter machine, while systems with only two objects can simulate any blind counter machine. In the first case, the universality (of generating sets of numbers) is obtained also for a small number of membranes, four.