Stochastic cellular automata solutions to the density classification problem. When randomness helps computing
type: Item
instance of: scholarly article
title: Stochastic cellular automata solutions to the density classification problem. When randomness helps computing
zbMATH Open document ID: 1286.68336
author: Nazim Fatès
published in: Theory of Computing Systems
publication date: 2013-10-21T00:00:00Z
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 68Q87
Mathematics Subject Classification ID: 37B15
zbMATH DE Number: 6217438
zbMATH Keywords: stochastic and probabilistic cellular automata
zbMATH Keywords: density classification problem
zbMATH Keywords: models of spatially distributed computing
zbMATH Keywords: stochastic process
MaRDI profile type: Publication
full work available at URL: s00224-012-9386-3
OpenAlex ID: W1013383594
cites work: A very effective density classifier two-dimensional cellular automaton with memory
cites work: Q4799363
cites work: Density Classification on Infinite Lattices and Trees
cites work: Fully asynchronous behavior of double-quiescent elementary cellular automata
cites work: Q4174769
cites work: Evolving cellular automata to perform computations: Mechanisms and impediments
cites work: Some investigations about synchronization and density classification tasks in one-dimensional and two-dimensional cellular automata rule spaces
cites work: The Gacs-Kurdyumov-Levin automaton revisited
DOI: 10.1007/S00224-012-9386-3
description: scientific article; zbMATH DE number 6217438