Hi Paul,
interesting essay!
You write:
'One measuring of entropy in network theory is the growth of complexity in link structure.'
Are you referring to a specific definition of entropy for networks? Any pointers? Would this be something like the log of the number of graph automorphisms?
You also write:
'Given the promise of simple, discrete algorithms, it is interesting to consider a dynamic digital model of fundamental interactions based on holon states. Because holons would have the minimal wavelength of all fields, they might be thought of as 'cells' in a dynamic grid. It is possible that simple digital rules, akin to SDCA algorithms, could transform both the values (quantum states, such as polarization) and linkage of sites. This would render this stratum geometrically dynamic, offering a digital basis for distortions in spacetime'.
I am interested in SDCA type of models, where interconnection patterns evolve, although I claim that having a dynamic interconnection pattern should suffice for building everything, without need of an additional layer of labels, or cell states. The interconnection pattern could indeed code for local states. In the planar case, for example, one has polygonal faces, each with its size, and this generalizes to simplices in higher dimensions. Depending on whether or not these 'atoms' have and preserve their own identity, one can conceive two different types of field/particle (I see analogies with fermion vs. boson behaviour here).
Did you run computer experiments in which both the background cell structure and the additional layer of state information you place on top of it give rise, separately, to the emergence of solitons or other patterns?
Thanks and good luck!
Tommaso