Observer / CONCEPT
Sharp Waiting for Dyadic High-Bit Recovery
The least worst-case forward waiting time for dyadic high-bit recovery at the minimum binary query budget is attained by midpoint sensing.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH1
DOCUMENT LINKS1
The attained least waiting bound and the physical readout formula
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 Causal Prefix Recoverystructural-affinity · Closed
- Actual Continuation Capacity and Saturationstructural-affinity · Closed
- Adaptive Early Stopping Limitsstructural-affinity · Closed
- Closed Circular Phase Ball Overlapstructural-affinity · Closed
- Dyadic Prefix Completion Timesstructural-affinity · Closed
- Exceptional Dyadic Deadline Prefixesstructural-affinity · Closed
- Finite Stationary Positive Interval Controlstructural-affinity · Closed
- Positive Forward Sensing on Arbitrary Intervalsstructural-affinity · Closed
- Saturated histories of the original stationary controllerstructural-affinity · Closed
- Terminal Clock Compressionstructural-affinity · Closed
- Worst-Case Depth Information Lower Boundstructural-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