Rules in programming languages and networks

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


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.



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

Similar books and articles

A Categorisation of School Rules.Robert Thornberg - 2008 - Educational Studies 34 (1):25-33.
The Role of Rules.Ota Weinberger - 1988 - Ratio Juris 1 (3):224-240.
In Defense of Explicit Rules.Andy Clark - 1991 - In William Ramsey, Stephen P. Stich & D. Rumelhart (eds.), Philosophy and Connectionist Theory. Lawrence Erlbaum.
Genuinely Constitutive Rules.Bartosz Kaluziński - 2019 - Organon F: Medzinárodný Časopis Pre Analytickú Filozofiu 26 (4):597–611.
Correspondence Rules.Kenneth F. Schaffner - 1969 - Philosophy of Science 36 (3):280-290.
Rules, Perception and Intelligibility.J. J. - 1965 - Review of Metaphysics 19 (2):375-376.
Order Relations Among Efficient Decision Rules.Jacob Paroush - 1997 - Theory and Decision 43 (3):209-218.


Added to PP

42 (#275,580)

6 months
12 (#69,937)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Fred Adams
University of Delaware
Ken Aizawa
Rutgers University - Newark

References found in this work

No references found.

Add more references