SetReplace
SetReplace copied to clipboard
maxitg
C++/Wolfram Language package for exploring set and graph rewriting systems
## Changes * Implements `HypergraphSubstitutionSystem`, which uses the existing low-level Hypergraph-related code to compute the evolution of hypergraphs. * `GenerateMultihistory` generates a `Multihistory` object that contains a handle to the...
## Changes * Trying to solve #494. * Adding a basic `Hypergraph` object, accessors and upvalues. ## Comments * Various designs questions: - ~How to represent the `Hypergraph` object in...
### The problem Since Github now supports click-to-copy for code blocks, it became somewhat inconvenient that the input/output code blocks contain `In[] :=` and `Out[] =` prefixes that should not...
### The project goal Path integral approach to quantum theory can be thought of as probability theory on histories. Token-event graphs might be a way to describe histories. However, we...
### The project goal We currently don't have any way to enumerate ordered hypergraphs or `HypergraphSubstitutionSystem` rules in *SetReplace*. The closest thing we have is a [`RandomHypergraph`](https://github.com/maxitg/SetReplace/blob/master/Documentation/SymbolsAndFunctions/UtilityFunctions/RandomHypergraph.md) function and a...
### The project goal We do have [some understanding](https://github.com/maxitg/SetReplace/files/6225225/TokenDeduplication.nb.zip) of how token deduplication might work in systems where atoms have explicit names (i.e., multiset systems with no `Module`, `Unique`, or...
### The project goal Thanks to @SantiagoGiner from 2021 Winter School, we now have a way of computing [`CausalDensityDimension`](https://github.com/maxitg/SetReplace/blob/master/Documentation/SymbolsAndFunctions/UtilityFunctions/CausalDensityDimension.md) (aka [Myrheim–Meyer dimension](https://en.wikipedia.org/wiki/Causal_sets#Dimension_estimators)) of causal graphs. This project will be the...
### The problem #### Directed Hypergraphs The edges of a directed hypergraph consist of two unordered sets of vertices, in other words, ` -> ` Here, the order in the...
Implement enumeration of SetReplace systems. Specifically, come up with a numbering scheme (may be multiple numbers), i.e., ``` size.initVsRuleSplit.ruleCount.rule1;rule2;....init ``` Then, there should be a function which would take this...
### The problem One difference between multihistories as implemented in *SetReplace* and the [`MultiwaySystem`](https://resources.wolframcloud.com/FunctionRepository/resources/MultiwaySystem) is that `MultiwaySystem` identifies isomorphic states and merges them into one in properties such as `"StatesList"`....