| slovo | definícia |
cellular automata
(foldoc) | cellular automaton
cellular automata
(CA, plural "- automata") A regular
spatial lattice of "cells", each of which can have any one of
a finite number of states. The state of all cells in the
lattice are updated simultaneously and the state of the entire
lattice advances in discrete time steps. The state of each
cell in the lattice is updated according to a local rule which
may depend on the state of the cell and its neighbors at the
previous time step.
Each cell in a cellular automaton could be considered to be a
finite state machine which takes its neighbours' states as
input and outputs its own state.
The best known example is J.H. Conway's game of Life.
{FAQ
(http://alife.santafe.edu/alife/topics/cas/ca-faq/ca-faq.html)}.
Usenet newsgroups: news:comp.theory.cell-automata,
news:comp.theory.self-org-sys.
(1995-03-03)
|
| | podobné slovo | definícia |
quantum-dot cellular automata
(foldoc) | Quantum-dot Cellular Automata
QCA
(QCA) Quantum logic circuits created
by orientating pairs of quantum cells so that their relative
positions determine their affect on each other. This is
functionally analogous but structurally different from how
individual gates in integrated circuits are combined to
create logical and memory circuitry.
The advantages of quantum-dot cellular automata over
conventional circuitry are extremely small size/high density,
low power requirements, and potentially high processing
speeds. Disadvantages (in 2000) are difficulty of fabrication
and low yield.
See also: quantum cell wire.
(http://nd.edu/~qcahome/).
(http://mitre.org/research/nanotech/quantum_dot_cell.html).
["Quantum Dot Heterostructures", D. Bimberg, et al, John Wiley
& Sons Ltd., Dec 1998].
(2001-07-17)
|
|