Export Citations
Skip header Section
Cellular AutomataJune 1968
- Author:
- E. F. Codd
Abstract
No abstract available.
Cited By
- Bonin L, Rovito L, De Lorenzo A and Manzoni L (2024). Cellular geometric semantic genetic programming, Genetic Programming and Evolvable Machines, 25:1, Online publication date: 1-Jun-2024.
- Sipper M and Lin H (2022). Artificial General Intelligence: Pressure Cooker or Crucible?, Computer, 55:7, (92-96), Online publication date: 1-Jul-2022.
- Ishizaka H, Kong G and Imai K (2022). The Weak Universality of Two-Dimensional Five-State von Neumann Neighborhood Number-Conserving Cellular Automaton, New Generation Computing, 40:2, (541-551), Online publication date: 1-Jul-2022.
- Tang Y and Ha D The sensory neuron as a transformer Proceedings of the 35th International Conference on Neural Information Processing Systems, (22574-22587)
- Nichele S (2021). Tim Taylor and Alan Dorin: Rise of the self-replicators—early visions of machines, AI and robots that can reproduce and evolve, Genetic Programming and Evolvable Machines, 22:1, (141-145), Online publication date: 1-Mar-2021.
- Kyparissas N and Dollas A (2020). Large-scale Cellular Automata on FPGAs, ACM Transactions on Reconfigurable Technology and Systems, 14:1, (1-32), Online publication date: 6-Jan-2021.
- Rhodes A Evolving Order and Chaos: Comparing Particle Swarm Optimization and Genetic Algorithms for Global Coordination of Cellular Automata 2020 IEEE Congress on Evolutionary Computation (CEC), (1-7)
- Bhattacharjee K, Naskar N, Roy S and Das S (2018). A survey of cellular automata: types, dynamics, non-uniformity and applications, Natural Computing: an international journal, 19:2, (433-461), Online publication date: 1-Jun-2020.
- Anisimov A, Marchenko O and Zemlianskyi V (2019). Evolutionary Method of Constructing Artificial Intelligence Systems, Cybernetics and Systems Analysis, 55:1, (1-9), Online publication date: 1-Jan-2019.
- Lê Cong S, Pinchinat S and Schwarzentruber F Small undecidable problems in epistemic planning Proceedings of the 27th International Joint Conference on Artificial Intelligence, (4780-4786)
- Paredis J Exploring the evolution of Genotype Phenotype Mappings 2017 IEEE Congress on Evolutionary Computation (CEC), (279-285)
- van Zijl L Clustering in 1D Binary Elementary Cellular Automata Proceedings of the 2015 Annual Research Conference on South African Institute of Computer Scientists and Information Technologists, (1-7)
- Mori M, Isokawa T, Peper F and Matsui N (2015). Swarm Networks in Brownian Environments, New Generation Computing, 33:3, (297-318), Online publication date: 1-Jul-2015.
- Coleman G and Byrne D 36 Walk Proceedings of the 2014 International Workshop on Movement and Computing, (55-60)
- Burgin M and Eberbach E (2012). Ubiquity symposium: Evolutionary computation and the processes of life, Ubiquity, 2012:August, (1-13), Online publication date: 1-Aug-2012.
- Xu X, Zhang X and Wang L Simulating energy efficient wireless sensor networks using cellular automata Proceedings of the Winter Simulation Conference, (3207-3216)
- Tufte G and Nichele S On the correlations between developmental diversity and genomic composition Proceedings of the 13th annual conference on Genetic and evolutionary computation, (1507-1514)
- Kabamba P, Owens P and Ulsoy A (2011). The von neumann threshold of self-reproducing systems, Robotica, 29:1, (123-135), Online publication date: 1-Jan-2011.
- Martínez G, Morita K, Adamatzky A and Margenstern M Majority adder implementation by competing patterns in life-like rule B2/S2345 Proceedings of the 9th international conference on Unconventional computation, (93-104)
- Das S, Mukherjee S, Naskar N and Sikdar B (2009). Characterization of Single Cycle CA and its Application in Pattern Classification, Electronic Notes in Theoretical Computer Science (ENTCS), 252, (181-203), Online publication date: 1-Oct-2009.
- Mantere T Image ordering by cellular genetic algorithms with TSP and ICA Proceedings of the Eleventh conference on Congress on Evolutionary Computation, (822-829)
- Tufte G Phenotypic, developmental and computational resources Proceedings of the 10th annual conference on Genetic and evolutionary computation, (859-866)
- Nishio H, Margenstern M and von Haeseler F (2007). On Algebraic Structure of Neighborhoods of Cellular Automata, Fundamenta Informaticae, 78:3, (397-416), Online publication date: 1-Nov-2007.
- Ninagawa S Evolution of one-dimensional cellular automata by 1/f noise Proceedings of the 9th European conference on Advances in artificial life, (905-914)
- Nishio H, Margenstern M and von Haeseler F (2007). On Algebraic Structure of Neighborhoods of Cellular Automata, Fundamenta Informaticae, 78:3, (397-416), Online publication date: 1-Aug-2007.
- Woods D and Neary T The Complexity of Small Universal Turing Machines Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World, (791-798)
- Stevens W (2007). Simulating Self-replicating Machines, Journal of Intelligent and Robotic Systems, 49:2, (135-150), Online publication date: 1-Jun-2007.
- Takada Y, Isokawa T, Peper F and Matsui N (2006). Construction universality in purely asynchronous cellular automata, Journal of Computer and System Sciences, 72:8, (1368-1385), Online publication date: 1-Dec-2006.
- Priese L (2006). Reversible Automaten und Einfache Universelle 2‐Dimensionale Thue‐Systeme, Mathematical Logic Quarterly, 22:1, (353-384), Online publication date: 13-Nov-2006.
- Nehaniv C Self-replication, evolvability and asynchronicity in stochastic worlds Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications, (126-169)
- Li K, Gao Z and Ning B (2005). Cellular automaton model for railway traffic, Journal of Computational Physics, 209:1, (179-192), Online publication date: 10-Oct-2005.
- Bilotta E and Pantano P (2005). Emergent Patterning Phenomena in 2D Cellular Automata, Artificial Life, 11:3, (339-362), Online publication date: 1-Sep-2005.
- Fredkin E A computing architecture for physics Proceedings of the 2nd conference on Computing frontiers, (273-279)
- Kari J (2005). Theory of cellular automata, Theoretical Computer Science, 334:1-3, (3-33), Online publication date: 11-Apr-2005.
- Cunha R, Silva A, Loureiro A and Ruiz L Simulating Large Wireless Sensor Networks Using Cellular Automata Proceedings of the 38th annual Symposium on Simulation, (323-330)
- Achasova S (2004). Simple Self-Reproduction Programs in a Cellular Space Based on the Parallel Substitution Algorithm, Programming and Computing Software, 30:4, (181-187), Online publication date: 1-Jul-2004.
- Furnas G and Qu Y Using pixel rewrites for shape-rich interaction Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, (369-376)
- Subrata R and Zomaya A (2003). Evolving Cellular Automata for Location Management in Mobile Computing Networks, IEEE Transactions on Parallel and Distributed Systems, 14:1, (13-26), Online publication date: 1-Jan-2003.
- Nehaniv C Evolution in asynchronous cellular automata Proceedings of the eighth international conference on Artificial life, (65-73)
- Bilotta E, Lafusa A and Pantano P Is self-replication an embedded characteristic of artificial/living matter? Proceedings of the eighth international conference on Artificial life, (38-48)
- Sarkar P (2000). A brief history of cellular automata, ACM Computing Surveys, 32:1, (80-107), Online publication date: 1-Mar-2000.
- Hutchinson D, Küttner L, Lanthier M, Maheshwari A, Nussbaum D, Roytenberg D and Sack J Parallel neighbourhood modeling Proceedings of the eighth annual ACM symposium on Parallel Algorithms and Architectures, (204-207)
- Bhattacharjee S, Bhattacharya J, Raghavendra U, Saha D and Pal Chaudhuri P A VLSI architecture for cellular automata based parallel data compression Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
- Gagliano R and Lauer M Discrete element models and real life duals Proceedings of the 26th conference on Winter simulation, (625-632)
- Feldman Y and Shapiro E (1992). Spatial machines, Communications of the ACM, 35:10, (60-73), Online publication date: 1-Oct-1992.
- Signorini J How a SIMD machine can implement a complex cellular automata? a case study: von Neumann's 29-state cellular automaton Proceedings of the 1989 ACM/IEEE conference on Supercomputing, (175-186)
- Meriaux M Cellular architectures and algorithms for image synthesis Proceedings of the Second Eurographics conference on Advances in Computer Graphics Hardware, (239-249)
- Lougheed R and McCubbrey D The cytocomputer Proceedings of the 7th annual symposium on Computer Architecture, (271-277)
- Manning F (1977). An Approach to Highly Integrated, Computer-Maintained Cellular Arrays, IEEE Transactions on Computers, 26:6, (536-552), Online publication date: 1-Jun-1977.
- Noural F and Kashef R (1975). A Universal Four-State Cellular Computer, IEEE Transactions on Computers, 24:8, (766-776), Online publication date: 1-Aug-1975.
- Wainwright R Life is universal! Proceedings of the 7th conference on Winter simulation - Volume 2, (449-459)
- Goodman E (1970). R70-18 Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines, IEEE Transactions on Computers, 19:7, (657-658), Online publication date: 1-Jul-1970.
- Chaltin G (1970). To a mathematical definition of 'life', ACM SIGACT News:4, (12-18), Online publication date: 1-Jan-1970.
Index Terms
- Cellular Automata
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
Cellular Automata: Elementary Cellular Automata
Cellular automata CA are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is ...
Closure properties of cellular automata
Concerning the power of one-dimensional cellular automata recognizers, Ibarra and Jiang have proved that real time cellular automata (CA) and linear time CA are equivalent if and only if real time CA is closed under reverse. In this paper we investigate ...
Cellular automata between sofic tree shifts
We study the sofic tree shifts of A^@S^^^@?, where @S^@? is a regular rooted tree of finite rank. In particular, we give their characterization in terms of unrestricted Rabin automata. We show that if X@?A^@S^^^@? is a sofic tree shift, then the ...