We introduce Genetic Systems, a formalism inspired by genetic regulatory networks and suitable for modeling the interactions between the genes and the proteins, acting as regulatory products. The generation of new objects, representing proteins, is driven by genetic gates: a new object is produced when all the activator objects are available in the system, and no inhibitor object is available. Activators are not consumed by the application of such an evolution rule. Objects disappear because of degradation: each object is equipped with a lifetime, and the object decays when such a lifetime expires. We investigate the computational expressiveness of Genetic Systems: we show that they are Turing equivalent by providing an encoding of Random Access Machines in Genetic Systems. © Springer-Verlag Berlin Heidelberg 2007.
Busi, N., Zandron, C. (2007). Computing with genetic gates: the power of decaying objects. In Computation and Logic in the Real World (pp.105-114). Springer [10.1007/978-3-540-73001-9_11].
Computing with genetic gates: the power of decaying objects
Zandron, C
2007
Abstract
We introduce Genetic Systems, a formalism inspired by genetic regulatory networks and suitable for modeling the interactions between the genes and the proteins, acting as regulatory products. The generation of new objects, representing proteins, is driven by genetic gates: a new object is produced when all the activator objects are available in the system, and no inhibitor object is available. Activators are not consumed by the application of such an evolution rule. Objects disappear because of degradation: each object is equipped with a lifetime, and the object decays when such a lifetime expires. We investigate the computational expressiveness of Genetic Systems: we show that they are Turing equivalent by providing an encoding of Random Access Machines in Genetic Systems. © Springer-Verlag Berlin Heidelberg 2007.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
