Scale-invariant cellular automata and self-similar Petri nets

Abstract

Two novel computing models based on an infinite tessellation of space-time are introduced.They consist of recursively coupled primitive building blocks. The first model is a scale-invariant generalization of cellular automata, whereas the second one utilizes self-similar Petri nets. Both models are capable of hypercomputations and can, for instance, "solve" the halting problem for Turing machines. These two models are closely related, as they exhibit a step-by-step equivalence for finite computations. On the other hand, they differ greatly for computations that involve an infinite number of building blocks: the first one shows indeterministic behavior whereas the second one halts. Both models are capable of challenging our understanding of computability, causality, and space-time.PACS numbers: 05.90.+m,02.90.+p,47.54.-r

Petri Nets Representing the Evolution of Elementary Cellular Automata

“…Igualmente, las RdP se han usado para modelar el AC cuántico de Margolus, [13]. Otros trabajos relacionados son [14][15] y [16].…”

Relationship between Petri Nets and Cellular Automata for the Analysis of Flexible Manufacturing Systems

“…The association between PN and CA has been explored in [4], [5] for modeling an ecological system. In [11] a self-timed CA is modeled with high-level PN and in [14] self-similar PN and CA are used to simulate Turing machines. In addition, in [16], [17] is proposed the use of CA to model FMS whose dynamics is firstly described by a net which has a similar dynamics to PN.…”

On the Brightness of the Thomson Lamp: A Prolegomenon to Quantum Recursion Theory

“…[8,9,10]). For the sake of hypercomputation, observers have been regarded on their path toward black holes [11,12,13], and automata have been densely embedded [14], to name just two "mind-boggling" proposals.…”