Conclusions and Discussion

Abstract

This chapter provides a summary and of the Game of Life Turing machine work, the Demonstration of universality and the Quadratic Assignment Problem solution. This project aims were to prove universal computation in the Game of Life cellular automaton by using a Turing machine construction with the object of providing a more demonstrable proof than using a counter machine construction.This has been done, starting with the finite state Turing machine described in Chap. 4 and adding the universal Turing machine described in Chap. 5 then by providing infinite capability through the stack constructor patterns described in Chap. 8.The result of running the symbol doubler Turing machine within the universal Turing machine are shown in Fig. 11.1. This shows how easy it is to verify the result of the computation. In addition some and original work has done during the process if optimizing the order of transitions described in Chap. 6. This uncovered the possibility that the NP-Hard quadratic assignment problem may have a subclass of problems for which optimal solutions all have large basins of attraction .