Intractability and approximation of optimization theories of cognition

DOI10.1016/j.jmp.2012.05.002zbMath1282.91283OpenAlexW1978666955MaRDI QIDQ2438604

Todd Wareham, Iris van Rooij

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

optimizationcomputational complexitycoherenceapproximationNP-hardconstraint satisfactioncomputational-level theoryharmony maximizationrational explanation

Mathematics Subject Classification ID

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

Related Items (3)

A computational-level explanation of the speed of goal inference ⋮ Rational analysis, intractability, and the prospects of `as if'-explanations ⋮ Parameterized complexity of theory of mind reasoning in dynamic epistemic logic

Cites Work

• Intractability and the use of heuristics in psychological explanations
• On the power of neural networks for solving hard problems
• Binary interactions and subset choice
• Approximating MAPs for belief networks is NP-hard and other theorems
• The computational complexity of propositional STRIPS planning
• A fuzzy measure for explanatory coherence
• Sources of complexity in subset choice
• Transparallel processing by hyperstrings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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