reasoner.js
SetReplace
reasoner.js | SetReplace | |
---|---|---|
4 | 1 | |
28 | 211 | |
- | - | |
8.5 | 0.0 | |
5 days ago | over 2 years ago | |
JavaScript | Mathematica | |
MIT License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
reasoner.js
-
[microblog] Reasoner.js: a functional-logic framework for automated reasoning
As usual, there is online playground and the project home page.
-
[Checkpoint] Reasoner.js typed graph rewriting system got variables
Project home page: https://github.com/mind-child/reasoner.js
-
[checkpoint] Reasoner.js: non-deterministic reasoning done right
project repository link:https://github.com/symbolverse/reasoner.js online playground link:https://symbolverse.github.io/reasoner.js/playground/
-
[sanity check] About half a way to metacompiler
Working draft is recently updated, but expect some changes during further development.
SetReplace
-
Multicomputation as a General Paradigm for Theoretical Science
Some of the ideas in this post might pan out, some might not. Regardless, I do think token event graphs will turn out to be important. Of course, I'm biased: I coined the name TEG -- although the underlying idea originated with Max Piskunov and his "local multiway systems" [0]
What's promising about TEGs (and their incidence hypergraph, the rewrite hypergraph) is that they offer a clean methodology to decompose the behavior of a non-deterministic automaton into its causally independent parts. We're still trying to understand how to think about them, but the most promising approach seems to use the lens of (modular) representation theory, which gives us a rich mathematical toolkit to work with.
If this methodology works, there will be possibility to represent many kinds of systems in disparate fields, ranging from distributed computation to physics to biology to machine learning, in the common language of TEGs and their representations. Of course it may turn out to be merely a recasting of older ideas. In particular the Khrone-Rhodes theorem [1], categorical Petri nets [2], and the GNS construction [3] seem like they might be describing the same or an analogous procedure.
I hope to soon be describing this approach in full detail using quiver geometry [4].
[0]: https://github.com/maxitg/SetReplace/blob/master/Research/Lo...
[1]: https://www.wikiwand.com/en/Krohn–Rhodes_theory
[2]: https://arxiv.org/abs/2101.04238
[3]: https://www.youtube.com/watch?v=OmaSAG4J6nw
[4]: https://quivergeometry.net
What are some alternatives?
WolframLanguageForJupyter - Wolfram Language kernel for Jupyter notebooks
feyncalc - Mathematica package for algebraic calculations in elementary particle physics.
perfecthash - A performant, parallel, probabilistic, random acyclic-graph, low-latency, perfect hash generation library.
BernDirac - A Mathematica package for performing calculations involving matrices/vectors in the Dirac notation which is usually used in quantum mechanics/quantum computing.