Abstract
This chapter discusses the possibility of future work:
-
A wider study of the method used to solve a simple quadratic assignment problem.
-
Investigate the behaviour of Finite Turing machines with varying amount of finite tape.
-
Follow up on the procedure used to construct stack cells from glider salvoes which worked better than expected.
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
References
Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB—a quadratic assignment problem library. Technical report, Department of Mathematics, Graz University of Technology, Graz, Austria (1996)
Wolfram, S.: Universality and complexity in cellular automata. Physica 10D, 1–35 (1984)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Rendell, P. (2016). Further Work. In: Turing Machine Universality of the Game of Life. Emergence, Complexity and Computation, vol 18. Springer, Cham. https://doi.org/10.1007/978-3-319-19842-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-19842-2_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19841-5
Online ISBN: 978-3-319-19842-2
eBook Packages: EngineeringEngineering (R0)