Abstract

A concept for the emergence of a time-equivalent property from a static network of interconnected states is shown. This property is referred to as virtual time. For each state, a set of coefficients is defined, which locally represents the information embedded in the network’s connectivity. Network structures denoted as repellers feature successive splits into a steadily increasing number of quantum states. They convey an equivalent calculation of their static connectivity coefficients and virtual particles dynamically propagating within them. Strong indications are provided, that static networks are virtual Turing complete machines for algorithms with finite runtime. This opens up a wide range of possible encodings for said coefficients and motivates further research.