Planar Trivalent Network Computation
- Cite this paper as:
- Bolognesi T. (2007) Planar Trivalent Network Computation. In: Durand-Lose J., Margenstern M. (eds) Machines, Computations, and Universality. MCU 2007. Lecture Notes in Computer Science, vol 4664. Springer, Berlin, Heidelberg
Confluent rewrite systems for giant trivalent networks have been investigated by S. Wolfram as possible models of space and spacetime, in the ambitious search for the most fundamental, computational laws of physics. We restrict here to planar trivalent nets, which are shown to support Turing-complete computations, and take an even more radical, approach: while operating on network duals, we use just one elementary rewrite rule and drive its application by a simple, fully deterministic algorithm, rather than by pattern-matching. We devise effective visual indicators for exploring the complexity of computations with elementary initial conditions, consisting of thousands of graphs, and expose a rich variety of behaviors, from regular to random-like. Among their features we study, in particular, the dimensionality of the emergent space.
KeywordsDigital physics trivalent network complexity indicator cellular automata two-dimensional Turing machine turmite emergent space
Unable to display preview. Download preview PDF.