Rule:Serizawa

@RULE Serizawa Uploaded by SimSim314#5616 on Discord > Serizawa is natural von neuman 3 state rule.

@TREE

num_states=3 num_neighbors=4 num_nodes=41 1 0 1 2 1 0 0 0 1 1 2 0 2 0 1 2 1 0 0 1 1 1 1 0 2 1 4 5 2 2 5 5 3 3 6 7 1 0 2 0 2 4 2 9 1 2 0 1 2 9 1 11 3 6 10 12 1 2 1 0 2 5 14 1 3 7 12 15 4 8 13 16 2 1 4 9 2 4 2 1 2 5 9 11 3 18 19 20 1 1 0 1 1 0 1 0 2 2 22 23 2 1 23 1 3 19 24 25 2 14 1 1 3 20 25 27 4 21 26 28 2 2 9 5 2 5 1 14 2 5 11 1 3 30 31 32 2 9 23 1 2 11 1 1 3 31 34 35 2 1 1 23 3 32 35 37 4 33 36 38 5 17 29 39

@TABLE

1. Serizawa, T. (1986) 3-state Neumann neighbor cellular automata capable
2. of constructing self-reproducing machine, Trans. IEICE Japan, J-69,
3. 653-660.
5. Abstract:
7. This paper defines the 3-state Neumann-neighbor cellular automata, and shows
8. that its space is construction-universal. The proof for this is achieved by
9. presenting a realization of self-reproducing machines. The state-transition
10. rule and the basic operations of configurations of the cellular automata are
11. described first. Then methods are shown to construct AND circuit, pulse
12. generator, signal-line, delay circuit and memory circuit. Finally, the
13. structure of the self-reproducing machine is shown, which is realized by
14. combining those circuits. The machine has two construction arms, a Turing tape
15. and a timing loop. It can make a replica of its own using the Turing tape. The
16. machine can also be operated as a universal construction machine or a
17. universal Turing machine.
19. Thanks to Kenichi Morita for finding a copy of the paper.
21. contact: tim.hutton@gmail.com

n_states:3 neighborhood:vonNeumann symmetries:rotate4reflect

var a={0,1,2} var b={0,1,2} var c={0,1,2} var d={0,1,2} var e={0,1,2}

1. states: 0=empty, 1=white circle, 2=black circle
2. (transitions from Fig. 1)

1,0,0,0,0,1 0,0,0,2,0,1 0,2,0,2,0,1 0,0,2,2,0,1 0,0,1,2,0,1 1,2,0,2,0,1 2,1,0,1,0,1 0,0,1,1,1,1 2,0,2,2,1,1 1,0,2,1,2,1 2,0,1,1,0,1 1,0,2,2,0,1 1,0,1,2,0,1 0,1,1,1,1,1 1,1,1,2,1,1 2,1,1,1,1,1 1,2,2,2,2,1

2,0,0,0,0,2 1,0,0,2,0,2 1,1,0,2,0,2 0,0,2,1,2,2 0,0,2,2,1,2 1,0,1,2,1,2 1,0,1,1,1,2

1. all other configurations go to zero

a,b,c,d,e,0