AECAM: An extension matrix algorithm on a cellular automata machine (Q1192509)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: AECAM: An extension matrix algorithm on a cellular automata machine |
scientific article; zbMATH DE number 60938
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | AECAM: An extension matrix algorithm on a cellular automata machine |
scientific article; zbMATH DE number 60938 |
Statements
AECAM: An extension matrix algorithm on a cellular automata machine (English)
0 references
27 September 1992
0 references
Cellular automata provides incredibly simple paradigms for solving complex problems in areas like biology, combinatorial mathematics, hydrodynamics and pattern recognition. The main emphasis in cellular automata machines like CAM-6 is in formulating algorithms with intrinsic parallelism and yet keeping things as simple as possible. The authors present a simplified version of the extension matrix algorithms that can be implemented on a cellular automata machine. The implementation is also discussed.
0 references
extension matrix algorithm
0 references
cellular automatic machine
0 references
machine learning
0 references
intrinsic parallelism
0 references
