Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On the activity of cell circuits realising the system of all conjunctions
-
O. V. Cheremisin
Veröffentlicht/Copyright:
1. Juni 2003
We investigate the activity of cell circuits, the measure of their complexity, which describes the functioning of such circuits from the energy point of view. For the system Kn of all elementary conjunctions of n variables we find the order of the minimal activity as n → ∞. We prove that it is impossible to reach simultaneously the minimal in order activity and complexity of realising the system Kn in the class of cell circuits.
Published Online: 2003-06-01
Published in Print: 2003-06-01
Copyright 2003, Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Covering runs in binary Markov sequences
- An optimal in order method of synthesis of a search operator in the class of automaton circuits of a special form
- On the complexity of recurring sequences
- Limit theorems for the number of points of a given set covered by a random linear subspace
- On a Sprindzhuk problem
- On the activity of cell circuits realising the system of all conjunctions
Artikel in diesem Heft
- Covering runs in binary Markov sequences
- An optimal in order method of synthesis of a search operator in the class of automaton circuits of a special form
- On the complexity of recurring sequences
- Limit theorems for the number of points of a given set covered by a random linear subspace
- On a Sprindzhuk problem
- On the activity of cell circuits realising the system of all conjunctions
