Quasi-uniform computation-universal cellular automata

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

21 Scopus citations


Cellular automata (CA) are dynamical systems in which space and time are discrete, where each cell obeys the same rule and has a finite number of states. In this paper we study non-uniform CA, i.e. With non-uniform local interaction rules. Our focal point is the issue of universal computation, which has been proven for uniform automata using complicated designs embedded in cellular space. The computation-universal system presented here is simpler than previous ones, and is embedded in the minimal possible two-dimensional cellular space, namely 2-state, 5-neighbor (which is insufficient for universal computation in the uniform model). The space studied is quasi-uniform, meaning that a small number of rules is used (our final design consists of just two rules which is minimal), distributed such that most of the grid contains one rule except for an infinitely small region which contains the others. We maintain that such automata provide us with a simple, genera/model for studying Artificial Life phenomena.

Original languageEnglish
Title of host publicationAdvances in Artificial Life - 3rd European Conference on Artificial Life, Proceedings
EditorsPablo Chacon, Juan Julian Merelo, Federico Moran, Alvaro Moreno
PublisherSpringer Verlag
Number of pages11
ISBN (Print)3540594965, 9783540594963
StatePublished - 1 Jan 1995
Externally publishedYes
Event3rd European Conference on Artificial Life, ECAL 1995 - Granada, Spain
Duration: 4 Jun 19956 Jun 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference3rd European Conference on Artificial Life, ECAL 1995


  • Cellular Automaton
  • Turing Machine
  • Artificial Life
  • Cellular Automaton Model

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Quasi-uniform computation-universal cellular automata'. Together they form a unique fingerprint.

Cite this