Pylyshyn, Z.W. (1984b). Why computation requires symbols. Proceedings of the Sixth Annual Conference of the Cognitive Science Society, Bolder, Colorado, August, 1984. Hillsdale, N.J: Earlbaum.  Home/Search   Document Not in Database   Summary   Related Articles

.... committed to the details of these machines as exemplified in Turing s original formulation or in typical commercial computers; only to the basic idea that the kind of computing that is relevant to understanding cognition involves operations on symbols (see Newell, 1980, 1982; Fodor 1976, 1987; or Pylyshyn, 1980, 1984). In contrast, Connectionists propose to design systems that can exhibit intelligent behavior without storing, retrieving, or otherwise operating on structured symbolic expressions. The style of processing carried out in such models is thus strikingly unlike what goes on when conventional machines ....

....between expressions A B and C , and their composite expression (A B) C . This type of mapping is well known because of its use in Tarski s definition of an interpretation of a language in a model. The idea of a mapping from symbolic expressions to a structure of physical states is discussed in Pylyshyn (1984, p 54 69) where it is referred to as an instantiation function and in Stabler (1983) where it is called a realization mapping . 9 Connectionism and Cognitive Architecture expository, it turns out that describing exactly what Connectionists are committed to requires substantial ....

[Article contains additional citation context not shown here]

Pylyshyn, Z.W. (1984b). Why computation requires symbols. Proceedings of the Sixth Annual Conference of the Cognitive Science Society, Bolder, Colorado, August, 1984. Hillsdale, N.J: Earlbaum.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC