منابع مشابه
Cellular automata and intermediate degrees
We study a classification of cellular automata based on the Turing degree of the orbits of the automaton. The difficulty of determining the membership of a cellular automaton in any one of these classes is characterized in the arithmetical hierarchy.
متن کاملCellular Automata and Intermediate Reachability Problems
We exhibit one-dimensional cellular automata whose reachability and confluence problems have arbitrary r.e. degree of unsolvability.
متن کاملExploring and Exploiting Quantum-Dot Cellular Automata
The Full Adders (FAs) constitute the essential elements of digital systems, in a sense that they affect the circuit parameters of such systems. With respect to the MOSFET restrictions, its replacement by new devices and technologies is inevitable. QCA is one of the accomplishments in nanotechnology nominated as the candidate for MOSFET replacement. In this article 4 new layouts are presente...
متن کاملTuring Degrees of Limit Sets of Cellular Automata
Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a computable point and that any non-trivial property on them is undecidable. We go one step further in this article by giving a full characterization of the sets of T...
متن کاملNoise and Intermediate Asynchronism in Cellular Automata with Sampling Compensation
Cellular Automata (CAs) are a class of discrete dynamical systems that are widely used to model complex systems in which the dynamics is specified locally at cell scale. In its classic definition, CAs performs with perfect synchronism. However, this does not stand for what happens at a microscopic level for physical and biological systems. Recent research has studied the CAs behavioral conseque...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00661-8