BSB Model Attempts to Compute “Most Preferred” Activation Pattern (Golden, 1988; Biological Cybernetics; Golden,1996, Mathematical Methods)
BSB Representation Theorem: The BSB probability mass function p : S ? (0,1) defined by: can represent every BSB Preference Relation R consistent with A1-A9.
BSB Satisficing Theorem (see Golden, 1986, 1993, JMP): A BSB Algorithm (W,b,?) with ? ɚ/|?min| has property: p(x(t+1)) > p(x(t)) for all x(t+1)?x(t), where is p defined as in (*).