First Steps Towards a Geometry of Computation

We introduce a geometrical setting which seems promising for the study of computation in multiset rewriting systems, but could also be applied to register machines and other models of computation. This approach will be applied here to membrane systems (also known as P systems) without dynamical membrane creation. We discuss the role of maximum parallelism and further simplify our model by considering only one membrane and sequential application of rules, thereby arriving at asynchronous multiset rewriting systems (AMR systems). Considering only one membrane is no restriction, as each static membrane system has an equivalent AMR system. It is further shown that AMR systems without a priority relation on the rules are equivalent to Petri Nets. For these systems we introduce the notion of asymptotically exact computation, which allows for stochastic appearance checking in a priori bounded (for some complexity measure) computations. The geometrical analogy in the lattice N0, d ∈ N, is developed, in which a computation corresponds to a trajectory of a random walk on the directed graph induced by the possible rule applications. Eventually this leads to symbolic dynamics on the partition generated by shifted positive cones C p , p ∈ N0, which are associated with the rewriting rules, and their intersections. Complexity measures are introduced and we consider non–halting, loop–free computations and the conditions imposed on the rewriting rules. Eventually, two models of information processing, control by demand and control by availability are discussed and we end with a discussion of possible future developments.

[1]  Wolfgang Reisig,et al.  Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.

[2]  Naftali Tishby,et al.  Stochastic computing with biomolecular automata , 2004, Proc. Natl. Acad. Sci. USA.

[3]  E. D. Giorgi.  Selected Papers , 2006 .

[4]  E D Sontag,et al.  Some new directions in control theory inspired by systems biology. , 2004, Systems biology.

[5]  Gheorghe Paun,et al.  Membrane Computing: The Power of (Rule) Creation , 2002, J. Univers. Comput. Sci..

[6]  R. Paton,et al.  Spatio-logical processes in intracellular signalling. , 2000, Bio Systems.

[7]  Jorma Rissanen,et al.  The Minimum Description Length Principle in Coding and Modeling , 1998, IEEE Trans. Inf. Theory.

[8]  Rudolf Freund,et al.  Asynchronous P Systems and P Systems Working in the Sequential Mode , 2004, Workshop on Membrane Computing.

[9]  Daniel Le Métayer,et al.  Programming by multiset transformation , 1993, CACM.

[10]  Wolfgang Banzhaf,et al.  Artificial ChemistriesA Review , 2001, Artificial Life.

[11]  J. Davies,et al.  Molecular Biology of the Cell , 1983, Bristol Medico-Chirurgical Journal.

[12]  Valerie Isham,et al.  Non‐Negative Matrices and Markov Chains , 1983 .

[13]  Danail Bonchev,et al.  Chemical Reaction Networks , 1996 .

[14]  Apostolos Syropoulos,et al.  Mathematics of Multisets , 2000, WMP.

[15]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[16]  P. R. Peacock.  Selected Papers , 1949, Nature.

[17]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[18]  Jinyuan You,et al.  P Systems and Petri Nets , 2003, Workshop on Membrane Computing.

[19]  D N Wheatley,et al.  Diffusion Theory in Biology: A Relic of Mechanistic Materialism , 2000, Journal of the history of biology.

[20]  Robert Rosen,et al.  A relational theory of biological systems II , 1958 .

[21]  Adrian S. Lewis,et al.  Convex Analysis And Nonlinear Optimization , 2000 .

[22]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.

[23]  John Doyle.  Computational biology: Beyond the spherical cow , 2001, Nature.

[24]  Moshe Abeles,et al.  Time Is Precious , 2004, Science.

[25]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[26]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[27]  S. Leibler,et al.  Robustness in simple biochemical networks , 1997, Nature.

[28]  P. Halling.  Do the laws of chemistry apply to living cells? , 1989, TIBS -Trends in Biochemical Sciences. Regular ed.

[29]  Michal Walicki,et al.  Algebraic approaches to nondeterminism—an overview , 1997, CSUR.

[30]  Werner E. Kluge,et al.  Reduction, Data Flow and Control Flow Models of Computation , 1986, Advances in Petri Nets.

[31]  D. Wood,et al.  Computation with biomolecules. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[32]  Geert Jan Olsder,et al.  Synchronization and Linearity: An Algebra for Discrete Event Systems , 1994 .

[33]  B. Alberts,et al.  Molecular Biology of the Cell 4th edition , 2007 .

[34]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[35]  Zohar Manna,et al.  Proving termination with multiset orderings , 1979, CACM.

[36]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[37]  Mario J. Pérez-Jiménez,et al.  An Approach to Computational Complexity in Membrane Computing , 2004, Workshop on Membrane Computing.

[38]  Kazuo Murota,et al.  Discrete convex analysis , 1998, Math. Program..

[39]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[40]  G. P. Monro,et al.  The Concept of Multiset , 1987, Math. Log. Q..

[41]  Christof Koch,et al.  Computation and the single neuron , 1997, Nature.

[42]  Bruce J. MacLennan,et al.  Natural computation and non-Turing models of computation , 2004, Theor. Comput. Sci..

[43]  Hiroshi Tanaka,et al.  Artificial Life Applications of a Class of P Systems: Abstract Rewriting Systems on Multisets , 2000, WMP.

[44]  Mario J. Pérez-Jiménez,et al.  Exploring Computation Trees Associated with P Systems , 2004, Workshop on Membrane Computing.

[45]  C. Reutenauer.  The Mathematics of Petri Nets , 1990 .

[46]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[47]  J J Hopfield,et al.  Encoding for computation: recognizing brief dynamical patterns by exploiting effects of weak rhythms on action-potential timing. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[48]  Douglas Lind,et al.  An Introduction to Symbolic Dynamics and Coding: SHIFTS AS DYNAMICAL SYSTEMS , 1995 .

[49]  Mario de Jesús Pérez Jiménez,et al.  Weak Metrics on Configurations of a P System , 2004 .

[50]  H. Kitano,et al.  Computational systems biology , 2002, Nature.

[51]  Peter Dittrich,et al.  Artificial Chemistry ’ s Global Dynamic . Movements in the Lattice of Organisation , 2022 .

[52]  Oscar H. Ibarra,et al.  Catalytic P systems, semilinear sets, and vector addition systems , 2004, Theor. Comput. Sci..

[53]  Carlos Martín-Vide,et al.  Membrane systems with promoters/inhibitors , 2002, Acta Informatica.

[54]  Gheorghe Paun,et al.  Symport/Antiport P Systems with Three Objects Are Universal , 2004, Fundam. Informaticae.

[55]  Hagit Attiya,et al.  Wiley Series on Parallel and Distributed Computing , 2004, SCADA Security: Machine Learning Concepts for Intrusion Detection and Prevention.

[56]  Marcin Paprzycki,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..

[57]  C. Leake.  Synchronization and Linearity: An Algebra for Discrete Event Systems , 1994 .