On the complexity of asynchronous freezing cellular automata
type: Item
instance of: scholarly article
title: On the complexity of asynchronous freezing cellular automata
author: Eric Goles
author: Diego Maldonado
author: Pedro Montealegre
author: Martín Ríos-Wilson
published in: Information and Computation
publication date: 2021-11-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/1910.10882
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7433296
zbMATH Keywords: cellular automata
zbMATH Keywords: computational complexity
zbMATH Keywords: freezing dynamics
MaRDI profile type: Publication
OpenAlex ID: W3161835047
cites work: Statistical mechanics of cellular automata
cites work: Algebraic properties of cellular automata
cites work: Q3675526
cites work: Computation theory of cellular automata
cites work: Actin Automata: Phenomenology and Localizations
cites work: Simulating complex systems by cellular automata.
cites work: P-completeness of Cellular Automaton Rule 110
cites work: Computational complexity of dynamical systems: the case of cellular automata
cites work: A parallel cellular automata environment on multicomputers for computational science
cites work: Fully asynchronous behavior of double-quiescent elementary cellular automata
cites work: Q5321519
cites work: Cell space approaches in biomathematics
cites work: Q4843270
cites work: Computational Complexity
cites work: The complexity of theorem-proving procedures
cites work: Q3944542
cites work: The complexity of the asynchronous prediction of the majority automata
cites work: On the complexity of the stability problem of binary freezing totalistic cellular automata
cites work: Complexity of Self‐Assembled Shapes
cites work: The program-size complexity of self-assembled squares (extended abstract)
cites work: Strict self-assembly of discrete Sierpinski triangles
cites work: Combinatorial optimization problems in self-assembly
cites work: An introduction to tile-based self-assembly and a survey of recent results
cites work: The complexity of the bootstraping percolation and other problems
cites work: Q4023519
cites work: Reversibility and surjectivity problems of cellular automata
cites work: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
cites work: Q3636525
cites work: Bulking I: An abstract theory of bulking
cites work: Bulking II: Classifications of cellular automata
cites work: Q4128417
DOI: 10.1016/J.IC.2021.104764
Recommended article: Computational complexity of finite asynchronous cellular automata
Recommended article: Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata
Recommended article: ON ASYNCHRONOUS CELLULAR AUTOMATA
Recommended article: Fundamentals of Computation Theory
Recommended article: Computational Aspects of Asynchronous Cellular Automata
Recommended article: Asynchronous cellular automata and dynamical properties
Recommended article: On the complexity of the stability problem of binary freezing totalistic cellular automata
Recommended article: Some Formal Properties of Asynchronous Cellular Automata
Recommended article: Delay-insensitive computation in asynchronous cellular automata
Recommended article: Turing-completeness of asynchronous non-camouflage cellular automata
description: scientific article; zbMATH DE number 7433296