Stack Constructor

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


The question of the inexhaustible storage required for true universal behaviour is resolved in this chapter and the previous chapter by building a stack constructor pattern that adds blank stack cells to both stacks faster than the Turing machine can use them.The stack is constructed by salvoes of gliders moving towards each other and interacting at the construction site. These gliders are generated by patterns that move a constant speed producing a glider periodically. These types of patterns are called a rakes. This chapter describes the procedure used to assemble the pattern of rakes used to constantly add stack cells to the stacks .The objective of the stack constructor is to continuously add empty stack cells to the ends of the stacks of the Turing machine pattern built in Conway’s Game of Life so that the Turing machine’s calculations are not limited by the size of Turing tape it has initially. The design of the 45 \(^{\circ }\) stack is described in Chap.  7. The parts of the stack cell are shown in Fig. 8.1. The construction is performed by salvoes of gliders generated by two convoys of glider rakes. A glider rake is a pattern that generates a glider periodically and moves along at a constant speed, these are described in Sect. 8.3. The gliders from one convoy arrive at the construction site in the opposite direction to the gliders from the other convoy.


blockBlock Glider Stream Construction Stream Cell Stack Display Time 
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.
    Niemiec, M.D.: Niemiec’s Life Page—syntheses (1998).
  2. 2.
    Niemiec, M.D.: Niemiec’s Life Page—syntheses (1998).
  3. 3.
    The Python Software Foundation. The Python Language (1990).
  4. 4.
    Trevorrow, A., Rokicki, T.: An open source, cross-platform application for exploring conway’s Game of Life and other cellular automata (2005).
  5. 5.
    Summers, J.: Jason Summers’s pattern collections (2009).
  6. 6.
    Goucher, A.P.: Paul Rendell’s c/5 stack constructor (2011).

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

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

Personalised recommendations