Submitted:
29 September 2025
Posted:
29 September 2025
You are already at the latest version
Abstract
Keywords:
1. Introduction
2. Spiral-Time Model as Strategic Implementation
3. Structural Strategy and Distributions
4. Mathematical Formulation of Strategic Distributions
5. Examples of Spiral-Time in Action
5.1. Communication Without Order
5.2. Solving Problems by Outcome, Not Process
6. Simulation of Spiral-Time Communication
6.1. Message Transmission: Structural Encoding over Sequential Sending
- The original message is divided into semantic units , each representing a self-contained concept or clause.
- For each unit , a constraint function is defined such that depends on a subset of other units:
- A global constraint map is formed, and the valid message corresponds to a fixed point of this map:
- Instead of sending a fixed ordering, the sender transmits the constraint structure and a strategic distribution , which encodes probabilistic or logical variation across acceptable message configurations.

6.2. Message Reconstruction: Constraint Resolution Instead of Temporal Decoding
- The receiver receives the constraint map and the strategic distribution .
- It applies a constraint satisfaction solver (e.g., SAT solver or fixed-point algorithm) to find:
- The result is a coherent message, where all semantic units are compatible, even if the sentence structure or lexical choices differ from the original.
6.3. Emergent Meaning without Causality
6.4. Statistical Performance of Spiral-Time Reconstruction
- Structurally encoding a message into semantic units with logical constraints.
- Randomizing the transmission sequence to eliminate causal order.
- Reconstructing the message by solving the constraint system via a fixed-point solver.

- Average semantic similarity: 0.87 (SD = 0.05)
- Minimum similarity: 0.78
- Maximum similarity: 0.94
7. Physical and Philosophical Support
Spiral-Time and Agential Realism
8. Spiral-Time Design
Spiral-Time Design Principles
9. Complexity Theory Implications
10. Case Studies and Applications
10.1. Distributed Consensus under Uncertainty
10.2. Spiral-Time Inference in Bayesian Networks
10.3. Regulation in Genetic Networks
11. Visualization through Strategic Landscapes
12. Conclusions and Outlook
References
- Pearl, J. Causality: Models, Reasoning, and Inference, 2nd ed.; Cambridge University Press: Cambridge, 2009. [Google Scholar]
- Turing, A.M. On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 1936, s2-42, 230–265. [Google Scholar] [CrossRef]
- Fink, M.; Woltran, S. Answer Set Programming and SAT Solving. In Handbook of Satisfiability; Biere, A.; Heule, M.; van Maaren, H.; Walsh, T., Eds.; IOS Press, 2011; pp. 341–432.
- Aaronson, S. Quantum Computing Since Democritus; Cambridge University Press, 2013.
- van Benthem, J. Logic and the Dynamics of Information. Studia Logica 2001, 67, 89–107. [Google Scholar] [CrossRef]
- Dolgov, A.D.; Novikov, I.D. Superluminal Particles and Causality. Physics Letters B 1998, 442, 82–89. [Google Scholar] [CrossRef]
- Bokulich, A. Noncausal Structural Explanations and the Sciences. In Causation and Explanation in Science; Woodward, J., Ed.; Oxford University Press, 2024. Preprint.
- Baumeler, Ä.; Wolf, S. Non-causal Computation. Entropy 2017, 19, 326. [Google Scholar] [CrossRef]
- Barad, K. Meeting the Universe Halfway: Quantum Physics and the Entanglement of Matter and Meaning; Duke University Press, 2007.
- de Petris, L.; Khatibi, S. Organizing Relational Complexity—Design of Interactive Complex Systems. Multimodal Technologies and Interaction 2025, 9, 81. [Google Scholar] [CrossRef]
- Barad, K. Transmaterialities: Trans*/matter/realities and queer political imaginings. GLQ: A Journal of Lesbian and Gay Studies 2015, 21, 387–422. [Google Scholar] [CrossRef]
- Heath-Carpentier, A., Ed. The Challenge of Complexity: Essays by Edgar Morin; Liverpool University Press, 2023.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).