All-or-none subprocesses in the learning of complex sequences☆
暂无分享,去创建一个
Abstract This paper reports a study designed to investigate whether the all-or-none conception of the learning process can be extended to a learning task more complex than conditioning or simple verbal association. The experimental task is to learn numerical sequences by anticipating each new member of the sequences. Although the obtained sequence learning appears very complex, it proves to be analyzable into constituent all-or-none subprocesses.
[1] Patrick Suppes,et al. Institute for Mathematical Studies in the Social Sciences , 1969 .
[2] Gordon H. Bower,et al. Application of a model to paired-associate learning , 1961 .
[3] Paul W. Holland. A variation on the minimum chi-square test , 1967 .
[4] R. Atkinson,et al. A comparison of paired-associate learning models having different acquisition and retention axioms , 1964 .
[5] W. K. Estes,et al. All-or-none processes in learning and retention. , 1964 .