Partitioned cellular automaton: Difference between revisions
Jump to navigation
Jump to search
m Ian07 moved page Partitioned cellular automata to Partitioned cellular automaton: singular form |
link to forum thread |
||
| 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. | ||
==External Link== | |||
{{LinkForumThread|f=11|t=4098|title=Partitioned Cellular Automata}} | |||
{{Glossary}} | {{Glossary}} | ||
[[Category:Algorithms]] | [[Category:Algorithms]] | ||
[[Category:Cellular automata]] | [[Category:Cellular automata]] | ||
Revision as of 08:08, 12 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.
External Link
- Partitioned Cellular Automata (discussion thread) at the ConwayLife.com forums