Read the equation
Selects the neuron or family attaining the largest displayed score. In the Rhiannon C_i−dx variant, subtracting the same dx from every candidate does not change the winner. This maximum-cost rule conflicts with the separate minimum-cost selector elsewhere in the notes and needs an explicit design choice.
Terms & definitions
The recovered passage does not supply a separate symbol table. Read the source context for the notation used in this version; familiar letters may carry different meanings in other builds.
How it works
Read \rho(x) as the quantity being defined or updated by this relation.
Applies the stated minimum, maximum, or clamp. These bounds are part of the actual operation.
Use this version’s variable definitions and update order. The same symbol may be assigned a different meaning in another build.
Assumptions & limits
Source recovery establishes that the expression appears in this record. Its mathematical validity, implementation behavior, and interpretation must be assessed separately. See the linked source and research notes for the checks available for this version.
Original context
Read the surrounding source passage
Routing Choosing which neuron handles a task: \rho(x) = \arg\max_i \big( C_i - dx \big) Highest “cost advantage minus coherence pressure” wins. ⸻ Repair / Optimization Activation
Exact original notation
\rho(x) = \arg\max_i \big( C_i - dx \big)
Related builds
Sources & provenance
\rho(x) = \arg\max_i \big( C_i - dx \big)
\rho(x) = \arg\max_i \big( C_i - dx \big)