3 ms·
A concrete example of #2 is the hashlife algorithm. Intermediate steps can be skipped in a region of space, yet since it implements the CA nothing inside can no
by carry_bit 9y ago
A concrete example of #2 is the hashlife algorithm. Intermediate steps can be skipped in a region of space, yet since it implements the CA nothing inside can notice that the computation didn't actually happen.