Naive: Difference between revisions
Jump to navigation
Jump to search
{{Glossary}} |
No edit summary |
||
| Line 1: | Line 1: | ||
{{stub}} | {{stub}} | ||
'''Naive''' rules, so-called due to arising in flawed implementations of cellular automata by unfamiliar programmers, are a class of cellular automata where transitions are incremented in a reading-order fashion, rather than all at once. | '''Naive''' rules, so-called due to arising in flawed implementations of cellular automata by unfamiliar programmers, are a class of cellular automata where transitions are incremented in a reading-order fashion, rather than all at once. | ||
{{Glossary}} | |||
[[Category:Algorithms]] | |||
[[Category:Cellular automata]] | |||
Revision as of 12:56, 10 May 2021
| This article is a stub. You can help LifeWiki by expanding it. |
Naive rules, so-called due to arising in flawed implementations of cellular automata by unfamiliar programmers, are a class of cellular automata where transitions are incremented in a reading-order fashion, rather than all at once.