You can edit almost every page by Creating an account and confirming your email.

The Ruliad

From EverybodyWiki Bios & Wiki

A schematic figure of 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: {{x,y}}{{x,y}},{{x,y}}{{x,y},{y,z}},{{0,1}}{{0,1},{1,z}}. with x, y, z as three arbitrary elements; the arrow signifies a replacement or transformation between relations. Note that the element z can be anything, as long as it is distinct from 0 and 1, which have already been used. Continuing to apply this rule, obtains {{0,1},{1,a},{1,z},{z,b}} The values a and b are necessarily introduced because when operating on {0,1} and {1,z}, which may be obtained in the following: {0,1}{{0,1},{1,z}},{1,z}{{1,z},{z,a}}. Henceforth, the second replacement requires a different element than the previous z, and the same reasoning holds for b.

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]

References

  1. "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, retrieved 2023-11-20
  2. "The Wolfram Physics Project: Glossary". www.wolframphysics.org. Retrieved 2023-11-04.
  3. Jadhav, Darsh (October 2019). "Algorithms: Recursion and Iteration". Research Gate.
  4. "Manipulating the graph: Layouts - Linkurious user manual 4.0.17". doc.linkurious.com. Retrieved 2023-11-20.
  5. Johnston, Nathaniel (2021). Conway's Game of Life: Mathematics and Construction (1st ed.). Nathaniel Johnston. ISBN 9781794816961. Search this book on
  6. Bonifaci, Vincenzo; Facca, Enrico; Folz, Frederic; Karrenbauer, Andreas; Kolev, Pavel; Mehlhorn, Kurt; Morigi, Giovanna; Shahkarami, Golnoosh; Vermande, Quentin (2022-06-12). "Physarum-inspired multi-commodity flow dynamics". Theoretical Computer Science. 920 (C): 1–20. arXiv:2009.01498. doi:10.1016/j.tcs.2022.02.001. ISSN 0304-3975. Unknown parameter |s2cid= ignored (help)
  7. "ResearchGate | Find and share research". ResearchGate. Retrieved 2023-11-04.
  8. "The Concept of the Ruliad—Stephen Wolfram Writings". writings.stephenwolfram.com. 2021-11-10. Retrieved 2023-11-04.


This article "The Ruliad" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:The Ruliad. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.

Page kept on Wikipedia This page exists already on Wikipedia.