A simple three-dimensional real-time reliable cellular array
From MaRDI portal
Publication:1104099
DOI10.1016/0022-0000(88)90024-4zbMath0646.68072OpenAlexW2056757061MaRDI QIDQ1104099
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
universal Turing machineone-dimensional universal iterative arrayreliable real-time simulationthree-dimensional array of unreliable cellular automata
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
Symmetry in self-correcting cellular automata ⋮ A Turing Machine Resisting Isolated Bursts of Faults ⋮ A study on learning robustness using asynchronous 1D cellular automata rules ⋮ Self-stabilisation of Cellular Automata on Tilings ⋮ Area efficient methods to increase the reliability of combinatorial circuits ⋮ Fault tolerance in cellular automata at low fault rates ⋮ A Toom rule that increases the thickness of sets. ⋮ Around probabilistic cellular automata ⋮ Stochastic minority on graphs ⋮ FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA ⋮ A Study on the Automatic Generation of Asynchronous Cellular Automata Rules by Means of Genetic Algorithms ⋮ Directed Percolation Arising in Stochastic Cellular Automata Analysis ⋮ Emulating cellular automata in chemical reaction-diffusion networks ⋮ Translationally invariant universal classical Hamiltonians ⋮ Subcritical bootstrap percolation via Toom contours
Cites Work
This page was built for publication: A simple three-dimensional real-time reliable cellular array