Isotropic

A cellular automaton is said to be isotropic if its global transition function is isotropic, i.e. invariant under rotations and reflections. Cellular automata that are not isotropic are called anisotropic or non-isotropic.

There are 2¹⁰² isotropic Life-Like rules, and 2⁵¹² MAP rules. The 2⁵¹² figure includes all outer-totalistic, isotropic, and anisotropic Life-like rules. Totalistic rules are a strict subset of outer-totalistic rules, which in turn are a strict subset of isotropic rules. Isotropic and anisotropic rules together make up the full complement of 2⁵¹² MAP rules.

Isotropic rules are most often represented in Hensel notation, but like any other possible 2-state rule in a range-1 Moore neighbourhood, they can also be encoded as MAP rule strings.

Also see

gollark: So I just arbitrarily picked one, but it's kind of bad.

gollark: The annoying thing about maths is that there's no convenient canonical form for expressions available.

gollark: No.

gollark: osmarkscalculator™ is a highly unperformant rewrite rule applier thing™ for bad computer algebra.

gollark: I know of Rubi, but I don't want to redesign my language to make it able to load its rules.

This article is issued from Conwaylife. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.