Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Universality Frontier for Asynchronous Cellular Automata

Ivan Baburin, Matthew Cook, Florian Grötschla, Andreas Plesner, Roger Wattenhofer

TL;DR

The paper addresses the universality frontier for asynchronous cellular automata (ACAs) by introducing flip automata networks (FAN) to guarantee invariant histories under arbitrary asynchronous updates and by developing a formal simulation framework that ties ACAs to synchronous CAs. Using FANs as intermediaries, ACAs can simulate synchronous CAs with linear overhead, specifically $4q$ states in the general case and $3q$ in one dimension, improving prior quadratic bounds. It proves a non-universality result for one-way asynchronous automata and demonstrates the smallest known universal constructions to date: a $6$-state first-neighbor automaton in 1D and a $3$-state von Neumann automaton in 2D. The Mountain-Valley encoding provides a concrete, transitive real-time-like simulation by embedding FANs into ACAs, clarifying how bidirectional communication and invariant histories enable robust asynchronous computation with practical overheads.

Abstract

In this work, we investigate the computational aspects of asynchronous cellular automata (ACAs), a modification of cellular automata in which cells update independently, following an asynchronous schedule. We introduce flip automata networks (FAN), a simple modification of automata networks that remain robust under any asynchronous update schedule. We show that asynchronous automata can efficiently simulate their synchronous counterparts with a linear memory overhead, which improves upon the previously established quadratic bound. Additionally, we address the universality gap for (a)synchronous cellular automata -- the boundary separating universal and non-universal automata, which is still not fully understood. We tighten this boundary by proving that all one-way asynchronous automata lack universal computational power. Conversely, we establish the existence of a universal 6-state first-neighbor automaton in one dimension and a 3-state von Neumann automaton in two dimensions, which represent the smallest known universal constructions to date.

Universality Frontier for Asynchronous Cellular Automata

TL;DR

The paper addresses the universality frontier for asynchronous cellular automata (ACAs) by introducing flip automata networks (FAN) to guarantee invariant histories under arbitrary asynchronous updates and by developing a formal simulation framework that ties ACAs to synchronous CAs. Using FANs as intermediaries, ACAs can simulate synchronous CAs with linear overhead, specifically states in the general case and in one dimension, improving prior quadratic bounds. It proves a non-universality result for one-way asynchronous automata and demonstrates the smallest known universal constructions to date: a -state first-neighbor automaton in 1D and a -state von Neumann automaton in 2D. The Mountain-Valley encoding provides a concrete, transitive real-time-like simulation by embedding FANs into ACAs, clarifying how bidirectional communication and invariant histories enable robust asynchronous computation with practical overheads.

Abstract

In this work, we investigate the computational aspects of asynchronous cellular automata (ACAs), a modification of cellular automata in which cells update independently, following an asynchronous schedule. We introduce flip automata networks (FAN), a simple modification of automata networks that remain robust under any asynchronous update schedule. We show that asynchronous automata can efficiently simulate their synchronous counterparts with a linear memory overhead, which improves upon the previously established quadratic bound. Additionally, we address the universality gap for (a)synchronous cellular automata -- the boundary separating universal and non-universal automata, which is still not fully understood. We tighten this boundary by proving that all one-way asynchronous automata lack universal computational power. Conversely, we establish the existence of a universal 6-state first-neighbor automaton in one dimension and a 3-state von Neumann automaton in two dimensions, which represent the smallest known universal constructions to date.

Paper Structure

This paper contains 4 sections, 5 theorems, 13 equations, 3 figures.

Table of Contents

  1. Introduction
  2. Background
  3. Flip Automata Networks
  4. Simulating Synchronous Networks

Key Result

Theorem 7

A cellular automaton $(S, N, f, \mathbb{Z}^d)$ is commutative if and only if it has invariant histories and its global transition function $G$ is monotonic.

Figures (3)

  • Figure 1: Current "universality frontier" for synchronous (left) and asynchronous cellular automata (right). The solid line indicates the impossibility proofs for universality, while the dashed line shows the currently smallest known universal constructions. Contributions of this work are marked in red: $6$-state first neighbors, $3$-state von Neumann, and non-universality of one-way automata.
  • Figure 2: Two-step evolution of flip automata network $\mathcal{A}_\text{flip} = (T_{\text{flip}}, \{0, 1, 2\}, \{f_i\}_{i=0}^4)$ where each $f_i$ computes the sum of all neighboring node states mod $3$, and flips all incoming arrows (applicable transitions marked in gray). At each point in time we apply all applicable transitions.
  • Figure 3: Representation of a flip automata network for Rule 212 as a mountain-valley landscape (left) and evolution of a mountain-valley landscape carrying information about the frequency of updates (right).

Theorems & Definitions (17)

  • Definition 1: Cellular Automaton
  • Definition 2: Asynchronous Cellular Automaton
  • Definition 3: Update Schedule
  • Definition 4: Update History
  • Definition 5: Monotonicity
  • Definition 6: Commutativity
  • Theorem 7: Invariance gacs
  • Definition 8: Flip Automata Network
  • Proposition 8
  • Example 9
  • ...and 7 more