On Evaluating Human Problem Solving of Computationally Hard Problems

Sarah Carruthers, U. Stege
{"title":"On Evaluating Human Problem Solving of Computationally Hard Problems","authors":"Sarah Carruthers, U. Stege","doi":"10.7771/1932-6246.1152","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":90070,"journal":{"name":"The journal of problem solving","volume":"274 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2013-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The journal of problem solving","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7771/1932-6246.1152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

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.
评价人类解决计算难题的能力
本文关注的是计算机科学,更确切地说是计算复杂性理论,如何为认知科学提供信息。特别是,我们建议在调查人们如何处理计算硬度时要考虑的因素。本文将讨论Marr层次理论的两个较高层次:计算层次和算法层次。我们相信人类确实处理硬认知功能的原因有三个:(1)文献中提出了几个计算上的硬功能,例如在视觉搜索、视觉感知和类比推理、语言处理和决策领域。人们似乎被计算难度大的娱乐谜题和游戏所吸引。难度难题的例子包括数独、扫雷和15-Puzzle。(3)人类问题解决领域的许多研究文章表明,人类有能力快速且近乎最优地解决困难的计算问题,如欧几里得旅行推销员问题。本文简要介绍了复杂性理论的一些理论和基础,并通过对人类表现的已知结果的简短调查,回顾了一些计算困难的游戏和谜题,以及复杂性理论与认知功能模型之间的联系,激发了在人类问题解决中使用计算困难的问题。我们的目标是阐明计算机科学,特别是复杂性理论,在人类问题解决研究中可以发挥的作用。理论计算机科学可以为人类研究提供大量有趣的问题,但它也可以帮助我们深入了解这些问题。特别是,我们讨论了计算机科学在选择研究计算问题和设计实验以调查人类表现时所能发挥的作用。最后,我们列举了在选择计算困难的问题作为研究主题时可能出现的问题和陷阱,从而激发了一些有趣的潜在未来研究方向。讨论的陷阱包括:问题实例的呈现和表征的选择,问题理解的评价,以及认知支持在实验中的作用。我们的目标不是详尽地列出这些选择可能影响实验研究的所有方式,而是提供一些简单的例子,以突出可能存在的缺陷。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信