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 CONSEQUENCES1
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
RELATED KNOWLEDGE
Structural connections
- Actual Positive Shear Fibersstructural-affinity · Closed
- Adaptive Cost and the Passive Boundarystructural-affinity · Closed
- Adaptive Cost and the Passive Boundarystructural-affinity · Closed
- Canonical Passive Joint Boundarystructural-affinity · Closed
- Equality Query Schedule Normal Formstructural-affinity · Closed
- Passive Adaptive Transcript Upper Boundstructural-affinity · Closed
- Passive Policy Normalizationstructural-affinity · Closed
- Passive Query Memoizationstructural-affinity · Closed
- Positive Rank-One Secantsstructural-affinity · Closed
- Positive Rulings and Actual Second Queriesstructural-affinity · Closed
- Terminal Histories and Exact First-Step Costsstructural-affinity · Closed
- Weighted Identification of Sibling Residue Leavesstructural-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