Generation of Diophantine Sets by Computing P Systems with External Output

Authors:
Álvaro Romero Jiménez;Mario J. Pérez-Jiménez
Affiliations:
-;-
Venue:
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Year:
2002

Citing 4
Cited 0

Hilbert's tenth problem

Hilbert's tenth problem
Membrane computing with external output

Fundamenta Informaticae
Computing with membranes

Journal of Computer and System Sciences
A guide to membrane computing

Theoretical Computer Science - Natural computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper a variant of P systems with external output designed to compute functions on natural numbers is presented. These P systems are stable under composition and iteration of functions. We prove that every diophan tine set can be generated by such P systems; then, the universality of this model can be deduced from the theorem by Matiyasevich, Robinson, Davis and Putnam in which they establish that every recursively enumerable set is a diophantine set.