The tractable cognition thesis

Cognitive Science

Volumn 32, Issue 6, 2008, Pages 939-984

  van Rooij, Iris ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Cognitive modeling; Complexity theory; Computational level theory; Constraint satisfaction; Intractability; NP hard; Philosophy of computation; Philosophy of mind

Indexed keywords

EID: 49949096946     PISSN: 03640213     EISSN: None     Source Type: Journal    
DOI: 10.1080/03640210801897856     Document Type: Article

References (129)

1. Anderson, J. R. (1978) Arguments concerning representations for mental imagery. Psychological Review, 85, pp. 249-277.
2. Anderson, J. R. (1987) Methodologies for studying human knowledge. Behavioral and Brain Sciences, 10, pp. 467-505.
3. Anderson, J. R. (1990) The adaptive character of thought, Lawrence Erlbaum Associates, Inc. Hillsdale, NJ
4. Arora, S. and Barak, B. Computational complexity: A modern approach, Cambridge University Press, Cambridge, MA
5. Barton, G. E., Berwick, R. C. and Ristad, E. S. (1987) Computational complexity and natural language, MIT Press, Cambridge, MA
6. Bylander, T. (1994) The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69, pp. 165-204.
7. Chalmers, D. J. (1994) A computational foundation for the study of cognition (Tech. Rep. in Philosophy-Neuroscience-Psychology.), Washington University
8. Chater, N. and Oaksford, M. (2000) The rational analysis of mind and behavior. Synthese, 122, pp. 93-131.
9. Chater, N., Tenebaum, J. B. and Yuille, A. (2006) Special issue: Probabilistic models in cognition. [Special issue]. Trends in Cognitive Sciences, 10:7
10. Chater, N. and Vitanyi, P. (2003) Generalized law of universal generalization. Journal of Mathematical Psychology, 47, pp. 346-369.
11. Chater, N. and Vitanyi, P. (2003) Simplicity: A unifying principle in cognitive science?. Trends in Cognitive Sciences, 7, pp. 19-22.
12. Cherniak, C. (1986) Minimal rationality, MIT Press, Cambridge, MA
13. Church, A. (1936) An unsolvable problem of elementary number theory. American Journal of Mathematics, 58, pp. 345-363.
14. Cleland, C. E. (1993) Is the Church-Turing thesis true?. Minds and Machines, 3, pp. 283-312.
15. Cleland, C. E. (1995) Effective procedures and computable functions. Minds and Machines, 5, pp. 9-23.
16. Cockshott, P. and Michaelson, G. (2005) Are there new models of computation? Reply to Wegner and Eberbach. Computer Journal, 50, pp. 232-247.
17. Cook, S. (1971) The complexity of theorem-proving procedures. Proceedings of the 3rd Annual ACM symposium on Theory of Computing ACM Press, pp. 151-158. New York
18. Cooper, G. F. (1990) The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence, 42, pp. 393-405.
19. Copeland, B. J. (2002) Accelerating Turing machines. Minds and Machines, 12, pp. 281-301.
20. Cummins, R. (2000) "How does it work?" vs. "What are the laws?" Two conceptions of psychological explanation. Explanation and cognition, pp. 117-145. MIT Press, Cambridge, MA
21. Deutsch, D. (1985) Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A, 400, pp. 97-117.
22. Downey, R. G. and Fellows, M. R. (1999) Parameterized complexity, Springer-Verlag, New York
23. Dry, M., Lee, M. D., Vickers, D. and Hughes, P. (2006) Human performance on visually presented traveling salesperson problems with varying numbers of nodes. Journal of Problem Solving, 1, pp. 20-32.
24. Dunne, P. E., Laurence, M. and Wooldridge, M. (2003) Complexity results for agent design problems. Annals of Mathematics, Computing & Teleinformatics, 1:1, pp. 19-36.
25. Eliasmith, C. (2000) Is the brain analog or digital? The solution and its consequences for cognitive science. Cognitive Science Quarterly, 1, pp. 147-170.
26. Eliasmith, C. (2001) Attractive and in-discrete: A critique of two putative virtues of the dynamicist theory of mind. Minds and Machines, 11, pp. 417-426.
27. Fellows, M. R. (2002) Parameterized complexity: The main ideas and connections to practical computing. Experimental algorithmics: From algorithm design to robust and efficient software, pp. 51-77. Springer-Verlag, Berlin
28. Fishburn, P. C. and LaValle, I. H. (1993) Subset preferences in linear and nonlinear utility theory. Journal of Mathematical Psychology, 37, pp. 611-623.
29. Fishburn, P. C. and LaValle, I. H. (1996) Binary interactions and subset choice. European Journal of Operational Research, 92, pp. 182-192.
30. Flum, J. and Grohe, M. (2006) Parameterized complexity theory, Springer-Verlag, New York
31. Fodor, J. A. (1987) Psychosemantics: The problem of meaning in the philosophy of mind, MIT Press, Cambridge, MA
32. Fortnow, L. (2003) One complexity theorist's view of quantum computing. Theoretical Computer Science, 292, pp. 597-610.
33. Frixione, M. (2001) Tractable competence. Minds and Machines, 11, pp. 379-397.
34. Gandy, R. (1988) The confluence of ideas in 1936. The universal Turing machine: A half-century survey, pp. 55-111. Oxford University Press, New York
35. Garey, M. R. and Johnson, D. S. (1979) Computers and intractability: A guide to the theory of NP-completeness, Freeman, New York
36. Gibbons, A. and Rytter, W. (1988) Efficient parallel algorithms, Cambridge University Press, Cambridge, England
37. Gigerenzer, G. and Goldstein, D. G. (1996) Reasoning the fast and frugal way: Models of bounded rationality. Psychological Review, 103, pp. 650-669.
38. Grush, R. and Churchland, P. S. (1995) Gaps in Penrose's toilings. Journal of Consciousness Studies, 2, pp. 10-29.
39. Hahn, U., Chater, N. and Richardson, L. B. (2003) Similarity as transformation. Cognition, 87, pp. 1-32.
40. Hamilton, M., Muller, M., van Rooij, I. and Wareham, T. (2007) Approximating solution structure. Proceedings of the Dagstuhl Seminar on Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs Internationales Begegnugs-und Forschungszentrum fur Informatik (IBFI), pp. 1-24. Schloss Dagstuhl, Germany
41. (1987) Categorical perception: The groundwork of cognition, Cambridge University Press, Cambridge, England
42. Haselager, W. F. G. (1997) Cognitive science and folk psychology: The right frame of mind, Sage, London
43. Horgan, T. and Tienson, J. (1996) Connectionism and the philosophy of psychology, MIT Press, Cambridge, MA
44. Horsten, L. and Roelants, H. (1995) The Church-Turing thesis and effective mundane procedures. Minds and Machines, 5, pp. 1-8.
45. Israel, D. (2002) Reflections on Godel's and Gandy's reflections on Turing's thesis. Minds and Machines, 12, pp. 181-201.
46. Jagota, A. (1997) Optimization by a Hopfield-style network. Optimality in biological and artificial networks?, pp. 203-226. Lawrence Erlbaum Associates, Inc, Hillsdale, NJ
47. Jaja, J. (1992) An introduction to parallel algorithms, Wesley, Reading, Addison, MA
48. Joseph, D. A. and Plantinga, W. H. (1985) On the complexity of reachability and motion planning problems. Proceedings of the 1st ACM symposium on Computational Geometry ACM Press, pp. 62-66. New York
49. Judd, J. S. (1990) Neural network design and the complexity of learning, MIT Press, Cambridge, MA
50. Kak, S. (2000) Active agents, intelligence, and quantum computing. Information Sciences, 128, pp. 1-17.
51. Karp, R. M. (1972) Reducibility among combinatorial problems. Complexity of computer computations, pp. 85-104. Plenum, New York
52. Kleene, S. C. (1936) General recursive functions of natural numbers. Mathematische Annelen, 112, pp. 727-742.
53. Kleene, S. C. (1988) Turing's analysis of computability, and major applications of it. The universal Turing machine: A half-century survey, pp. 17-54. Oxford University Press, New York
54. Krueger, L. E. and Tsav, C. -Y. (1990) Analyzing vision at the complexity level: Misplaced complexity?. Behavioral and Brain Sciences, 13, pp. 449-450.
55. Kube, P. R. (1991) Unbounded visual search is not both biologically plausible and NP-complete. Behavioral and Brain Sciences, 14, pp. 768-773.
56. Levesque, H. J. (1988) Logic and the complexity of reasoning. Journal of Philosophical Logic, 17, pp. 355-389.
57. Lewis, H. R. and Papadimitrou, C. H. (1998) Elements of the theory of computation, Prentice Hall, Upper Saddle River, NJ
58. Li, M. and Vitanyi, P. (1997) An introduction to Kolmogorov complexity and its applications, Springer-Verlag, New York
59. Litt, A., Eliasmith, C., Kroon, F. W., Weinstein, S. and Thagard, P. (2006) Is the brain a quantum computer?. Cognitive Science, 30, pp. 593-603.
60. Marr, D. (1982) Vision: A computational investigation into the human representation and processing visual information, Freeman, San Francisco
61. Martignon, L. and Hoffrage, U. (2002) Fast, frugal, and fit: Simple heuristics for paired comparison. Theory and Decision, 52, pp. 29-71.
62. Martignon, L. and Schmitt, M. (1999) Simplicity and robustness of fast and frugal heuristics. Minds and Machines, 9, pp. 565-593.
63. Massaro, D. W. and Cowan, N. (1993) Information processing models: Microscopes of the mind. Annual Review of Psychology, 44, pp. 383-425.
64. Millgram, E. (2000) Coherence: The price of the ticket. Journal of Philosophy, 97, pp. 82-93.
65. Narayanan, A. (1999) Quantum computing for beginners. Proceedings of the 1999 Congress on Evolutionary Computation IEEE Press, pp. 2231-2238. Piscataway, NJ
66. Nebel, B. (1996) Artificial intelligence: A computational perspective. Principles of knowledge representation, pp. 237-266. CSLI Publications, Stanford, CA
67. Newell, A. and Simon, H. A. (1988) GPS, a program that simulates human thought. Readings in cognitive science: A perspective from psychology and artificial intelligence, pp. 453-460. Kaufmann, San Mateo, CA
68. Newell, A. and Simon, H. A. (1988) The theory of human problem solving. Readings in cognitive science: A perspective from psychology and artificial intelligence, pp. 33-51. Kaufmann, San Mateo, CA
69. Niedermeier, R. (2006) Invitation to fixed-parameter algorithms, Oxford University Press, New York
70. Oaksford, M. and Chater, N. (1993) Reasoning theories and bounded rationality. Rationality: Psychological and philosophical perspectives, pp. 31-60. Routledge, London
71. Oaksford, M. and Chater, N. (1998) Rationality in an uncertain world: Essays on the cognitive science of human reasoning, Psychology Press, Hove, England
72. Papadimitriou, C. H. and Steiglitz, K. (1988) Combinatorial optimization: Algorithms and complexity, Dover, New York
73. Parberry, I. (1994) Circuit complexity and neural networks, MIT Press, Cambridge, MA
74. Parberry, I. (1997) Knowledge, understanding, and computational complexity. Optimality in biological and artificial networks?, pp. 125-144. Lawrence Erlbaum Associates, Inc, Mahwah, NJ
75. Penrose, R. (1989) The emperor's new mind: Concerning computers, minds, and the laws of physics, Oxford University Press, New York
76. Penrose, R. (1994) Shadows of the mind, Oxford University Press, Oxford
77. Penrose, R. (1997) Physics and the mind. The large, the small and the human mind, pp. 93-143. Cambridge University Press, Cambridge, England
78. Pizlo, Z., Stefanov, E., Saalweachter, J., Li, Z., Haxhimusa, Y. and Kropatsch, W. G. (2006) Traveling salesman problem: A foveating pyramid model. Journal of Problem Solving, 1, pp. 83-101.
79. (1995) Mind as motion: Explorations in the dynamics of cognition, MIT Press, Cambridge, MA
80. Post, E. L. (1936) Finite combinatory processes-formulation I. Journal Symbolic Logic, 1, pp. 103-105.
81. Pothos, E. M. and Chater, N. (2001) Basic categories by simplicity. Similarity and categorization, pp. 51-72. Oxford University Press, Oxford England
82. Pothos, E. M. and Chater, N. (2002) A simplicity principle in unsupervised human categorization. Cognitive Science, 26, pp. 303-343.
83. Prasse, M. and Rittgen, P. (1998) Why Church's thesis holds: Some notes on Peter Wegner's tracts on interaction and computability. Computer Journal, 41, pp. 357-362.
84. Pylyshyn, Z. (1984) Computation and cognition: Towards a foundation for cognitive science, MIT Press, Cambridge, MA
85. Pylyshyn, Z. (1991) The role of cognitive architectures in the theory of cognition. Architectures for intelligence, pp. 189-223. Lawrence Erlbaum Associates, Inc, Hillsdale, NJ
86. Reiter, R. (1980) A logic for default reasoning. Artificial Intelligence, 13, pp. 81-132.
87. Rensink, R. A. and Provan, G. (1991) The analysis of resource-limited vision systems. Proceedings of the 13th annual conference of the Cognitive Science Society Erlbaum, pp. 311-316. Hillsdale, NJ
88. Ristad, E. S. (1990) Computational structure of human language, Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA
89. Ristad, E. S. (1993) The language complexity game, MIT Press, Cambridge, MA
90. Rosch, E. (1973) On the internal structure of perceptual and semantic categories. Cognitive development and the acquisition of language, pp. 111-144. Academic, New York
91. Rosch, E. and Mervis, C. B. (1975) Family resemblances: Studies in the internal structure of categories. Cognitive Psychology, 7, pp. 573-605.
92. Roth, D. (1996) On the hardness of approximate reasoning. Artificial Intelligence, 82, pp. 273-302.
93. Rumelhart, D. E., McClelland, J. L. and the PDP Research Group (1986) Parallel distributed processing. Explorations in the microstructure of cognition. Volume 1: Foundations, MIT Press, Cambridge, MA
94. Shor, P. (1997) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26, pp. 1484-1509.
95. Siegel, R. M. (1990) Is it really that complex? After all, there are no green elephants. Behavioral and Brain Sciences, 13, p. 453.
96. Siegelmann, H. and Sontag, E. (1994) Analog computation via neural networks. Theoretical Computer Science, 131, pp. 331-360.
97. Simon, H. A. (1957) Models of man: Social and rational, Wiley, New York
98. Simon, H. A. (1988) Rationality as process and as product of thought. Decision making: Descriptive, normative, and prescriptive interactions, pp. 58-77. Cambridge University Press, Cambridge, England
99. Simon, H. A. (1990) Invariants of human behavior. Annual Review of Psychology, 41, pp. 1-19.
100. Smolensky, P. and Legendre, G. (2006) The harmonic mind: From neural computation to optimality-theoretic grammar, Bradford, Cambridge, MA
101. Stege, U. and van Rooij, I. (2006) Computing maximum coherence: A hard nut to crack?. Paper presented at the 39th annual meeting of the Society for Mathematical Psychology Vancouver, British Columbia
102. Steinhart, E. (2002) Logically possible machines. Minds and Machines, 12, pp. 259-280.
103. Thagard, P. (1993) Computational tractability and conceptual coherence: Why do computer scientists believe that P ≠NP?. Canadian Journal of Philosophy, 23, pp. 349-364.
104. Thagard, P. (2000) Coherence in thought and action, MIT Press, Cambridge, MA
105. Thagard, P. and Verbeurgt, K. (1998) Coherence as constraint satisfaction. Cognitive Science, 22, pp. 1-24.
106. Thelen, E. and Smith, L. B. (1994) A dynamic systems approach to the development of cognition and action, MIT Press, Cambridge, MA
107. Todd, P. M. and Gigerenzer, G. (2000) Precis of simple heuristics that make us smart. Behavioral and Brain Sciences, 23, pp. 727-780.
108. Tsotsos, J. K. (1990) Analyzing vision at the complexity level. Behavioral and Brain Sciences, 13, pp. 423-469.
109. Tsotsos, J. K. (2001) Complexity, vision and attention. Vision & attention, pp. 105-128. Springer-Verlag, New York
110. Turing, A. M. (1936) On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42, pp. 230-265.
111. Tversky, A. (1977) Features of similarity. Psychological Review, 84, pp. 327-352.
112. van der Helm, P. A. (2004) Transparallel processing by hyperstrings. Proceedings of the National Academy of Sciences, USA, 101:30, pp. 10862-10867.
113. van der Helm, P. A. and Leeuwenberg, E. L. J. (1986) Avoiding explosive search in automatic selection of simplest pattern codes. Pattern Recognition, 19, pp. 181-191.
114. van der Helm, P. A. and Leeuwenberg, E. L. J. (1996) Goodness of visual regularities: A nontransformational approach. Psychological Review, 103, pp. 429-456.
115. van Emde Boas, P. (1990) Machine models and simulations. Handbook of theoretical computer science, Volume A: Algorithms and complexity, pp. 1-66. MIT Press, Cambridge, MA
116. van Gelder, T. (1995) What might cognition be if not computation?. Journal of Philosophy, 7, pp. 345-381.
117. van Gelder, T. (1998) The dynamical hypothesis in cognitive science. Behavioral and Brain Sciences, 21, pp. 615-665.
118. van Gelder, T. (1999) Defending the dynamical hypothesis. Dynamics, synergetics, autonomous agents: Nonlinear systems approaches to cognitive psychology and cognitive science, pp. 13-28. World Scientific, Singapore
119. van Rooij, I. (2003) Tractable cognition: Complexity theory in cognitive psychology, Department of Psychology, University of Victoria, British Columbia, Canada
120. van Rooij, I., Stege, S. and Kadlec, H. (2005) Sources of complexity in subset choice. Journal of Mathematical Psychology, 49, pp. 160-187.
121. van Rooij, I. and Wareham, T. (2008) Parameterized complexity in cognitive modeling: Foundations, applications, and opportunities. Computer Journal, 51, pp. 385-404.
122. van Rooij, I. and Wright, C. (2006) The incoherence of heuristically explaining coherence. Proceedings of the 28th annual conference of the Cognitive Science Society Lawrence Erlbaum Associates, Inc, p. 2622. Mahwah, NJ
123. Wareham, T. (1996) The role of parameterized computational complexity theory in cognitive modeling. Working Notes of the AAAI-96 Workshop on Computational Cognitive Modeling: Source of the Power
124. Wareham, T. (1999) Systematic parameterized complexity analysis in computational phonology, Department of Computer Science, University of Victoria, British Columbia, Canada
125. Wareham, T. (2001) The parameterized complexity of intersection and composition operations on sets of finite-state automata. Proceedings of the 5th International Conference on Implementation and Application of Automata Springer-Verlag, pp. 302-310. Berlin
126. Wegner, P. (1997) Why interaction is more powerful than algorithms. Communications of the ACM, 40, pp. 80-91.
127. Wegner, P. and Eberbach, E. (2004) New models of computation. Computer Journal, 47, pp. 4-9.
128. Wells, A. J. (1998) Turing's analysis of computation and theories of cognitive architecture. Cognitive Science, 22, pp. 269-294.
129. Wooldridge, M. and Dunne, P. E. (2005) The complexity of agent design problems: Determinism and history dependence. Annals of Mathematics and Artificial Intelligence, 45, pp. 343-371.