Implicit Value Updating Explains Transitive Inference Performance: The Betasort Model
Fig 2
Outline of the betasort algorithm over the course of one trial.
The algorithm’s logic is presented in both a schematic (left) and detailed (right) outline. Rectangles refer to operations, diamonds to logical branches, and octagons to loops that iterate over sets of items. Four phase are depicted: the choice policy (red), the relaxation of the contents of memory (green), the processing of explicit feedback (blue), and implicit inference (yellow).