Hacker News new | ask | show | jobs
by airesearcher 253 days 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.

1 comments

The observation that other CA can be equivalent is a weak critique at best, this CA may be a nice compact way of describing types of CA that have interesting properties. It is not terribly interesting that it may be subsumed by some other CA. It may be some interesting unstudied subset.

For instance the Game of Life is a subset of 2-d binary state CA, the rule only takes the totals of neighboring cells, and so is a subset of those CAs with rules that care about specific patterns of neighbors.

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.