Rational analysis, intractability, and the prospects of 'as if'-explanations.
The plausibility of so-called 'rational explanations' in cognitive science is often contested on the grounds of computational intractability. Some have argued that intractability is a pseudoproblem, however, because cognizers do not actually perform the rational calculations posited by rational mode...
| Publicado en: | Synthese Vol. 195; no. 2; pp. 491 - 511 |
|---|---|
| Autores principales: | , , , |
| Formato: | Artículo |
| Publicado: |
Springer Nature
Feb2018
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=127331452&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 127331452 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00397857 4LI jtl: Synthese issn: 00397857 maglogo: N pubinfo: dt: Feb2018 vid: 195 iid: 2 pid: 237 pub: Springer Nature artinfo: ui: 127331452 10.1007/s11229-014-0532-0 ppf: 491 ppct: 20 formats: fmt: – @attributes: type: T – @attributes: type: P size: 465KB tig: atl: Rational analysis, intractability, and the prospects of 'as if'-explanations. aug: au: van Rooij, Iris Wright, Cory D. Kwisthout, Johan Wareham, Todd affil: Donders Institute for Brain, Cognition, and Behaviour, Radboud Universiteit Nijmegen, Nijmegen, The Netherlands Department of Philosophy, California State University Long Beach, Long Beach, CA, USA Department of Computer Science, Memorial University of Newfoundland, St. John’s, NL, Canada su: Approximation theory Semantics Comparative linguistics Computational complexity Cognitive science sug: subj: Approximation theory Semantics Comparative linguistics Computational complexity Cognitive science keyword: Approximation Computational-level theory Intractability NP-hard Psychological explanation Rational analysis ab: The plausibility of so-called 'rational explanations' in cognitive science is often contested on the grounds of computational intractability. Some have argued that intractability is a pseudoproblem, however, because cognizers do not actually perform the rational calculations posited by rational models; rather, they only behave as if they do. Whether or not the problem of intractability is dissolved by this gambit critically depends, inter alia, on the semantics of the 'as if' connective. First, this paper examines the five most sensible explications in the literature, and concludes that none of them actually circumvents the problem. Hence, rational 'as if' explanations must obey the minimal computational constraint of tractability. Second, this paper describes how rational explanations could satisfy the tractability constraint. Our approach suggests a computationally unproblematic interpretation of 'as if' that is compatible with the original conception of rational analysis. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y custom: Synthese is a copyright of Springer, 2018. All Rights Reserved. item: Synthese holder: Springer Nature dt: @attributes: year: 2018 holdings: @attributes: islocal: N |
|---|