06.09.2021 Views

Mind, Body, World- Foundations of Cognitive Science, 2013a

Mind, Body, World- Foundations of Cognitive Science, 2013a

Mind, Body, World- Foundations of Cognitive Science, 2013a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Many other activation functions exist. One review paper has identified 640 different<br />

activation functions employed in connectionist networks (Duch & Jankowski,<br />

1999). One characteristic <strong>of</strong> the vast majority <strong>of</strong> all <strong>of</strong> these activation functions is<br />

their nonlinearity. Connectionist cognitive science is associationist, but it is also<br />

nonlinear.<br />

4.4 The Connectionist Sandwich<br />

Both the McCulloch-Pitts neuron (McCulloch & Pitts, 1943) and the perceptron<br />

(Rosenblatt, 1958, 1962) used the Heaviside step function to implement the all-ornone<br />

law. As a result, both <strong>of</strong> these architectures generated a “true” or “false” judgment<br />

about each input pattern. Thus both <strong>of</strong> these architectures are digital, and<br />

their basic function is pattern recognition or pattern classification.<br />

The two-valued logic that was introduced in Chapter 2 can be cast in the context<br />

<strong>of</strong> such digital pattern recognition. In the two-valued logic, functions are computed<br />

over two input propositions, p and q, which themselves can either be true or false. As<br />

a result, there are only four possible combinations <strong>of</strong> p and q, which are given in the<br />

first two columns <strong>of</strong> Table 4-1. Logical functions in the two-valued logic are themselves<br />

judgments <strong>of</strong> true or false that depend on combinations <strong>of</strong> the truth values <strong>of</strong><br />

the input propositions p and q. As a result, there are 16 different logical operations<br />

that can be defined in the two-valued logic; these were provided in Table 2-2.<br />

The truth tables for two <strong>of</strong> the sixteen possible operations in the two-valued<br />

logic are provided in the last two columns <strong>of</strong> Table 4-1. One is the AND operation<br />

(p·q), which is only true when both propositions are true. The other is the XOR<br />

operation (pq), which is only true when one or the other <strong>of</strong> the propositions is true.<br />

p q pq p q<br />

1 1 1 0<br />

1 0 0 1<br />

0 1 0 1<br />

0 0 0 0<br />

Table 4-1. Truth tables for the logical operations AND (pq) and XOR (p q), where<br />

the truth value <strong>of</strong> each operation is given as a function <strong>of</strong> the truth <strong>of</strong> each<br />

<strong>of</strong> two propositions, p and q. ‘1’ indicates “true” and ‘0’ indicates “false.” The<br />

logical notation is taken from McCulloch (1988b).<br />

That AND or XOR are examples <strong>of</strong> digital pattern recognition can be made more<br />

explicit by representing their truth tables graphically as pattern spaces. In a pattern<br />

142 Chapter 4

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!