Computational complexity analysis can help, but first we need a theory

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)
DOI 10.1017/S0140525X0800469X
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,974
External links
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
John K. Tsotsos (1990). Analyzing Vision at the Complexity Level. Behavioral and Brain Sciences 13 (3):423-445.

View all 7 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

16 ( #164,320 of 1,725,822 )

Recent downloads (6 months)

1 ( #348,716 of 1,725,822 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.