A simple three-dimensional real-time reliable cellular array

DOI10.1016/0022-0000(88)90024-4zbMATH Open0646.68072OpenAlexW2056757061MaRDI QIDQ1104099FDOQ1104099

Authors: Peter Gács, J. Reif 

Publication date: 1988

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(88)90024-4

Recommendations

• Reliable cellular automata with self-organization
• Reliable computation with cellular automata
• scientific article; zbMATH DE number 3901792
• scientific article; zbMATH DE number 4026832
• Cellular automata are generic

zbMATH Keywords

universal Turing machineone-dimensional universal iterative arrayreliable real-time simulationthree-dimensional array of unreliable cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Reliable computation with cellular automata
• A natural modification of a random process and its application to stochastic functional series and Gaussian measures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reliable Information Storage in Memories Designed from Unreliable Components*

Cited In (19)

• Fault tolerance in cellular automata at low fault rates
• A study on learning robustness using asynchronous 1D cellular automata rules
• Subcritical bootstrap percolation via Toom contours
• Title not available (Why is that?)
• A Study on the Automatic Generation of Asynchronous Cellular Automata Rules by Means of Genetic Algorithms
• Emulating cellular automata in chemical reaction-diffusion networks
• Stochastic minority on graphs
• Symmetry in self-correcting cellular automata
• Probabilistic cellular automata with Andrei Toom
• Self-stabilisation of Cellular Automata on Tilings
• A Turing machine resisting isolated bursts of faults
• Area efficient methods to increase the reliability of combinatorial circuits
• Around probabilistic cellular automata
• Reliable cellular automata with self-organization
• A Toom rule that increases the thickness of sets.
• Directed Percolation Arising in Stochastic Cellular Automata Analysis
• Reliable computation with cellular automata
• Translationally invariant universal classical Hamiltonians
• FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA

This page was built for publication: A simple three-dimensional real-time reliable cellular array

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104099)