Rosetta stone for connectionism.

摘要

The term connectionism is usually applied to neural networks. There are, however, many other models that are mathematically similar, including classifier systems, immune networks, autocatalytic chemical reaction networks, and others. In view of this similarity, it is appropriate to broaden the term connectionism. I define a connectionist model as a dynamical system with two properties: the interactions between the variables at any given time are explicitly constrainted to a finite list of connections; the connections are fluid, in that their strength and/or pattern of connectivity can change with time. This paper reviews the four examples listed above and maps them into a common mathematical framework, discussing their similarities and differences. It also suggests new applications of connectionist models, and poses some problems to be addressed in an eventual theory of connectionist systems. 66 refs.