Intractability and the use of heuristics in psychological explanations

Synthese 187 (2):471-487 (2012)

Authors
Cory Wright
California State University, Long Beach
Iris van Rooij
Radboud University Nijmegen
Abstract
Many cognitive scientists, having discovered that some computational-level characterization f of a cognitive capacity φ is intractable, invoke heuristics as algorithmic-level explanations of how cognizers compute f. We argue that such explanations are actually dysfunctional, and rebut five possible objections. We then propose computational-level theory revision as a principled and workable alternative.
Keywords psychological explanation  computational-level theory  computational complexity  intractability  approximation  algorithm  NP-hard  heuristics  function  cognitive science
Categories (categorize this paper)
DOI 10.1007/s11229-010-9847-7
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive
Through your library

References found in this work BETA

Coherence in Thought and Action (M. Amini).P. Thagard - 2000 - Philosophical Books 43 (2):136-140.
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.

View all 30 references / Add more references

Citations of this work BETA

Axiomatic and Ecological Rationality: Choosing Costs and Benefits.Patricia Rich - 2016 - Erasmus Journal for Philosophy and Economics 9 (2):90.
Sculpting Computational‐Level Models.Mark Blokpoel - 2018 - Topics in Cognitive Science 10 (3):641-648.

View all 8 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2010-10-27

Total views
335 ( #19,602 of 2,309,316 )

Recent downloads (6 months)
33 ( #24,029 of 2,309,316 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature