We consider the so-called not-and and not-or logic gates denoted by nand and nor. Their truth tables
Question:
We consider the so-called not-and and not-or logic gates denoted by nand and nor. Their truth tables are defined in the following way:
As in Sec. 9.5.2 we use these operations to define a relation between three stochastic
variables X1, X2 and X3, by letting X3 = X1nandX2 or X3 = X1norX2.
(a) Similar to Table 9.1 construct the probabilities for Pnand and Pnor.
Now mix the processes with the copy process as in Eq. (9.67), replacing or by nand and
xor by nor.
(b) Make a figure equivalent to Fig. 9.6.
(c) Make a figure equivalent to Fig. 9.7.
(d) Make a figure equivalent to Fig. 9.8.
(e) Make a figure equivalent to Fig. 9.9.
(f) Discuss the differences and similarities between the figures produced in (b), (c), (d) and (e) and Figs. 9.6, 9.7, 9.8 and 9.9.
Step by Step Answer:
Complexity Science The Study Of Emergence
ISBN: 9781108834766
1st Edition
Authors: Henrik Jeldtoft Jensen