3 ms·
Isn't this single frame state of a classic cellular automata? Note, not "just" because I mean no disrespect. I don't understand how this differs from Conway's l
by ggm 11mo ago
Isn't this single frame state of a classic cellular automata? Note, not "just" because I mean no disrespect. I don't understand how this differs from Conway's life other than nuances of the live or die rule.
- deleted 11mo ago[deleted]
- gsf_emergency_6 11mo agoCGL doesn't have the scale invariance ("fractality") of ASM. ASM criticality is stable and persistent. "fractal life on edge"? what that looks like https://youtu.be/rKD51IUNK3A?t=40s https://youtu.be/rKD51IUNK3A?t=40s
- ggm 11mo agoSo that gets to how it differs, but it doesn't say its not a cellular automata. It could say "it's a cellular automata with different rules"
- gsf_emergency_6 11mo agoIt is a cellular automata distinguished by commutativity. You used CGL as the basis for comparison, that's highly nonAbelian. According to Wolfram (& I agree :), everything is a cellular automaton, so comparing to CGL made more sense to me.
- Sharlin 11mo agoI don't believe that Game of Life is Abelian.
- tripplyons 11mo agoI don't think you could even define an associative binary operator on states in the Game of Life because of its computational irreducibility.
- ggm 11mo agoCGOL is is turing complete. If you can make a NOR gate, you can make anything.
- tripplyons 11mo agoI know it is Turing-complete; I was instead commenting on its computational irreducibility. My point is that it is impossible to express the rules in the form of an associative operator over a sequence of board states. You could say the same thing about iterating with a sufficiently complex circuit of NOR gates.