How the UWCA Works: A Step-by-Step Explanation of the Universal Windowed Cellular Automaton

A regular cellular automaton (like Rule 110) updates every cell at once using a lookup table. The UWCA (Universal Windowed Cellular Automaton) does something more sophisticated: it encodes the states of cells as residues of large prime numbers, and uses a single arithmetic sweep to find the correct next state for each position. The result is a cellular automaton that can implement any rule in a sliding-window fashion, using only modular arithmetic. This tutorial explains how the UWCA works step by step: the residue encoding, the arithmetic sweep, the window mechanism, and how the GTE polynomial specifically implements the UWCA architecture. The UWCA construction is key to understanding how the 19-bit GTE rule gives rise to the universality and computational completeness properties of the substrate.