Automata Generative Networks 1

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

A simple parsing algorithm converts each step of a cellular automaton evolution into a tree. Successive trees are linked up by periodically linking nodes that lie in the same column.

Contributed by: Kovas Boguta (March 2011)
Open content licensed under CC BY-NC-SA


Snapshots


Details

detailSectionParagraph


Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send