Get the latest tech news
Bitbanging 1D Reversible Automata
Nearest-neighbor, one-dimensional, reversible, bitbanging binary cell automata implementation.
After performing the left and right shifts, we get the high or low bit from the next or previous integers in the array. It’s actually much faster (2x at least) on my CPU to calculate a pair of ratios in floating point, then convert them back to integers. Still better would be to limit the size of the pixmap to be 2 x larger than the dimensions of the automata, where x ∈ ℕ then we can use shifts instead of division.
Or read this on Hacker News