# Contact Info

All your questions concerning the conference should be sent to:José M. Sempere (jsempere@dsic.upv.es) or

Claudio Zandron (zandron@disco.unimib.it)

# Tutorial Day

The Tutorial Day aims to introduce P systems to the audience by covering the main
aspects of membrane computing. It is specially oriented to students of computer science,
mathematics, biology, and science in a broad sense. Nevertheless, it is a good
opportunity to review the cornerstones of this research area for all the people
working in membrane computing.

# The tutorials and the lecturers

A Personal Overview of Membrane ComputingProf. Dr. Gheorghe Paun
Romanian Academy, Academia Europaea, and University of Sevilla |

** Abstract** This is a personal presentation of membrane computing,
starting with the initial intentions/dreams from the beginnings, the autumn
of 1998, describing shortly the "map" of the domain (with emphasis on the research
directions where I was involved), and coming to the "frontiers", the questions
which I believe they deserve our efforts in the near future. I will also touch
such sensitive topics as the balance between theory and applications, motivations
for further models, the limits of natural computing ("do we dream too much?"),
the possible dissolution of membrane computing (and of other related areas) in a
more general scientific framework (let us call it "infobiology"), and so on.
The presentation will be rather informal, but some basic knowledge of membrane
computing is assumed.

**The slides**(here)

Computational Completeness and Universality in Membrane ComputingProf. Dr. Rudolf Freund
Faculty of Informatics, TU Vienna |

** Abstract** Many variants of membrane systems can be shown to be computationally
complete. The proof techniques depend on the objects and the way they are processed in the
membrane system, e.g., symbol objects processed in parallel or strings or even DNA molecules
processed sequentially. In the tutorial, typical examples for proofs showing computational
completeness of specific variants of P systems are given. Moreover, the constructions of
several small universal P systems will be explained.

**The slides**(here)

Computational Complexity Aspects in Membrane ComputingDr. Claudio Zandron
Department of Informatics, Systems and Communications, University of Milano-Bicocca |

** Abstract** We will recall basic definitions for Membrane Systems with Active Membranes
and we will show how to use such systems to produce Time-efficient solutions for some computationally
hard problems. We will then present the main Time Complexity and Space Complexity Classes
for Membrane systems.

**The slides**(here)

P automataDr. Gyorgy Vaszil
Department of Computer Science, University of Debrecen |

** Abstract** P automata are variants of P systems introduced with
the intention to build a bridge between more conventional, automata-like
computational devices and membrane systems. They are similar to automata in the
sense that they are processing a given input provided as a sequence (or string)
of input entities. In this tutorial, we are going to look at P automata as the
implementation of a computing principle where the computational resources (in
particular the space for storing information and the "program" for manipulating it),
are provided by the symbols of the input which are already processed: The processed
part of the input becomes part of the "hardware" of the machine, thus, similarly to
several "computational" mechanisms going on in the real world, the object of the
computation and the device executing the computation itself can not be clearly
distinguished. We are going to give a wide overview on topics such as the different
variants of P automata, results on complexity and computability, and their relations
to formal language theory.

**The slides**(here)

"In silico" Membrane Computing: Implementation vs. SimulationDr. Agustín Riscos-Núñez
Department of Computer Science and Artificial Intelligence, University of Sevilla |

** Abstract** This tutorial will provide an overview on existing simulation software tools
devoted to membrane computing. Challenges related to flexibility and performance will be discussed,
from the perspective of simulators design. In particular, a variety of case studies using P-Lingua
and MeCoSim will be illustrated, from ecosystem modelling to solutions to NP-complete problems.

**The slides**(here)