Construction universality in purely asynchronous cellular automata

  • Authors:

  • Yousuke Takada;Teijiro Isokawa;Ferdinand Peper;Nobuyuki Matsui

  • Affiliations:

  • Division of Computer Engineering, University of Hyogo, 2167 Shosha, Himeji, Hyogo 671-2201, Japan;Division of Computer Engineering, University of Hyogo, 2167 Shosha, Himeji, Hyogo 671-2201, Japan;Nanotechnology Group, National Institute of Information and Communications Technology, 588-2 Iwaoka, Iwaoka-cho, Nishi-ku, Kobe 651-2492, Japan and Division of Computer Engineering, University of ...;Division of Computer Engineering, University of Hyogo, 2167 Shosha, Himeji, Hyogo 671-2201, Japan

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Universality in cellular automata (CAs), first studied by von Neumann, has attracted much research efforts over the years, especially for CA employing synchronous timing. This paper proposes a computation- and construction-universal CA with a von Neumann neighborhood that is updated in a purely asynchronous way, rather than by the conventional but less efficient way of simulating synchronous CAs on asynchronous CAs. The proposed asynchronous CA is capable of implementing self-reproducing machines. Our model employs strongly symmetric cells with 15 states.