Computing with Structured Connectionist Networks
Nigel Goddard, Jerome A. Feldman, Mark Fanty, Kenton J. Lynne · UR Research (University of Rochester)
Massively parallel (connectionist) computation is receiving widespread attention. Both the theory of connectionist computation and its applications to a broad range of problems are advancing rapidly. Somewhat less attention has been paid to the experimental methodologies of designing and testing massively parallel networks. This paper describes a coordinated set of specification, simulation and monitoring tools that have proven to be quite useful in our research. Also included are an overview of the structured connectionist paradigm and several sample applications.