Re: [Haskell-cafe] Optimizing cellular automata evaluation (round 2)

On Friday 30 November 2007 00:31, Justin Bailey wrote:

I represent the automata as an array of integers, where each bit represents a cell.

Mathematica uses a single arbitrary-precision integer to represent each generation of a 1D automaton. The rules to derive the next generation are compiled into arithmetic operations on the integer. The offloads all such work onto your big number library and, with GMP, will be as fast in Haskell as most other languages. -- Dr Jon D Harrop, Flying Frog Consultancy Ltd. http://www.ffconsultancy.com/products/?e