Solving the Majority Problem with Rule 232

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

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

This Demonstration uses NKS rule 232 to solve the majority voting problem (or density classification task) for a binary string by manipulating the input. The majority voting problem consists in determining if there are more 1s or more 0s in . The result is given by convergence of the evolution of the cellular automaton to either all 0s or all 1s.

Contributed by: Fernando Faria (October 18)
Open content licensed under CC BY-NC-SA



[1] S. Wolfram. A New Kind of Science. (NKS|Online).


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.