Observer / CONCEPT
Adaptive Separation Depth Upper Bound
Pair-separating readouts on a finite state quotient construct an identifying adaptive protocol tree with worst realized depth at most one less than the number of states.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS1
Pair separation gives a state-count adaptive depth bound
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- Adaptive Cost and the Passive Boundarystructural-affinity · Closed
- Adaptive Cost and the Passive Boundarystructural-affinity · Closed
- Canonical Passive Joint Boundarystructural-affinity · Closed
- Indexed Common-Source Upper Boundstructural-affinity · Closed
- Indexed Readout Monotonicitystructural-affinity · Closed
- Minimum Audit Set Coverstructural-affinity · Closed
- Passive Adaptive Transcript Upper Boundstructural-affinity · Closed
- Subfamily Readout Refinementstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance