Intractability and approximation of optimization theories of cognition

DOI10.1016/J.JMP.2012.05.002MaRDI QIDQ2438604zbMATH OpenOpenAlexFDO

Authors Iris van Rooij, Todd Wareham

Publication date 5 March 2014

Published in Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jmp.2012.05.002

zbMATH Keywords

approximationcoherencecomputational complexitycomputational-level theoryconstraint satisfactionharmony maximizationNP-hardoptimizationrational explanation

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cognitive psychology (91E10)

Recommendations

• Computer Aided Systems Theory – EUROCAST 2005
• On the hardness of approximate reasoning
• Rational analysis, intractability, and the prospects of `as if'-explanations
• Intractability and the use of heuristics in psychological explanations
• Characterizing properties of approximate solutions for optimization problems

Cites work

• A fuzzy measure for explanatory coherence
• Approximating MAPs for belief networks is NP-hard and other theorems
• Binary interactions and subset choice
• scientific article; zbMATH DE number 1670535 (Why is no real title available?)
• scientific article; zbMATH DE number 3135430 (Why is no real title available?)
• scientific article; zbMATH DE number 3137856 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1301800 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 1407500 (Why is no real title available?)
• Intractability and the use of heuristics in psychological explanations
• On the power of neural networks for solving hard problems
• Sources of complexity in subset choice
• The computational complexity of propositional STRIPS planning
• Tractable competence
• Transparallel processing by hyperstrings

Cited in

(5)

• Rational analysis, intractability, and the prospects of `as if'-explanations
• Parameterized complexity of theory of mind reasoning in dynamic epistemic logic
• A computational-level explanation of the speed of goal inference
• Intractability and the use of heuristics in psychological explanations
• The assessment of global optimization skills in procedural knowledge space theory

This page was built for publication: Intractability and approximation of optimization theories of cognition

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