Message Boards Message Boards

1 Reply
0 Total Likes
View groups...
Share this post:

Reversible AND universal elementary cellular automata

Posted 1 year ago

Has any of the reversible extensions of the elementary one-dimensional cellular automata in NKS (e.g. Rule 37R) been shown to be computationally universal (like Rule 110)? If so, please give me links. Otherwise, could this be the case? Or is there a proof that no nR can be universal?

POSTED BY: Giulio Prisco

Wolfram mentions Rule 37R as an example of “cellular automata with class 4 overall behavior” (NKS, Chapter 11). “I strongly suspect that all class 4 rules, like rule 110, will turn out to be universal,” he says.

POSTED BY: Giulio Prisco
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
or Discard

Group Abstract Group Abstract