Mathematical Framework
Regeneration Operator (Full Implementation)
R[χ](x,t) = ∫₀ᵗ φ(x,τ)·exp(C(τ)/Ω)·Θ(t-τ) dτ
Templates φ weighted by exp(C/Ω) - exponential amplification controlled by Ω
Implementation: weight(shape) = exp(C_global/Ω) × exp(C_shape/Ω)
Memory Weight Function (As Implemented)
w(τ) = exp(C_accumulated/Ω) × exp(C_shape/Ω)
Low Ω: Exponentially peaked at recent high-C | High Ω: Approximately uniform across history
Global coherence C amplifies all template accessibility multiplicatively
Effective Memory Depth
τeff = ∫₀ᵗ exp(C(τ)/Ω) dτ ≈ exp(C/Ω) for constant C
Grows exponentially with accumulated coherence at high Ω
Higher coherence = deeper temporal integration
Coherence Accumulation Dynamics
dC/dt = -F = -(DKL[q(η|μ)||p(η|b)] - log p(b))
Successful prediction (low VFE) increases coherence
Coherence measures cumulative inferential success over system lifetime
Boundary Dissolution Limit
Ω → Ωcrit ⟹ AB → Amin ⟹ |U⟩ ≠ |S⟩|E⟩
At critical Ω, separability breaks down and FEP formalism becomes ill-defined
Safeguard: Ωmin = 0.3 prevents numerical instability