Lecture 3.4
Given admissible evidence, the operating system can be reconstructed as a structured approximation. This lecture states the extractability thesis — that a latent decision system can be inferred from behaviour — and, just as importantly, the limits of what such inference can establish.
Learning objectives
After this lesson, the reader should understand:
Concept framework
From trace to structure
Case study
A reconstruction yields "escalate above £48,000". An equally consistent reading is "escalate when the approver is not a director". How is the ambiguity resolved?
Not by the data alone. If directors happen to hold the higher approval limits, the two rules produce identical behaviour across every record in the log, and no further volume of the same evidence will separate them. This is the non-identifiability problem familiar from inverse reinforcement learning: behaviour under-determines the rule that generated it. The discipline's answer is not to silently pick the more plausible reading. It is to surface both, name the confound explicitly, and route the question back to the institution — which knows which of the two it meant, and is the only party entitled to say.
Discussion questions
Exercise
Reconstruct a boundary, then attack your own result.
Research notes