Fisher D F, Monty R A
J Exp Psychol Hum Learn. 1978 Mar;4(2):158-64.
Recognition memory for matrices of 0s and 1s was examined as a function of the number of elements (complexity) and density of those elements within the matrix. It was found that with greater density and lesser complexity, recognition performance improved. This result contradicts an earlier finding of Green and Purohit, who concluded that the more complicated matrices led to better performance. The present study suggests that their conclusion was erroneous and stemmed from failure to control the physical parameters of density and number of elements in the matrix. Implications for the general problem of recognition memory and eye movements are discussed.
对由0和1组成的矩阵的识别记忆，作为矩阵内元素数量（复杂度）和这些元素密度的函数进行了研究。结果发现，密度越大且复杂度越小，识别性能越好。这一结果与格林和普罗希特早期的发现相矛盾，他们得出的结论是，矩阵越复杂，性能越好。本研究表明，他们的结论是错误的，并且源于未能控制矩阵中密度和元素数量的物理参数。文中还讨论了该研究结果对识别记忆和眼动这一普遍问题的启示。
