Simulations of connectionist networks aren't duplications
It's invalid to conclude that because a serial simulation of a connectionist network can’t think, that an actual connectionist network can’t think. The invalidity can be shown by modifying one of Searle’s own arguments about simulation.
Three Valid Inferences

Searle argues that this is invalid reasoning:

  1. An actual storm can make is wet,
  2. Therefore, a simulation of a storm can make is wet.
But that implies that the contrapositive form is also invalid:

  1. A simulation of a storm can't make us wet.
  2. Therefore, an actual storm can't make us wet.
Thus, Searle's connectionism argument is also invalid:

  1. A serial simulation of a connectionist network can’t think.
  2. Therefore, an actual connectionist network can’t think.
See "Simulations are not Duplications", Map 2, Box 23.

Jack Copeland, 1993.
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 are formal systems »Connectionist networks are formal systems
■
Simulations of connectionist networks aren't duplications
+Commentaar (0)
+Citaten (0)
+About