03 / 03 · HOW TIME BECOMES SPACE
Specified mathematical modelMotion without a travelling monad
Change the private writing order while a frozen target and a one-cell shift give exactly the same completed pattern.
English synthetic reference narration; English and Arabic subtitles. The voice is not the author’s voice. The film is a model illustration, not footage of a physical process.
The complete narration
Two orders, two questions
Generation order and physical transport are different questions. The upper register shows a scan through addresses. The lower panel shows a pattern whose motion is governed by a separate, stated update rule.
Write a buffer; retain the record
During one scan, a buffer is written one cell at a time. The observer retains the previous completed pattern. No growing fragment is mistaken for a new observed configuration.
Accept the complete target
When every cell has been written, the buffer is accepted as the next record. In this example, the supplied transport rule shifts the pattern by one neighbouring cell on a periodic lattice.
A jumping scan; the same result
Switch the writing order from sequential to interleaved. The private scan now jumps between distant display cells. Yet the completed records are identical, because writing uses the same frozen target state.
Compare completed records
Stepping between completed records reveals the same one-cell translation. This is motion in the specified model, not a travelling source. Comparing record positions does not reveal an observed path between them.
The precise result
The demonstration proves scan-order independence for this buffer construction. It does not derive a universal speed or a particle law. A physical theory must connect transport, geometry, memory and calibrated clocks through its source dynamics.
Sources and further reading
Model, equations and limits
A frozen target, an explicit update
The full state is (m, j, π, R, T, W): completed-record count, write index, a fixed writing permutation, retained record, frozen target and pending buffer. One application of the update writes one buffer entry. Only the twelfth write makes the entire buffer the new retained record. The initial seed and periodic lattice are supplied.
Why changing the scan does not change the record
Every permutation writes each target entry exactly once. Each write reads the same frozen T, and distinct destination entries do not overwrite one another. At completion W = T = SR for every permutation. Induction then gives the same retained sequence Rₘ = SᵐR₀. An in-place update that reads partially overwritten values would not satisfy this argument.
What this does—and does not—connect
The construction separates private address order from the observable one-cell shift. It does not derive the shift rule, lattice, seed, memory budget or a physical clock from the source. One cell per completed record is a dimensionless model statement, not a prediction of the speed of light. No interpolated trajectory is displayed as an observation between records.
Changing the writing-order control restarts the unfinished scan at its boundary; it leaves the retained record intact. The two selectable permutations and 54 additional test permutations pass the same completion comparison.
Sources
Explanatory source: SMONAD DTT foundations, accessed 16 October 2026. The code is an explicit teaching implementation; it is not an independent verification of the complete research programme.