Rules in programming languages and networks

In J. Dinsmore (ed.), The Symbolic and Connectionist Paradigms: Closing the Gap. Lawrence Erlbaum (1992)
Download Edit this record How to cite View on PhilPapers
Abstract
1. Do models formulated in programming languages use explicit rules where connectionist models do not? 2. Are rules as found in programming languages hard, precise, and exceptionless, where connectionist rules are not? 3. Do connectionist models use rules operating on distributed representations where models formulated in programming languages do not? 4. Do connectionist models fail to use structure sensitive rules of the sort found in "classical" computer architectures? In this chapter we argue that the answer to each of these questions is negative.
PhilPapers/Archive ID
ADARIP
Upload history
Archival date: 2022-03-29
View other versions
Added to PP
2009-01-28

Downloads
40 (#67,596)

6 months
22 (#38,495)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?