David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Behavioral and Brain Sciences 31 (4):399-400 (2008)
Leech et al. present a connectionist algorithm as a model of (the development) of analogizing, but they do not specify the algorithm's associated computational-level theory, nor its computational complexity. We argue that doing so may be essential for connectionist cognitive models to have full explanatory power and transparency, as well as for assessing their scalability to real-world input domains
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
Robert C. Cummins (2000). "How Does It Work" Versus "What Are the Laws?": Two Conceptions of Psychological Explanation. In F. Keil & Robert A. Wilson (eds.), Explanation and Cognition, 117-145. MIT Press
Ian Parberry (1994). Circuit Complexity and Neural Networks. Monograph Collection (Matt - Pseudo).
P. Thagard (2002). Coherence in Thought and Action (M. Amini). Philosophical Books 43 (2):136-140.
John K. Tsotsos (1990). A Complexity Level Analysis of Vision. Behavioral and Brain Sciences 13 (3).
John K. Tsotsos (1990). Analyzing Vision at the Complexity Level. Behavioral and Brain Sciences 13 (3):423-445.
Citations of this work BETA
No citations found.
Similar books and articles
Mark Mason (2008). Complexity Theory and the Philosophy of Education. Educational Philosophy and Theory 40 (1):4–18.
Jakub Szymanik (2009). The Computational Complexity of Quantified Reciprocals. In Peter Bosch, David Gabelaia & Jérôme Lang (eds.), Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. Springer
Jakub Szymanik (2010). Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language. Linguistics and Philosophy 33 (3):215-250.
Gregory J. Chaitin (1970). Computational Complexity and Godel's Incompleteness Theorem. [Rio De Janeiro,Centro Técnico Científico, Pontifícia Universidade Católica Do Rio De Janeiro.
Added to index2009-01-28
Total downloads16 ( #154,465 of 1,699,833 )
Recent downloads (6 months)3 ( #206,271 of 1,699,833 )
How can I increase my downloads?