Fibonacci sequence generation using membrane computing

This paper demonstrates how a well-known number sequence (the Fibonacci numbers) can be generated by a new model of computing called membrane computation. A contribution of this paper is to add a feature to the notation describing membrane structure (originally described by Gheorge Paun) called a recursive meta-rule, which defines how new rules are inherited for each new membrane creation. A membrane computer is inspired by the membrane structures of biological cells. The objects within a given membrane may evolve according to a set of rules established for that membrane. Objects can represent, for example, numbers or strings. Typically, the evolution rules are implemented as transformations on string objects. A key feature of the membrane computer is inherent parallelism; distributed operations are performed simultaneously, unless a priority of operations is specified. A membrane computer of the type called a "transition P-system" is used to represent the Fibonacci numbers as a sequential evolution of objects.