WOLFRAM 2.0

by Steven Harvey - Harvey18@juno.com

This SysRPL program generates the 3 neighborhood, 2 state, 
1-dimensional cellular automata commonly known as the 
Wolfram automata, after Steven Wolfram, who did pioneering 
work in the field.  The rules for generating the automata 
are labeled by assigning them a binary number, corresponding 
to the listing of 0's and 1's obtained by listing the eight 
possible neighborhoods in ascending numerical order and 
mapping which produce 0 and which 1.  For example, rule 90 
has the following neighborhood table:

000     001     010     011     100     101     110     111

 0       1       0       1       1       0       1       0
 
 
To run the program, just place a number between 0 and 255 on 
the stack and execute Wolfram.  If the number is out of range 
if will be truncated.

Any comments will be greatly appreciated.

References:

Voorhees, Computational Analysis of One-Dimensional Cellular Automata, 1996
Wolfram, Cellular Automata and Complexity, 1994
Wuensche & Lesser, Global Dynamics of Cellular Automata, 1992

Version 2.0 [ 11-20-96]
-added argument validation
-improved algorithm to scan each cell only once
-~33% faster [still slow]


