Naive: Difference between revisions

From LifeWiki
Jump to navigation Jump to search
Created page with "{{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..."
 
{{Glossary}}
Line 1: Line 1:
{{Glossary}}
{{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.

Revision as of 12:53, 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.