Cellular Automaton, Part I

I have wrote a Wireworld CA program in Java and have realized how the OR-gate & XOR-gate works, but I'm still having problems with realizing the AND-gate. Anybody have some experience with this cellular automaton?


//The OR-gate:

0 0 0 0 0 0 0 0
0 3 3 3 0 0 0 0
0 0 0 0 3 0 0 0
0 0 0 3 3 3 3 0
0 0 0 0 3 0 0 0
0 2 1 3 0 0 0 0
0 0 0 0 0 0 0 0

//The XOR-gate:

0 0 0 0 0 0 0 0 0 0
0 2 1 3 0 0 0 0 0 0
0 0 0 0 3 0 0 0 0 0
0 0 0 3 3 3 3 0 0 0
0 0 0 3 0 0 3 3 3 0
0 0 0 3 3 3 3 0 0 0
0 0 0 0 3 0 0 0 0 0
0 2 1 3 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0

>>6
Meh, it's pretty easy, write Conway's Game of Life and modify the mutation part, that's about it. It's written in Java, /prog/ doesn't like Java.

The only gates that I have left to realize are: the NAND-gate, NOR-gate, NXOR-gate and NOT-gate. Even with the gates above, it's possible to do some cool stuff.

Also, Wireworld is Turing-complete!.