Abstract
The recognition that human minds/brains are finite systems with limited resources for computation has led researchers in Cognitive Science to advance the Tractable Cognition thesis: Human cognitive capacities are constrained by computational tractability. As also artificial intelligence (AI) in its attempt to recreate intelligence and capacities inspired by the human mind is dealing with finite systems, transferring the Tractable Cognition thesis into this new context and adapting it accordingly may give rise to insights and ideas that can help in progressing towards meeting the goals of the AI endeavor.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
- Common Sense Reasoning
- Much Probable Explanation
- CEUR Workshop Proceeding
- Computer Metaphor
- Computational Cognitive Model
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Frixione, M.: Tractable competence. Minds and Machines 11, 379–397 (2001)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)
van Rooij, I.: The tractable cognition thesis. Cognitive Science 32, 939–984 (2008)
Nebel, B.: Artificial intelligence: A computational perspective. In: Brewka, G. (ed.) Principles of Knowledge Representation, pp. 237–266. CSLI Publications (1996)
Oaksford, M., Chater, N.: Précis of bayesian rationality: The probabilistic approach to human reasoning. Behavioral and Brain Sciences 32, 69–84 (2009)
Kwisthout, J., Wareham, T., van Rooij, I.: Bayesian intractability is not an ailment that approximation can cure. Cognitive Science 35(5), 779–784 (2011)
van Rooij, I.: Rationality, intractability and the prospects of “as if” explanations. In: Szymanik, J., Verbrugge, R. (eds.) Proc. of the Logic & Cognition Workshop at ESSLLI 2012. CEUR Workshop Proceedings, vol. 883, CEUR-WS.org (August 2012)
Downey, R.G., Fellows, M.R., Stege, U.: Parameterized complexity: A framework for systematically confronting computational intractability. In: Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, AMS (1997)
Anderson, J.R.: Cognitive Psychology and Its Implications. W. H. Freeman and Company (1985)
Gigerenzer, G., Hertwig, R., Pachur, T. (eds.): Heuristics: The Foundation of Adaptive Behavior. Oxford University Press (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Besold, T.R., Robere, R. (2013). A Note on Tractability and Artificial Intelligence. In: Kühnberger, KU., Rudolph, S., Wang, P. (eds) Artificial General Intelligence. AGI 2013. Lecture Notes in Computer Science(), vol 7999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39521-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-39521-5_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39520-8
Online ISBN: 978-3-642-39521-5
eBook Packages: Computer ScienceComputer Science (R0)