Subscribe to RSS feed
Demonstrations 1 - 20 of 168
The First 1936 Elegant Binary Turing Machines
New this month
Half-Distance Rules with Low Resolution
Half-Distance Rules with High Resolution
Wolfram Science Summer School Rules
Cellular Automata Sensitivity to Initial Conditions
Finite Lyapunov Exponent for Generalized Logistic Maps with z-Unimodality
Complex Networks from Simple Rewrite Rules
2D Heat Diffusion Using a Search-Update-Feedback Cellular Automaton (SCA) Approach
Applying the Iota-Delta Numerical Function to Describe Normal and Anomalous Diffusion Using the Rules 26 and 146
Iota-Delta Function for Generating Cellular Automata
Order, Chaos, and the Formation of a Cantor Set Attractor in Elementary Cellular Automata
Neighbor-Dependent Network Systems
The Turbine Pattern in the Game of Life
Cobweb Diagrams of Elementary Cellular Automata
Kolmogorov Complexity of 3×3 and 4×4 Squares
Small Turing Machines with Halting State: Enumeration and Running on a Blank Tape
Turing Machines with Memory
Cellular Automaton Fluids
The Mazoyer Firing Squad
The #1 tool for creating Demonstrations
and anything technical.
Explore anything with the first
computational knowledge engine.
The web's most extensive
Course Assistant Apps »
An app for every course—
right in the palm of your hand.
Wolfram Blog »
Read our views on math,
science, and technology.
Computable Document Format »
The format that makes Demonstrations
(and any information) easy to share and interact with.
STEM Initiative »
Programs & resources for
educators, schools & students.
Join the initiative for modernizing
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
© 2015 Wolfram Demonstrations Project & Contributors |
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have