NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 6 results Save | Export
Peer reviewed Peer reviewed
Direct linkDirect link
Carruthers, Sarah; Stege, Ulrike; Masson, Michael E. J. – Journal of Problem Solving, 2018
The role that the mental, or internal, representation plays when people are solving hard computational problems has largely been overlooked to date, despite the reality that this internal representation drives problem solving. In this work we investigate how performance on versions of two hard computational problems differs based on what internal…
Descriptors: Problem Solving, Goal Orientation, Computation, Difficulty Level
Peer reviewed Peer reviewed
Direct linkDirect link
Wareham, Todd – Journal of Problem Solving, 2017
In human problem solving, there is a wide variation between individuals in problem solution time and success rate, regardless of whether or not this problem solving involves insight. In this paper, we apply computational and parameterized analysis to a plausible formalization of extended representation change theory (eRCT), an integration of…
Descriptors: Problem Solving, Schemata (Cognition), Intuition, Computation
Peer reviewed Peer reviewed
Direct linkDirect link
Dry, Matthew J.; Fontaine, Elizabeth L. – Journal of Problem Solving, 2014
The Traveling Salesperson Problem (TSP) is a computationally difficult combinatorial optimization problem. In spite of its relative difficulty, human solvers are able to generate close-to-optimal solutions in a close-to-linear time frame, and it has been suggested that this is due to the visual system's inherent sensitivity to certain geometric…
Descriptors: Problem Solving, Geographic Location, Computation, Visual Stimuli
Peer reviewed Peer reviewed
Direct linkDirect link
Carruthers, Sarah; Stege, Ulrike – Journal of Problem Solving, 2013
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…
Descriptors: Problem Solving, Computation, Difficulty Level, Computer Science
Peer reviewed Peer reviewed
Direct linkDirect link
Kwisthout, Johan – Journal of Problem Solving, 2012
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…
Descriptors: Problem Solving, Computation, Abstract Reasoning, Difficulty Level
Peer reviewed Peer reviewed
Direct linkDirect link
Wareham, Todd; Evans, Patricia; van Rooij, Iris – Journal of Problem Solving, 2011
Solving new problems can be made easier if one can build on experiences with other problems one has already successfully solved. The ability to exploit earlier problem-solving experiences in solving new problems seems to require several cognitive sub-abilities. Minimally, one needs to be able to retrieve relevant knowledge of earlier solved…
Descriptors: Logical Thinking, Problem Solving, Difficulty Level, Computation