Further Work

  • Paul RendellEmail author
Part of the Emergence, Complexity and Computation book series (ECC, volume 18)


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.


Quadratic Assignment Problem Large Basin Automate Version Simple Machine Machine Universal 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    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)Google Scholar
  2. 2.
    Wolfram, S.: Universality and complexity in cellular automata. Physica 10D, 1–35 (1984)MathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of the West of EnglandBristolUK

Personalised recommendations