Evolution of Generic Square Calculations in Cellular Automata

Michal Bidlo

Abstract

The paper deals with the design of uniform multi-state one-dimensional cellular automata using an evolutionary algorithm and their application to solve the problem of generic square calculations. The key idea is based on the representation of the transition functions for the automata, which utilises the concept of conditionally matching rules. This technique allows us to design complex cellular automata for which the conventional representations have failed. A study is proposed with various settings of the experimental system, which concerns the way of evaluating the candidate solutions, the number of cell states and the number of conditional rules of the transition functions. It is shown that various generic solutions for the square calculation can be obtained in one-dimensional cellular automata using local interactions of cells only. The results presented demonstrates an ability of the evolution to discover innovative solutions both from the view of complexity of the cellular automaton and the number of steps needed to calculate the results in comparison with the known solution.

References

  1. Berlekamp, E. R., Conway, J. H., and Guy, R. K. (2004). Winning Ways for Your Mathematical Plays, 2nd Ed., Volume 4. A K Peters/CRC Press.
  2. Bidlo, M. (2015). Investigation of replicating tiles in cellular automata designed by evolution using conditionally matching rules. In 2015 IEEE International Conference on Evolvable Systems (ICES), Proceedings of the 2015 IEEE Symposium Series on Computational Intelligence (SSCI), pages 1506-1513. IEEE Computational Intelligence Society.
  3. Bidlo, M. (2016). On routine evolution of complex cellular automata. IEEE Transactions on Evolutionary Computation, PP(99):1-13, URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp= &arnumber=7377086&isnumber=4358751.
  4. Bidlo, M. and Vasicek, Z. (2013). Evolution of cellular automata with conditionally matching rules. In 2013 IEEE Congress on Evolutionary Computation (CEC 2013), pages 1178-1185. IEEE Computer Society.
  5. Codd, E. F. (1968). Cellular Automata. Academic Press, New York.
  6. Durand, B. and Rka, Z. (1999). The game of life: Universality revisited. In Mathematics and Its Applications, Volume 460 Cellular Automata, pages 51-74. Springer Netherlands.
  7. Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor.
  8. Ilachinski, A. (2001). Cellular Automata: A Discrete Universe. World Scientific.
  9. Jean-Yves Perrier, Moshe Sipper, J. Z. (1996). Toward a viable, self-reproducing universal computer. Physica D, 97(4):335-352.
  10. Lindgren, K. and Nordahl, M. G. (1990). Universal computation in simple one-dimensional cellular automata. Complex Systems, 4(3):299-318.
  11. Mardiris, V., Sirakoulis, G., and Karafyllidis, I. (2015). Automated design architecture for 1-d cellular automata using quantum cellular automata. Computers, IEEE Transactions on, 64(9):2476-2489.
  12. Ninagawa, S. (2013). Solving the parity problem with rule 60 in array size of the power of two. Journal of Cellular Automata, 8(3-4):189-203.
  13. Rendell, P. (2011). A universal turing machine in conway's game of life. In 2011 International Conference on High Performance Computing and Simulation (HPCS), pages 764-772.
  14. Rendell, P. (2013). A fully universal turing machine in Conway's game of life. Journal of Cellular Automata, 9(1-2):19-358.
  15. Sahoo, S., Choudhury, P. P., Pal, A., and Nayak, B. K. (2014). Solutions on 1-d and 2-d density classification problem using programmable cellular automata. Journal of Cellular Automata, 9(1):59-88.
  16. Sahu, S., Oono, H., Ghosh, S., Bandyopadhyay, A., Fujita, D., Peper, F., Isokawa, T., and Pati, R. (2010). Molecular implementations of cellular automata. In Cellular Automata for Research and Industry, Lecture Notes in Computer Science, Vol. 6350, pages 650- 659. Springer.
  17. Sipper, M. (1995). Quasi-uniform computation-universal cellular cutomata. In Advances in Artificial Life, ECAL 1995, Lecture Notes in Computer Science, Vol. 929, pages 544-554. Springer Berlin Heidelberg.
  18. Sridharan, K. and Pudi, V. (2015). Design of Arithmetic Circuits in Quantum Dot Cellular Automata Nanotech-
  19. Stefano, G. D. and Navarra, A. (2012). Scintillae: How to approach computing systems by means of cellular automata. In Cellular Automata for Research and Industry, Lecture Notes in Computer Science, Vol. 7495, pages 534-543. Springer.
  20. Tempesti, G. (1995). A new self-reproducing cellular automaton capable of construction and computation. In Advances in Artificial Life, Proc. 3rd European Conference on Artificial Life, Lecture Notes in Artificial Intelligence, Vol. 929, pages 555-563. Springer.
  21. von Neumann, J. (1966). The Theory of Self-Reproducing Automata. A. W. Burks (ed.), University of Illinois Press.
  22. Wolfram, S. (2002). A New Kind of Science. Wolfram Media, Champaign IL.
  23. Yuns, J.-B. (2010). Achieving universal computations on one-dimensional cellular automata. In Cellular Automata for Research and Industry, Lecture Notes in Computer Science Volume 6350, pages 660-669. Springer.
Download


Paper Citation


in Harvard Style

Bidlo M. (2016). Evolution of Generic Square Calculations in Cellular Automata . In Proceedings of the 8th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2016) ISBN 978-989-758-201-1, pages 94-102. DOI: 10.5220/0006064800940102


in Bibtex Style

@conference{ecta16,
author={Michal Bidlo},
title={Evolution of Generic Square Calculations in Cellular Automata},
booktitle={Proceedings of the 8th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2016)},
year={2016},
pages={94-102},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006064800940102},
isbn={978-989-758-201-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 8th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2016)
TI - Evolution of Generic Square Calculations in Cellular Automata
SN - 978-989-758-201-1
AU - Bidlo M.
PY - 2016
SP - 94
EP - 102
DO - 10.5220/0006064800940102