Arithmetic Operations on Self-Replicating Cellular Automata
ECAL '99 Proceedings of the 5th European Conference on Advances in Artificial Life
Evolving FPGA Based Cellular Automata
SEAL'98 Selected papers from the Second Asia-Pacific Conference on Simulated Evolution and Learning on Simulated Evolution and Learning
The Quest for Small Universal Cellular Automata
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Intrinsic Universality Problem of One-Dimensional Cellular Automata
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Universal Four-State Cellular Computer
IEEE Transactions on Computers
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
A Construction Method of Moore Neighborhood Number-Conserving Cellular Automata
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Theoretical Computer Science
Bulking II: Classifications of cellular automata
Theoretical Computer Science
Bulking I: An abstract theory of bulking
Theoretical Computer Science
How common can be universality for cellular automata?
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Partitioned quantum cellular automata are intrinsically universal
Natural Computing: an international journal
A simple n-dimensional intrinsically universal quantum cellular automaton
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Embedding Universal Delay-Insensitive Circuits in Asynchronous Cellular Spaces
Fundamenta Informaticae - Cellular Automata
Intrinsically universal n-dimensional quantum cellular automata
Journal of Computer and System Sciences
Hi-index | 0.01 |
Complex behavior by machines can be achieved by either having a large number of very simple machines or by having a complex machine with which to start. Our primary interest in this paper was with the former. By considering the global behavior of a large number of the simplest of machines, the following results were shown: 1. An array of identical square cells each of which can exist in only four states and communicates with its four nearest neighbors (forming a neighborhood of five cells) can a) perform any computation which is computable and b) construct (almost) any configuration--in particular, it can be self-reproducing. Cells capable of the first behavior are called universal computers; the second behavior characterizes the universal constructor. 2. A three state, five neighbor cell is capable of universal computation when configured in a finite initial area. 3. Two states and five neighbors are sufficient for universal computation, but require an infinite initial configuration. Being parallel machines, these cellular automata can serve as a good theoretical basis for parallel computation and should be useful mathematically in many of the same areas as the Turing Machine. Practical physical applications were also indicated.