The Syntactic Argument
The representation-without-rules conception of connectionism can't succeed, because rules can always be formulated to describe the network’s representation-level processing.


Such rules can:

  • specify how the parts of a representation are instantiated in nodes and connections (representation instantiation rules), and can
  • characterise the operation of individual nodes in the network (note-level rules).
Anticipated by Terence Horgan and John Tienson, 1991.
PAGE NAVIGATOR(Help)
-
Artificial Intelligence »Artificial Intelligence
Can computers think? [1] »Can computers think? [1]
Yes: connectionist networks can think [5a] »Yes: connectionist networks can think [5a]
Connectionist networks can think without following rules »Connectionist networks can think without following rules
Representations without rules »Representations without rules
The Syntactic Argument
The Multiple Realisability Defence  »The Multiple Realisability Defence
+Commentaar (0)
+Citaten (0)
+About