Philosophy:The Ruliad
The Ruliad is a concept introduced by Stephen Wolfram. It is defined as the entangled limit of everything that is computationally achievable:[1] the result of following all possible computational rules in all possible ways. It can be seen as an attempt to abstract and generalize every aspect of the physical universe through the use of structures such as graphs.
The term is derived from the concept of the Rulial Space, a space defined by allowing all practicable rules of a given class to be followed between states of a system.[2]
Basic structure
At the lowest level, the structures on which the models operate consist of collections of relations between identical discrete elements. These structures can be represented as graphs or hypergraphs, with such collections being represented as the edges, and those elements are nodes. An example of a simple rule: [math]\displaystyle{ \begin{align} \{\{x, y\}\} &\longrightarrow \{\{x, y\}\}, \\ \{\{x, y\}\} &\longrightarrow \{\{x, y\}, \{y, z\}\}, \\ \{\{0, 1\}\} &\longrightarrow \{\{0, 1\}, \{1, z\}\}. \end{align} }[/math] with [math]\displaystyle{ x }[/math], [math]\displaystyle{ y }[/math], [math]\displaystyle{ z }[/math] as three arbitrary elements; the arrow signifies a replacement or transformation between relations. Note that the element [math]\displaystyle{ z }[/math] can be anything, as long as it is distinct from 0 and 1, which have already been used. Continuing to apply this rule, obtains [math]\displaystyle{ \{\{0, 1\}, \{1, a\}, \{1, z\}, \{z, b\}\} }[/math] The values [math]\displaystyle{ a }[/math] and [math]\displaystyle{ b }[/math] are necessarily introduced because when operating on [math]\displaystyle{ \{0, 1\} }[/math] and [math]\displaystyle{ \{1, z\} }[/math], which may be obtained in the following: [math]\displaystyle{ \begin{align} \{0, 1\} &\longrightarrow \{\{0, 1\}, \{1, z\}\}, \\ \{1, z\} &\longrightarrow \{\{1, z\}, \{z, a\}\}. \end{align} }[/math] Henceforth, the second replacement requires a different element than the previous [math]\displaystyle{ z }[/math], and the same reasoning holds for [math]\displaystyle{ b }[/math].
When imagining to continue this process (iteratively or recursively[3]), the branching in the graph's space may be noticed, expanding both in terms of the number of edges and nodes. In the example, with a preference for an organized top-to-bottom layout,[4] it becomes apparent that the rule generates a binary tree.
In more complex cases, the Ruliad presents correlations with the world of fractal geometry, cellular automata (like The Game Of Life by John Conway[5]), Turing machines or growth processes of biological organisms like the Physarum Polycephalum.[6] These are Rulial multiway graphs, after 3-steps for Turing machines (with various numbers of states):.[7]
The full Ruliad involves taking the infinite limits of all possible rules, initial conditions and steps.[8]
Interpretation
Hypothetically, if a rule were identified that describes (almost) everything in our Universe at the level of macro/microscopic physical laws evolving over time, reconciling both quantum mechanics and relativity[9] (consider quantum gravity), the inevitable next question would be: "Why this rule and not others?"
The Ruliad is a mosaic of possible choices, many of which don't truly represent our surroundings. Stephen Wolfram's idea (also presented during a TED Talk[10]) is that we are observers confined within a specific branch of the Ruliad. We cannot observe the overall picture from the outside, but we tend to analyze specific facets of the Ruliad through particular methods of empirical perception and analysis.
Moreover, what we observe in the present, what we observed in the past, and what we will observe in the near future may not necessarily coincide with what we would see with an infinitely long time available for the evolution[11] of the Ruliad. We are not capable of predicting with a high degree of accuracy how the structure will evolve over time, especially when considering long-term "distances" and rules that can occur in any way without constraints. The evolution of such a complex system is hardly predictable,[12] even with the probabilistic and algorithmic tools we have today: Stephen refers to it as computational irreducibility.[13]
So, the solution would involve a concatenation of What If scenarios and observations from various perspectives,[14] each of which interprets the Ruliad within the confines of its own branch.
Note: there could be points of contact between multiple "universes" related to different observers (not necessarily meant as a physical entity endowed with consciousness[15][16]).
References
- ↑ "1. Computational Science Basics", A Survey of Computational Physics (Princeton University Press): pp. 1–29, 2008-12-31, doi:10.1515/9781400841189-002, ISBN 9781400841189, http://dx.doi.org/10.1515/9781400841189-002, retrieved 2023-11-20
- ↑ "The Wolfram Physics Project: Glossary" (in en). https://www.wolframphysics.org/glossary/.
- ↑ Jadhav, Darsh (October 2019). "Algorithms: Recursion and Iteration". Research Gate. https://www.researchgate.net/publication/360139905.
- ↑ "Manipulating the graph: Layouts - Linkurious user manual 4.0.17". https://doc.linkurious.com/user-manual/latest/layout/#hierarchical-layout.
- ↑ Johnston, Nathaniel (2021) (in English). Conway's Game of Life: Mathematics and Construction (1st ed.). Nathaniel Johnston. ISBN 9781794816961.
- ↑ Bonifaci, Vincenzo; Facca, Enrico; Folz, Frederic; Karrenbauer, Andreas; Kolev, Pavel; Mehlhorn, Kurt; Morigi, Giovanna; Shahkarami, Golnoosh et al. (2022-06-12). "Physarum-inspired multi-commodity flow dynamics". Theoretical Computer Science 920 (C): 1–20. doi:10.1016/j.tcs.2022.02.001. ISSN 0304-3975. https://doi.org/10.1016/j.tcs.2022.02.001.
- ↑ "ResearchGate | Find and share research" (in en). https://www.researchgate.net/.
- ↑ "The Concept of the Ruliad—Stephen Wolfram Writings" (in en). 2021-11-10. https://writings.stephenwolfram.com/2021/11/the-concept-of-the-ruliad/.
- ↑ Macías, Alfredo; Macias, Alfredo; Lämmerzahl, Claus; Camacho, Abel (2008). "On the incompatibility between General Relativity and Quantum Theory". AIP Conference Proceedings (AIP) 977: 3–11. doi:10.1063/1.2902797. Bibcode: 2008AIPC..977....3M. http://dx.doi.org/10.1063/1.2902797.
- ↑ Wolfram, Stephen (2023-10-27), How to think computationally about AI, the universe and everything, https://www.ted.com/talks/stephen_wolfram_how_to_think_computationally_about_ai_the_universe_and_everything, retrieved 2023-11-04
- ↑ Zwirn, Hervé; Delahaye, Jean-Paul (2013), "Unpredictability and Computational Irreducibility", Emergence, Complexity and Computation (Berlin, Heidelberg: Springer Berlin Heidelberg): pp. 273–295, doi:10.1007/978-3-642-35482-3_19, ISBN 978-3-642-35481-6, http://dx.doi.org/10.1007/978-3-642-35482-3_19, retrieved 2023-11-20
- ↑ Israeli, Navot; Goldenfeld, Nigel (2004-02-20). "Computational irreducibility and the predictability of complex physical systems". Physical Review Letters 92 (7): 074105. doi:10.1103/PhysRevLett.92.074105. ISSN 0031-9007. PMID 14995857. Bibcode: 2004PhRvL..92g4105I. https://pubmed.ncbi.nlm.nih.gov/14995857/.
- ↑ "Computational Irreducibility: A New Kind of Science | Online by Stephen Wolfram [Page 737"] (in en). https://www.wolframscience.com/nks/p737--computational-irreducibility/.
- ↑ Elshatlawy, Hatem (30 Aug 2023). "Ruliology: Linking Computation, Observers and Physical Law". arXiv:2308.16068 [physics.hist-ph].
- ↑ Rovelli, Carlo (2020) (in Italian). Helgoland (4th ed.). Adelphi. ISBN 9788845935053.
- ↑ Plotnitsky, Arkady. (1997). "Penrose's triangles: The large, the small, and the human mind". Postmodern Culture 7 (3). doi:10.1353/pmc.1997.0027. ISSN 1053-1920. http://dx.doi.org/10.1353/pmc.1997.0027.
Original source: https://en.wikipedia.org/wiki/The Ruliad.
Read more |