HAL's Automata

Universal Cellular Automata

HAL's solutions are expressed in the form of a universal cellular automata 'designed' to solve the specified problem.

While in principle HAL should be able to design for virtually any possible system of this type, there are currently some constraints on which models may actually be embedded on the surfaces of HAL's cells.

In particular, the automata must currently be uniform, and rotationally symmetrical.

We currently use a 5 bit-per site system, consisting of 1 bit of RAM (a flip-flop) and a four bit, 16-state lookup table whose entries correspond to different Boolean logic gates. The use of boolean gates corresponds to the target FPGA-based hardware.

Boolean gates are a temporary measure - we are particularly interested in reversible cellular automata, believing these to be of fundamental importance to the future of computation.

We have developed several two- and three-dimensional models which we believe are amongst the most suitable potential target substrates.

These are linked to from our Billiard Ball Machine pages.

Index | HAL | HALcell | Parallel | Hardware | Future | Problem | Limits | Automata | Questions | Links
tim@tt1.org | http://www.alife.co.uk/