Boundary-Condition Graphs as Memory and Control in Recursive Formal Systems
Run the same prompt twice at temperature zero and the second answer can change a sentence. The rules did not move: the weights are frozen and the decoding rule is fixed. What moved were conditions nobody registered, down to the order in which a batched kernel adds floating-point numbers. That small surprise opens the whole architecture of how a generative model is steered.
Described one run at a time, a generative model works as a formal system: fixed rules and priors, deriving consequences from initial conditions that are only ever partly registered. Mechanistic interpretability is kept for…
The skinny
The skinny isn't ready yet — notes appear once the transcript is processed.