𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the prediction of local patterns in cellular automata

✍ Scribed by W. John Wilbur; David J. Lipman; Shihab A. Shamma

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
953 KB
Volume
19
Category
Article
ISSN
0167-2789

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Computational Complexity of Finit
On the Computational Complexity of Finite Cellular Automata
✍ K. Sutner πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 932 KB

We study the computational complexity of several problems with the evolution of configurations on finite cellular automata. In many cases, the problems turn out to be complete in their respective classes. For example, the problem of deciding whether a configuration has a predecessor is shown to be N

Practical issues in the realization of q
Practical issues in the realization of quantum-dot cellular automata
✍ Gary H. Bernstein; Greg Bazan; Minhan Chen; Craig S. Lent; James L. Merz; Alexei πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 148 KB

Several practical issues in the development and operation of quantum-dot cellular automata (QCA) cells and systems are discussed. The need for adiabatic clocking of QCA systems and modeling of electrostatic confinement of quantum dots are presented. Experimental data on dot coupling and applications

On the potential use of cellular automat
On the potential use of cellular automata machines for electromagnetic field solution
✍ Neil R. S. Simons; Michel Cuhaci; Nikhil Adnani; Greg E. Bridges πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 918 KB

In this paper, the potential use of cellular automata machines for electromagnetic field solution is investigated. Cellular automata are computational models that operate on a discrete spatial lattice, evolve in discrete time, and employ simple discrete variables. We specifically examine the lattice