Intractability and the use of heuristics in psychological explanations

DOI10.1007/s11229-010-9847-7zbMath1275.68113MaRDI QIDQ383037

Cory D. Wright, Todd Wareham, Iris van Rooij

Publication date: 25 November 2013

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11229-010-9847-7

zbMATH Keywords

algorithm; computational complexity; heuristics; approximation; NP-hard; intractability; computational-level theory; psychological explanation

Mathematics Subject Classification ID

91E10: Cognitive psychology

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68T01: General topics in artificial intelligence

Related Items

Unnamed Item, Rational analysis, intractability, and the prospects of `as if'-explanations, A computational-level explanation of the speed of goal inference, Intractability and approximation of optimization theories of cognition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational complexity of propositional STRIPS planning
• Truthlikeness for hypotheses expressed in terms of \(n\) quantitative variables
• Parameterizing above Guaranteed Values: MaxSat and MaxCut
• The complexity of theorem-proving procedures
• On Computable Numbers, with an Application to the Entscheidungsproblem