Computational complexity analysis can help, but first we need a theory [Open Peer Commentary]
until further notice
SourceBehavioral and Brain Sciences, 31, 5, (2008), pp. 399-400
Article / Letter to editor
Display more detailsDisplay less details
SW OZ DCC AI
SW OZ NICI KI
Behavioral and Brain Sciences
SubjectCognitive artificial intelligence; DI-BCB_DCC_Theme 2: Perception, Action and Control
Leech, Mareschal, & Cooper 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.
Upload full text
Use your RU credentials (u/z-number and password) to log in with SURFconext to upload a file for processing by the repository team.