Computational complexity analysis can help, but first we need a theory [Open Peer Commentary]

Contains fulltext : 72913.pdf (publisher's version ) (Closed access)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.2 p