Reliable computation with cellular automata
From MaRDI portal
Publication:1090457
DOI10.1016/0022-0000(86)90002-4zbMath0621.68038OpenAlexW2078058516MaRDI QIDQ1090457
Publication date: 1986
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1802/8851
stabilityergodicityerror-correcting mediumerror-free mediumk-dimensional cellular spaceone-dimensional cellular spacepositive probability conjecturereliable computation with unreliable components
Related Items
A Turing Machine Resisting Isolated Bursts of Faults, A study on learning robustness using asynchronous 1D cellular automata rules, Ergodicity of some classes of cellular automata subject to noise, Universal computation and physical dynamics, A simple three-dimensional real-time reliable cellular array, Self-stabilisation of Cellular Automata on Tilings, Cellular automata as a paradigm for ecological modeling, Overview: PCA Models and Issues, Topological quantum memory, Cutting the Firing Squad Synchronization, Fault-tolerant quantum error correction for non-abelian anyons, Area efficient methods to increase the reliability of combinatorial circuits, Revisiting the cutting of the firing squad synchronization, Cellular automaton decoders of topological quantum memories in the fault tolerant setting, Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays, State-efficient realization of fault-tolerant FSSP algorithms, Statistical mechanics of probabilistic cellular automata., Quick Energy Drop in Stochastic 2D Minority, Around probabilistic cellular automata, Three research directions in non-uniform cellular automata, THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT, The Gacs-Kurdyumov-Levin automaton revisited, Effective Closed Subshifts in 1D Can Be Implemented in 2D, Stochastic minority on graphs, FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA, Theory of cellular automata: a survey, Directed Percolation Arising in Stochastic Cellular Automata Analysis, Computing in fault tolerant broadcast networks and noisy decision trees, The expressiveness of quasiperiodic and minimal shifts of finite type, Nature-Based Problems in Cellular Automata, Self-stabilization of circular arrays of automata, On the Expressive Power of Quasiperiodic SFT., Simple one-dimensional interaction systems with superexponential relaxation times.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A natural modification of a random process and its application to stochastic functional series and Gaussian measures
- A stability criterion for attractive nearest neighbor spin systems on Z
- Fault tolerant cellular spaces
- Fault tolerant cellular automata
- Reliable Computation in Computing Systems Designed from Unreliable Components*
