Rule 30 exact binomial-Lucas lifting: boolean logic to integer coefficients, Stirling & support sets

DOWNLOAD-DESKTOP-NOTEBOOK.nb (378 KB)
rule30_wolfram.pdf (436 KB)

5 Likes

Bonus: Exact Support-Set Algebra for Rule 45!

For those interested in exploring how this binomial-Lucas lifting framework applies to other chaotic elementary cellular automata, I mapped out the exact set recurrence for Rule 45. Like Rule 30, Rule 45 is a highly complex

For Rule 45, starting with initial conditions S_1 = \{0, 1\} and S_2 = \{1, 2\}:

S_m = \mathrm{Inc}\Big( (S_{m-1} * S_{m-2}) \;\Delta\; S_{m-2} \;\Delta\; \{0\} \Big)

Key differences from Rule 30: Notice that the linear S_{m-1} term is completely absent, but we have a new constant parity injection via the \{0\} set.

If you want to test this in the Mathematica environment :

2 Likes

news-congrads-kkluyshnik-02-04-19.jpg – you have earned Featured Contributor Badge 2015-11-02_10-07-11.png
Your exceptional post has been selected for our editorial columns Staff Picks http://wolfr.am/StaffPicks and Publication Materials https://wolfr.am/PubMat and Your Profile is now distinguished by a Featured Contributor Badge and is displayed on the Featured Contributor Board. Thank you!

2 Likes

https://mathematica.stackexchange.com/questions/318912/rule-30-finding-a-closed-formula-for-the-s-m-subset-recurrence/319098#319098