The tractable cognition thesis

I Van Rooij - Cognitive science, 2008 - Wiley Online Library
The recognition that human minds/brains are finite systems with limited resources for
computation has led some researchers to advance the Tractable Cognition thesis: Human …

Intentional communication: Computationally easy or difficult?

I Van Rooij, J Kwisthout, M Blokpoel… - Frontiers in Human …, 2011 - frontiersin.org
Human intentional communication is marked by its flexibility and context sensitivity.
Hypothesized brain mechanisms can provide convincing and complete explanations of the …

A lazy brain? Embodied embedded cognition and cognitive neuroscience

P Haselager, J van Dijk, I van Rooij - Handbook of cognitive science, 2008 - Elsevier
Publisher Summary Compared to for instance the E. coli, humans have an exceptionally rich
behavioral repertoire that gets applied with great flexibility and sensitivity to environmental …

Intractability and approximation of optimization theories of cognition

I van Rooij, T Wareham - Journal of Mathematical Psychology, 2012 - Elsevier
Many computational-or rational-level theories of human cognition suffer from computational
intractability: the postulated optimization functions are impossible to compute in a …

[PDF][PDF] Identifying sources of intractability in cognitive models: An illustration using analogical structure mapping

I Van Rooji, P Evans, M Muller, J Gedge… - Proceedings of the …, 2008 - escholarship.org
Many computational models in cognitive science and artificial intelligence face the problem
of computational intractability when assumed to operate for unrestricted input domains …

[PDF][PDF] What does (and doesn't) make analogical problem solving easy? A complexity-theoretic perspective

T Wareham, P Evans, I Rooij - The Journal of Problem Solving, 2011 - docs.lib.purdue.edu
Solving new problems can be made easier if one can build on experiences with other
problems one has already successfully solved. The ability to exploit earlier problem-solving …

Tree-width and the computational complexity of MAP approximations in Bayesian networks

J Kwisthout - Journal of Artificial Intelligence Research, 2015 - jair.org
The problem of finding the most probable explanation to a designated set of variables given
partial evidence (the MAP problem) is a notoriously intractable problem in Bayesian …

Structure approximation of most probable explanations in Bayesian networks

J Kwisthout - European Conference on Symbolic and Quantitative …, 2013 - Springer
Typically, when one discusses approximation algorithms for (NP-hard) problems (like
Traveling Salesperson, Vertex Cover, Knapsack), one refers to algorithms that return a …

Treewidth and the computational complexity of MAP approximations

J Kwisthout - … Graphical Models: 7th European Workshop, PGM …, 2014 - Springer
The problem of finding the most probable explanation to a designated set of variables (the
MAP problem) is a notoriously intractable problem in Bayesian networks, both to compute …

Algorithms in moderately exponential time

M Mnich - 2010 - research.tue.nl
This thesis studies exponential time algorithms that give optimum solutions to optimization
problems which are highly unlikely to be solvable to optimality in polynomial time. Such …