Graßl, Björn (2025) Virtual Time and Execution of Algorithms in Static Networks. [Preprint]

Text Virtual Time and Execution of Algorithms in Static Networks.pdf Available under License Creative Commons Attribution. Download (900kB)

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.

---

Export/Citation:

EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL

Social Networking:

Share |

---

Item Type:	Preprint
Creators:	Creators Email ORCID Graßl, Björn bjoern.grassl@gmx.de 0009-0005-8448-9855
Additional Information:	This manuscript introduces the concept of "virtual time" in static networks and presents a novel arrow notation for its formal description. The uncovered similarities between virtual time and physical time make this a potentially valuable contribution to research on the emergence of spacetime. The presented methods and formalism are designed to be applicable across various areas of physics. While the manuscript primarily focuses on formal definitions and mathematical methods, section 2.1 contains a speculative outlook. This section is clearly marked as such and is not essential for understanding the core mathematical framework. It serves to illustrate potential applications and to stimulate further research directions. The manuscript is currently a preprint version and has not undergone peer review. Due to personal circumstances, there might be delays in responding to feedback. However, constructive comments and scientific discourse are highly welcome and will be addressed when possible.
Keywords:	virtual, time, emergence, concept, network, algorithm
Subjects:	Specific Sciences > Mathematics > Methodology General Issues > Scientific Metaphysics General Issues > Causation Specific Sciences > Computation/Information > Quantum General Issues > Computer Simulation General Issues > Determinism/Indeterminism General Issues > Laws of Nature General Issues > Thought Experiments
Depositing User:	Dr. Björn Graßl
Date Deposited:	13 Jan 2025 19:21
Last Modified:	13 Jan 2025 19:21
Item ID:	24545
Publisher:	Zenodo
Official URL:	https://doi.org/10.5281/zenodo.14634821
DOI or Unique Handle:	10.5281/zenodo.14634820
Subjects:	Specific Sciences > Mathematics > Methodology General Issues > Scientific Metaphysics General Issues > Causation Specific Sciences > Computation/Information > Quantum General Issues > Computer Simulation General Issues > Determinism/Indeterminism General Issues > Laws of Nature General Issues > Thought Experiments
Date:	12 January 2025
URI:	https://philsci-archive.pitt.edu/id/eprint/24545

Monthly Views for the past 3 years

Monthly Downloads for the past 3 years

Plum Analytics

Altmetric.com

Actions (login required)

View Item