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

DOI10.1007/s11229-014-0532-0zbMath1436.03089OpenAlexW2071929954MaRDI QIDQ1709129

Johan Kwisthout, Iris van Rooij, 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

zbMATH Keywords

approximationNP-hardnessintractabilitycomputational-level theorypsychological explanationrational analysis

Mathematics Subject Classification ID

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

Related Items (2)

Naturalism, tractability and the adaptive toolbox ⋮ Unnamed Item

Cites Work

• Intractability and the use of heuristics in psychological explanations
• Most probable explanations in Bayesian networks: complexity and tractability
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Approximating MAPs for belief networks is NP-hard and other theorems
• Finding MAPs for belief networks is NP-hard
• A computational-level explanation of the speed of goal inference
• Intractability and approximation of optimization theories of cognition
• The computational complexity of probabilistic inference using Bayesian belief networks
• Alan Turing: Life and Legacy of a Great Thinker
• Hypercomputation and the Physical Church‐Turing Thesis
• General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
• The Physical Church–Turing Thesis: Modest or Bold?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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