There is a scientific romance behind this fine book.
Outsiders often make startling contributions to a field.
In this case the outsiders were Andrew Wuensche, a successful architect in London, and his friend, Mike Lesser, with a background in industrial automation, and robotics. Yet these two, not knowing that the problem they were attacking, that of finding all the predecessor states to any state in a cellular automaton, had been intuitively deemed virtually insoluble by the academic insiders in the field, insiders that include this reviewer. Andy and Mike attacked and nailed the problem. This book records their success, provides analytic insights that trained mathematicians working in the field missed left and right, and constitutes the only atlas of the basins of attraction fields of one dimensional cellular automata. In this binary case, each node realizes a Boolean function with one input from itself and additional inputs.