A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Intractability and approximation of optimization theories of cognition
2012
Journal of Mathematical Psychology
Many computational-or rational-level theories of human cognition suffer from computational intractability: the postulated optimization functions are impossible to compute in a reasonable time by a finite mind/brain, or any other computational mechanism. It has been proposed that such intractable theories can nevertheless have explanatory force if we assume that human cognitive processes somehow approximate the optimal function. This raises the question of when a cognitive process can be said to
doi:10.1016/j.jmp.2012.05.002
fatcat:j24n5mmz2nc4xcp66iuo4vvo44