Abstract
Algorithmic chemistries intended as computation models seldom model energy. This could partly explain some undesirable phenomena such as unlimited elongation of strings in these chemistries, in contrast to nature where polymerization tends to be unfavored. In this paper, we show that a simple yet sufficiently accurate energy model can efficiently steer resource usage, in particular for the case of elongation control. A string chemistry is constructed on purpose to make strings grow arbitrarily large. Simulation results show that the addition of energy control alone is able to keep the molecules within reasonable length bounds, even without mass conservation, and without explicit length thresholds. A narrow energy range is detected where the system neither stays inert nor grows unbounded. At this operating point, interesting phenomena often emerge, such as clusters of autocatalytic molecules, which seem to cooperate.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Fontana, W., Buss, L.W.: “The arrival of the fittest”: Toward a theory of biological organization. Bull. Math. Bio. 56(1), 1–64 (1994)
Banzhaf, W., Lasarczyk, C.W.G.: Genetic programming of an algorithmic chemistry. In: Genetic Programming Theory and Practice II, pp. 175–190. Springer, Heidelberg (2004)
Decraene, J., Mitchell, G., McMullin, B.: Unexpected evolutionary dynamics in a string based artificial chemistry. In: Proc. 11th Int. Conf. Sim. Synthesis of Living Systems (ALife XI), pp. 158–165. MIT Press, Cambridge (2008)
Dittrich, P., Speroni di Fenizio, P.: Chemical organization theory. Bull. Math. Bio. 69(4), 1199–1231 (2007)
Gillespie, D.T.: Exact stochastic simulation of coupled chemical reactions. J. Phys. Chem. 81(25), 2340–2361 (1977)
Gibson, M.A., Bruck, J.: Efficient exact stochastic simulation of chemical systems with many species and many channels. J. Phys. Chem. A 104(9), 1876–1889 (2000)
Upadhyay, S.K.: Chemical Kinetics and Reaction Dynamics. Springer, Heidelberg (2006)
Benkö, G., Flamm, C., Stadler, P.F.: Explicit collision simulation of chemical reactions in a graph based artificial chemistry. In: Capcarrère, M.S., Freitas, A.A., Bentley, P.J., Johnson, C.G., Timmis, J. (eds.) ECAL 2005. LNCS (LNAI), vol. 3630, pp. 725–733. Springer, Heidelberg (2005)
Lancet, D., Sadovsky, E., Seidemann, E.: Probability model for molecular recognition in biological receptor repertoires. PNAS 90, 3715–3719 (1993)
Pereira, J.: A biochemistry-inspired artificial chemistry: LAC. In: Proc. 12th Portuguese Conf. Art. Intel. (EPIA 2005), pp. 79–84 (2005)
Gordon-Smith, C.: Evolution without smart molecules. In: “Extending the Darwinian Framework: New levels of selection and inheritance” Workshop at ECAL 2007, 9th Euro. Conf. ALife (2007)
Bagley, R.J., Farmer, J.D.: Spontaneous emergence of a metabolism. In: Proc. 2nd Int. Conf. A Life, pp. 93–140. Addison-Wesley, Reading (1992)
Fernando, C., Rowe, J.: Natural selection in chemical evolution. J. Theor. Bio. 247(1), 152–167 (2007)
Takeuchi, N., Hogeweg, P.: Evolution of complexity in RNA-like replicator systems. Biology Direct 3 (2008)
Tschudin, C.: Fraglets - a metabolistic execution model for communication protocols. In: Proc. 2nd Ann. Symp. Auton. Intel. Net. Sys., AINS (2003)
Smith, E.: Thermodynamics of natural selection II: Chemical carnot cycles. J. Theor. Bio. 252(2), 198–212 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meyer, T., Yamamoto, L., Banzhaf, W., Tschudin, C. (2011). Elongation Control in an Algorithmic Chemistry. In: Kampis, G., Karsai, I., Szathmáry, E. (eds) Advances in Artificial Life. Darwin Meets von Neumann. ECAL 2009. Lecture Notes in Computer Science(), vol 5777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21283-3_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-21283-3_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21282-6
Online ISBN: 978-3-642-21283-3
eBook Packages: Computer ScienceComputer Science (R0)