Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Zuse, K.: Rechnender raum. Elektronische Datenverarbeitung 8, 336–344 (1967)
Zuse, K.: Calculating space (rechnender raum), Tech. rep., MIT, Cambridge, Mass., technical Translation AZT-70-164-GEMIT (1970)
Wolfram, S.: A New Kind of Science. Wolfram Media, Inc. (2002)
Cook, M.: Universality in elementary cellular automata. Complex Systems 15(1), 1–40 (2004)
Smolin, L.: Atoms of space and time. Scientific American, 56–65 (2004)
Bolognesi, T.: Planar trivalent network computation, Tech. rep., CNR-ISTI, Pisa, 2006-TR-41 (December 2006)
Bolognesi, T.: Behavioural complexity indicators for process algebra: the NKS approach. Journal of Logic and Algebraic Programming (to appear)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-540-74593-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-74593-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74592-1
Online ISBN: 978-3-540-74593-8
eBook Packages: Computer ScienceComputer Science (R0)