Partitioned cellular automaton: Difference between revisions
Jump to navigation
Jump to search
Created page with "{{stub}} Partitioned cellular automata (PCA) are a class of cellular automata investigated due to their capability for reversibility. They have been researched on square and t..." |
cats |
||
| Line 1: | Line 1: | ||
{{stub}} | {{stub}} | ||
Partitioned cellular automata (PCA) are a class of cellular automata investigated due to their capability for reversibility. They have been researched on square and triangular grids. | '''Partitioned cellular automata''' ('''PCA''') are a class of cellular automata investigated due to their capability for reversibility. They have been researched on square and triangular grids. | ||
{{Glossary}} | |||
[[Category:Algorithms]] | |||
[[Category:Cellular automata]] | |||
Revision as of 12:57, 10 May 2021
| This article is a stub. You can help LifeWiki by expanding it. |
Partitioned cellular automata (PCA) are a class of cellular automata investigated due to their capability for reversibility. They have been researched on square and triangular grids.