Maximum-score routing rule

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

1. Read ρ(x) as the quantity being defined or updated by this relation.

2. Chooses an argument maximizing the displayed objective over the stated feasible set.

3. 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

ROUTING FUNCTION ρ(x)

ρ(x) = argmaxᵢ( Cᵢ - dx )         ← chooses which neuron handles task

▼
ACTIVE NEURON PATHWAY  │  <── chosen by routing ρ(x)
(one or several nodes)

ρ(x) = argmaxᵢ( Cᵢ - dx )         ← chooses which neuron handles task

Related builds