Abstract
The complexity of the behaviour that some simple cellular automata (CA) can exhibit is clearly shown by a demonstration of universal computation. The ability to perform any calculation that a Turing machine can make. The construction of such a machine necessarily requires areas covered by repeating patterns for storage of data and programs as well as areas of variation encoding information on a more direct way producing an uneven texture when viewed at a distance. These textures together with the inherent symmetry of the design lead naturally to artistically pleasing images.
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Rendell, P. (2016). Turing Machine in Conway Game of Life. In: Adamatzky, A., Martínez, G. (eds) Designing Beauty: The Art of Cellular Automata. Emergence, Complexity and Computation, vol 20. Springer, Cham. https://doi.org/10.1007/978-3-319-27270-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-27270-2_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27269-6
Online ISBN: 978-3-319-27270-2
eBook Packages: EngineeringEngineering (R0)