COMPUTING MEDIA

The iterative-circuit structure is characterized by these features: homogeneity, close action (between adjacent elements only), universality, program tuning. Any graph, or function of the algebra of logic, or finite automaton can be realized in the iterative-circuit structure. The minimum number of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Evreinov,E. V
Format: Report
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The iterative-circuit structure is characterized by these features: homogeneity, close action (between adjacent elements only), universality, program tuning. Any graph, or function of the algebra of logic, or finite automaton can be realized in the iterative-circuit structure. The minimum number of tuning states for a two-dimensional-structure element is three; for a three-dimensional-structure element, two. When the amount of equipment used in a computing system increases by 10-100 times, the iterative-circuit structure is 100-1000 times more efficient than a universal computer built on the same physico-technical basis. (Author) Edited machine trans. of mono. Simpozium po Vychislitelnym Sistemam, Novosibirsk, 1966. Trudy (Symposium on Computing Systems. Novosibirsk, 1966. Transactions), Novosibirsk, 1967 p109-112.