Abstract
This chapter is concerned with the developments of universal computation and construction within Conway’s Game of Life (GoL). I will begin by describing the history of the concepts and mechanisms for universal computation and construction in GoL, before explaining how a Universal Computer–Constructor (UCC) would operate in this automaton. Moreover, I shall present the design of a working UCC in the rule. It is both capable of computing any calculation (i.e. it is Turing-complete) and constructing most, if not all, of the constructible configurations within the rule. It cannot construct patterns which have no predecessor; neither can any machine in the rule (for obvious reasons). As such, it is more accurately a general constructor, rather than a universal constructor.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
http://www.radicaleye.com/lifepage/patterns/ssrefl/ssrefl.html
Gardner, M.: Wheels, life and other mathematical amusements (1983)
Hutton, T.: Codd’s self-replicating computer (2010)
Minsky, M.: Recursive unsolvability of Post’s problem of ‘tag’ and other topics in theory of turing machines. JSTOR (1961)
Wang, H.: A variant to Turing’s theory of computing machines (1957)
Wolfram, S.: A New Kind of Science. Wolfram Media, Champaign (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag London Limited
About this chapter
Cite this chapter
Goucher, A.P. (2010). Universal Computation and Construction in GoL Cellular Automata. In: Adamatzky, A. (eds) Game of Life Cellular Automata. Springer, London. https://doi.org/10.1007/978-1-84996-217-9_25
Download citation
DOI: https://doi.org/10.1007/978-1-84996-217-9_25
Publisher Name: Springer, London
Print ISBN: 978-1-84996-216-2
Online ISBN: 978-1-84996-217-9
eBook Packages: Computer ScienceComputer Science (R0)