Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol (Q3596753)

From MaRDI portal
Revision as of 10:20, 16 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
scientific article

    Statements

    Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol (English)
    0 references
    0 references
    0 references
    0 references
    29 January 2009
    0 references

    Identifiers