In[]:=
Out[]=
Black [0,0,0]
Red [1,0,0]
Green [0,1,0]
Blue [0,0,1]
Yellow [1,1,0]
Magenta [1,0,1]
Cyan [0,1,1]
White [1,1,1]
Out[]=
Running positive-space simulation: 31×31, 150 steps...
Complete: 151 frames.
Out[]=
Out[]=
t
renderPos[history4〚1〛,Positive — t=0]
renderComp[history4〚1〛,Complement — t=0]
Computing complexity measures at each step...
Step 24...
Step 49...
Step 74...
Step 99...
Step 124...
Step 149...
All measures computed.
Out[]=
H(Positive Space)
H(Null-Space Complement)
Maximum |H(P) - H(N)| across all steps: 0.
Out[]=
H〈pairs〉(Positive)
H〈pairs〉(Complement)