计算复杂性可以提高对奖励相关属性的记忆识别能力。

Computational complexity in optimisation tasks is often seen as impairing optimal choice. We test whether it could have beneficial effects on memory. In a preregistered lab experiment (N = 131) using the NP-hard 0-1 knapsack problem, we manipulated knapsack capacity to create instances differing in two objective complexity metrics: phase transition proximity and Sahni-k. As predicted, solving a more complex instance resulted in a 44% (d = 0.45) increase in above-chance recognition memory relative to a lower-complexity instance. Participants spent longer on the compl