BOOLEAN formulation of a network 2)
← Back
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 2 possible configurations (i.e. 10 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)
Categories
- 1) General information
- 2) Methodology or model
- 3) Epistemology, ontology and semantics
- 4) Human sciences
- 5) Discipline oriented
Publisher
Bertalanffy Center for the Study of Systems Science(2020).
To cite this page, please use the following information:
Bertalanffy Center for the Study of Systems Science (2020). Title of the entry. In Charles François (Ed.), International Encyclopedia of Systems and Cybernetics (2). Retrieved from www.systemspedia.org/[full/url]
We thank the following partners for making the open access of this volume possible: