{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T00:55:34Z","timestamp":1789952134038,"version":"4.0.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,10,10]],"date-time":"2014-10-10T00:00:00Z","timestamp":1412899200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Synthese"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s11229-014-0532-0","type":"journal-article","created":{"date-parts":[[2014,10,9]],"date-time":"2014-10-09T16:53:12Z","timestamp":1412873592000},"page":"491-510","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Rational analysis, intractability, and the prospects of \u2018as if\u2019-explanations"],"prefix":"10.1007","volume":"195","author":[{"given":"Iris","family":"van Rooij","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cory D.","family":"Wright","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johan","family":"Kwisthout","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Todd","family":"Wareham","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,10,10]]},"reference":[{"key":"532_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S. (2005). NP-complete problems and physical reality. SIGACT News, 36, 30\u201352.","DOI":"10.1145\/1052796.1052804"},{"key":"532_CR2","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1038\/scientificamerican0308-62","volume":"298","author":"S Aaronson","year":"2008","unstructured":"Aaronson, S. (2008). The limits of quantum computers. Scientific American, 298, 62\u201369.","journal-title":"Scientific American"},{"key":"532_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0004-3702(98)00043-5","volume":"102","author":"AM Abdelbar","year":"1998","unstructured":"Abdelbar, A. M., & Hedetniemi, S. M. (1998). Approximating MAPs for belief networks is NP-hard and other theorems. Artificial Intelligence, 102, 21\u201338.","journal-title":"Artificial Intelligence"},{"key":"532_CR4","first-page":"76","volume-title":"Proceedings of the 7th international workshop on machine learning","author":"JR Anderson","year":"1990","unstructured":"Anderson, J. R., & Matessa, M. (1990). A rational analysis of categorization. In B. Porter & R. Mooney (Eds.), Proceedings of the 7th international workshop on machine learning (pp. 76\u201384). San Francisco: Morgan Kaufmann."},{"key":"532_CR5","volume-title":"The adaptive character of thought","author":"JR Anderson","year":"1990","unstructured":"Anderson, J. R. (1990). The adaptive character of thought. Hillsdale: Lawrence Erlbaum Associates Inc."},{"key":"532_CR6","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1037\/0033-295X.98.3.409","volume":"98","author":"JR Anderson","year":"1991","unstructured":"Anderson, J. R. (1991a). The adaptive nature of human categorization. Psychological Review, 98, 409\u2013429.","journal-title":"Psychological Review"},{"key":"532_CR7","doi-asserted-by":"crossref","unstructured":"Anderson, J. R. (1991b). Is human cognition adaptive? Behavioral and Brain Sciences, 14, 471\u2013517.","DOI":"10.1017\/S0140525X00070801"},{"key":"532_CR8","first-page":"1","volume-title":"Architectures for intelligence","author":"JR Anderson","year":"1991","unstructured":"Anderson, J. R. (1991c). The place of cognitive architectures in a rational analysis. In K. Van Lehn (Ed.), Architectures for intelligence (pp. 1\u201324). Hillsdale: Erlbaum."},{"key":"532_CR9","first-page":"337","volume-title":"Proceedings of the 30th annual symposium on the theory of computing","author":"S Arora","year":"1998","unstructured":"Arora, S. (1998). The approximability of NP-hard problems. Proceedings of the 30th annual symposium on the theory of computing (pp. 337\u2013348). New York: ACM Press."},{"key":"532_CR10","doi-asserted-by":"crossref","unstructured":"Blokpoel, M., Kwisthout, J., van der Weide, T. P., Wareham, T., & van Rooij, I. (2013). A computational-level explanation of the speed of goal inference. Journal of Mathematical Psychology, 57, 117\u2013133.","DOI":"10.1016\/j.jmp.2013.05.006"},{"key":"532_CR11","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/978-0-387-68546-5_17","volume-title":"New computational paradigms: Changing conceptions of what is computable","author":"O Bournez","year":"2008","unstructured":"Bournez, O., & Campagnolo, M. L. (2008). A survey of continuous-time computation. In S. B. Cooper, B. L\u00f6we, & A. Sorbi (Eds.), New computational paradigms: Changing conceptions of what is computable (pp. 383\u2013423). Berlin: Springer."},{"key":"532_CR12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0010-0277(90)90033-G","volume":"34","author":"N Chater","year":"1990","unstructured":"Chater, N., & Oaksford, M. (1990). Autonomy, implementation, and cognitive architecture: A reply to Fodor and Pylyshyn. Cognition, 34, 93\u2013107.","journal-title":"Cognition"},{"key":"532_CR13","doi-asserted-by":"crossref","unstructured":"Chater, N., & Oaksford, M. (1999). Ten years of the rational analysis of cognition. Trends in Cognitive Sciences, 3, 57\u201365.","DOI":"10.1016\/S1364-6613(98)01273-X"},{"key":"532_CR14","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1023\/A:1005272027245","volume":"122","author":"N Chater","year":"2000","unstructured":"Chater, N., & Oaksford, M. (2000). The rational analysis of mind and behavior. Synthese, 122, 93\u2013131.","journal-title":"Synthese"},{"key":"532_CR15","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1348\/000712601162031","volume":"92","author":"N Chater","year":"2001","unstructured":"Chater, N., & Oaksford, M. (2001). Human rationality and the psychology of reasoning: Where do we go from here? British Journal of Psychology, 92, 193\u2013216.","journal-title":"British Journal of Psychology"},{"key":"532_CR16","doi-asserted-by":"crossref","unstructured":"Chater, N., & Oaksford, M. (2008). The probabilistic mind: Prospects for Bayesian cognitive science. Oxford: Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780199216093.001.0001"},{"key":"532_CR17","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0749-5978(02)00508-3","volume":"90","author":"N Chater","year":"2003","unstructured":"Chater, N., Oaksford, M., Nakisa, R., & Redington, M. (2003). Fast, frugal, and rational: How rational norms explain behavior. Organizational Behavior and Human Decision Processes, 90, 63\u201386.","journal-title":"Organizational Behavior and Human Decision Processes"},{"key":"532_CR18","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.tics.2006.05.007","volume":"10","author":"N Chater","year":"2006","unstructured":"Chater, N., Tenenbaum, J. B., & Yuille, A. (2006). Probabilistic models of cognition. Trends in Cognitive Science, 10, 287\u2013293.","journal-title":"Trends in Cognitive Science"},{"key":"532_CR19","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0004-3702(90)90060-D","volume":"42","author":"GF Cooper","year":"1990","unstructured":"Cooper, G. F. (1990). The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence, 42, 393\u2013405.","journal-title":"Artificial Intelligence"},{"key":"532_CR20","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1093\/bjps\/54.2.181","volume":"54","author":"P Cotogno","year":"2003","unstructured":"Cotogno, P. (2003). Hypercomputation and the physical Church-Turing Thesis. British Journal of Philosophy of Science, 54, 181\u2013223.","journal-title":"British Journal of Philosophy of Science"},{"key":"532_CR21","doi-asserted-by":"crossref","unstructured":"Dagum, P., & Luby, M. (1993). Approximating probabilistic inference in Bayesian belief networks is NP-hard. Artificial Intelligence, 60, 141\u2013153.","DOI":"10.1016\/0004-3702(93)90036-B"},{"key":"532_CR22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1093\/acprof:oso\/9780199216093.003.0003","volume-title":"The probabilistic mind: Prospects for rational models of cognition","author":"D Danks","year":"2008","unstructured":"Danks, D. (2008). Rational analyses, instrumentalism, and implementations. In N. Chater & M. Oaksford (Eds.), The probabilistic mind: Prospects for rational models of cognition (pp. 59\u201375). Oxford: Oxford University Press."},{"key":"532_CR23","first-page":"2124","volume-title":"Proceedings of the 35th annual conference of the cognitive science society","author":"D Danks","year":"2013","unstructured":"Danks, D. (2013). Moving from levels and reduction to dimensions anand constraints. In M. Knauff, M. Pauen, N. Sebanz, & I. Wachsmuth (Eds.), Proceedings of the 35th annual conference of the cognitive science society (pp. 2124\u20132129). Oxford: Oxford University Press."},{"key":"532_CR24","doi-asserted-by":"crossref","unstructured":"Davis, M. (2004). The myth of hypercomputation. In C. Tuescher (Ed.), Alan Turing: Life and legacy of a great thinker (pp. 195\u2013211). Berlin: Springer.","DOI":"10.1007\/978-3-662-05642-4_8"},{"key":"532_CR25","first-page":"679","volume-title":"Logic, methodology, and philosophy of science IX","author":"DC Dennett","year":"1994","unstructured":"Dennett, D. C. (1994). Cognitive science as reverse engineering: several meanings of \u2018top down\u2019 and \u2018bottom up\u2019. In D. Prawitz, B. Skyrms, & D. Westerstahl (Eds.), Logic, methodology, and philosophy of science IX (pp. 679\u2013689). Amsterdam: Elsevier Science."},{"key":"532_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R. G., & Fellows, M. R. (1999). Parameterized complexity. New York: Springer."},{"key":"532_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/applin\/ami038","volume":"27","author":"NC Ellis","year":"2006","unstructured":"Ellis, N. C. (2006). Language acquisition as rational contingency learning. Applied Linguistics, 27, 1\u201324.","journal-title":"Applied Linguistics"},{"key":"532_CR28","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0010-0277(88)90031-5","volume":"28","author":"JA Fodor","year":"1988","unstructured":"Fodor, J. A., & Pylyshyn, Z. W. (1988). Connectionism and cognitive architecture: A critical analysis. Cognition, 28, 3\u201371.","journal-title":"Cognition"},{"key":"532_CR29","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/1562164.1562186","volume":"52","author":"L Fortnow","year":"2009","unstructured":"Fortnow, L. (2009). The status of the P versus NP problem. Communications of the ACM, 52, 78\u201386.","journal-title":"Communications of the ACM"},{"key":"532_CR30","unstructured":"Garey, M., & Johnson, D. (1979). Computers and intractability. A guide to the theory of NP-completeness. San Francisco: W. H. Freeman & Co."},{"key":"532_CR31","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1002\/9780470752937.ch4","volume-title":"Blackwell handbook of judgment and decision making","author":"G Gigerenzer","year":"2004","unstructured":"Gigerenzer, G. (2004). Fast and frugal heuristics: The tools of bounded rationality. In D. Koehler & N. Harvey (Eds.), Blackwell handbook of judgment and decision making (pp. 62\u201388). Malden: Blackwell."},{"key":"532_CR32","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1080\/03640210701802071","volume":"32","author":"ND Goodman","year":"2008","unstructured":"Goodman, N. D., Tenenbaum, J. B., Feldman, J., & Griffiths, T. L. (2008). A rational analysis of rule-based concept learning. Cognitive Science, 32, 108\u2013154.","journal-title":"Cognitive Science"},{"key":"532_CR33","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1037\/0033-295X.113.3.461","volume":"113","author":"WD Gray","year":"2006","unstructured":"Gray, W. D., Sims, C. R., Fu, W., & Schoelles, M. J. (2006). The soft constraints hypothesis: A rational analysis approach to resource allocation for interactive behavior. Psychological Review, 113, 461\u2013482.","journal-title":"Psychological Review"},{"key":"532_CR34","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1177\/0963721412447619","volume":"21","author":"TL Griffiths","year":"2012","unstructured":"Griffiths, T. L., Vul, E., & Sanborn, A. N. (2012). Bridging levels of analysis for probabilistic models of cognition. Current Directions in Psychological Science, 21, 263\u2013268.","journal-title":"Current Directions in Psychological Science"},{"key":"532_CR35","first-page":"67","volume-title":"Handbook of theoretical computer science; volume A: Algorithms and complexity","author":"D Johnson","year":"1990","unstructured":"Johnson, D. (1990). A catalog of complexity classes. In J. van Leeuwen (Ed.), Handbook of theoretical computer science; volume A: Algorithms and complexity (pp. 67\u2013161). Cambridge: MIT Press."},{"key":"532_CR36","doi-asserted-by":"crossref","first-page":"1452","DOI":"10.1016\/j.ijar.2011.08.003","volume":"52","author":"J Kwisthout","year":"2011","unstructured":"Kwisthout, J. (2011). Most probable explanations in Bayesian networks: Complexity and tractability. International Journal of Approximate Reasoning, 52, 1452\u20131469.","journal-title":"International Journal of Approximate Reasoning"},{"key":"532_CR37","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.cogsys.2012.12.008","volume":"24","author":"J Kwisthout","year":"2013","unstructured":"Kwisthout, J., & van Rooij, I. (2013). Bridging the gap between theory and practice of approximate Bayesian inference. Cognitive Systems Research, 24, 2\u20138.","journal-title":"Cognitive Systems Research"},{"key":"532_CR38","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1111\/j.1551-6709.2011.01182.x","volume":"35","author":"J Kwisthout","year":"2011","unstructured":"Kwisthout, J., Wareham, T., & van Rooij, I. (2011). Bayesian intractability is not an ailment that approximation can cure. Cognitive Science, 35, 779\u2013784.","journal-title":"Cognitive Science"},{"key":"532_CR39","volume-title":"Vision: A computational investigation into the human representation and processing visual information","author":"D Marr","year":"1982","unstructured":"Marr, D. (1982). Vision: A computational investigation into the human representation and processing visual information. San Francisco: W. H. Freeman & Co."},{"key":"532_CR40","doi-asserted-by":"crossref","unstructured":"Nayebi, A. (2014). Practical intractability: A critique of the hypercomputation movement. Minds and Machines, 24, 275\u2013305.","DOI":"10.1007\/s11023-013-9317-3"},{"key":"532_CR41","first-page":"433","volume-title":"The protein folding problem and tertiary structure prediction","author":"JT Ngo","year":"1994","unstructured":"Ngo, J. T., Marks, J., & Karplus, M. (1994). Computational complexity, protein structure prediction, and the Levinthal paradox. In K. Merz Jr & S. Le Grand (Eds.), The protein folding problem and tertiary structure prediction (pp. 433\u2013506). Boston: Birkhauser."},{"key":"532_CR42","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1037\/0033-295X.113.2.327","volume":"113","author":"D Norris","year":"2006","unstructured":"Norris, D. (2006). The Bayesian reader: Explaining word recognition as an optimal Bayesian decision process. Psychological Review, 113, 327\u2013357.","journal-title":"Psychological Review"},{"key":"532_CR43","doi-asserted-by":"crossref","DOI":"10.4324\/9780203345955","volume-title":"Rationality in an uncertain world: Essays on the cognitive science of human reasoning","author":"M Oaksford","year":"1998","unstructured":"Oaksford, M., & Chater, N. (1998). Rationality in an uncertain world: Essays on the cognitive science of human reasoning. Sussex: Psychology Press."},{"key":"532_CR44","doi-asserted-by":"crossref","unstructured":"Oaksford, M., & Chater, N. (2009). Pr\u00e9cis of Bayesian rationality: The probabilistic approach to human reasoning. Behavioral and Brain Sciences, 32, 69\u2013120.","DOI":"10.1017\/S0140525X09000284"},{"key":"532_CR45","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1093\/bjps\/axr016","volume":"62","author":"G Piccinini","year":"2011","unstructured":"Piccinini, G. (2011). The physical Church-Turing thesis: Modest or bold? British Journal of Philosophy of Science, 62, 733\u2013769.","journal-title":"British Journal of Philosophy of Science"},{"key":"532_CR46","doi-asserted-by":"crossref","unstructured":"Sanborn, A. N., Griffiths, T. L., & Navarro, D. J. (2010). Rational approximations to rational models: Alternative algorithms for category learning. Psychological Review, 117, 1144\u20131167.","DOI":"10.1037\/a0020511"},{"key":"532_CR47","unstructured":"Sch\u00f6ning, U. (1990). Complexity cores and hard problem instances\u2019. In T. Asano, T. Ibaraki, H. Imai, & T. Nishizeki (Eds.), Proceedings of the international symposium on algorithms (SIGAL\u201990) (pp. 232\u2013240). Berlin: Springer."},{"key":"532_CR48","doi-asserted-by":"crossref","first-page":"443","DOI":"10.3758\/PBR.17.4.443","volume":"17","author":"L Shi","year":"2010","unstructured":"Shi, L., Griffiths, T. L., Feldman, N. H., & Sanborn, A. N. (2010). Exemplar models as a mechanism for performing Bayesian inference. Psychonomic Bulletin & Review, 17, 443\u2013464.","journal-title":"Psychonomic Bulletin & Review"},{"key":"532_CR49","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/0004-3702(94)90072-8","volume":"68","author":"SE Shimony","year":"1994","unstructured":"Shimony, S. E. (1994). Finding MAPs for belief networks is NP-hard. Artificial Intelligence, 68, 399\u2013410.","journal-title":"Artificial Intelligence"},{"key":"532_CR50","doi-asserted-by":"crossref","first-page":"2727","DOI":"10.1162\/089976603322518731","volume":"15","author":"J S\u0306\u00edma","year":"2003","unstructured":"S\u0306\u00edma, J., & Orponen, P. (2003). General-purpose computation with neural networks: A survey of complexity-theoretic results. Neural Computation, 15, 2727\u20132778.","journal-title":"Neural Computation"},{"key":"532_CR51","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1017\/S0140525X00079577","volume":"13","author":"JK Tsotsos","year":"1990","unstructured":"Tsotsos, J. K. (1990). Analyzing vision at the complexity level. Behavioral and Brain Sciences, 13, 423\u2013469.","journal-title":"Behavioral and Brain Sciences"},{"key":"532_CR52","doi-asserted-by":"crossref","unstructured":"van Rooij, I. (2008). The tractable cognition thesis. Cognitive Science, 32, 939\u2013984.","DOI":"10.1080\/03640210801897856"},{"key":"532_CR53","doi-asserted-by":"crossref","unstructured":"van Rooij, I., & Wareham, T. (2008). Parameterized complexity in cognitive modeling: Foundations, applications and opportunities. Computer Journal, 51, 385\u2013404.","DOI":"10.1093\/comjnl\/bxm034"},{"key":"532_CR54","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.jmp.2012.05.002","volume":"56","author":"I Rooij van","year":"2012","unstructured":"van Rooij, I., & Wareham, T. (2012). Intractability and approximation of optimization theories of cognition. Journal of Mathematical Psychology, 56, 232\u2013247.","journal-title":"Journal of Mathematical Psychology"},{"key":"532_CR55","unstructured":"van Rooij, I., & Wright, C. D. (2006). The incoherence of heuristically explaining coherence. In R. Sun & N. Miyake (Eds.), Proceedings of 28th annual conference of the cognitive science society (p. 2622). Mahwah: Lawrence Erlbaum Associates."},{"key":"532_CR56","doi-asserted-by":"crossref","unstructured":"van Rooij, I., Wright, C. D., & Wareham, T. (2012). Intractability and the use of heuristics in psychological explanations. Synthese, 187, 471\u2013487.","DOI":"10.1007\/s11229-010-9847-7"},{"key":"532_CR57","doi-asserted-by":"crossref","DOI":"10.2307\/j.ctv1pncnrh","volume-title":"Re-engineering philosophy for limited beings: Piecewise approximations to reality","author":"WC Wimsatt","year":"2007","unstructured":"Wimsatt, W. C. (2007). Re-engineering philosophy for limited beings: Piecewise approximations to reality. Cambridge: Harvard University Press."},{"key":"532_CR58","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/3-540-16486-3_112","volume-title":"Structure in complexity theory","author":"S Zachos","year":"1986","unstructured":"Zachos, S. (1986). Probabilistic quantifiers, adversaries, & complexity classes: An overview. In A. L. Selman (Ed.), Structure in complexity theory (pp. 383\u2013400). Berlin: Springer."}],"container-title":["Synthese"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11229-014-0532-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11229-014-0532-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11229-014-0532-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11229-014-0532-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T18:14:01Z","timestamp":1650392041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11229-014-0532-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,10]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["532"],"URL":"https:\/\/doi.org\/10.1007\/s11229-014-0532-0","relation":{},"ISSN":["0039-7857","1573-0964"],"issn-type":[{"value":"0039-7857","type":"print"},{"value":"1573-0964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,10]]}}}