airesearcher

7 ms·

1.
by airesearcher 6d ago
Having worked on nearly 500 complex lean libraries in math and theoretical physics, with AI assistance, I have some experience from the road to share here. In all my work I have found that AI is terrible at coming up with interesting ideas
2.
New Master Fixed Point Theorem Unifies Godel, Turing, Kleene, Tarski, Lob(novaspivack.com)
3 points by airesearcher 5mo ago|0 comments
3.
SocioLife – Socio-Economic Life SIM That Runs in the Browser(novaspivack.com)
1 points by airesearcher 10mo ago|1 comments
4.
by airesearcher 10mo ago
SocioLife is an advanced artificial life simulation exploring emergent social behaviors, tribal dynamics, economic systems, warfare, diplomacy, and technological evolution in a complex multi-agent ecosystem. SocioLife is written in javascri
5.
by airesearcher 11mo ago
Looks better... the one thing I am not seeing is the behavior where they expand in two directions at the same time - but it might be that it's too small. Also it would be better if you started from a much lower density initial conditio
6.
by airesearcher 11mo ago
share a link to the new version of your shader - would love to check it out perhaps also make a version that starts from random initial condition as well? looks promising
7.
by airesearcher 11mo ago
Looks closer. Can’t tell from your example if exact.. but seems better
8.
by airesearcher 11mo ago
Very cool!
9.
by airesearcher 11mo ago
Actually - on that particular topic - you might want to read the articles and the math before forming an opinion - start from information geometry and fisher information metrics of information processing - which is what that particular line
10.
by airesearcher 11mo ago
You're right that Realm of Lace edges are derived from node eligibility, making it theoretically equivalent to a complex multi-state CA. I've updated the documentation to reflect this honestly. However, your Shadertoy port doesn&#
11.
by airesearcher 11mo ago
The difference is that it is not merely using dynamic neighborhoods - it's using topological properties of neighbors and neighborhoods as metrics that rules use. For example, sum of degrees of neighbors, or betweenness, or other measur
12.
by airesearcher 11mo ago
Actually it's a pretty hard thing to implement - the main challenge was to make it performant in python... I had to jump through flaming hoops!
13.
by airesearcher 11mo ago
links are first-class entities. Some rules have cell states AND links. Some rules treat cell states as topological metrics of neighborhoods or neighbors. See the detailed .md cited above for more details.
14.
by airesearcher 11mo ago
Because I was too lazy to refactor it into a ton of modules...
15.
by airesearcher 11mo ago
The question is really whether this class of rule is a subset of 2D binary state CA, or whether it is a superset in fact.
16.
by airesearcher 11mo ago
Here is a bit more information on how this class of rule works - should help with some of the questions about that in the thread: https://github.com/novaspivack/lace/blob/master/Realm_of_Lac...
17.
by airesearcher 11mo ago
https://github.com/novaspivack/lace/blob/master/Rule_Explana... https://github.com/novaspivack/lace/blob/master/Betweenness_...
18.
by airesearcher 11mo ago
I've added a bit more explanation https://github.com/novaspivack/lace/blob/master/Rule_Explana... https://github.com/novaspivack/lace/blob/master/Betweenness_...
19.
by airesearcher 11mo ago
Yes you are missing something. The first examples do that, but later examples do something different - they are using the neighborhood topology instead of traditional cell states, to generate the behavior.
20.
by airesearcher 11mo ago
In theory, if using a computationally universal CA, you can simulate any other CA with it. However it might require a lot of sub-steps to do so. No claim is being made that this is a new kind of computation.
21.
by airesearcher 11mo ago
These rules use very different principles than traditional cell-based rules - for example neighbor degree, number of connections, and eligibility criteria based on connectivity. So in short, the cells are not becoming alive or dead based on
22.
by airesearcher 11mo ago
Good feedback - These rules use very different principles than traditional cell-based rules - for example neighbor degree, number of connections, and eligibility criteria based on connectivity. So the cells are not becoming alive or dead ba
23.
by airesearcher 11mo ago
Birth conditions: Based on sum of neighbor degrees Survival conditions: Based on sum of neighbor degrees Death conditions: Specific degree counts that cause node death Eligibility: Nodes must meet conditions to form connections
24.
by airesearcher 11mo ago
hahaha ... I actually wondered if someone dosed me... but no that was not possible in that situation at that time (and it would have had to be an elephant dose to last a week). Yes, I did try to simulate a mouse brain... but on a Mac 128 th
25.
by airesearcher 11mo ago
Realm of Lace Rules The signature "Realm of Lace" family of rules uses: Birth conditions: Based on sum of neighbor degrees Survival conditions: Based on sum of neighbor degrees Death conditions: Specific degree counts that cause n
26.
by airesearcher 11mo ago
Good question... and I explored this a lot in the rules - some of the parameters are extremely sensitive... so it takes a lot of trial and error...
27.
by airesearcher 11mo ago
Yeah thanks for the feedback - explaining the rules would require a longer write-up so I opted for the late binding path... in the repo there is a rule editor, and it explains the parameters of every rule in the GUI. It's a lot easier
28.
Lace: A New Kind of Cellular Automata Where Links Matter(novaspivack.com)
137 points by airesearcher 11mo ago|63 comments
29.
by airesearcher 11mo ago
LACE - Link Automata Computing Engine (written in python, with optional taichi GPU-powered mode for large-scale simulations) LACE is a new kind of cellular automata where rules operate on cell states and their links to other cells. Check ou
30.
by airesearcher 1y ago
That is similar to the point that the paper makes - however it proves it rigorously with formal logic.

More ›