From representation to computation

Latent states can represent information and may also participate in multi-step computation. Understanding an update begins with what it reads, which conditions it depends on and which state it changes.

Order is part of the conditions

If the prerequisites an operation reads are not yet available, updates with the same form may lead to different outcomes. Causal dependencies and execution order therefore need to be studied together. Recovering states in controlled tasks also requires clear boundaries around the inputs, local operations, and identifiable states.

Test the questions separately

Reliable execution with a known causal graph and certified operations is a different level of capability from identifying a program from an open-ended problem description and controlling its execution autonomously. Validating the former lays a foundation for the latter, but cannot establish it. My next questions are how to design experiments that distinguish these abilities, and how to identify precisely what is missing when they fail.