BOOLEAN formulation of a network
| Collection | International Encyclopedia of Systems and Cybernetics |
|---|---|
| Year | 2004 |
| Vol. (num.) | 2(1) |
| ID | ◀ 316 ▶ |
| Object type | Methodology or model |
Let us suppose N Boolean automata (able to transmit only the values 0 or 1) that are connected in a network. At any moment t, each automaton has a value 0 or 1, which is function of the value of a number of other automata in the network at the instant t-1. In such a network there are 2N possible configurations (i.e. 1030 for a network of 10 automata with all their potential connections) (adapted from H. ZWIRN, 2002, p. 54)
As it is not possible to consider simultaneously the behavior of many automata (as it depends from the others and that communication is neither isochronic , nor isospatial, the behavior of the network is difficult (practically impossible) to forecast. However“…as the number of possible configurations is limited, the network's global behavior must be cyclical… However, the cycle is necessarily very long and the network's dynamics will seem chaotic” (Ibid)