A larger one could be constructed by focusing on denser rules.
Code: Select all
@RULE 1C3SShip (incomplete)
@TABLE
n_states:3
neighborhood:Moore
symmetries:none
#delay
0,0,0,0,0,2,1,2,0,2
2,0,0,0,0,0,1,0,0,1
1,0,0,0,0,0,1,0,0,0
2,0,0,0,0,0,2,0,0,1
1,0,0,0,0,0,2,0,0,0
#leftward expansion
0,0,0,1,0,0,0,0,0,2
0,0,0,0,0,1,2,0,0,2
0,0,0,2,1,2,0,0,0,1
2,0,0,0,2,1,2,0,0,0
2,1,0,1,2,0,0,0,0,1
1,0,0,0,1,1,0,0,0,0
1,1,0,1,2,0,0,0,0,2
0,0,1,1,0,0,0,0,0,2
0,0,0,1,1,0,0,0,0,1
2,1,0,2,0,0,0,0,0,1
2,0,0,0,0,1,2,0,0,0
1,1,0,2,0,0,0,0,0,2
1,0,0,0,2,1,0,0,0,0
#downward expansion
0,1,0,0,0,0,0,0,0,2
0,0,0,0,0,0,2,1,0,2
0,2,0,0,0,0,0,2,1,1
2,0,0,0,0,0,2,1,2,0
2,1,2,1,0,0,0,0,2,1
2,0,0,0,0,1,2,1,0,0
1,0,0,0,0,0,0,1,1,0
2,1,0,1,0,0,0,0,1,1
1,1,0,1,0,0,0,0,2,2
0,1,1,0,0,0,0,0,0,2
0,1,0,0,0,0,0,0,1,1
2,2,0,1,0,0,0,0,0,1
1,2,0,1,0,0,0,0,0,2
1,0,0,0,0,0,0,1,2,0
0,0,0,0,0,2,1,0,0,2
2,0,0,0,0,2,1,0,0,0
#downward stop
0,1,0,0,0,0,2,1,0,1
1,0,0,0,0,0,2,1,0,2
2,0,0,0,0,0,2,1,0,0
0,2,0,0,0,1,1,2,2,2
2,1,0,2,0,2,0,0,1,1
2,0,0,0,0,0,2,2,1,0
0,2,0,0,0,1,2,2,2,2
2,0,0,0,0,1,1,2,1,0
2,1,0,2,1,1,0,0,0,1
1,2,2,1,0,0,0,0,0,2
1,2,0,0,0,0,0,1,2,2
2,1,0,2,1,2,0,0,0,1
2,0,0,0,0,1,2,2,1,0
1,2,0,0,0,0,0,2,2,0
2,2,1,1,0,0,0,0,0,0
1,1,0,0,0,0,0,2,2,0
0,0,0,2,2,1,2,1,1,1
1,0,0,0,2,1,2,1,1,2
2,1,2,1,0,0,0,0,0,0
1,2,0,2,0,0,0,2,1,0
0,0,0,0,0,2,1,1,0,2
1,1,0,2,1,2,0,0,1,0
2,0,0,0,2,1,2,1,1,0
2,0,1,0,0,0,0,1,2,0
#downward counting
0,1,0,0,0,0,1,1,0,2
1,1,1,0,0,2,2,0,0,2
1,1,0,0,0,0,2,1,1,0
0,0,2,0,0,0,1,2,2,1
0,0,0,0,0,1,1,1,1,1
0,0,2,0,0,0,2,1,1,1
0,2,0,0,0,1,2,2,1,1
0,0,2,0,0,0,2,2,2,1
1,1,0,1,0,1,0,0,1,2
1,1,0,0,0,0,2,2,2,0
1,1,0,0,0,0,1,2,2,0
1,0,0,0,0,0,2,2,1,0
1,0,0,0,0,0,1,2,1,0
1,1,0,0,0,0,1,1,1,0
0,0,2,0,0,0,1,1,1,1
0,0,0,0,0,0,2,0,2,1
1,0,0,0,0,2,0,0,1,0
2,0,0,0,0,0,1,1,0,0
1,1,2,0,0,1,0,0,1,2
0,2,0,0,0,0,1,2,1,2
2,0,0,0,0,0,1,2,1,0
2,1,0,2,0,1,0,0,2,1
1,2,2,0,0,1,0,0,0,2
1,1,2,0,0,2,0,0,1,2
0,2,0,0,0,0,2,2,1,2
0,2,0,0,0,0,1,2,2,2
2,1,0,2,0,1,0,0,0,1
1,2,2,0,0,2,0,0,0,2
0,2,0,0,0,0,2,2,2,2
2,1,0,2,0,2,0,0,0,1
0,2,0,0,0,0,0,2,2,2
2,0,0,0,0,0,0,1,1,0
2,0,1,2,0,0,0,0,0,0
2,1,0,0,0,0,0,2,0,1
2,1,1,1,0,0,0,0,2,0
1,1,0,0,0,0,0,2,1,0
1,0,0,0,0,0,0,2,0,2
0,0,2,0,0,0,1,1,2,1
#upward signal
0,0,1,1,2,2,0,0,0,2
0,0,1,1,1,2,0,0,0,2
0,0,2,1,1,2,0,0,0,2
0,0,2,2,1,2,0,0,0,2
0,0,2,2,2,2,0,0,0,2
0,0,2,1,2,2,0,0,0,2
0,0,1,2,1,2,0,0,0,2
0,0,1,2,2,2,0,0,0,2
2,0,1,1,1,0,0,0,0,0
2,0,1,1,2,0,0,0,0,0
2,0,1,2,1,0,0,0,0,0
2,0,1,2,2,0,0,0,0,0
2,0,2,1,1,0,0,0,0,0
2,2,2,1,2,0,0,0,0,0
2,0,2,2,1,0,0,0,0,0
2,0,2,2,2,0,0,0,0,0
2,1,0,0,0,1,0,2,0,1
2,2,0,0,0,1,0,2,0,1
0,1,1,2,1,2,0,0,2,1
0,1,1,1,2,2,0,0,1,1
1,1,1,2,2,0,0,0,2,2
0,2,1,2,0,0,0,0,1,2
2,1,0,2,0,2,2,0,1,1
2,1,0,2,0,1,0,2,0,1
2,1,1,0,1,1,0,1,1,1
1,1,2,0,0,2,0,1,1,2
1,1,0,0,0,2,0,1,1,2
1,0,1,2,1,0,1,0,0,2
2,2,2,0,0,1,0,0,2,1
1,0,0,1,2,1,0,1,0,2
2,0,0,1,1,2,0,1,0,1
1,1,1,2,2,0,0,0,1,2
2,1,0,0,0,2,0,1,1,1
2,2,1,1,2,0,0,0,1,0
1,0,0,2,2,0,0,1,0,2
1,0,0,2,2,0,0,2,0,2
2,0,0,1,0,2,0,1,0,1
#leftward stop
0,0,0,0,0,2,2,0,0,2
2,0,0,0,0,2,2,0,0,0
0,0,0,0,0,0,2,2,0,2
0,0,0,2,2,2,2,0,0,2
2,0,0,0,2,2,2,0,0,0
2,2,0,2,0,0,0,2,0,1
2,0,0,0,1,2,2,0,0,0
2,2,0,1,0,0,0,2,0,1
0,0,0,2,2,2,1,1,0,2
0,0,0,2,2,2,2,1,0,2
1,0,0,2,2,1,0,0,0,2
2,0,0,0,1,2,1,1,0,0
2,2,0,1,0,0,0,1,1,1
1,0,0,2,1,2,0,0,0,0
2,0,2,0,1,1,2,1,0,1
1,0,1,0,1,1,2,0,0,0
2,1,1,0,0,0,0,0,2,0
1,0,0,1,1,2,0,0,0,0
1,0,0,0,1,1,1,0,0,0
2,0,0,1,2,0,0,1,1,1
2,0,0,2,0,2,0,1,1,1
0,0,0,0,1,1,2,1,0,1
1,0,0,1,1,2,0,0,0,0
1,0,0,0,1,1,2,0,0,0
2,0,1,1,0,0,0,0,0,1
2,2,1,0,0,0,0,0,1,0
2,0,0,1,0,2,0,1,1,1
#leftward counting
0,2,1,2,0,0,0,0,2,2
2,2,1,0,0,0,0,0,2,0
0,2,2,2,0,0,0,0,1,2
0,2,2,2,0,0,0,0,2,2
2,0,0,1,0,2,0,2,0,1
2,1,1,2,2,0,0,0,2,0
2,1,1,0,0,0,0,0,1,0
0,2,2,2,0,0,0,0,0,2
2,0,0,2,2,0,0,0,0,0
2,0,1,0,0,0,0,0,0,0
1,0,0,1,0,0,2,0,0,2
#ending
2,2,0,2,0,0,0,0,0,0
2,0,0,0,2,0,0,0,0,0
2,0,0,0,0,0,0,0,0,1
#diagonal mode
#2,0,0,0,2,0,0,0,0,0
#2,0,1,0,0,0,0,0,2,0
#0,0,0,1,0,2,0,2,0,1
#extra length
2,0,2,1,2,0,0,1,1,1
2,1,0,0,1,1,0,0,1,1
2,0,0,0,0,0,1,1,2,0
1,1,0,0,0,0,0,0,0,0
2,0,1,0,2,0,0,0,0,0
0,1,0,0,0,2,0,2,0,1
#back up
0,2,1,1,0,0,0,0,0,2
2,1,1,0,1,1,0,2,1,1
0,2,1,1,1,0,0,0,2,2
2,2,1,2,2,0,0,0,0,0
2,1,1,1,1,2,0,2,2,0
2,0,1,1,1,2,0,2,0,0
#TODO: convert binary counter push into binary counter pull
#TODO: collapse back into a single cell
ORDINAL ALERT/EDIT (ORDINAL EDIT?): I realized that g(n) is actually a w_2^CK function because the pattern doesn't have to stabilize: it could go on infinitely and never repeat but still have a finite population.
Explicit proof: given a statement {for all x there exists y such that z} make a [register machine/waterfall model/Collatz function/tag system storing the tape as a binary integer in sliding-block memory/register machine that simulates the next step of a Turing machine by simulating itself emulating f(input)/whatever as long as the system is universal and it can be simulated with a bounded population] that does the following:
On the other hand, {there exists n such that for all generations g, the population is less than n} is a Sigma^1_1 statement describing a pattern's population being bounded.