Starting interactive Python…
Initializing...
Rulebook · Check an output for 1; clear it for 0. Choosing a starting rule resets these eight outputs.
Drag the values or click for exact entry. TT||(T||) counts stored rows, including t=0t=0||(t=0||); the Colab starts with T=N//2T=N//2||(T=N//2||). Here TT||(T||) can be varied independently. Random initialization uses uj∼U(0,1)u_j\sim U(0,1)||(u_j\sim U(0,1)||) and xj(0)=1[uj<ρ0]x_j(0)=\mathbf{1}[u_j<\rho_0]||(x_j(0)=\mathbf{1}[u_j<\rho_0]||). The seed keeps the same random draws when density changes.

One local update

At t=0, j=500: rule[1, 1, 0] = 0. The outlined cell changes from 1 to 0. Up to ten neighbors on either side are shown.
Lecture started at 14:50 EDT (confirmed by Ewan). Transcript retrieved October 1 at 15:09 EDT from the recorded lecture, queried 14:40–16:05 EDT; 144 indexed turns were available through approximately 15:07:45, with one pending recording. This is a snapshot of an ongoing lecture. ASR text and timestamps have not been checked against the audio. The lecture portion establishes binary 1D states, radius-one neighborhoods, rulebook ordering, and synchronous updates. The original starter used Rule 30; the notebook now follows the linked Colab snapshot with Rule 184, N=1000, density=0.6, and 500 stored rows. A fixed random seed, editable rule outputs, alternate initial conditions, and zero-outside boundaries extend the Colab. CA in general can also be stochastic.