Rules in programming languages and networks

, &
In John Dinsmore (ed.), The Symbolic and Connectionist Paradigms: Closing the Gap. Lawrence Erlbaum (1992)
  Copy   BIBTEX

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.

Categories

Keywords

Reprint years

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Where do underlying representations come from: a connectionist approach to the acquisition of phonological rules.C. D. Lee & M. Gasser - 1992 - In John Dinsmore (ed.), The Symbolic and Connectionist Paradigms: Closing the Gap. Lawrence Erlbaum. pp. 179--207.
Rules and Representations in the Classicism-Connectionism Debate.Marcello Guarini - 1998 - Dissertation, The University of Western Ontario (Canada)
A defence of connectionism against the "syntactic" argument.Marcello Guarini - 2001 - Synthese 128 (3):287-317.
A Critical Examination of Connectionist Cognitive Architectures.Marin S. Marinov - 1992 - Dissertation, The University of Western Ontario (Canada)
What connectionist models learn: Learning and representation in connectionist networks.Stephen José Hanson & David J. Burr - 1990 - Behavioral and Brain Sciences 13 (3):471-489.
Putting together connectionism – again.Paul Smolensky - 1988 - Behavioral and Brain Sciences 11 (1):59-74.
Symbolic parsing via subsymbolic rules.Stan C. Kwasny & Kanaan A. Faisal - 1992 - In John Dinsmore (ed.), The Symbolic and Connectionist Paradigms: Closing the Gap. Lawrence Erlbaum. pp. 209--236.
Representations without Rules, Connectionism and the Syntactic Argument.Kenneth Aizawa - 1994 - Synthese 101 (3).
Explanation and connectionist models.Catherine Stinson - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. Routledge. pp. 120-133.
On the proper treatment of thermostats.David S. Touretzky - 1988 - Behavioral and Brain Sciences 11 (1):55-56.

Analytics

Added to PP
2009-01-28

Downloads
207 (#99,196)

6 months
82 (#69,492)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Fred Adams
University of Delaware
Ken Aizawa
Rutgers University - Newark

Citations of this work

Add more citations

References found in this work

No references found.

Add more references