max_computation_rate
plain-language theorem explainer
The definition sets the maximum computation rate in Recognition Science as the reciprocal of the fundamental tick τ₀, yielding one operation per minimum time quantum. Researchers bounding clock speeds or bit rates in discrete-time models cite it when deriving finite upper limits from temporal discreteness. The definition is a direct one-line assignment from the already-proved positive fundamental_tick.
Claim. The maximum computation rate is defined by $r_0 := 1/τ_0$, where $τ_0$ is the fundamental tick (minimum time quantum).
background
In ComputationLimitsStructure the fundamental tick τ₀ is defined as the minimum time quantum with the property that it is positive. This definition takes its reciprocal to produce the maximum rate of operations per unit time. The module setting states that computation limits arise from temporal discreteness, with the maximum bit rate equal to 1/τ₀ in RS units (one operation per tick). Upstream, the fundamental_tick declaration supplies the value τ₀ used here.
proof idea
One-line definition that directly applies the reciprocal to the fundamental_tick value.
why it matters
This definition supplies the quantity proved positive and finite in the downstream theorem max_rate_pos (IC-002.2). It fills the temporal-discreteness source of limits listed in the module, connecting the eight-tick octave structure to an explicit bound on operations per discrete time unit. The result is used whenever a proof needs an explicit finite ceiling on computation rate without invoking energy or irrationality arguments.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.