OAI/Combinatorics/UniformKServer/OffsetInstance.lean
16 declarations, 0 contain sorry, 0 declared as axioms
Uniform absolute squared-log cost for the exact rational-search/dyadic suffix, with arbitrary repeated starts and arbitrary finite activation delay. The literal bit-machine implementation is deliberately not asserted here.
- theorem
OAI.UniformKServer.OffsetInstance.history_diameterline 17 - def
OAI.UniformKServer.OffsetInstance.slopeline 32 - theorem
OAI.UniformKServer.OffsetInstance.rate_boundline 36 - def
OAI.UniformKServer.OffsetInstance.restartline 40 - def
OAI.UniformKServer.OffsetInstance.capline 43 - theorem
OAI.UniformKServer.OffsetInstance.validline 47 - theorem
OAI.UniformKServer.OffsetInstance.restart_posline 55 - def
OAI.UniformKServer.OffsetInstance.expectedline 59 - def
OAI.UniformKServer.OffsetInstance.endpointline 65 - theorem
OAI.UniformKServer.OffsetInstance.endpoint_nonnegline 70 - theorem
OAI.UniformKServer.OffsetInstance.suffix_boundline 78 - def
OAI.UniformKServer.OffsetInstance.coefficientline 94 - theorem
OAI.UniformKServer.OffsetInstance.coefficient_positiveline 96 - theorem
OAI.UniformKServer.OffsetInstance.coefficient_boundline 103 - def
OAI.UniformKServer.OffsetInstance.delayedCostline 116 - theorem
OAI.UniformKServer.OffsetInstance.delayed_boundline 121