Intractability and the use of heuristics in psychological explanations

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

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.

Analytics

Added to PP
2010-10-27

Downloads
494 (#20,126)

6 months
37 (#30,753)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Cory Wright
California State University, Long Beach
Iris van Rooij
Radboud University Nijmegen

References found in this work

Vision.David Marr - 1982 - W. H. Freeman.
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.

View all 32 references / Add more references