When computer scientists discuss the computational complexity of, for example, finding the shortest path from building A to building B in some town or city, their starting point typically is a formal description of the problem at hand, e.g., a graph with weights on every edge where buildings correspond to vertices, routes between buildings to…

This article is concerned with how computer science, and more exactly computational complexity theory, can inform cognitive science. In particular, we suggest factors to be taken into account when investigating how people deal with computational hardness. This discussion will address the two upper levels of Marr's Level Theory: the computational…

The minimal control principle (Taatgen, 2007) predicts that people strive for problem-solving strategies that require as few internal control states as possible. In an experiment with the Abstract Decision Making task (ADM task; Joslyn & Hunt, 1998) the reward structure was manipulated to make either a low-control strategy or a high-strategy…

Gestalt psychologists proposed two distinct learning mechanisms. Associative learning occurs gradually through the repeated co-occurrence of external stimuli or memories. Insight learning occurs suddenly when people discover new relationships within their prior knowledge as a result of reasoning or problem solving processes that re-organize or…

In November 2008 at Purdue University, the 2nd Workshop on Human Problem Solving was held. This workshop, which was a natural continuation of the first workshop devoted almost exclusively to optimization problems, addressed a wider range of topics that reflect the scope of the "Journal of Problem Solving." The workshop was attended by 35…