Abstract
The key feature of artificial life is the idea of emergence, where new patterns or behaviors emerge from complex computational processes that cannot be predicted. Emergence initiates the formation of higher-order properties via the interaction of lower-level properties. Biological networks contain many theory models of evolution. Similarities between the theoretically estimated networks and empirically modeled counterpart networks are considered as evidence of the theoretic and predictive biological evolution. However, the methods by which these theoretical models are parameterized and modeled might lead to inference validity questions. Opting for randomized parametric values is a probabilistic concern that a model produces. There persists a wide range of probable parameter values which allow a model to produce varying statistic results according to the parameters selected. While using the phenomenon of cellular automata, we tried to model life on a grid of squares. Each square in the grid is taken as a biological cell; we have framed rules such that the process of cell division and pattern formation in terms of biological theoretic perspective is studied. Relatively complex behaviors of the cell patterns which vary from generation to generation are visually analyzed. Three algorithms—game of life, Langton’s ant, and hodgepodge—have been implemented whose technical implementation will provide an inspiration and foundation to build simulators that exhibit characteristics and behaviors of biological systems of reproduction.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bentley PJ (ed) (1999) Evolutionary design by computers. Morgan Kaufmann, Los Altos
Web Link to Future Learn (Creative coding: Monash University). https://www.futurelearn.com/courses/creative-coding
Driessens E, Verstappen M Ima traveller, website http://notnot.home.xs4all.nl/
Web Link to Online Visualization insights. https://www.random-walk.com
Haru JI, Graham W (2014) Artificial nature, 14 Aug 2014. http://artificialnature.mat.ucsb.edu
Cormack JM (2003) Evolving sonic ecosystems. In: Adamatzky A (ed) The international journal of systems and cybernetics—kybernetes, vol 32 no. 1/2. Emerald, Northampton
Cormack JM (2001) Eden: an evolutionary sonic ecosystem. In: Kelemen J, Sosik P (eds) ECAL 2001. LNCS, vol 2159, pp 133–142. Springer, Heidelberg
Whitelaw M (2004) Metacreation: art and artificial life. MIT Press, Cambridge
Hayles NK (1999) How to become Posthuman: virtual bodies in cybernetics, literature and informatics. University of Chicago Press, Chicago
Dawkins R (1996) The blind watchmaker. W.W. Norton & Company Inc., New York
Sims K (1991) Artificial evolution for computer graphics. In: Proceedings of SIGGRAPH91 computer graphics annual conference series. ACM SIGGRAPH, Las Vegas, New York
Todd S, Latham W (1999) The mutation and growth of art by computers. In: Bentley PJ (ed) Evolutionary design by computers. Morgan Kaufmann, Los Altos, pp 221–250
Daniel S Web link to nature of code. www.natureofcode.com
Rafael PS, Winfer CT, William ESY (2002) Parallel implementations of cellular automata algorithms on the AGILA high performance computing systems. In: Proceedings of the sixth international symposium on parallel architectures, algorithms, and networks (I-SPAN’02). IEEE Computer Society Press, USA, pp 125–131
Reiter C (2009) With J: the Hodge Podge machine, vol 130(41)
Jaime S, Eduardo RM Algorithmic sound composition using coupled cellular automata. Interdisciplinary Center for Computer Music Research (ICCMR), University of Plymouth, UK
Adamatzky A (ed) (2010) Game of life cellular automata. Springer, London
Lichtenegger K (2005) Stochastic cellular automaton models in disease spreading and ecology
Jean PB (2001) How fast does Langton’s ant move? J Stat Phys 102:355–360
Tatsuie T, Takeo H (2011) Recognizing repeatable configurations of time reversible generalized Langtons Ant is PSPACE—Hard. Algorithms 4(1):1–15
Gajardo A, Moreira A, Goles E Complexity of Langton’s Ant. Discrete Appl Math 117(1):41–50
Acknowledgments
We would like to express profound gratitude to Sri Kunjam Nageswara Rao, for his guidance, supervision, and generosity all through the study. We pay equal debt of gratitude to Professor P. Srinivasa Rao, Head of the Department, for providing invariable support and facilities. We are greatly thankful to the other faculty members of the department for their constant encouragement and valuable suggestions. We also thank S. Vakkalanka sir, Asst. Prof. Avanthi Institute of Engineering and Technology, for his suggestions while framing the paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 The Author(s)
About this chapter
Cite this chapter
Rao, K.N., Divya, M., Pallavi, M., Naga Priyanka, B. (2015). Modeling Artificial Life: A Cellular Automata Approach. In: Muppalaneni, N., Gunjan, V. (eds) Computational Intelligence Techniques for Comparative Genomics. SpringerBriefs in Applied Sciences and Technology(). Springer, Singapore. https://doi.org/10.1007/978-981-287-338-5_6
Download citation
DOI: https://doi.org/10.1007/978-981-287-338-5_6
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-287-337-8
Online ISBN: 978-981-287-338-5
eBook Packages: EngineeringEngineering (R0)