scientific article; zbMATH DE number 3610746
From MaRDI portal
Publication:4174769
zbMATH Open0393.68060MaRDI QIDQ4174769FDOQ4174769
Authors:
Publication date: 1978
Title of this publication is not available (Why is that?)
Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cited In (24)
- Stability and interaction in flatline games
- Solving the density classification problem with a large diffusion and small amplification cellular automaton
- Analysis of quantum particle automata for solving the density classification problem
- Stable multi-level monotonic eroders
- Computation in artificially evolved, non-uniform cellular automata
- Opinion forming in Erdős-Rényi random graph and expanders
- Opinion Forming in Erdös-Rényi Random Graph and Expanders
- Some investigations about synchronization and density classification tasks in one-dimensional and two-dimensional cellular automata rule spaces
- Evolving cellular automata to perform computations: Mechanisms and impediments
- Preface: Taming randomness and complexity -- essays in honour of Professor Péter Gács
- Construction of one-dimensional nonuniform number conserving elementary cellular automata rules
- The positive rates problem for attractive nearest neighbor spin systems on ?
- Fitness landscape of the cellular automata majority problem: view from the ``Olympus
- Around probabilistic cellular automata
- Density-conserving affine continuous cellular automata solving the relaxed density classification problem
- Co-evolving non-uniform cellular automata to perform computations
- Deducing local rules for solving global tasks with random Boolean networks
- Deterministic computing techniques for perfect density classification
- Affine continuous cellular automata solving the fixed-length density classification problem
- Reliable computation with cellular automata
- Analytic proof of the attractors of a class of cellular automaton
- Co-evolving architectures for cellular machines
- Stochastic cellular automata solutions to the density classification problem. When randomness helps computing
- The density classification problem in the context of continuous cellular automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4174769)
