Intractability and the use of heuristics in psychological explanations

Synthese

Volumn 187, Issue 2, 2012, Pages 471-487

  van Rooij, Iris ^a   Wright, Cory D ^b   Wareham, Todd ^c  

^a RADBOUD UNIVERSITY   (Netherlands)

^b CALIFORNIA STATE UNIVERSITY   (United States)

^c MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

Algorithm; Approximation; Computational complexity; Computational level theory; Heuristics; Intractability; NP hard; Psychological explanation

Indexed keywords

EID: 84865574534     PISSN: 00397857     EISSN: 15730964     Source Type: Journal    
DOI: 10.1007/s11229-010-9847-7     Document Type: Article

References (41)

1. Anderson J. R. (1990) The adaptive character of thought. Lawrence Erlbaum Associates, Hillsdale, NJ.
2. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., Protasi M. (1999) Complexity and approximation: Combinatorial optimization problems and their approximability properties. Springer, Berlin.
3. Barton G., Berwick R., Ristad E. (1987) Computational complexity and natural language. The MIT Press, Cambridge, MA.
4. Bechtel W., Wright C. (2009) What is psychological explanation. In: Calvo P., Symons J. (eds) Routledge companion to the philosophy of psychology. Routledge, New York, pp 113-130.
5. Bylander T. (1994) The computational complexity of propositional STRIPS planning. Artificial Intelligence 89(1-2): 165-204.
6. Carruthers P. (2005) Simple heuristics meet massive modularity. In: Carruthers P., Laurence S., Stich S. (eds) The innate mind. Vol. 2: Culture and cognition. Oxford University Press, Oxford, pp 181-198.
7. Chater N., Tenenbaum J. B., Yuille A. (2006) Probabilistic models of cognition. Trends in Cognitive Science 10(7): 287-293.
8. Cherniak C. (1986) Minimum rationality. The MIT Press, Cambridge, MA.
9. Cook, S. (1971). The complexity of theorem-proving procedures. In Proceedings of the 3rd annual ACM symposium on the theory of computing. New York, pp. 151-158.
10. Downey R., Fellows M. (1999) Parameterized complexity. Springer, Berlin.
11. Forbus, K., & Oblinger, D. (1990). Making SME Greedy and Pragmatic. In Proceedings of the twelfth annual conference of the cognitive science society. Hillsdale, NJ, pp. 61-68.
12. Fortnow L. (2009) The status of the P versus NP problem. Communications of the ACM 52(9): 78-86.
13. Franks B. (1995) On explanation in the cognitive sciences: Competence, idealization, and the failure of the classical cascade. British Journal of Philosophy of Science 46(4): 475-502.
14. Frixione M. (2001) Tractable competence. Minds and Machines 11: 379-397.
15. Garey M. R., Johnson D. S. (1979) Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman, San Francisco, CA.
16. Gentner D. (1983) Structure-mapping: A theoretical framework for analogy. Cognitive Science 7: 155-170.
17. Gentner D., Markman A. (1995) Similarity is like analogy. In: Cacciari C. (ed.) Similarity in language, thought, and perception. BREPOLS, Brussels, pp 111-147.
18. Gigerenzer G. (2008) Why heuristics work. Perspectives on Psychological Science 3: 20-29.
19. Gigerenzer G., Goldstein D. G. (1996) Reasoning the fast and frugal way: Models of bounded rationality. Psychological Review 103: 650-669.
20. Kieseppä I. (1996) Truthlikeness for multidimensional, quantitative cognitive problems. Kluwer, Dordrecht.
21. Levesque H. J. (1988) Logic and the complexity of reasoning. Journal of Philosophical Logic 17: 355-389.
22. Mahajan M., Raman V. (1999) Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms 31: 335-354.
23. Markman A., Gentner D. (2000) Structure mapping in the comparison process. The American Journal of Psychology 113: 501-538.
24. Marr D. (1982) Vision: A computational investigation into the human representation and processing visual information. W. H. Freeman, San Francisco, CA.
25. Marr D., Poggio T. (1977) From understanding computation to understanding neural circuitry. Neuroscience Research Progress Bulletin 15: 470-488.
26. Millgram E. (2000) Coherence: The price of the ticket. Journal of Philosophy 97: 82-93.
27. Piccinini G. (2004) Functionalism, computationalism, and mental states. Studies in the History of Philosophy of Science 35: 811-833.
28. Piccinini G. (2010) The mind as neural software? Understanding functionalism, computationalism, and computational functionalism. Philosophy and Phenomenological Research 81: 269-311.
29. Samuels R. (2005) The complexity of cognition: Tractability arguments for massive modularity. In: Carruthers P., Laurence S., Stich S. (eds) The innate mind, Vol. 1: Structure and contents. Oxford University Press, Oxford, pp 107-121.
30. Schöning, U. (1990). Complexity cores and hard problem instances. In T. Asano, T. Ibaraki, H. Imai, & T. Nishizeki (Eds.), Proceedings of the international symposium on algorithms (SIGAL'90). Berlin, pp. 232-240.
31. Thagard P. (1998) Computation and the philosophy of science. In: Bynum T., Moor J. (eds) The digital phoenix: How computers are changing philosophy. Blackwell, Oxford, pp 48-61.
32. Thagard P. (2000) Coherence in thought and action. The MIT Press, Cambridge, MA.
33. Thagard P., Shelley C. (1997) Abductive reasoning: Logic, visual thinking, and coherence. In: Chiara M.-L. D., Doets K., Mundici D., van Bentham J. (eds) Logic and scientific methods. Kluwer, Dordrecht, pp 412-427.
34. Thagard P., Verbeurgt K. (1998) Coherence as constraint satisfaction. Cognitive Science 22(1): 1-24.
35. Todd P., Gigerenzer G. (2000) Précis of simple heuristics that make us smart. Behavioral and Brain Sciences 23: 727-780.
36. Tsotsos J. K. (1990) Analyzing vision at the complexity level. Behavioral and Brain Sciences 13: 423-469.
37. Turing A. (1936) On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42: 230-265.
38. van Rooij I. (2008) The tractable cognition thesis. Cognitive Science 32: 939-984.
39. Veale, T., & Keane M. T. (1997). The competence of sub-optimal theories of structure mapping on hard analogies. In Proceedings of the 15th international joint conference on artificial intelligence (IJCAI'97), Vol. 1. pp. 232-237.
40. Wigderson, A. (2007). P, NP and mathematics-a computational complexity perspective. In: Proceedings of ICM 2006, Vol. I. Zurich, pp. 665-712.
41. Wright C., Bechtel W. (2007) Mechanisms and psychological explanation. In: Thagard P. (ed.) Handbook of philosophy of psychology and cognitive science. Elsevier, New York, pp 31-79.