| Information | |
|---|---|
| has gloss | eng: The Rule 110 cellular automaton (often simply Rule 110) is an elementary cellular automaton with the following rule table: |
| lexicalization | eng: Rule 110 |
| instance of | c/Cellular automaton rules |
| Meaning | |
|---|---|
| Dutch | |
| has gloss | nld: Regel 110 (Engels: Rule 110) is de enige elementaire cellulaire automaat waarvan Turingvolledigheid is bewezen. Regel 110 werd voor het eerst besproken door Stephen Wolfram. |
| lexicalization | nld: regel 110 |
| Media | |
|---|---|
| media:img | CA rule110s.png |
| media:img | Ca110-interaction.png |
| media:img | Ca110-structures.png |
| media:img | Cts-diagram.jpg |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint