|visits||member for||11 months|
|seen||Jun 27 '12 at 16:32|
How to computationally model the Wisconsin Card Sorting task?
For this, I work in RL and interested how people learn the optimal strategy. That is, I havent worked with this task before, but interested in it as it would allow a number of experimental manipulations. I find it hard, and didnt like Dehaene & Changeux (1991), because it doesnt seem to capture the role of memory in the optimal strategy. People can keep track of some, but not very much, history of trials when doing the task. I.e the mathematically optimal strategy seems too computationally heavy, and I couldnt find anyone who developed a better model. Thank you so much for your response