JCA HomeIssue Contents

A Fully Universal Turing Machine in Conway’s Game of Life
Paul Rendell

In this paper we present a Fully Universal Turing Machine build in the Cellular Automaton Conway’s Game of Life. This is an extension of the Turing Machine built previously by the author [10]. It has infinite tape provided by two stack structures which grow continuously using collision based construction. Two patterns the fanout and takeout are described which are key in solving the routing and synchronization problems. The procedure used to find a viable order of synthesis of the parts in the stack construction is described. It provides visible evidence of the speed of the HashLife algorithm

Keywords: Universal turing machine, Conway’s game life, Golly, HashLife.

Full Text (IP)