Bolognesi T. Planar trivalent network computation. The document will be submitted to Conference: CiE (Computability in Europe) 2007, Technical report, 2006. |

Abstract (English) |
Confluent rewrite systems for giant trivalent networks of unstructured nodes 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 {em one} elementary rewrite rule -- which is singled out also by Loop Quantum Gravity -- and drive its application by (two variants of) 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. | |

Subject | Digital physics Trivalent network Complexity indicator F.1.1 Models of computation |

1) Download Document PDF |

Open access Restricted Private