Tractability and the computational mind

Jakub Szymanik, Rineke Verbrugge

OnderzoeksoutputAcademicpeer review

8 Downloads (Pure)


We overview logical and computational explanations of the notion of tractability as applied in cognitive science. We start by introducing the basics of mathematical theories of complexity: computability theory, computational complexity theory, and descriptive complexity theory. Computational philosophy of mind often identifies mental algorithms with computable functions. However, with the development of programming practice it has become apparent that for some computable problems finding effective algorithms is hardly possible. Some problems need too much computational resource, e.g., time or memory, to be practically computable. Computational complexity theory is concerned with the amount of resources required for the execution of algorithms and, hence, the inherent difficulty of computational problems. An important goal of computational complexity theory is to categorize computational problems via complexity classes, and in particular, to identify efficiently solvable problems and draw a line between tractability and intractability. We survey how complexity can be used to study computational plausibility of cognitive theories. We especially emphasize methodological and mathematical assumptions behind applying complexity theory in cognitive science. We pay special attention to the examples of applying logical and computational complexity toolbox in different domains of cognitive science. We focus mostly on theoretical and experimental research in psycholinguistics and social cognition.
Originele taal-2English
TitelThe Routledge Handbook of the Computational Mind
RedacteurenMark Sprevak, Matteo Colombo
Plaats van productieOxford
Aantal pagina's16
Uitgave1st Editon
ISBN van elektronische versie9781315643670
ISBN van geprinte versie9781138186682
StatusPublished - 27-jan-2018

Citeer dit