𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computation of Boolean functions on networks of binary automata

✍ Scribed by Maurice Tchuente

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
541 KB
Volume
26
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Computation of Boolean Functions
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In
✍ GyΓΆrgy TurΓ‘n; Farrokh Vatan πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 741 KB

We consider the complexity of computing Boolean functions by analog circuits of bounded fan-in, i.e., by circuits of gates computing real-valued functions, either exactly or as sign-representation. Sharp upper bounds are obtained for the complexity of the most difficult n-variable function over cert

Dynamics of Boolean Networks Controlled
Dynamics of Boolean Networks Controlled by Biologically Meaningful Functions
✍ L. RAEYMAEKERS πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 159 KB

The remarkably stable dynamics displayed by randomly constructed Boolean networks is one of the most striking examples of the spontaneous emergence of self-organization in model systems composed of many interacting elements (Kauffman, S., J. theor. Biol.22, 437-467, 1969; The Origins of Order, Oxfor

Computing with Snakes in Directed Networ
Computing with Snakes in Directed Networks of Automata
✍ Shimon Even; Ami Litman; Peter Winkler πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 146 KB

We consider unidirectional, strongly connected networks of identical finite-state automata, of bounded in-and out-degree but unknown topology and unbounded size n. Protocols which are quadratic or linear in n are provided which accomplish the following tasks: wake up and report when done; construct