Binary Patterns of Integer Functions

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.

Intricate patterns can be produced from the binary number representation of the results of integer functions. Is there a cellular automata rule (and initial condition) that can produce the same behavior and computation?

Contributed by: Daniel de Souza Carvalho (March 2011)
Open content licensed under CC BY-NC-SA



There is a cellular automaton (NKS|Online) that computes the primes.

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.