Rational analysis, intractability, and the prospects of `as if'-explanations

DOI10.1007/S11229-014-0532-0zbMATH Open1436.03089OpenAlexW2071929954MaRDI QIDQ1709129FDOQ1709129

Authors: Iris van Rooij, Johan Kwisthout, Todd Wareham, Cory D. Wright 

Publication date: 27 March 2018

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11229-014-0532-0

Recommendations

• Intractability and the use of heuristics in psychological explanations
• Naturalism, tractability and the adaptive toolbox
• Intractability and approximation of optimization theories of cognition
• The computational complexity of rationalizing boundedly rational choice behavior
• Computationalism

zbMATH Keywords

approximationNP-hardnessintractabilitycomputational-level theorypsychological explanationrational analysis

Mathematics Subject Classification ID

Logic in the philosophy of science (03A10) General topics in the theory of computing (68Q01)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Finding MAPs for belief networks is NP-hard
• The computational complexity of probabilistic inference using Bayesian belief networks
• A survey on continuous time computations
• General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
• Intractability and the use of heuristics in psychological explanations
• Title not available (Why is that?)
• Alan Turing: Life and Legacy of a Great Thinker
• Approximating MAPs for belief networks is NP-hard and other theorems
• Most probable explanations in Bayesian networks: complexity and tractability
• The physical Church-Turing thesis: modest or bold?
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hypercomputation and the Physical Church‐Turing Thesis
• A computational-level explanation of the speed of goal inference
• Intractability and approximation of optimization theories of cognition

Cited In (6)

• Intractability and approximation of optimization theories of cognition
• `As if' reasoning in Vaihinger and Pasch
• Analysisversuslawsboole’s explanatory psychologism versus his explanatory anti-psychologism
• Naturalism, tractability and the adaptive toolbox
• Intractability and the use of heuristics in psychological explanations
• Parameterized complexity results for a model of theory of mind based on dynamic epistemic logic

This page was built for publication: Rational analysis, intractability, and the prospects of `as if'-explanations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709129)