On Evaluating Human Problem Solving of Computationally Hard Problems

被引:4
|
作者
Carruthers, Sarah [1 ]
Stege, Ulrike [1 ]
机构
[1] Univ Victoria, Victoria, BC, Canada
来源
JOURNAL OF PROBLEM SOLVING | 2013年 / 5卷 / 02期
基金
加拿大自然科学与工程研究理事会;
关键词
problem solving; computational complexity; intractability; algorithmic level theories; cognitive functions;
D O I
10.7771/1932-6246.1152
中图分类号
G40 [教育学];
学科分类号
040101 ; 120403 ;
摘要
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 level and the algorithmic level. Our reasons for believing that humans indeed deal with hard cognitive functions are threefold: (1) Several computationally hard functions are suggested in the literature, e.g., in the areas of visual search, visual perception and analogical reasoning, linguistic processing, and decision making. (2) People appear to be attracted to computationally hard recreational puzzles and games. Examples of hard puzzles include Sudoku, Minesweeper, and the 15-Puzzle. (3) A number of research articles in the area of human problem solving suggest that humans are capable of solving hard computational problems, like the Euclidean Traveling Salesperson Problem, quickly and near-optimally. This article gives a brief introduction to some theories and foundations of complexity theory and motivates the use of computationally hard problems in human problem solving with a short survey of known results of human performance, a review of some computationally hard games and puzzles, and the connection between complexity theory and models of cognitive functions. We aim to illuminate the role that computer science, in particular complexity theory, can play in the study of human problem solving. Theoretical computer science can provide a wealth of interesting problems for human study, but it can also help to provide deep insight into these problems. In particular, we discuss the role that computer science can play when choosing computational problems for study and designing experiments to investigate human performance. Finally, we enumerate issues and pitfalls that can arise when choosing computationally hard problems as the subject of study, in turn motivating some interesting potential future lines of study. The pitfalls addressed include: choice of presentation and representation of problem instances, evaluation of problem comprehension, and the role of cognitive support in experiments. Our goal is not to exhaustively list all the ways in which these choices may impact experimental studies, but rather to provide a few simple examples in order to highlight possible pitfalls.
引用
收藏
页码:42 / 70
页数:29
相关论文
共 50 条
  • [1] Distributed problem solving without communication - An examination of computationally hard satisfiability problems
    Liu, JM
    Jin, XL
    Han, J
    [J]. INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2002, 16 (08) : 1041 - 1064
  • [2] Using three-dimensional microfluidic networks for solving computationally hard problems
    Chiu, DT
    Pezzoli, E
    Wu, HK
    Stroock, AD
    Whitesides, GM
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2001, 98 (06) : 2961 - 2966
  • [3] Computationally hard algebraic problems
    Rabin, MO
    [J]. 37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, : 284 - 289
  • [4] Real-time solving of computationally hard problems using optimal algorithm portfolios
    Nof, Yair
    Strichman, Ofer
    [J]. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2021, 89 (07) : 693 - 710
  • [5] Real-time solving of computationally hard problems using optimal algorithm portfolios
    Yair Nof
    Ofer Strichman
    [J]. Annals of Mathematics and Artificial Intelligence, 2021, 89 : 693 - 710
  • [6] SOLVING HARD PROBLEMS
    Murdoch, Joseph R.
    [J]. CHEMICAL & ENGINEERING NEWS, 2010, 88 (50) : 4 - 5
  • [7] Comparing Problem Solving Strategies for NP-hard Optimization Problems
    Hidalgo-Herrero, Mercedes
    Rabanal, Pablo
    Rodriguez, Ismael
    Rubio, Fernando
    [J]. FUNDAMENTA INFORMATICAE, 2013, 124 (1-2) : 1 - 25
  • [8] Locating phase transitions in computationally hard problems
    B. Ashok
    T. K. Patra
    [J]. Pramana, 2010, 75 : 549 - 563
  • [9] Locating phase transitions in computationally hard problems
    Ashok, B.
    Patra, T. K.
    [J]. PRAMANA-JOURNAL OF PHYSICS, 2010, 75 (03): : 549 - 563
  • [10] A COMPUTATIONALLY EFFICIENT METHOD FOR SOLVING THE REDUNDANT PROBLEM IN BIOMECHANICS
    YAMAGUCHI, GT
    MORAN, DW
    SI, J
    [J]. JOURNAL OF BIOMECHANICS, 1995, 28 (08) : 999 - +